tesseract  4.00.00dev
GenericVector< T > Class Template Reference

#include <baseapi.h>

Inheritance diagram for GenericVector< T >:
GenericVectorEqEq< T > tesseract::PointerVector< GenericVector< double > > tesseract::PointerVector< RecodeBeam > tesseract::PointerVector< tesseract::BaselineBlock > tesseract::PointerVector< tesseract::BaselineRow > tesseract::PointerVector< tesseract::DocumentData > tesseract::PointerVector< tesseract::ImageData > tesseract::PointerVector< tesseract::LanguageModelState > tesseract::PointerVector< tesseract::Network > tesseract::PointerVector< tesseract::NetworkIO > tesseract::PointerVector< tesseract::Shape > tesseract::PointerVector< tesseract::TrainingSample > tesseract::PointerVector< tesseract::TransposedArray > tesseract::PointerVector< WERD_RES >

Public Member Functions

 GenericVector ()
 
 GenericVector (int size, T init_val)
 
 GenericVector (const GenericVector &other)
 
GenericVector< T > & operator+= (const GenericVector &other)
 
GenericVector< T > & operator= (const GenericVector &other)
 
 ~GenericVector ()
 
void reserve (int size)
 
void double_the_size ()
 
void init_to_size (int size, T t)
 
void resize_no_init (int size)
 
int size () const
 
unsigned int unsigned_size () const
 
int size_reserved () const
 
int length () const
 
bool empty () const
 
T & get (int index) const
 
T & back () const
 
T & operator[] (int index) const
 
pop_back ()
 
int get_index (T object) const
 
bool contains (T object) const
 
contains_index (int index) const
 
int push_back (T object)
 
void operator+= (T t)
 
int push_back_new (T object)
 
int push_front (T object)
 
void set (T t, int index)
 
void insert (T t, int index)
 
void remove (int index)
 
void truncate (int size)
 
void set_clear_callback (TessCallback1< T > *cb)
 
void set_compare_callback (TessResultCallback2< bool, T const &, T const &> *cb)
 
void clear ()
 
void delete_data_pointers ()
 
void move (GenericVector< T > *from)
 
bool write (FILE *f, TessResultCallback2< bool, FILE *, T const &> *cb) const
 
bool read (tesseract::TFile *f, TessResultCallback2< bool, tesseract::TFile *, T *> *cb)
 
bool Serialize (FILE *fp) const
 
bool Serialize (tesseract::TFile *fp) const
 
bool DeSerialize (bool swap, FILE *fp)
 
bool DeSerialize (tesseract::TFile *fp)
 
bool SerializeClasses (FILE *fp) const
 
bool SerializeClasses (tesseract::TFile *fp) const
 
bool DeSerializeClasses (bool swap, FILE *fp)
 
bool DeSerializeClasses (tesseract::TFile *fp)
 
void reverse ()
 
void sort ()
 
void sort (int(*comparator)(const void *, const void *))
 
bool bool_binary_search (const T &target) const
 
int binary_search (const T &target) const
 
void compact_sorted ()
 
void compact (TessResultCallback1< bool, int > *delete_cb)
 
dot_product (const GenericVector< T > &other) const
 
int choose_nth_item (int target_index)
 
void swap (int index1, int index2)
 
bool WithinBounds (const T &rangemin, const T &rangemax) const
 

Static Public Member Functions

static bool SkipDeSerialize (tesseract::TFile *fp)
 
static bool SkipDeSerializeClasses (tesseract::TFile *fp)
 
static T * double_the_size_memcpy (int current_size, T *data)
 

Protected Member Functions

int choose_nth_item (int target_index, int start, int end, unsigned int *seed)
 
void init (int size)
 

Protected Attributes

inT32 size_used_
 
inT32 size_reserved_
 
T * data_
 
TessCallback1< T > * clear_cb_
 
TessResultCallback2< bool, T const &, T const & > * compare_cb_
 

Static Protected Attributes

static const int kDefaultVectorSize = 4
 

Detailed Description

template<typename T>
class GenericVector< T >

Definition at line 42 of file baseapi.h.

Constructor & Destructor Documentation

◆ GenericVector() [1/3]

template<typename T>
GenericVector< T >::GenericVector ( )
inline

Definition at line 40 of file genericvector.h.

