HashTest Class Reference

Inheritance diagram for HashTest:

Collaboration diagram for HashTest:

Protected Member Functions
void	hmap1 ()
void	hmmap1 ()
void	hmmap2 ()
void	hmset1 ()
void	hset2 ()
void	insert_erase ()
void	allocator_with_state ()

Private Member Functions
	CPPUNIT_TEST_SUITE (HashTest)
	CPPUNIT_TEST (hmap1)
	CPPUNIT_TEST (hmmap1)
	CPPUNIT_TEST (hmmap2)
	CPPUNIT_TEST (hmset1)
	CPPUNIT_TEST (hset2)
	CPPUNIT_TEST (insert_erase)
	CPPUNIT_TEST (allocator_with_state)
	CPPUNIT_TEST_SUITE_END ()

Private Attributes
	CPPUNIT_IGNORE

Detailed Description

Definition at line 33 of file hash_test.cpp.

Member Function Documentation

allocator_with_state()

void HashTest::allocator_with_state ( )

protected

Definition at line 377 of file hash_test.cpp.

{
#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS)
  char buf1[2048];
  StackAllocator<int> stack1(buf1, buf1 + sizeof(buf1));
 
  char buf2[2048];
  StackAllocator<int> stack2(buf2, buf2 + sizeof(buf2));
 
  {
    typedef hash_set<int, hash<int>, equal_to<int>, StackAllocator<int> > HashSetInt;
    HashSetInt hint1(10, hash<int>(), equal_to<int>(), stack1);
 
    int i;
    for (i = 0; i < 5; ++i)
      hint1.insert(i);
    HashSetInt hint1Cpy(hint1);
 
    HashSetInt hint2(10, hash<int>(), equal_to<int>(), stack2);
    for (; i < 10; ++i)
      hint2.insert(i);
    HashSetInt hint2Cpy(hint2);
 
    hint1.swap(hint2);
 
    CPPUNIT_ASSERT( hint1.get_allocator().swaped() );
    CPPUNIT_ASSERT( hint2.get_allocator().swaped() );
 
    CPPUNIT_ASSERT( hint1.get_allocator() == stack2 );
    CPPUNIT_ASSERT( hint2.get_allocator() == stack1 );
  }
  CPPUNIT_ASSERT( stack1.ok() );
  CPPUNIT_ASSERT( stack2.ok() );
#endif
}

CPPUNIT_TEST() [1/7]

HashTest::CPPUNIT_TEST ( allocator_with_state  )

private

CPPUNIT_TEST() [2/7]

HashTest::CPPUNIT_TEST ( hmap1  )

private

CPPUNIT_TEST() [3/7]

HashTest::CPPUNIT_TEST ( hmmap1  )

private

CPPUNIT_TEST() [4/7]

HashTest::CPPUNIT_TEST ( hmmap2  )

private

CPPUNIT_TEST() [5/7]

HashTest::CPPUNIT_TEST ( hmset1  )

private

CPPUNIT_TEST() [6/7]

HashTest::CPPUNIT_TEST ( hset2  )

private

CPPUNIT_TEST() [7/7]

HashTest::CPPUNIT_TEST ( insert_erase  )

private

CPPUNIT_TEST_SUITE()

HashTest::CPPUNIT_TEST_SUITE ( HashTest  )

private

CPPUNIT_TEST_SUITE_END()

HashTest::CPPUNIT_TEST_SUITE_END ( )

private

hmap1()

void HashTest::hmap1 ( )

protected

Definition at line 76 of file hash_test.cpp.

