Lines Matching refs:k
159 bool equal( const MyKey& j, const MyKey& k ) const { in equal()
160 return j.key==k.key; in equal()
163 std::size_t hash( const MyKey& k ) const { in hash()
164 return k.key; in hash()
170 bool equal( const MyKey& j, const MyKey& k ) const { in equal()
171 return j.key==k.key; in equal()
351 Iterator1 i(j), k; in TestIteratorAssignment() local
354 k = j; in TestIteratorAssignment()
355 CHECK(k==j); in TestIteratorAssignment()
356 CHECK(!(k!=j)); in TestIteratorAssignment()
573 size_t hash( const T& k ) const { in hash()
574 return my_hash_func(k); in hash()
748 int k = i->first.value_of(); in TraverseTable() local
749 CHECK_FAST(UseKey(k)); in TraverseTable()
750 CHECK_FAST((*i).first.value_of()==k); in TraverseTable()
751 CHECK_FAST_MESSAGE((0<=k && size_t(k)<n), "out of bounds key" ); in TraverseTable()
752 CHECK_FAST_MESSAGE( !array[k], "duplicate key" ); in TraverseTable()
753 array[k] = true; in TraverseTable()
765 CHECK_FAST(cic->first.value_of()==k); in TraverseTable()
766 CHECK_FAST((*cic).first.value_of()==k); in TraverseTable()
867 int k = i->first.value_of(); in operator ()() local
868 CHECK_FAST((0<=k && size_t(k)<n)); in operator ()()
869 ++array[k]; in operator ()()
876 for( size_t k=0; k<n; ++k ) { in Check() local
877 if( array[k] != int(UseKey(k)) ) { in Check()
879 int(k), int(array[k]), int(UseKey(k)), int(k)); in Check()
985 int k; in operator ()() local
993 k = a->second.value_of(); in operator ()()
995 if( std::size_t(k) == my_nthread ) in operator ()()