| :
include #include #include #include "trie.h" int main(int argc, char **argv) { Trie *trie = create_trie(); insert(trie, "abc", 1); insert(trie, "abd", 2); insert(trie, "ac", 3); insert(trie, "bc", 4); insert(trie, "bd", 5); insert(trie, "b", 6); print(trie); printf("search abc: %d ", search(trie, "abc")); printf("search abd: %d ", search(trie, "abd")); printf("search ac: %d ", search(trie, "ac")); printf("search bc: %d ", search(trie, "bc")); printf("search bd: %d ", search(trie, "bd")); printf("search b: %d ", search(trie, "b")); printf("search a: %d ", search(trie, "a")); printf("search d: %d ", search(trie, "d")); printf("search_prefix ab: "); char *buffer = malloc(10 * sizeof(char)); memset(buffer, 0, 10 * sizeof(char)); int count = search_prefix(trie, "ab", buffer); for (int i = 0; i < count; i++) { printf("%d ", buffer[i]); } printf(" "); printf("search_prefix b: "); memset(buffer, 0, 10 * sizeof(char)); count = search_prefix(trie, "b", buffer); for (int i = 0; i < count; i++) { printf("%d ", buffer[i]); } printf(" "); printf("search_prefix a: "); memset(buffer, 0, 10 * sizeof(char)); count = search_prefix(trie, "a", buffer); for (int i = 0; i < count; i++) { printf("%d ", buffer[i]); } printf(" "); printf("search_prefix d: "); memset(buffer, 0, 10 * sizeof(char)); count = search_prefix(trie, "d", buffer); for (int i = 0; i < count; i++) { printf("%d ", buffer[i]); } printf(" "); return 0; }
ǸҳܰȨ۳ʱ踶ѹ
˴
ɨ븶Ѽɸ
low power mode | SAQ | IMS_SIP_REGISTER->Request | ML | Max PUSCH C/(I+N) | Centralized Unit | CBSD | NrFreqReselPriority | 附着请求 | sakagami Extended | Okumura-Hata | Microwave Propagation Model |