#include <indexmapbidi.h>

Inheritance diagram for tesseract::IndexMap:

Public Member Functions
virtual	~IndexMap ()

virtual int	SparseToCompact (int sparse_index) const

int	CompactToSparse (int compact_index) const

virtual int	SparseSize () const

int	CompactSize () const

void	CopyFrom (const IndexMap &src)

void	CopyFrom (const IndexMapBiDi &src)

bool	Serialize (FILE *fp) const

bool	DeSerialize (bool swap, FILE *fp)

Protected Attributes
int32_t	sparse_size_

GenericVector< int32_t >	compact_map_

Detailed Description

Definition at line 42 of file indexmapbidi.h.

Constructor & Destructor Documentation

◆ ~IndexMap()

tesseract::IndexMap::~IndexMap ( )

virtualdefault

Member Function Documentation

◆ CompactSize()

int tesseract::IndexMap::CompactSize ( ) const

inline

Definition at line 61 of file indexmapbidi.h.

                           {
     return compact_map_.size();
   }

◆ CompactToSparse()

int tesseract::IndexMap::CompactToSparse ( int compact_index ) const

inline

Definition at line 53 of file indexmapbidi.h.

                                                {
     return compact_map_[compact_index];
   }

◆ CopyFrom() [1/2]

void tesseract::IndexMap::CopyFrom ( const IndexMap & src )

Definition at line 38 of file indexmapbidi.cpp.

                                            {
   sparse_size_ = src.sparse_size_;
   compact_map_ = src.compact_map_;
 }

◆ CopyFrom() [2/2]

void tesseract::IndexMap::CopyFrom ( const IndexMapBiDi & src )

Definition at line 42 of file indexmapbidi.cpp.

                                                {
   sparse_size_ = src.SparseSize();
   compact_map_ = src.compact_map_;
 }

◆ DeSerialize()

bool tesseract::IndexMap::DeSerialize	(	bool	swap,
		FILE *	fp
	)

Definition at line 54 of file indexmapbidi.cpp.

                                               {
   uint32_t sparse_size;
   if (!tesseract::DeSerialize(fp, &sparse_size)) return false;
   if (swap)
     ReverseN(&sparse_size, sizeof(sparse_size));
   // Arbitrarily limit the number of elements to protect against bad data.
   if (sparse_size > UINT16_MAX) return false;
   sparse_size_ = sparse_size;
   return compact_map_.DeSerialize(swap, fp);
 }

◆ Serialize()

bool tesseract::IndexMap::Serialize ( FILE * fp ) const

Definition at line 48 of file indexmapbidi.cpp.

                                        {
   return tesseract::Serialize(fp, &sparse_size_) && compact_map_.Serialize(fp);
 }

◆ SparseSize()

virtual int tesseract::IndexMap::SparseSize ( ) const

inlinevirtual

Reimplemented in tesseract::IndexMapBiDi.

Definition at line 57 of file indexmapbidi.h.

                                  {
     return sparse_size_;
   }

◆ SparseToCompact()

int tesseract::IndexMap::SparseToCompact ( int sparse_index ) const

virtual

Reimplemented in tesseract::IndexMapBiDi.

Definition at line 32 of file indexmapbidi.cpp.

                                                     {
   int result = compact_map_.binary_search(sparse_index);
   return compact_map_[result] == sparse_index ? result : -1;
 }

Member Data Documentation

◆ compact_map_

GenericVector<int32_t> tesseract::IndexMap::compact_map_

protected

Definition at line 80 of file indexmapbidi.h.

◆ sparse_size_

int32_t tesseract::IndexMap::sparse_size_