107 lines
3.6 KiB
C++
107 lines
3.6 KiB
C++
/*
|
|
* Licensed to the OpenAirInterface (OAI) Software Alliance under one or more
|
|
* contributor license agreements. See the NOTICE file distributed with
|
|
* this work for additional information regarding copyright ownership.
|
|
* The OpenAirInterface Software Alliance licenses this file to You under
|
|
* the OAI Public License, Version 1.1 (the "License"); you may not use this file
|
|
* except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.openairinterface.org/?page_id=698
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*-------------------------------------------------------------------------------
|
|
* For more information about the OpenAirInterface (OAI) Software Alliance:
|
|
* contact@openairinterface.org
|
|
*/
|
|
|
|
#include <gtest/gtest.h>
|
|
extern "C" {
|
|
#include "hashtable.h"
|
|
}
|
|
|
|
TEST(hashtable, test_insert_remove) {
|
|
hash_table_t* table = hashtable_create(250, NULL, NULL);
|
|
int* a = (int*)calloc(1, sizeof(*a));
|
|
EXPECT_EQ(hashtable_insert(table, 1, a), HASH_TABLE_OK);
|
|
EXPECT_EQ(hashtable_remove(table, 1), HASH_TABLE_OK);
|
|
EXPECT_EQ(hashtable_destroy(&table), HASH_TABLE_OK);
|
|
}
|
|
|
|
TEST(hashtable, test_insert_iterate_remove) {
|
|
hash_table_t* table = hashtable_create(250, NULL, NULL);
|
|
int* a = (int*)calloc(1, sizeof(*a));
|
|
EXPECT_EQ(hashtable_insert(table, 1, a), HASH_TABLE_OK);
|
|
auto iterator = hashtable_get_iterator(table);
|
|
void* ptr;
|
|
int num_items = 0;
|
|
while(hashtable_iterator_getnext(&iterator, &ptr)) {
|
|
num_items++;
|
|
}
|
|
EXPECT_EQ(num_items, 1);
|
|
EXPECT_EQ(hashtable_remove(table, 1), HASH_TABLE_OK);
|
|
num_items = 0;
|
|
|
|
auto iterator2 = hashtable_get_iterator(table);
|
|
while(hashtable_iterator_getnext(&iterator2, &ptr)) {
|
|
num_items++;
|
|
}
|
|
EXPECT_EQ(num_items, 0);
|
|
EXPECT_EQ(hashtable_destroy(&table), HASH_TABLE_OK);
|
|
}
|
|
|
|
TEST(hashtable, test_insert_three_iterate_remove) {
|
|
hash_table_t* table = hashtable_create(250, NULL, NULL);
|
|
int* a1 = (int*)calloc(1, sizeof(*a1));
|
|
int* a2 = (int*)calloc(1, sizeof(*a2));
|
|
int* a3 = (int*)calloc(1, sizeof(*a3));
|
|
EXPECT_EQ(hashtable_insert(table, 1, a1), HASH_TABLE_OK);
|
|
EXPECT_EQ(hashtable_insert(table, 2, a2), HASH_TABLE_OK);
|
|
EXPECT_EQ(hashtable_insert(table, 3, a3), HASH_TABLE_OK);
|
|
auto iterator = hashtable_get_iterator(table);
|
|
void* ptr;
|
|
int num_items = 0;
|
|
while(hashtable_iterator_getnext(&iterator, &ptr)) {
|
|
num_items++;
|
|
}
|
|
EXPECT_EQ(num_items, 3);
|
|
EXPECT_EQ(hashtable_remove(table, 1), HASH_TABLE_OK);
|
|
num_items = 0;
|
|
|
|
auto iterator2 = hashtable_get_iterator(table);
|
|
while(hashtable_iterator_getnext(&iterator2, &ptr)) {
|
|
num_items++;
|
|
}
|
|
EXPECT_EQ(num_items, 2);
|
|
EXPECT_EQ(hashtable_destroy(&table), HASH_TABLE_OK);
|
|
}
|
|
|
|
TEST(hashtable, test_insert_empty_insert_interate) {
|
|
hash_table_t* table = hashtable_create(250, NULL, NULL);
|
|
int* a = (int*)calloc(1, sizeof(*a));
|
|
EXPECT_EQ(hashtable_insert(table, 1, a), HASH_TABLE_OK);
|
|
EXPECT_EQ(hashtable_remove(table, 1), HASH_TABLE_OK);
|
|
|
|
int* a2 = (int*)calloc(1, sizeof(*a2));
|
|
EXPECT_EQ(hashtable_insert(table, 1, a2), HASH_TABLE_OK);
|
|
auto iterator3 = hashtable_get_iterator(table);
|
|
int num_items = 0;
|
|
void* ptr;
|
|
while(hashtable_iterator_getnext(&iterator3, &ptr)) {
|
|
num_items++;
|
|
}
|
|
EXPECT_EQ(num_items, 1);
|
|
|
|
EXPECT_EQ(hashtable_destroy(&table), HASH_TABLE_OK);
|
|
}
|
|
|
|
int main(int argc, char** argv)
|
|
{
|
|
testing::InitGoogleTest(&argc, argv);
|
|
return RUN_ALL_TESTS();
|
|
}
|