40  : size_used_(0), size_reserved_(0), data_(NULL),
41  clear_cb_(NULL), compare_cb_(NULL) {}
inT32 size_reserved_
TessCallback1< T > * clear_cb_
TessResultCallback2< bool, T const &, T const & > * compare_cb_

◆ GenericVector() [2/3]

template<typename T>
GenericVector< T >::GenericVector ( int  size,
init_val 
)
inline

Definition at line 43 of file genericvector.h.

43  {
44  init(size);
45  init_to_size(size, init_val);
46  }
void init_to_size(int size, T t)
voidpf void uLong size
Definition: ioapi.h:39
void init(int size)

◆ GenericVector() [3/3]

template<typename T>
GenericVector< T >::GenericVector ( const GenericVector< T > &  other)
inline

Definition at line 49 of file genericvector.h.

49  {
50  this->init(other.size());
51  this->operator+=(other);
52  }
GenericVector< T > & operator+=(const GenericVector &other)
int size() const
Definition: genericvector.h:72
void init(int size)

◆ ~GenericVector()

template<typename T >
GenericVector< T >::~GenericVector ( )

Definition at line 665 of file genericvector.h.

665  {
666  clear();
667 }

Member Function Documentation

◆ back()

template<typename T >
T & GenericVector< T >::back ( ) const

Definition at line 718 of file genericvector.h.

718  {
719  ASSERT_HOST(size_used_ > 0);
720  return data_[size_used_ - 1];
721 }
#define ASSERT_HOST(x)
Definition: errcode.h:84

◆ binary_search()

template<typename T>
int GenericVector< T >::binary_search ( const T &  target) const
inline

Definition at line 250 of file genericvector.h.

250  {
251  int bottom = 0;
252  int top = size_used_;
253  while (top - bottom > 1) {
254  int middle = (bottom + top) / 2;
255  if (data_[middle] > target)
256  top = middle;
257  else
258  bottom = middle;
259  }
260  return bottom;
261  }

◆ bool_binary_search()

template<typename T>
bool GenericVector< T >::bool_binary_search ( const T &  target) const
inline

Definition at line 238 of file genericvector.h.

238  {
239  int index = binary_search(target);
240  if (index >= size_used_)
241  return false;
242  return data_[index] == target;
243  }
int binary_search(const T &target) const

◆ choose_nth_item() [1/2]

template<typename T>
int GenericVector< T >::choose_nth_item ( int  target_index)
inline

Definition at line 309 of file genericvector.h.

309  {
310  // Make sure target_index is legal.
311  if (target_index < 0)
312  target_index = 0; // ensure legal
313  else if (target_index >= size_used_)
314  target_index = size_used_ - 1;
315  unsigned int seed = 1;
316  return choose_nth_item(target_index, 0, size_used_, &seed);
317  }
int choose_nth_item(int target_index)

◆ choose_nth_item() [2/2]

template<typename T >
int GenericVector< T >::choose_nth_item ( int  target_index,
int  start,
int  end,
unsigned int seed 
)
protected

Definition at line 1068 of file genericvector.h.

1069  {
1070  // Number of elements to process.
1071  int num_elements = end - start;
1072  // Trivial cases.
1073  if (num_elements <= 1)
1074  return start;
1075  if (num_elements == 2) {
1076  if (data_[start] < data_[start + 1]) {
1077  return target_index > start ? start + 1 : start;
1078  } else {
1079  return target_index > start ? start : start + 1;
1080  }
1081  }
1082  // Place the pivot at start.
1083  #ifndef rand_r // _MSC_VER, ANDROID
1084  srand(*seed);
1085  #define rand_r(seed) rand()
1086  #endif // _MSC_VER
1087  int pivot = rand_r(seed) % num_elements + start;
1088  swap(pivot, start);
1089  // The invariant condition here is that items [start, next_lesser) are less
1090  // than the pivot (which is at index next_lesser) and items
1091  // [prev_greater, end) are greater than the pivot, with items
1092  // [next_lesser, prev_greater) being equal to the pivot.
1093  int next_lesser = start;
1094  int prev_greater = end;
1095  for (int next_sample = start + 1; next_sample < prev_greater;) {
1096  if (data_[next_sample] < data_[next_lesser]) {
1097  swap(next_lesser++, next_sample++);
1098  } else if (data_[next_sample] == data_[next_lesser]) {
1099  ++next_sample;
1100  } else {
1101  swap(--prev_greater, next_sample);
1102  }
1103  }
1104  // Now the invariant is set up, we recurse on just the section that contains
1105  // the desired index.
1106  if (target_index < next_lesser)
1107  return choose_nth_item(target_index, start, next_lesser, seed);
1108  else if (target_index < prev_greater)
1109  return next_lesser; // In equal bracket.
1110  else
1111  return choose_nth_item(target_index, prev_greater, end, seed);
1112 }
void swap(int index1, int index2)
#define rand_r(seed)
int choose_nth_item(int target_index)