{
#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS)
  typedef hash_map<char, crope, hash<char>, equal_to<char> > maptype;
  maptype m;
  // Store mappings between roman numerals and decimals.
  m['l'] = "50";
  m['x'] = "20"; // Deliberate mistake.
  m['v'] = "5";
  m['i'] = "1";
  CPPUNIT_ASSERT( !strcmp(m['x'].c_str(),"20") );
  m['x'] = "10"; // Correct mistake.
  CPPUNIT_ASSERT( !strcmp(m['x'].c_str(),"10") );
 
  CPPUNIT_ASSERT( !strcmp(m['z'].c_str(),"") );
 
  CPPUNIT_ASSERT( m.count('z')==1 );
  pair<maptype::iterator, bool> p = m.insert(pair<const char, crope>('c', crope("100")));
 
  CPPUNIT_ASSERT(p.second);
 
  p = m.insert(pair<const char, crope>('c', crope("100")));
  CPPUNIT_ASSERT(!p.second);
 
  //Some iterators compare check, really compile time checks
  maptype::iterator ite(m.begin());
  maptype::const_iterator cite(m.begin());
  cite = m.begin();
  maptype const& cm = m;
  cite = cm.begin();
  CPPUNIT_ASSERT( ite == cite );
  CPPUNIT_ASSERT( !(ite != cite) );
  CPPUNIT_ASSERT( cite == ite );
  CPPUNIT_ASSERT( !(cite != ite) );
#endif
}

hmmap1()

void HashTest::hmmap1 ( )

protected

Definition at line 113 of file hash_test.cpp.

{
#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS)
  typedef hash_multimap<char, int, hash<char>,equal_to<char> > mmap;
  mmap m;
  CPPUNIT_ASSERT(m.count('X')==0);
  m.insert(pair<const char,int>('X', 10)); // Standard way.
  CPPUNIT_ASSERT(m.count('X')==1);
//  m.insert('X', 20); // Non-standard, but very convenient!
  m.insert(pair<const char,int>('X', 20));  // jbuck: standard way
  CPPUNIT_ASSERT(m.count('X')==2);
//  m.insert('Y', 32);
  m.insert(pair<const char,int>('Y', 32));  // jbuck: standard way
  mmap::iterator i = m.find('X'); // Find first match.
 
  CPPUNIT_ASSERT((*i).first=='X');
  CPPUNIT_ASSERT((*i).second==10);
  i++;
  CPPUNIT_ASSERT((*i).first=='X');
  CPPUNIT_ASSERT((*i).second==20);
  i++;
  CPPUNIT_ASSERT((*i).first=='Y');
  CPPUNIT_ASSERT((*i).second==32);
  i++;
  CPPUNIT_ASSERT(i==m.end());
 
  size_t count = m.erase('X');
  CPPUNIT_ASSERT(count==2);
 
  //Some iterators compare check, really compile time checks
  mmap::iterator ite(m.begin());
  mmap::const_iterator cite(m.begin());
  CPPUNIT_ASSERT( ite == cite );
  CPPUNIT_ASSERT( !(ite != cite) );
  CPPUNIT_ASSERT( cite == ite );
  CPPUNIT_ASSERT( !(cite != ite) );
 
  typedef hash_multimap<size_t, size_t> HMapType;
  HMapType hmap;
 
  //We fill the map to implicitely start a rehash.
  for (size_t counter = 0; counter < 3077; ++counter)
    hmap.insert(HMapType::value_type(1, counter));
 
  hmap.insert(HMapType::value_type(12325, 1));
  hmap.insert(HMapType::value_type(12325, 2));
 
  CPPUNIT_ASSERT( hmap.count(12325) == 2 );
 
  //At this point 23 goes to the same bucket as 12325, it used to reveal a bug.
  hmap.insert(HMapType::value_type(23, 0));
 
  CPPUNIT_ASSERT( hmap.count(12325) == 2 );
#endif
}

hmmap2()

void HashTest::hmmap2 ( )

protected

Definition at line 248 of file hash_test.cpp.

{
#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS)
  hashType h;
  mapType m;
 
  // CAUTION the following configurations WORKS in our setting
  //      for (int id = 1; id != 400; id ++)   and int key = (id %3 == 0 ? 3 : id)
  //      for (int id = 200; id != 1; id --)   and int key = (id %3 == 0 ? 3 : id)
  //      for (int id = 300; id != 1; id --)   and int key = (id %3 == 0 ? 3 : id)
  //      for (int id = 400; id != 1; id --)   and int key = (id %3 == 0 ? 1 : id)
  //      for (int id = 4000; id != 1; id --)  and int key = (id %3 == 0 ? 1 : id)
  //
  // whereas these will FAIL
  //      for (int id = 400; id != 1; id --)   and int key = (id %3 == 0 ? 3 : id)
  //      for (int id = 4000; id != 1; id --)  and int key = (id %3 == 0 ? 3 : id)
  //
 
  for ( int id = 400; id != 1; id-- ) {
    // generate many entries with key 3, fill up with unique keys. Data is unique (needed in check_keys())
    int key = (id % 3 == 0 ? 3 : id);
 
    // keep hash_multi_map and multimap in sync
    h.insert(make_pair(key, id));
    m.insert(make_pair(key, id));
 
    // check whether both contain the same elements
    check_keys( h, m );
  }
#endif
}

