Commit 4d28c1b

committed

Add C++ implementation

Signed-off-by: begeekmyfriend <begeekmyfriend@gmail.com>

1 parent 275ecc7 commit 4d28c1bCopy full SHA for 4d28c1b

File tree

1 file changed

+10

-12

lines changed

460_lfu_cache
- lfu_cache.c

1 file changed

+10

-12

lines changed

`‎460_lfu_cache/lfu_cache.c‎`

Lines changed: 10 additions & 12 deletions

Original file line number	Diff line number	Diff line change
`@@ -31,6 +31,7 @@ typedef struct FreqAVLNode {`
`31`	`31`
`32`	`32`	`typedef struct {`
`33`	`33`	`FreqAVLNode *root;`
	`34`	`+ FreqAVLNode *min_freq_node;`
`34`	`35`	`} FreqAVLTree;`
`35`	`36`
`36`	`37`	`typedef struct LFUNode {`
`@@ -284,19 +285,11 @@ static void avl_node_erase(FreqAVLTree tree, FreqAVLNode node)`
`284`	`285`	`avl_tree_balance(tree, startpoint);`
`285`	`286`	`}`
`286`	`287`
`287`		`-static FreqAVLNode avl_tree_min_get(FreqAVLTree tree)`
`288`		`-{`
`289`		`- FreqAVLNode *node = tree->root;`
`290`		`- while (node->children[0] != NULL) {`
`291`		`- node = node->children[0];`
`292`		`- }`
`293`		`- return node;`
`294`		`-}`
`295`		`-`
`296`	`288`	`static FreqAVLTree *avl_tree_init(void)`
`297`	`289`	`{`
`298`	`290`	`FreqAVLTree tree = malloc(sizeof(tree));`
`299`	`291`	`tree->root = NULL;`
	`292`	`+ tree->min_freq_node = NULL;`
`300`	`293`	`return tree;`
`301`	`294`	`}`
`302`	`295`
`@@ -327,7 +320,11 @@ static void freq_incr(FreqAVLTree* tree, LFUNode *lfu, int key)`
`327`	`320`
`328`	`321`	`/* New frequency */`
`329`	`322`	`int freq = ++lfu->freq;`
`330`		`- lfu->node = avl_tree_insert(tree, freq);`
	`323`	`+ FreqAVLNode *node = avl_tree_insert(tree, freq);`
	`324`	`+ if (lfu->node == tree->min_freq_node) {`
	`325`	`+ tree->min_freq_node = node;`
	`326`	`+ }`
	`327`	`+ lfu->node = node;`
`331`	`328`	`list_add(&lfu->dlink, &lfu->node->dhead);`
`332`	`329`	`}`
`333`	`330`
`@@ -378,7 +375,7 @@ void lFUCachePut(LFUCache* obj, int key, int value)`
`378`	`375`
`379`	`376`	`/* squeeze minimum frequency */`
`380`	`377`	`if (obj->size == obj->capacity) {`
`381`		`- FreqAVLNode *node = avl_tree_min_get(obj->tree);`
	`378`	`+ FreqAVLNode *node = obj->tree->min_freq_node;`
`382`	`379`	`lfu = list_last_entry(&node->dhead, LFUNode, dlink);`
`383`	`380`	`list_del(&lfu->dlink);`
`384`	`381`	`list_del(&lfu->key_link);`
`@@ -396,6 +393,7 @@ void lFUCachePut(LFUCache* obj, int key, int value)`
`396`	`393`	`lfu->val = value;`
`397`	`394`	`lfu->freq = 1;`
`398`	`395`	`lfu->node = avl_tree_insert(obj->tree, lfu->freq);`
	`396`	`+ obj->tree->min_freq_node = lfu->node;`
`399`	`397`	`list_add(&lfu->dlink, &lfu->node->dhead);`
`400`	`398`	`list_add(&lfu->key_link, &obj->hheads[hash]);`
`401`	`399`	`}`
`@@ -430,7 +428,7 @@ void lFUCacheFree(LFUCache* obj)`
`430`	`428`	`int main(void)`
`431`	`429`	`{`
`432`	`430`	`LFUCache* obj = lFUCacheCreate(2);`
`433`		`-#if 1`
	`431`	`+#if 0`
`434`	`432`	`lFUCachePut(obj, 1, 1);`
`435`	`433`	`printf("Put 1 1\n");`
`436`	`434`	`lFUCachePut(obj, 2, 2);`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 4d28c1b

File tree

1 file changed

1 file changed

`‎460_lfu_cache/lfu_cache.c‎`

0 commit comments