◆ clear()

template<typename T >
void GenericVector< T >::clear ( )

Definition at line 856 of file genericvector.h.

856  {
857  if (size_reserved_ > 0) {
858  if (clear_cb_ != NULL)
859  for (int i = 0; i < size_used_; ++i)
860  clear_cb_->Run(data_[i]);
861  delete[] data_;
862  data_ = NULL;
863  size_used_ = 0;
864  size_reserved_ = 0;
865  }
866  if (clear_cb_ != NULL) {
867  delete clear_cb_;
868  clear_cb_ = NULL;
869  }
870  if (compare_cb_ != NULL) {
871  delete compare_cb_;
872  compare_cb_ = NULL;
873  }
874 }
virtual void Run(A1)=0
inT32 size_reserved_
TessCallback1< T > * clear_cb_
TessResultCallback2< bool, T const &, T const & > * compare_cb_

◆ compact()

template<typename T>
void GenericVector< T >::compact ( TessResultCallback1< bool, int > *  delete_cb)
inline

Definition at line 282 of file genericvector.h.

282  {
283  int new_size = 0;
284  int old_index = 0;
285  // Until the callback returns true, the elements stay the same.
286  while (old_index < size_used_ && !delete_cb->Run(old_index++))
287  ++new_size;
288  // Now just copy anything else that gets false from delete_cb.
289  for (; old_index < size_used_; ++old_index) {
290  if (!delete_cb->Run(old_index)) {
291  data_[new_size++] = data_[old_index];
292  }
293  }
294  size_used_ = new_size;
295  delete delete_cb;
296  }
virtual R Run(A1)=0

◆ compact_sorted()

template<typename T>
void GenericVector< T >::compact_sorted ( )
inline

Definition at line 265 of file genericvector.h.

265  {
266  if (size_used_ == 0)
267  return;
268 
269  // First element is in no matter what, hence the i = 1.
270  int last_write = 0;
271  for (int i = 1; i < size_used_; ++i) {
272  // Finds next unique item and writes it.
273  if (data_[last_write] != data_[i])
274  data_[++last_write] = data_[i];
275  }
276  // last_write is the index of a valid data cell, so add 1.
277  size_used_ = last_write + 1;
278  }

◆ contains()

template<typename T>
bool GenericVector< T >::contains ( object) const

Definition at line 781 of file genericvector.h.

781  {
782  return get_index(object) != -1;
783 }
int get_index(T object) const

◆ contains_index()

template<typename T >
T GenericVector< T >::contains_index ( int  index) const

Definition at line 764 of file genericvector.h.

764  {
765  return index >= 0 && index < size_used_;
766 }

◆ delete_data_pointers()

template<typename T >
void GenericVector< T >::delete_data_pointers ( )

Definition at line 877 of file genericvector.h.

877  {
878  for (int i = 0; i < size_used_; ++i)
879  if (data_[i]) {
880  delete data_[i];
881  }
882 }

◆ DeSerialize() [1/2]

template<typename T >
bool GenericVector< T >::DeSerialize ( bool  swap,
FILE *  fp 
)

Definition at line 946 of file genericvector.h.

946  {
947  inT32 reserved;
948  if (fread(&reserved, sizeof(reserved), 1, fp) != 1) return false;
949  if (swap) Reverse32(&reserved);
950  reserve(reserved);
951  size_used_ = reserved;
952  if (fread(data_, sizeof(T), size_used_, fp) != unsigned_size()) return false;
953  if (swap) {
954  for (int i = 0; i < size_used_; ++i)
955  ReverseN(&data_[i], sizeof(data_[i]));
956  }
957  return true;
958 }
unsigned int unsigned_size() const
Definition: genericvector.h:76
int32_t inT32
Definition: host.h:38
void reserve(int size)
void swap(int index1, int index2)
void Reverse32(void *ptr)
Definition: helpers.h:200
void ReverseN(void *ptr, int num_bytes)
Definition: helpers.h:184

