tesseract::BitVectorTest Class Reference

Inheritance diagram for tesseract::BitVectorTest:

Public Member Functions
std::string	OutputNameToPath (const std::string &name)
void	ComputePrimes (BitVector *map)
void	TestPrimes (const BitVector &map)
void	TestAll (const BitVector &map, bool value)
void	SetBitPattern (int start_byte, int end_byte, int spacing, BitVector *bv)
void	ExpectCorrectBits (const BitVector &bv)
Public Member Functions inherited from testing::Test
virtual	~Test ()

Protected Member Functions
void	SetUp () override
Protected Member Functions inherited from testing::Test
	Test ()
virtual void	SetUp ()
virtual void	TearDown ()

Additional Inherited Members
Static Public Member Functions inherited from testing::Test
static void	SetUpTestSuite ()
static void	TearDownTestSuite ()
static void	TearDownTestCase ()
static void	SetUpTestCase ()
static bool	HasFatalFailure ()
static bool	HasNonfatalFailure ()
static bool	IsSkipped ()
static bool	HasFailure ()
static void	RecordProperty (const std::string &key, const std::string &value)
static void	RecordProperty (const std::string &key, int value)

Detailed Description

Definition at line 24 of file bitvector_test.cc.

Member Function Documentation

ComputePrimes()

void tesseract::BitVectorTest::ComputePrimes ( BitVector *  map )

inline

Definition at line 36 of file bitvector_test.cc.

                                     {
    map->Init(kPrimeLimit + 1);
    TestAll(*map, false);
    map->SetBit(2);
    // Set all the odds to true.
    for (int i = 3; i <= kPrimeLimit; i += 2) {
      map->SetValue(i, true);
    }
    int factor_limit = static_cast<int>(sqrt(1.0 + kPrimeLimit));
    for (int f = 3; f <= factor_limit; f += 2) {
      if (map->At(f)) {
        for (int m = 2; m * f <= kPrimeLimit; ++m) {
          map->ResetBit(f * m);
        }
      }
    }
  }

ExpectCorrectBits()

void tesseract::BitVectorTest::ExpectCorrectBits ( const BitVector &  bv )

inline

Definition at line 92 of file bitvector_test.cc.

                                              {
    int bit_index = -1;
    int prev_bit_index = -1;
    int num_bits_tested = 0;
    while ((bit_index = bv.NextSetBit(bit_index)) >= 0) {
      EXPECT_LT(bit_index, bv.size());
      // All bits in between must be 0.
      for (int i = prev_bit_index + 1; i < bit_index; ++i) {
        EXPECT_EQ(0, bv[i]) << "i = " << i << " prev = " << prev_bit_index;
      }
      // This bit must be 1.
      EXPECT_EQ(1, bv[bit_index]) << "Bit index = " << bit_index;
      ++num_bits_tested;
      prev_bit_index = bit_index;
    }
    // Check the bits between the last and the end.
    for (int i = prev_bit_index + 1; i < bv.size(); ++i) {
      EXPECT_EQ(0, bv[i]);
    }
    EXPECT_EQ(num_bits_tested, bv.NumSetBits());
  }

OutputNameToPath()

std::string tesseract::BitVectorTest::OutputNameToPath ( const std::string &  name )

inline

Definition at line 32 of file bitvector_test.cc.

                                                    {
    return file::JoinPath(FLAGS_test_tmpdir, name);
  }

SetBitPattern()

void tesseract::BitVectorTest::SetBitPattern ( int  start_byte, int  end_byte, int  spacing, BitVector *  bv  )

inline

Definition at line 79 of file bitvector_test.cc.

                                                                               {
    bv->Init((end_byte - start_byte) * 8 * spacing);
    for (int byte_value = start_byte; byte_value < end_byte; ++byte_value) {
      for (int bit = 0; bit < 8; ++bit) {
        if (byte_value & (1 << bit)) {
          bv->SetBit((byte_value - start_byte) * 8 * spacing + bit);
        }
      }
    }
  }

SetUp()

void tesseract::BitVectorTest::SetUp ( )

inlineoverrideprotectedvirtual

Reimplemented from testing::Test.

Definition at line 26 of file bitvector_test.cc.

                        {
    std::locale::global(std::locale(""));
    file::MakeTmpdir();
  }

TestAll()

void tesseract::BitVectorTest::TestAll ( const BitVector &  map, bool  value  )

inline

Definition at line 70 of file bitvector_test.cc.

                                                 {
    for (int i = 0; i < map.size(); ++i) {
      EXPECT_EQ(value, map[i]);
    }
  }

TestPrimes()

void tesseract::BitVectorTest::TestPrimes ( const BitVector &  map )

inline

Definition at line 54 of file bitvector_test.cc.

                                        {
    // Now all primes in the vector are true, and all others false.
    // According to Wikipedia, there are 168 primes under 1000, the last
    // of which is 997.
    int total_primes = 0;
    for (int i = 0; i <= kPrimeLimit; ++i) {
      if (map[i]) {
        ++total_primes;
      }
    }
    EXPECT_EQ(168, total_primes);
    EXPECT_TRUE(map[997]);
    EXPECT_FALSE(map[998]);
    EXPECT_FALSE(map[999]);
  }

---

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

• /media/home/debian/src/github/tesseract-ocr/tesseract/unittest/bitvector_test.cc