Collections-C

Collections-C copied to clipboard

Q: purpose of hashtable_hash_ptr

1

Newbie here, so please bear with me, but I think I am missing something obvious. What is the purpose of `hashtable_hash_ptr` @ https://github.com/srdja/Collections-C/blob/master/src/hashtable.c#L918 ? My understanding is that it would...

scossu

This function does not remove the element that was last returned by deque_iter_next. It removes the next item

BornMathias

list_add does not copy data

2

When using `list_add_all`(list1, list2) calling `list_destroy_free` on both lists will cause a SIGSEGV. The solution, as I see it is that `list_add_all` needs to do a deep copy of the...

fr0stbyte

How about adding the new data structure bitmasks, as the bitset in stl of c++

2

I once worked with the bitset of c++ its quite handy sometimes when you do competitive coding and is also useful for the works regarding OS studies. So I think...

nimitbhardwaj

Binary search on a sorted Array

7

You should be able do perform a binary search on a sorted array.

srdja

Filter functions

8

Collections should have `*_filter` and `*_filter_mut` functions so that one may do something like this: ``` c bool predicate(void *e) { int el = *((int*) e); if (el > 5)...

srdja

Hashtable free keys

2

- In configuration a free function specifically to free keys in hashtable_remove and hashtable_destroy cases can be added. In current configuration the keys are left in heap if they were...

xfilesee

Improve cooperation with C++ environments

1

[Some code from C source files](https://github.com/srdja/Collections-C/blob/82883c53a4e303b8bc55a18713db55653828899c/src/slist.h#L24) should be wrapped by the setting '[`extern "C"`](https://isocpp.org/wiki/faq/mixing-c-and-cpp#include-c-hdrs-personal)' for C++ tools, shouldn't it?

elfring

linked list with signals

6

I would like to see a list which is basicly a linked list, but you should be able to add callback functions for the following actions: - new item added...

mame98

How about adding Bloom Filter data structure?

2

I think Bloom Filters are pretty cool. They are a fairly fast and space-efficient implementation of a set with the trade-off that "False positive matches are possible, but false negatives...

ericbreyer