◆ DeSerialize() [2/2]

template<typename T >
bool GenericVector< T >::DeSerialize ( tesseract::TFile fp)

Definition at line 960 of file genericvector.h.

960  {
961  inT32 reserved;
962  if (fp->FReadEndian(&reserved, sizeof(reserved), 1) != 1) return false;
963  reserve(reserved);
964  size_used_ = reserved;
965  return fp->FReadEndian(data_, sizeof(T), size_used_) == size_used_;
966 }
int32_t inT32
Definition: host.h:38
void reserve(int size)
int FReadEndian(void *buffer, int size, int count)
Definition: serialis.cpp:97

◆ DeSerializeClasses() [1/2]

template<typename T >
bool GenericVector< T >::DeSerializeClasses ( bool  swap,
FILE *  fp 
)

Definition at line 1000 of file genericvector.h.

1000  {
1001  inT32 reserved;
1002  if (fread(&reserved, sizeof(reserved), 1, fp) != 1) return false;
1003  if (swap) Reverse32(&reserved);
1004  T empty;
1005  init_to_size(reserved, empty);
1006  for (int i = 0; i < reserved; ++i) {
1007  if (!data_[i].DeSerialize(swap, fp)) return false;
1008  }
1009  return true;
1010 }
bool DeSerialize(bool swap, FILE *fp)
int32_t inT32
Definition: host.h:38
void init_to_size(int size, T t)
void swap(int index1, int index2)
bool empty() const
Definition: genericvector.h:90
void Reverse32(void *ptr)
Definition: helpers.h:200

◆ DeSerializeClasses() [2/2]

template<typename T >
bool GenericVector< T >::DeSerializeClasses ( tesseract::TFile fp)

Definition at line 1012 of file genericvector.h.

1012  {
1013  inT32 reserved;
1014  if (fp->FReadEndian(&reserved, sizeof(reserved), 1) != 1) return false;
1015  T empty;
1016  init_to_size(reserved, empty);
1017  for (int i = 0; i < reserved; ++i) {
1018  if (!data_[i].DeSerialize(fp)) return false;
1019  }
1020  return true;
1021 }
bool DeSerialize(bool swap, FILE *fp)
int32_t inT32
Definition: host.h:38
void init_to_size(int size, T t)
int FReadEndian(void *buffer, int size, int count)
Definition: serialis.cpp:97
bool empty() const
Definition: genericvector.h:90

◆ dot_product()

template<typename T>
T GenericVector< T >::dot_product ( const GenericVector< T > &  other) const
inline

Definition at line 298 of file genericvector.h.

298  {
299  T result = static_cast<T>(0);
300  for (int i = MIN(size_used_, other.size_used_) - 1; i >= 0; --i)
301  result += data_[i] * other.data_[i];
302  return result;
303  }
#define MIN(x, y)
Definition: ndminx.h:28

◆ double_the_size()

template<typename T >
void GenericVector< T >::double_the_size ( )

Definition at line 685 of file genericvector.h.

685  {
686  if (size_reserved_ == 0) {
688  }
689  else {
690  reserve(2 * size_reserved_);
691  }
692 }
void reserve(int size)
inT32 size_reserved_
static const int kDefaultVectorSize

◆ double_the_size_memcpy()

template<typename T>
static T* GenericVector< T >::double_the_size_memcpy ( int  current_size,
T *  data 
)
inlinestatic

Definition at line 207 of file genericvector.h.

207  {
208  T *data_new = new T[current_size * 2];
209  memcpy(data_new, data, sizeof(T) * current_size);
210  delete[] data;
211  return data_new;
212  }

◆ empty()

template<typename T>
bool GenericVector< T >::empty ( ) const
inline

Definition at line 90 of file genericvector.h.

90  {
91  return size_used_ == 0;
92  }

◆ get()

template<typename T >
T & GenericVector< T >::get ( int  index) const

Definition at line 706 of file genericvector.h.

