spacepaste

Paste details

reply | raw

  1.  
  2. // Returns true if key presents in trie, else false
  3. bool search(struct TrieNode **root, const char *key, int idx)
  4. {
  5. int level;
  6. int length = strlen(key);
  7. int index;
  8. struct TrieNode *pCrawl = *root;
  9. // pi(idx);
  10. for (level = 0; level < length; level++)
  11. {
  12. str_new(ch);
  13. str_insert_char(ch, key[level]);
  14. if (ch.type & STR_TYPE_DIGIT) index = INT_TO_INDEX(key[level]);
  15. else if (ch.type & STR_TYPE_ALPHABETIC) index = CHAR_TO_INDEX(key[level]);
  16. str_free(ch)
  17. if (!pCrawl->children[index]) {
  18. index = CHAR_TO_INDEX('x');
  19. if (!pCrawl->children[index]) return false;
  20. }
  22. pCrawl = pCrawl->children[index];
  23. // pp(pCrawl->next);
  24. if (pCrawl->next) {
  25. // pi(pCrawl->next->idx)
  26. // pp(*root)
  27. *root = pCrawl->next;
  28. // pp(*root)
  29. // bool result = search(pCrawl->next, key, idx);
  30. // pb(result);
  31. }
  32. }
  34. // pi(pCrawl->count)
  35. bool final_match = false;
  36. for (int i = 0; i < pCrawl->count; i++) {
  37. // pi(pCrawl->idx[i])
  38. if (pCrawl->idx[i] == idx) final_match = true;
  39. }
  40. // pb(final_match)
  41. return (pCrawl != NULL && pCrawl->isEndOfWord && final_match);
  42. }
  44. // Returns true if key presents in trie, else false
  45. bool search_segmented(struct TrieNode *root, struct TrieNode *segments, const char *key)
  46. {
  47. int level;
  48. int length = strlen(key);
  49. int index;
  50. struct TrieNode *pCrawl = root;
  52. str_new(segment);
  53. int idx = 0;
  55. for (level = 0; level < length; level++)
  56. {
  57. str_insert_char(segment, key[level]);
  59. ps(segment.string);
  60. // pp(segments)
  61. bool result1 = search(&segments, segment.string, idx);
  62. // pp(segments)
  63. pi(idx)
  64. pb(result1);
  65. if (result1) {
  66. str_reset(segment);
  67. idx++;
  68. }
  69. pi(idx)
  70. str_new(ch);
  71. str_insert_char(ch, key[level]);
  72. if (ch.type & STR_TYPE_DIGIT) index = INT_TO_INDEX(key[level]);
  73. else if (ch.type & STR_TYPE_ALPHABETIC) index = CHAR_TO_INDEX(key[level]);
  74. str_free(ch)
  76. if (!pCrawl->children[index]) {
  77. index = CHAR_TO_INDEX('x');
  78. if (!pCrawl->children[index]) return false;
  79. }
  81. pCrawl = pCrawl->children[index];
  82. }
  83. str_free(segment);
  84. return (pCrawl != NULL && pCrawl->isEndOfWord);
  85. }
  86.  
Powered by spacepaste. Paste removal.