feat(shell): vscode ctrl k and f format code
This commit is contained in:
Alex Duan
parent
60d7ad82ac
commit
b222ff4ba5
|
|
@ -24,7 +24,7 @@ void pressTabKey(SShellCmd* cmd);
|
|||
// press othr key
|
||||
void pressOtherKey(char c);
|
||||
|
||||
// init shell auto funciton , shell start call once
|
||||
// init shell auto funciton , shell start call once
|
||||
bool shellAutoInit();
|
||||
|
||||
// set conn
|
||||
|
|
|
|||
|
|
@ -16,68 +16,65 @@
|
|||
#ifndef __TRIE__
|
||||
#define __TRIE__
|
||||
|
||||
//
|
||||
//
|
||||
// The prefix search tree is a efficient storage words and search words tree, it support 95 visible ascii code character
|
||||
//
|
||||
#define FIRST_ASCII 40 // first visiable char is '0'
|
||||
#define LAST_ASCII 122 // last visilbe char is 'z'
|
||||
|
||||
// capacity save char is 95
|
||||
#define CHAR_CNT (LAST_ASCII - FIRST_ASCII + 1)
|
||||
#define MAX_WORD_LEN 256 // max insert word length
|
||||
#define CHAR_CNT (LAST_ASCII - FIRST_ASCII + 1)
|
||||
#define MAX_WORD_LEN 256 // max insert word length
|
||||
|
||||
// define STire
|
||||
#define TIRE_TREE 0
|
||||
#define TIRE_LIST 1
|
||||
#define TIRE_TREE 0
|
||||
#define TIRE_LIST 1
|
||||
|
||||
typedef struct STireNode {
|
||||
struct STireNode** d;
|
||||
bool end; // record end flag
|
||||
}STireNode;
|
||||
struct STireNode** d;
|
||||
bool end; // record end flag
|
||||
} STireNode;
|
||||
|
||||
typedef struct StrName {
|
||||
char * name;
|
||||
struct StrName * next;
|
||||
}StrName;
|
||||
|
||||
char* name;
|
||||
struct StrName* next;
|
||||
} StrName;
|
||||
|
||||
typedef struct STire {
|
||||
char type; // see define TIRE_
|
||||
STireNode root;
|
||||
char type; // see define TIRE_
|
||||
STireNode root;
|
||||
|
||||
StrName * head;
|
||||
StrName * tail;
|
||||
StrName* head;
|
||||
StrName* tail;
|
||||
|
||||
int count; // all count
|
||||
int ref;
|
||||
}STire;
|
||||
int count; // all count
|
||||
int ref;
|
||||
} STire;
|
||||
|
||||
typedef struct SMatchNode {
|
||||
char* word;
|
||||
struct SMatchNode* next;
|
||||
}SMatchNode;
|
||||
|
||||
char* word;
|
||||
struct SMatchNode* next;
|
||||
} SMatchNode;
|
||||
|
||||
typedef struct SMatch {
|
||||
SMatchNode* head;
|
||||
SMatchNode* tail; // append node to tail
|
||||
int count;
|
||||
char pre[MAX_WORD_LEN];
|
||||
}SMatch;
|
||||
|
||||
SMatchNode* head;
|
||||
SMatchNode* tail; // append node to tail
|
||||
int count;
|
||||
char pre[MAX_WORD_LEN];
|
||||
} SMatch;
|
||||
|
||||
// ----------- interface -------------
|
||||
|
||||
// create prefix search tree, return value call freeTire to free
|
||||
// create prefix search tree, return value call freeTire to free
|
||||
STire* createTire(char type);
|
||||
|
||||
// destroy prefix search tree
|
||||
void freeTire(STire* tire);
|
||||
|
||||
// add a new word
|
||||
// add a new word
|
||||
bool insertWord(STire* tire, char* word);
|
||||
|
||||
// add a new word
|
||||
// add a new word
|
||||
bool deleteWord(STire* tire, char* word);
|
||||
|
||||
// match prefix words, if match is not NULL , put all item to match and return match
|
||||
|
|
|
|||
File diff suppressed because it is too large
Load Diff
|
|
@ -15,421 +15,412 @@
|
|||
|
||||
#define __USE_XOPEN
|
||||
|
||||
#include "os.h"
|
||||
#include "shellTire.h"
|
||||
#include "os.h"
|
||||
|
||||
// ----------- interface -------------
|
||||
|
||||
// create prefix search tree
|
||||
STire* createTire(char type) {
|
||||
STire* tire = taosMemoryMalloc(sizeof(STire));
|
||||
memset(tire, 0, sizeof(STire));
|
||||
tire->ref = 1; // init is 1
|
||||
tire->type = type;
|
||||
tire->root.d = (STireNode **)taosMemoryCalloc(CHAR_CNT, sizeof(STireNode *));
|
||||
return tire;
|
||||
STire* tire = taosMemoryMalloc(sizeof(STire));
|
||||
memset(tire, 0, sizeof(STire));
|
||||
tire->ref = 1; // init is 1
|
||||
tire->type = type;
|
||||
tire->root.d = (STireNode**)taosMemoryCalloc(CHAR_CNT, sizeof(STireNode*));
|
||||
return tire;
|
||||
}
|
||||
|
||||
// free tire node
|
||||
void freeTireNode(STireNode* node) {
|
||||
if (node == NULL)
|
||||
return ;
|
||||
|
||||
// nest free sub node on array d
|
||||
if(node->d) {
|
||||
for (int i = 0; i < CHAR_CNT; i++) {
|
||||
freeTireNode(node->d[i]);
|
||||
}
|
||||
taosMemoryFree(node->d);
|
||||
}
|
||||
if (node == NULL) return;
|
||||
|
||||
// free self
|
||||
taosMemoryFree(node);
|
||||
// nest free sub node on array d
|
||||
if (node->d) {
|
||||
for (int i = 0; i < CHAR_CNT; i++) {
|
||||
freeTireNode(node->d[i]);
|
||||
}
|
||||
taosMemoryFree(node->d);
|
||||
}
|
||||
|
||||
// free self
|
||||
taosMemoryFree(node);
|
||||
}
|
||||
|
||||
// destroy prefix search tree
|
||||
void freeTire(STire* tire) {
|
||||
// free nodes
|
||||
for (int i = 0; i < CHAR_CNT; i++) {
|
||||
freeTireNode(tire->root.d[i]);
|
||||
}
|
||||
taosMemoryFree(tire->root.d);
|
||||
// free nodes
|
||||
for (int i = 0; i < CHAR_CNT; i++) {
|
||||
freeTireNode(tire->root.d[i]);
|
||||
}
|
||||
taosMemoryFree(tire->root.d);
|
||||
|
||||
// free from list
|
||||
StrName * item = tire->head;
|
||||
while (item) {
|
||||
StrName * next = item->next;
|
||||
// free string
|
||||
taosMemoryFree(item->name);
|
||||
// free node
|
||||
taosMemoryFree(item);
|
||||
// free from list
|
||||
StrName* item = tire->head;
|
||||
while (item) {
|
||||
StrName* next = item->next;
|
||||
// free string
|
||||
taosMemoryFree(item->name);
|
||||
// free node
|
||||
taosMemoryFree(item);
|
||||
|
||||
// move next
|
||||
item = next;
|
||||
}
|
||||
tire->head = tire->tail = NULL;
|
||||
// move next
|
||||
item = next;
|
||||
}
|
||||
tire->head = tire->tail = NULL;
|
||||
|
||||
// free tire
|
||||
taosMemoryFree(tire);
|
||||
// free tire
|
||||
taosMemoryFree(tire);
|
||||
}
|
||||
|
||||
// insert a new word to list
|
||||
bool insertToList(STire* tire, char* word) {
|
||||
StrName * p = (StrName *)taosMemoryMalloc(sizeof(StrName));
|
||||
p->name = strdup(word);
|
||||
p->next = NULL;
|
||||
|
||||
if(tire->head == NULL) {
|
||||
tire->head = p;
|
||||
tire->tail = p;
|
||||
}else {
|
||||
tire->tail->next = p;
|
||||
tire->tail = p;
|
||||
}
|
||||
StrName* p = (StrName*)taosMemoryMalloc(sizeof(StrName));
|
||||
p->name = strdup(word);
|
||||
p->next = NULL;
|
||||
|
||||
return true;
|
||||
if (tire->head == NULL) {
|
||||
tire->head = p;
|
||||
tire->tail = p;
|
||||
} else {
|
||||
tire->tail->next = p;
|
||||
tire->tail = p;
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
// insert a new word to tree
|
||||
bool insertToTree(STire* tire, char* word, int len) {
|
||||
int m = 0;
|
||||
STireNode ** nodes = tire->root.d;
|
||||
for (int i = 0; i < len; i++) {
|
||||
m = word[i] - FIRST_ASCII;
|
||||
if (m < 0 || m > CHAR_CNT) {
|
||||
return false;
|
||||
}
|
||||
|
||||
if (nodes[m] == NULL) {
|
||||
// no pointer
|
||||
STireNode* p = (STireNode* )taosMemoryMalloc(sizeof(STireNode));
|
||||
memset(p, 0, sizeof(STireNode));
|
||||
nodes[m] = p;
|
||||
if (i == len - 1) {
|
||||
// is end
|
||||
p->end = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (nodes[m]->d == NULL) {
|
||||
// malloc d
|
||||
nodes[m]->d = (STireNode **)taosMemoryCalloc(CHAR_CNT, sizeof(STireNode *));
|
||||
}
|
||||
|
||||
// move to next node
|
||||
nodes = nodes[m]->d;
|
||||
int m = 0;
|
||||
STireNode** nodes = tire->root.d;
|
||||
for (int i = 0; i < len; i++) {
|
||||
m = word[i] - FIRST_ASCII;
|
||||
if (m < 0 || m > CHAR_CNT) {
|
||||
return false;
|
||||
}
|
||||
|
||||
// add count
|
||||
tire->count += 1;
|
||||
return true;
|
||||
if (nodes[m] == NULL) {
|
||||
// no pointer
|
||||
STireNode* p = (STireNode*)taosMemoryMalloc(sizeof(STireNode));
|
||||
memset(p, 0, sizeof(STireNode));
|
||||
nodes[m] = p;
|
||||
if (i == len - 1) {
|
||||
// is end
|
||||
p->end = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (nodes[m]->d == NULL) {
|
||||
// malloc d
|
||||
nodes[m]->d = (STireNode**)taosMemoryCalloc(CHAR_CNT, sizeof(STireNode*));
|
||||
}
|
||||
|
||||
// move to next node
|
||||
nodes = nodes[m]->d;
|
||||
}
|
||||
|
||||
// add count
|
||||
tire->count += 1;
|
||||
return true;
|
||||
}
|
||||
|
||||
// insert a new word
|
||||
// insert a new word
|
||||
bool insertWord(STire* tire, char* word) {
|
||||
int len = strlen(word);
|
||||
if (len >= MAX_WORD_LEN) {
|
||||
return false;
|
||||
}
|
||||
|
||||
switch (tire->type) {
|
||||
case TIRE_TREE:
|
||||
return insertToTree(tire, word, len);
|
||||
case TIRE_LIST:
|
||||
return insertToList(tire, word);
|
||||
default:
|
||||
break;
|
||||
}
|
||||
int len = strlen(word);
|
||||
if (len >= MAX_WORD_LEN) {
|
||||
return false;
|
||||
}
|
||||
|
||||
switch (tire->type) {
|
||||
case TIRE_TREE:
|
||||
return insertToTree(tire, word, len);
|
||||
case TIRE_LIST:
|
||||
return insertToList(tire, word);
|
||||
default:
|
||||
break;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
// delete one word from list
|
||||
bool deleteFromList(STire* tire, char* word) {
|
||||
StrName * item = tire->head;
|
||||
while (item) {
|
||||
if (strcmp(item->name, word) == 0) {
|
||||
// found, reset empty to delete
|
||||
item->name[0] = 0;
|
||||
}
|
||||
|
||||
// move next
|
||||
item = item->next;
|
||||
StrName* item = tire->head;
|
||||
while (item) {
|
||||
if (strcmp(item->name, word) == 0) {
|
||||
// found, reset empty to delete
|
||||
item->name[0] = 0;
|
||||
}
|
||||
return true;
|
||||
|
||||
// move next
|
||||
item = item->next;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
// delete one word from tree
|
||||
// delete one word from tree
|
||||
bool deleteFromTree(STire* tire, char* word, int len) {
|
||||
int m = 0;
|
||||
bool del = false;
|
||||
int m = 0;
|
||||
bool del = false;
|
||||
|
||||
STireNode** nodes = tire->root.d;
|
||||
for (int i = 0; i < len; i++) {
|
||||
m = word[i] - FIRST_ASCII;
|
||||
if (m < 0 || m >= CHAR_CNT) {
|
||||
return false;
|
||||
}
|
||||
|
||||
if (nodes[m] == NULL) {
|
||||
// no found
|
||||
return false;
|
||||
} else {
|
||||
// not null
|
||||
if(i == len - 1) {
|
||||
// this is last, only set end false , not free node
|
||||
nodes[m]->end = false;
|
||||
del = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if(nodes[m]->d == NULL)
|
||||
break;
|
||||
// move to next node
|
||||
nodes = nodes[m]->d;
|
||||
STireNode** nodes = tire->root.d;
|
||||
for (int i = 0; i < len; i++) {
|
||||
m = word[i] - FIRST_ASCII;
|
||||
if (m < 0 || m >= CHAR_CNT) {
|
||||
return false;
|
||||
}
|
||||
|
||||
// reduce count
|
||||
if (del) {
|
||||
tire->count -= 1;
|
||||
}
|
||||
|
||||
return del;
|
||||
}
|
||||
|
||||
// insert a new word
|
||||
bool deleteWord(STire* tire, char* word) {
|
||||
int len = strlen(word);
|
||||
if (len >= MAX_WORD_LEN) {
|
||||
return false;
|
||||
}
|
||||
|
||||
switch (tire->type) {
|
||||
case TIRE_TREE:
|
||||
return deleteFromTree(tire, word, len);
|
||||
case TIRE_LIST:
|
||||
return deleteFromList(tire, word);
|
||||
default:
|
||||
break;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
void addWordToMatch(SMatch* match, char* word){
|
||||
// malloc new
|
||||
SMatchNode* node = (SMatchNode* )taosMemoryMalloc(sizeof(SMatchNode));
|
||||
memset(node, 0, sizeof(SMatchNode));
|
||||
node->word = strdup(word);
|
||||
|
||||
// append to match
|
||||
if (match->head == NULL) {
|
||||
match->head = match->tail = node;
|
||||
if (nodes[m] == NULL) {
|
||||
// no found
|
||||
return false;
|
||||
} else {
|
||||
match->tail->next = node;
|
||||
match->tail = node;
|
||||
// not null
|
||||
if (i == len - 1) {
|
||||
// this is last, only set end false , not free node
|
||||
nodes[m]->end = false;
|
||||
del = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
match->count += 1;
|
||||
|
||||
if (nodes[m]->d == NULL) break;
|
||||
// move to next node
|
||||
nodes = nodes[m]->d;
|
||||
}
|
||||
|
||||
// reduce count
|
||||
if (del) {
|
||||
tire->count -= 1;
|
||||
}
|
||||
|
||||
return del;
|
||||
}
|
||||
|
||||
// insert a new word
|
||||
bool deleteWord(STire* tire, char* word) {
|
||||
int len = strlen(word);
|
||||
if (len >= MAX_WORD_LEN) {
|
||||
return false;
|
||||
}
|
||||
|
||||
switch (tire->type) {
|
||||
case TIRE_TREE:
|
||||
return deleteFromTree(tire, word, len);
|
||||
case TIRE_LIST:
|
||||
return deleteFromList(tire, word);
|
||||
default:
|
||||
break;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
void addWordToMatch(SMatch* match, char* word) {
|
||||
// malloc new
|
||||
SMatchNode* node = (SMatchNode*)taosMemoryMalloc(sizeof(SMatchNode));
|
||||
memset(node, 0, sizeof(SMatchNode));
|
||||
node->word = strdup(word);
|
||||
|
||||
// append to match
|
||||
if (match->head == NULL) {
|
||||
match->head = match->tail = node;
|
||||
} else {
|
||||
match->tail->next = node;
|
||||
match->tail = node;
|
||||
}
|
||||
match->count += 1;
|
||||
}
|
||||
|
||||
// enum all words from node
|
||||
void enumAllWords(STireNode** nodes, char* prefix, SMatch* match) {
|
||||
STireNode * c;
|
||||
char word[MAX_WORD_LEN];
|
||||
int len = strlen(prefix);
|
||||
for (int i = 0; i < CHAR_CNT; i++) {
|
||||
c = nodes[i];
|
||||
|
||||
if (c == NULL) {
|
||||
// chain end node
|
||||
continue;
|
||||
} else {
|
||||
// combine word string
|
||||
memset(word, 0, sizeof(word));
|
||||
strcpy(word, prefix);
|
||||
word[len] = FIRST_ASCII + i; // append current char
|
||||
void enumAllWords(STireNode** nodes, char* prefix, SMatch* match) {
|
||||
STireNode* c;
|
||||
char word[MAX_WORD_LEN];
|
||||
int len = strlen(prefix);
|
||||
for (int i = 0; i < CHAR_CNT; i++) {
|
||||
c = nodes[i];
|
||||
|
||||
// chain middle node
|
||||
if (c->end) {
|
||||
// have end flag
|
||||
addWordToMatch(match, word);
|
||||
}
|
||||
// nested call next layer
|
||||
if (c->d)
|
||||
enumAllWords(c->d, word, match);
|
||||
}
|
||||
if (c == NULL) {
|
||||
// chain end node
|
||||
continue;
|
||||
} else {
|
||||
// combine word string
|
||||
memset(word, 0, sizeof(word));
|
||||
strcpy(word, prefix);
|
||||
word[len] = FIRST_ASCII + i; // append current char
|
||||
|
||||
// chain middle node
|
||||
if (c->end) {
|
||||
// have end flag
|
||||
addWordToMatch(match, word);
|
||||
}
|
||||
// nested call next layer
|
||||
if (c->d) enumAllWords(c->d, word, match);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// match prefix from list
|
||||
void matchPrefixFromList(STire* tire, char* prefix, SMatch* match) {
|
||||
StrName * item = tire->head;
|
||||
int len = strlen(prefix);
|
||||
while (item) {
|
||||
if ( strncmp(item->name, prefix, len) == 0) {
|
||||
// prefix matched
|
||||
addWordToMatch(match, item->name);
|
||||
}
|
||||
|
||||
// move next
|
||||
item = item->next;
|
||||
StrName* item = tire->head;
|
||||
int len = strlen(prefix);
|
||||
while (item) {
|
||||
if (strncmp(item->name, prefix, len) == 0) {
|
||||
// prefix matched
|
||||
addWordToMatch(match, item->name);
|
||||
}
|
||||
|
||||
// move next
|
||||
item = item->next;
|
||||
}
|
||||
}
|
||||
|
||||
// match prefix words, if match is not NULL , put all item to match and return match
|
||||
void matchPrefixFromTree(STire* tire, char* prefix, SMatch* match) {
|
||||
SMatch* root = match;
|
||||
int m = 0;
|
||||
STireNode* c = 0;
|
||||
int len = strlen(prefix);
|
||||
if (len >= MAX_WORD_LEN) {
|
||||
return;
|
||||
SMatch* root = match;
|
||||
int m = 0;
|
||||
STireNode* c = 0;
|
||||
int len = strlen(prefix);
|
||||
if (len >= MAX_WORD_LEN) {
|
||||
return;
|
||||
}
|
||||
|
||||
STireNode** nodes = tire->root.d;
|
||||
for (int i = 0; i < len; i++) {
|
||||
m = prefix[i] - FIRST_ASCII;
|
||||
if (m < 0 || m > CHAR_CNT) {
|
||||
return;
|
||||
}
|
||||
|
||||
STireNode** nodes = tire->root.d;
|
||||
for (int i = 0; i < len; i++) {
|
||||
m = prefix[i] - FIRST_ASCII;
|
||||
if (m < 0 || m > CHAR_CNT) {
|
||||
return;
|
||||
}
|
||||
|
||||
// match
|
||||
c = nodes[m];
|
||||
if (c == NULL) {
|
||||
// arrive end
|
||||
break;
|
||||
}
|
||||
|
||||
// previous items already matched
|
||||
if (i == len - 1) {
|
||||
// malloc match if not pass by param match
|
||||
if (root == NULL) {
|
||||
root = (SMatch* )taosMemoryMalloc(sizeof(SMatch));
|
||||
memset(root, 0, sizeof(SMatch));
|
||||
strcpy(root->pre, prefix);
|
||||
}
|
||||
|
||||
// prefix is match to end char
|
||||
if (c->d)
|
||||
enumAllWords(c->d, prefix, root);
|
||||
} else {
|
||||
// move to next node continue match
|
||||
if(c->d == NULL)
|
||||
break;
|
||||
nodes = c->d;
|
||||
}
|
||||
// match
|
||||
c = nodes[m];
|
||||
if (c == NULL) {
|
||||
// arrive end
|
||||
break;
|
||||
}
|
||||
|
||||
// return
|
||||
return ;
|
||||
// previous items already matched
|
||||
if (i == len - 1) {
|
||||
// malloc match if not pass by param match
|
||||
if (root == NULL) {
|
||||
root = (SMatch*)taosMemoryMalloc(sizeof(SMatch));
|
||||
memset(root, 0, sizeof(SMatch));
|
||||
strcpy(root->pre, prefix);
|
||||
}
|
||||
|
||||
// prefix is match to end char
|
||||
if (c->d) enumAllWords(c->d, prefix, root);
|
||||
} else {
|
||||
// move to next node continue match
|
||||
if (c->d == NULL) break;
|
||||
nodes = c->d;
|
||||
}
|
||||
}
|
||||
|
||||
// return
|
||||
return;
|
||||
}
|
||||
|
||||
SMatch* matchPrefix(STire* tire, char* prefix, SMatch* match) {
|
||||
if(match == NULL) {
|
||||
match = (SMatch* )taosMemoryMalloc(sizeof(SMatch));
|
||||
memset(match, 0, sizeof(SMatch));
|
||||
}
|
||||
if (match == NULL) {
|
||||
match = (SMatch*)taosMemoryMalloc(sizeof(SMatch));
|
||||
memset(match, 0, sizeof(SMatch));
|
||||
}
|
||||
|
||||
switch (tire->type) {
|
||||
case TIRE_TREE:
|
||||
matchPrefixFromTree(tire, prefix, match);
|
||||
case TIRE_LIST:
|
||||
matchPrefixFromList(tire, prefix, match);
|
||||
default:
|
||||
break;
|
||||
}
|
||||
switch (tire->type) {
|
||||
case TIRE_TREE:
|
||||
matchPrefixFromTree(tire, prefix, match);
|
||||
case TIRE_LIST:
|
||||
matchPrefixFromList(tire, prefix, match);
|
||||
default:
|
||||
break;
|
||||
}
|
||||
|
||||
// return if need
|
||||
if (match->count == 0) {
|
||||
freeMatch(match);
|
||||
match = NULL;
|
||||
}
|
||||
// return if need
|
||||
if (match->count == 0) {
|
||||
freeMatch(match);
|
||||
match = NULL;
|
||||
}
|
||||
|
||||
return match;
|
||||
return match;
|
||||
}
|
||||
|
||||
|
||||
// get all items from tires tree
|
||||
void enumFromList(STire* tire, SMatch* match) {
|
||||
StrName * item = tire->head;
|
||||
while (item) {
|
||||
if (item->name[0] != 0) {
|
||||
// not delete
|
||||
addWordToMatch(match, item->name);
|
||||
}
|
||||
|
||||
// move next
|
||||
item = item->next;
|
||||
StrName* item = tire->head;
|
||||
while (item) {
|
||||
if (item->name[0] != 0) {
|
||||
// not delete
|
||||
addWordToMatch(match, item->name);
|
||||
}
|
||||
|
||||
// move next
|
||||
item = item->next;
|
||||
}
|
||||
}
|
||||
|
||||
// get all items from tires tree
|
||||
void enumFromTree(STire* tire, SMatch* match) {
|
||||
char pre[2] ={0, 0};
|
||||
STireNode* c;
|
||||
|
||||
// enum first layer
|
||||
for (int i = 0; i < CHAR_CNT; i++) {
|
||||
pre[0] = FIRST_ASCII + i;
|
||||
|
||||
// each node
|
||||
c = tire->root.d[i];
|
||||
if (c == NULL) {
|
||||
// this branch no data
|
||||
continue;
|
||||
}
|
||||
char pre[2] = {0, 0};
|
||||
STireNode* c;
|
||||
|
||||
// this branch have data
|
||||
if(c->end)
|
||||
addWordToMatch(match, pre);
|
||||
else
|
||||
matchPrefix(tire, pre, match);
|
||||
// enum first layer
|
||||
for (int i = 0; i < CHAR_CNT; i++) {
|
||||
pre[0] = FIRST_ASCII + i;
|
||||
|
||||
// each node
|
||||
c = tire->root.d[i];
|
||||
if (c == NULL) {
|
||||
// this branch no data
|
||||
continue;
|
||||
}
|
||||
|
||||
// this branch have data
|
||||
if (c->end)
|
||||
addWordToMatch(match, pre);
|
||||
else
|
||||
matchPrefix(tire, pre, match);
|
||||
}
|
||||
}
|
||||
|
||||
// get all items from tires tree
|
||||
SMatch* enumAll(STire* tire) {
|
||||
SMatch* match = (SMatch* )taosMemoryMalloc(sizeof(SMatch));
|
||||
memset(match, 0, sizeof(SMatch));
|
||||
SMatch* match = (SMatch*)taosMemoryMalloc(sizeof(SMatch));
|
||||
memset(match, 0, sizeof(SMatch));
|
||||
|
||||
switch (tire->type) {
|
||||
case TIRE_TREE:
|
||||
enumFromTree(tire, match);
|
||||
case TIRE_LIST:
|
||||
enumFromList(tire, match);
|
||||
default:
|
||||
break;
|
||||
}
|
||||
switch (tire->type) {
|
||||
case TIRE_TREE:
|
||||
enumFromTree(tire, match);
|
||||
case TIRE_LIST:
|
||||
enumFromList(tire, match);
|
||||
default:
|
||||
break;
|
||||
}
|
||||
|
||||
// return if need
|
||||
if (match->count == 0) {
|
||||
freeMatch(match);
|
||||
match = NULL;
|
||||
}
|
||||
// return if need
|
||||
if (match->count == 0) {
|
||||
freeMatch(match);
|
||||
match = NULL;
|
||||
}
|
||||
|
||||
return match;
|
||||
return match;
|
||||
}
|
||||
|
||||
|
||||
// free match result
|
||||
void freeMatchNode(SMatchNode* node) {
|
||||
// first free next
|
||||
if (node->next)
|
||||
freeMatchNode(node->next);
|
||||
// first free next
|
||||
if (node->next) freeMatchNode(node->next);
|
||||
|
||||
// second free self
|
||||
if (node->word)
|
||||
taosMemoryFree(node->word);
|
||||
taosMemoryFree(node);
|
||||
// second free self
|
||||
if (node->word) taosMemoryFree(node->word);
|
||||
taosMemoryFree(node);
|
||||
}
|
||||
|
||||
// free match result
|
||||
void freeMatch(SMatch* match) {
|
||||
// first free next
|
||||
if (match->head) {
|
||||
freeMatchNode(match->head);
|
||||
}
|
||||
// first free next
|
||||
if (match->head) {
|
||||
freeMatchNode(match->head);
|
||||
}
|
||||
|
||||
// second free self
|
||||
taosMemoryFree(match);
|
||||
}
|
||||
// second free self
|
||||
taosMemoryFree(match);
|
||||
}
|
||||
Loading…
Reference in New Issue