706  {
707  ASSERT_HOST(index >= 0 && index < size_used_);
708  return data_[index];
709 }
#define ASSERT_HOST(x)
Definition: errcode.h:84

◆ get_index()

template<typename T>
int GenericVector< T >::get_index ( object) const

Definition at line 770 of file genericvector.h.

770  {
771  for (int i = 0; i < size_used_; ++i) {
772  ASSERT_HOST(compare_cb_ != NULL);
773  if (compare_cb_->Run(object, data_[i]))
774  return i;
775  }
776  return -1;
777 }
virtual R Run(A1, A2)=0
#define ASSERT_HOST(x)
Definition: errcode.h:84
TessResultCallback2< bool, T const &, T const & > * compare_cb_

◆ init()

template<typename T >
void GenericVector< T >::init ( int  size)
protected

Definition at line 655 of file genericvector.h.

655  {
656  size_used_ = 0;
657  size_reserved_ = 0;
658  data_ = 0;
659  clear_cb_ = 0;
660  compare_cb_ = 0;
661  reserve(size);
662 }
void reserve(int size)
voidpf void uLong size
Definition: ioapi.h:39
inT32 size_reserved_
TessCallback1< T > * clear_cb_
TessResultCallback2< bool, T const &, T const & > * compare_cb_

◆ init_to_size()

template<typename T>
void GenericVector< T >::init_to_size ( int  size,
t 
)

Definition at line 696 of file genericvector.h.

696  {
697  reserve(size);
698  size_used_ = size;
699  for (int i = 0; i < size; ++i)
700  data_[i] = t;
701 }
void reserve(int size)
voidpf void uLong size
Definition: ioapi.h:39
int size() const
Definition: genericvector.h:72

◆ insert()

template<typename T>
void GenericVector< T >::insert ( t,
int  index 
)

Definition at line 740 of file genericvector.h.

740  {
741  ASSERT_HOST(index >= 0 && index <= size_used_);
742  if (size_reserved_ == size_used_)
743  double_the_size();
744  for (int i = size_used_; i > index; --i) {
745  data_[i] = data_[i-1];
746  }
747  data_[index] = t;
748  size_used_++;
749 }
#define ASSERT_HOST(x)
Definition: errcode.h:84
void double_the_size()
inT32 size_reserved_

◆ length()

template<typename T>
int GenericVector< T >::length ( ) const
inline

Definition at line 85 of file genericvector.h.

85  {
86  return size_used_;
87  }

◆ move()

template<typename T>
void GenericVector< T >::move ( GenericVector< T > *  from)

Definition at line 1035 of file genericvector.h.

1035  {
1036  this->clear();
1037  this->data_ = from->data_;
1038  this->size_reserved_ = from->size_reserved_;
1039  this->size_used_ = from->size_used_;
1040  this->compare_cb_ = from->compare_cb_;
1041  this->clear_cb_ = from->clear_cb_;
1042  from->data_ = NULL;
1043  from->clear_cb_ = NULL;
1044  from->compare_cb_ = NULL;
1045  from->size_used_ = 0;
1046  from->size_reserved_ = 0;
1047 }
inT32 size_reserved_
TessCallback1< T > * clear_cb_
TessResultCallback2< bool, T const &, T const & > * compare_cb_

◆ operator+=() [1/2]

template<typename T >
GenericVector< T > & GenericVector< T >::operator+= ( const GenericVector< T > &  other)

Definition at line 822 of file genericvector.h.

822  {
823  this->reserve(size_used_ + other.size_used_);
824  for (int i = 0; i < other.size(); ++i) {
825  this->operator+=(other.data_[i]);
826  }
827  return *this;
828 }
void reserve(int size)
GenericVector< T > & operator+=(const GenericVector &other)
int size() const
Definition: genericvector.h:72

◆ operator+=() [2/2]

template<typename T>
void GenericVector< T >::operator+= ( t)

Definition at line 817 of file genericvector.h.

817  {
818  push_back(t);
819 }
int push_back(T object)

◆ operator=()

template<typename T >
GenericVector< T > & GenericVector< T >::operator= ( const GenericVector< T > &  other)

Definition at line 831 of file genericvector.h.

831  {
832  if (&other != this) {
833  this->truncate(0);
834  this->operator+=(other);
835  }
836  return *this;
837 }
GenericVector< T > & operator+=(const GenericVector &other)
void truncate(int size)