hmset1()

void HashTest::hmset1 ( )

protected

Definition at line 280 of file hash_test.cpp.

{
#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS)
  hmset s;
  CPPUNIT_ASSERT( s.count(star) == 0 );
  s.insert(star);
  CPPUNIT_ASSERT( s.count(star) == 1 );
  s.insert(star);
  CPPUNIT_ASSERT( s.count(star) == 2 );
  hmset::iterator i = s.find(char(40));
  CPPUNIT_ASSERT( i == s.end() );
 
  i = s.find(star);
  CPPUNIT_ASSERT( i != s.end() )
  CPPUNIT_ASSERT( *i == '*' );
  CPPUNIT_ASSERT( s.erase(star) == 2 );
#endif
}

hset2()

void HashTest::hset2 ( )

protected

Definition at line 298 of file hash_test.cpp.

{
#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS)
  hash_set<int, hash<int>, equal_to<int> > s;
  pair<hash_set<int, hash<int>, equal_to<int> >::iterator, bool> p = s.insert(42);
  CPPUNIT_ASSERT( p.second );
  CPPUNIT_ASSERT( *(p.first) == 42 );
 
  p = s.insert(42);
  CPPUNIT_ASSERT( !p.second );
#endif
}

insert_erase()

void HashTest::insert_erase ( )

protected

Definition at line 311 of file hash_test.cpp.

{
#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS)
  typedef hash_map<string, size_t, hash<string>, equal_to<string> > hmap;
  typedef hmap::value_type val_type;
  {
    hmap values;
#  if !defined (__BORLANDC__) || (__BORLANDC__ >= 0x564)
    CPPUNIT_ASSERT( values.insert(val_type("foo", 0)).second );
    CPPUNIT_ASSERT( values.insert(val_type("bar", 0)).second );
    CPPUNIT_ASSERT( values.insert(val_type("abc", 0)).second );
#  else
    CPPUNIT_ASSERT( values.insert(hmap::value_type("foo", 0)).second );
    CPPUNIT_ASSERT( values.insert(hmap::value_type("bar", 0)).second );
    CPPUNIT_ASSERT( values.insert(hmap::value_type("abc", 0)).second );
#  endif
 
    CPPUNIT_ASSERT( values.erase("foo") == 1 );
    CPPUNIT_ASSERT( values.erase("bar") == 1 );
    CPPUNIT_ASSERT( values.erase("abc") == 1 );
  }
 
  {
    hmap values;
#  if !defined (__BORLANDC__) || (__BORLANDC__ >= 0x564)
    CPPUNIT_ASSERT( values.insert(val_type("foo", 0)).second );
    CPPUNIT_ASSERT( values.insert(val_type("bar", 0)).second );
    CPPUNIT_ASSERT( values.insert(val_type("abc", 0)).second );
#  else
    CPPUNIT_ASSERT( values.insert(hmap::value_type("foo", 0)).second );
    CPPUNIT_ASSERT( values.insert(hmap::value_type("bar", 0)).second );
    CPPUNIT_ASSERT( values.insert(hmap::value_type("abc", 0)).second );
#  endif
 
    CPPUNIT_ASSERT( values.erase("abc") == 1 );
    CPPUNIT_ASSERT( values.erase("bar") == 1 );
    CPPUNIT_ASSERT( values.erase("foo") == 1 );
  }
#endif
}

Member Data Documentation

CPPUNIT_IGNORE

HashTest::CPPUNIT_IGNORE

private

Definition at line 37 of file hash_test.cpp.

---

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

• sdk/lib/3rdparty/stlport/test/unit/hash_test.cpp