#include <indexmapbidi.h>

Inheritance diagram for tesseract::IndexMapBiDi:

Public Member Functions
	~IndexMapBiDi () override

void	InitAndSetupRange (int sparse_size, int start, int end)

void	Init (int size, bool all_mapped)

void	SetMap (int sparse_index, bool mapped)

void	Setup ()

bool	Merge (int compact_index1, int compact_index2)

bool	IsCompactDeleted (int index) const

void	CompleteMerges ()

int	SparseToCompact (int sparse_index) const override

int	SparseSize () const override

void	CopyFrom (const IndexMapBiDi &src)

bool	Serialize (FILE *fp) const

bool	DeSerialize (bool swap, FILE *fp)

int	MapFeatures (const std::vector< int > &sparse, std::vector< int > *compact) const

Public Member Functions inherited from tesseract::IndexMap
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)

Additional Inherited Members
Protected Attributes inherited from tesseract::IndexMap
int32_t	sparse_size_

std::vector< int32_t >	compact_map_

Detailed Description

Definition at line 104 of file indexmapbidi.h.

Constructor & Destructor Documentation

◆ ~IndexMapBiDi()

tesseract::IndexMapBiDi::~IndexMapBiDi ( )

overridedefault

Member Function Documentation

◆ CompleteMerges()

void tesseract::IndexMapBiDi::CompleteMerges ( )

Definition at line 177 of file indexmapbidi.cpp.

                                  {
  // Ensure each sparse_map_entry contains a master compact_map_ index.
  int compact_size = 0;
  for (int &i : sparse_map_) {
    int compact_index = MasterCompactIndex(i);
    i = compact_index;
    if (compact_index >= compact_size) {
      compact_size = compact_index + 1;
    }
  }
  // Re-generate the compact_map leaving holes for unused indices.
  compact_map_.clear();
  compact_map_.resize(compact_size, -1);
  for (size_t i = 0; i < sparse_map_.size(); ++i) {
    if (sparse_map_[i] >= 0) {
      if (compact_map_[sparse_map_[i]] == -1) {
        compact_map_[sparse_map_[i]] = i;
      }
    }
  }
  // Compact the compact_map, leaving tmp_compact_map saying where each
  // index went to in the compacted map.
  std::vector<int32_t> tmp_compact_map(compact_size, -1);
  compact_size = 0;
  for (size_t i = 0; i < compact_map_.size(); ++i) {
    if (compact_map_[i] >= 0) {
      tmp_compact_map[i] = compact_size;
      compact_map_[compact_size++] = compact_map_[i];
    }
  }
  compact_map_.resize(compact_size);
  // Now modify the entries in the sparse map to point to the new locations.
  for (int &i : sparse_map_) {
    if (i >= 0) {
      i = tmp_compact_map[i];
    }
  }
}

◆ CopyFrom()

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

Definition at line 135 of file indexmapbidi.cpp.

                                                   {
  sparse_map_ = src.sparse_map_;
  compact_map_ = src.compact_map_;
  sparse_size_ = sparse_map_.size();
}

◆ DeSerialize()

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

Definition at line 236 of file indexmapbidi.cpp.

                                                  {
  if (!IndexMap::DeSerialize(swap, fp)) {
    return false;
  }
  std::vector<int32_t> remaining_pairs;
  if (!tesseract::DeSerialize(swap, fp, remaining_pairs)) {
    return false;
  }
  sparse_map_.clear();
  sparse_map_.resize(sparse_size_, -1);
  for (unsigned i = 0; i < compact_map_.size(); ++i) {
    sparse_map_[compact_map_[i]] = i;
  }
  for (size_t i = 0; i < remaining_pairs.size(); ++i) {
    int sparse_index = remaining_pairs[i++];
    sparse_map_[sparse_index] = remaining_pairs[i];
  }
  return true;
}

◆ Init()

void tesseract::IndexMapBiDi::Init	(	int	size,
		bool	all_mapped
	)

Definition at line 97 of file indexmapbidi.cpp.

                                                 {
  if (!all_mapped) {
    sparse_map_.clear();
  }
  sparse_map_.resize(size, -1);
  if (all_mapped) {
    for (int i = 0; i < size; ++i) {
      sparse_map_[i] = i;
    }
  }
}