◆ operator[]()

template<typename T >
T & GenericVector< T >::operator[] ( int  index) const

Definition at line 712 of file genericvector.h.

712  {
713  assert(index >= 0 && index < size_used_);
714  return data_[index];
715 }

◆ pop_back()

template<typename T >
T GenericVector< T >::pop_back ( )

Definition at line 724 of file genericvector.h.

724  {
725  ASSERT_HOST(size_used_ > 0);
726  return data_[--size_used_];
727 }
#define ASSERT_HOST(x)
Definition: errcode.h:84

◆ push_back()

template<typename T>
int GenericVector< T >::push_back ( object)

Definition at line 787 of file genericvector.h.

787  {
788  int index = 0;
789  if (size_used_ == size_reserved_)
790  double_the_size();
791  index = size_used_++;
792  data_[index] = object;
793  return index;
794 }
void double_the_size()
inT32 size_reserved_

◆ push_back_new()

template<typename T>
int GenericVector< T >::push_back_new ( object)

Definition at line 797 of file genericvector.h.

797  {
798  int index = get_index(object);
799  if (index >= 0)
800  return index;
801  return push_back(object);
802 }
int get_index(T object) const
int push_back(T object)

◆ push_front()

template<typename T>
int GenericVector< T >::push_front ( object)

Definition at line 806 of file genericvector.h.

806  {
807  if (size_used_ == size_reserved_)
808  double_the_size();
809  for (int i = size_used_; i > 0; --i)
810  data_[i] = data_[i-1];
811  data_[0] = object;
812  ++size_used_;
813  return 0;
814 }
void double_the_size()
inT32 size_reserved_

◆ read()

template<typename T>
bool GenericVector< T >::read ( tesseract::TFile f,
TessResultCallback2< bool, tesseract::TFile *, T *> *  cb 
)

Definition at line 905 of file genericvector.h.

906  {
907  inT32 reserved;
908  if (f->FReadEndian(&reserved, sizeof(reserved), 1) != 1) return false;
909  reserve(reserved);
910  if (f->FReadEndian(&size_used_, sizeof(size_used_), 1) != 1) return false;
911  if (cb != NULL) {
912  for (int i = 0; i < size_used_; ++i) {
913  if (!cb->Run(f, data_ + i)) {
914  delete cb;
915  return false;
916  }
917  }
918  delete cb;
919  } else {
920  if (f->FReadEndian(data_, sizeof(T), size_used_) != size_used_)
921  return false;
922  }
923  return true;
924 }
int32_t inT32
Definition: host.h:38
void reserve(int size)
virtual R Run(A1, A2)=0
int FReadEndian(void *buffer, int size, int count)
Definition: serialis.cpp:97

◆ remove()

template<typename T >
void GenericVector< T >::remove ( int  index)

Definition at line 754 of file genericvector.h.

754  {
755  ASSERT_HOST(index >= 0 && index < size_used_);
756  for (int i = index; i < size_used_ - 1; ++i) {
757  data_[i] = data_[i+1];
758  }
759  size_used_--;
760 }
#define ASSERT_HOST(x)
Definition: errcode.h:84

◆ reserve()

template<typename T >
void GenericVector< T >::reserve ( int  size)

Definition at line 672 of file genericvector.h.

672  {
673  if (size_reserved_ >= size || size <= 0)
674  return;
676  T* new_array = new T[size];
677  for (int i = 0; i < size_used_; ++i)
678  new_array[i] = data_[i];
679  delete[] data_;
680  data_ = new_array;
682 }
voidpf void uLong size
Definition: ioapi.h:39
int size() const
Definition: genericvector.h:72
inT32 size_reserved_
static const int kDefaultVectorSize

◆ resize_no_init()

template<typename T>
void GenericVector< T >::resize_no_init ( int  size)
inline

Definition at line 66 of file genericvector.h.

66  {
67  reserve(size);
68  size_used_ = size;
69  }
void reserve(int size)
voidpf void uLong size
Definition: ioapi.h:39
int size() const
Definition: genericvector.h:72

◆ reverse()

template<typename T>
void GenericVector< T >::reverse ( )
inline

Definition at line 215 of file genericvector.h.

215  {
216  for (int i = 0; i < size_used_ / 2; ++i)
217  Swap(&data_[i], &data_[size_used_ - 1 - i]);
218  }
void Swap(T *p1, T *p2)
Definition: helpers.h:97

◆ Serialize() [1/2]

template<typename T >
bool GenericVector< T >::Serialize ( FILE *  fp) const

Definition at line 929 of file genericvector.h.

929  {
930  if (fwrite(&size_used_, sizeof(size_used_), 1, fp) != 1) return false;
931  if (fwrite(data_, sizeof(*data_), size_used_, fp) != unsigned_size()) return false;
932  return true;
933 }
unsigned int unsigned_size() const
Definition: genericvector.h:76

◆ Serialize() [2/2]

template<typename T >
bool GenericVector< T >::Serialize ( tesseract::TFile fp) const

Definition at line 935 of file genericvector.h.

935  {
936  if (fp->FWrite(&size_used_, sizeof(size_used_), 1) != 1) return false;
937  if (fp->FWrite(data_, sizeof(*data_), size_used_) != size_used_) return false;
938  return true;
939 }
int FWrite(const void *buffer, int size, int count)
Definition: serialis.cpp:148

◆ SerializeClasses() [1/2]

template<typename T >
bool GenericVector< T >::SerializeClasses ( FILE *  fp) const

Definition at line 978 of file genericvector.h.

978  {
979  if (fwrite(&size_used_, sizeof(size_used_), 1, fp) != 1) return false;
980  for (int i = 0; i < size_used_; ++i) {
981  if (!data_[i].Serialize(fp)) return false;
982  }
983  return true;
984 }
bool Serialize(FILE *fp) const

◆ SerializeClasses() [2/2]

template<typename T >
bool GenericVector< T >::SerializeClasses ( tesseract::TFile fp) const

Definition at line 986 of file genericvector.h.

986  {
987  if (fp->FWrite(&size_used_, sizeof(size_used_), 1) != 1) return false;
988  for (int i = 0; i < size_used_; ++i) {
989  if (!data_[i].Serialize(fp)) return false;
990  }
991  return true;
992 }
int FWrite(const void *buffer, int size, int count)
Definition: serialis.cpp:148
bool Serialize(FILE *fp) const

◆ set()

template<typename T>
void GenericVector< T >::set ( t,
int  index 
)

Definition at line 731 of file genericvector.h.

731  {
732  ASSERT_HOST(index >= 0 && index < size_used_);
733  data_[index] = t;
734 }
#define ASSERT_HOST(x)
Definition: errcode.h:84

◆ set_clear_callback()

template<typename T>
void GenericVector< T >::set_clear_callback ( TessCallback1< T > *  cb)

Definition at line 842 of file genericvector.h.

842  {
843  clear_cb_ = cb;
844 }
TessCallback1< T > * clear_cb_

◆ set_compare_callback()

template<typename T>
void GenericVector< T >::set_compare_callback ( TessResultCallback2< bool, T const &, T const &> *  cb)

Definition at line 849 of file genericvector.h.

850  {
851  compare_cb_ = cb;
852 }
TessResultCallback2< bool, T const &, T const & > * compare_cb_

◆ size()

template<typename T>
int GenericVector< T >::size ( ) const
inline

Definition at line 72 of file genericvector.h.

72  {
73  return size_used_;
74  }

◆ size_reserved()

template<typename T>
int GenericVector< T >::size_reserved ( ) const
inline

Definition at line 81 of file genericvector.h.

81  {
82  return size_reserved_;
83  }
inT32 size_reserved_

◆ SkipDeSerialize()

template<typename T >
bool GenericVector< T >::SkipDeSerialize ( tesseract::TFile fp)
static

Definition at line 968 of file genericvector.h.

968  {
969  inT32 reserved;
970  if (fp->FReadEndian(&reserved, sizeof(reserved), 1) != 1) return false;
971  return fp->FRead(NULL, sizeof(T), reserved) == reserved;
972 }
int32_t inT32
Definition: host.h:38
int FReadEndian(void *buffer, int size, int count)
Definition: serialis.cpp:97
int FRead(void *buffer, int size, int count)
Definition: serialis.cpp:108

◆ SkipDeSerializeClasses()

template<typename T >
bool GenericVector< T >::SkipDeSerializeClasses ( tesseract::TFile fp)
static