◆ InitAndSetupRange()

void tesseract::IndexMapBiDi::InitAndSetupRange	(	int	sparse_size,
		int	start,
		int	end
	)

Definition at line 85 of file indexmapbidi.cpp.

                                                                        {
  Init(sparse_size, false);
  for (int i = start; i < end; ++i) {
    SetMap(i, true);
  }
  Setup();
}

◆ IsCompactDeleted()

bool tesseract::IndexMapBiDi::IsCompactDeleted ( int index ) const

inline

Definition at line 132 of file indexmapbidi.h.

                                         {
    return MasterCompactIndex(index) < 0;
  }

◆ MapFeatures()

int tesseract::IndexMapBiDi::MapFeatures	(	const std::vector< int > &	sparse,
		std::vector< int > *	compact
	)		const

Definition at line 261 of file indexmapbidi.cpp.

                                                                                         {
  compact->clear();
  int num_features = sparse.size();
  int missed_features = 0;
  int prev_good_feature = -1;
  for (int f = 0; f < num_features; ++f) {
    int feature = sparse_map_[sparse[f]];
    if (feature >= 0) {
      if (feature != prev_good_feature) {
        compact->push_back(feature);
        prev_good_feature = feature;
      }
    } else {
      ++missed_features;
    }
  }
  return missed_features;
}

◆ Merge()

bool tesseract::IndexMapBiDi::Merge	(	int	compact_index1,
		int	compact_index2
	)

Definition at line 144 of file indexmapbidi.cpp.

                                                               {
  // Find the current master index for index1 and index2.
  compact_index1 = MasterCompactIndex(compact_index1);
  compact_index2 = MasterCompactIndex(compact_index2);
  // Be sure that index1 < index2.
  if (compact_index1 > compact_index2) {
    int tmp = compact_index1;
    compact_index1 = compact_index2;
    compact_index2 = tmp;
  } else if (compact_index1 == compact_index2) {
    return false;
  }
  // To save iterating over all sparse_map_ entries, simply make the master
  // entry for index2 point to index1.
  // This leaves behind a potential chain of parents that needs to be chased,
  // as above.
  sparse_map_[compact_map_[compact_index2]] = compact_index1;
  if (compact_index1 >= 0) {
    compact_map_[compact_index2] = compact_map_[compact_index1];
  }
  return true;
}

◆ Serialize()

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

Definition at line 217 of file indexmapbidi.cpp.

                                           {
  if (!IndexMap::Serialize(fp)) {
    return false;
  }
  // Make a vector containing the rest of the map. If the map is many-to-one
  // then each additional sparse entry needs to be stored.
  // Normally we store only the compact map to save space.
  std::vector<int32_t> remaining_pairs;
  for (unsigned i = 0; i < sparse_map_.size(); ++i) {
    if (sparse_map_[i] >= 0 && static_cast<unsigned>(compact_map_[sparse_map_[i]]) != i) {
      remaining_pairs.push_back(i);
      remaining_pairs.push_back(sparse_map_[i]);
    }
  }
  return tesseract::Serialize(fp, remaining_pairs);
}

◆ SetMap()

void tesseract::IndexMapBiDi::SetMap	(	int	sparse_index,
		bool	mapped
	)

Definition at line 110 of file indexmapbidi.cpp.

                                                       {
  sparse_map_[sparse_index] = mapped ? 0 : -1;
}

◆ Setup()

void tesseract::IndexMapBiDi::Setup ( )

Definition at line 117 of file indexmapbidi.cpp.

                         {
  int compact_size = 0;
  for (int &i : sparse_map_) {
    if (i >= 0) {
      i = compact_size++;
    }
  }
  compact_map_.clear();
  compact_map_.resize(compact_size, -1);
  for (size_t i = 0; i < sparse_map_.size(); ++i) {
    if (sparse_map_[i] >= 0) {
      compact_map_[sparse_map_[i]] = i;
    }
  }
  sparse_size_ = sparse_map_.size();
}

◆ SparseSize()

int tesseract::IndexMapBiDi::SparseSize ( ) const

inlineoverridevirtual

Reimplemented from tesseract::IndexMap.

Definition at line 144 of file indexmapbidi.h.

                                  {
    return sparse_map_.size();
  }

◆ SparseToCompact()

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