Definition at line 1023 of file genericvector.h.

1023  {
1024  inT32 reserved;
1025  if (fp->FReadEndian(&reserved, sizeof(reserved), 1) != 1) return false;
1026  for (int i = 0; i < reserved; ++i) {
1027  if (!T::SkipDeSerialize(fp)) return false;
1028  }
1029  return true;
1030 }
int32_t inT32
Definition: host.h:38
int FReadEndian(void *buffer, int size, int count)
Definition: serialis.cpp:97

◆ sort() [1/2]

template<typename T >
void GenericVector< T >::sort ( )

Definition at line 1050 of file genericvector.h.

1050  {
1051  sort(&tesseract::sort_cmp<T>);
1052 }

◆ sort() [2/2]

template<typename T>
void GenericVector< T >::sort ( int(*)(const void *, const void *)  comparator)
inline

Definition at line 231 of file genericvector.h.

231  {
232  qsort(data_, size_used_, sizeof(*data_), comparator);
233  }

◆ swap()

template<typename T>
void GenericVector< T >::swap ( int  index1,
int  index2 
)
inline

Definition at line 320 of file genericvector.h.

320  {
321  if (index1 != index2) {
322  T tmp = data_[index1];
323  data_[index1] = data_[index2];
324  data_[index2] = tmp;
325  }
326  }

◆ truncate()

template<typename T>
void GenericVector< T >::truncate ( int  size)
inline

Definition at line 136 of file genericvector.h.

136  {
137  if (size < size_used_)
138  size_used_ = size;
139  }
voidpf void uLong size
Definition: ioapi.h:39
int size() const
Definition: genericvector.h:72

◆ unsigned_size()

template<typename T>
unsigned int GenericVector< T >::unsigned_size ( ) const
inline

Definition at line 76 of file genericvector.h.

76  {
77  static_assert(sizeof(size_used_) <= sizeof(unsigned int), "");
78  assert(0 <= size_used_);
79  return static_cast<unsigned int>(size_used_);
80  }

◆ WithinBounds()

template<typename T>
bool GenericVector< T >::WithinBounds ( const T &  rangemin,
const T &  rangemax 
) const
inline

Definition at line 329 of file genericvector.h.

329  {
330  for (int i = 0; i < size_used_; ++i) {
331  if (data_[i] < rangemin || rangemax < data_[i])
332  return false;
333  }
334  return true;
335  }

◆ write()

template<typename T>
bool GenericVector< T >::write ( FILE *  f,
TessResultCallback2< bool, FILE *, T const &> *  cb 
) const

Definition at line 886 of file genericvector.h.

887  {
888  if (fwrite(&size_reserved_, sizeof(size_reserved_), 1, f) != 1) return false;
889  if (fwrite(&size_used_, sizeof(size_used_), 1, f) != 1) return false;
890  if (cb != NULL) {
891  for (int i = 0; i < size_used_; ++i) {
892  if (!cb->Run(f, data_[i])) {
893  delete cb;
894  return false;
895  }
896  }
897  delete cb;
898  } else {
899  if (fwrite(data_, sizeof(T), size_used_, f) != unsigned_size()) return false;
900  }
901  return true;
902 }
unsigned int unsigned_size() const
Definition: genericvector.h:76
virtual R Run(A1, A2)=0
inT32 size_reserved_

Member Data Documentation

◆ clear_cb_

template<typename T>
TessCallback1<T>* GenericVector< T >::clear_cb_
protected

Definition at line 351 of file genericvector.h.

◆ compare_cb_

template<typename T>
TessResultCallback2<bool, T const &, T const &>* GenericVector< T >::compare_cb_
mutableprotected

Definition at line 353 of file genericvector.h.

◆ data_

template<typename T>
T* GenericVector< T >::data_
protected

Definition at line 350 of file genericvector.h.

◆ kDefaultVectorSize

template<typename T>
const int GenericVector< T >::kDefaultVectorSize = 4
staticprotected

Definition at line 347 of file genericvector.h.

◆ size_reserved_

template<typename T>
inT32 GenericVector< T >::size_reserved_
protected

Definition at line 349 of file genericvector.h.

◆ size_used_

template<typename T>
inT32 GenericVector< T >::size_used_
protected

Definition at line 348 of file genericvector.h.


The documentation for this class was generated from the following files: