Srđan Panić

@ahmedabt No, not a separate generic function. What I meant to say is that every sequential data structure should have a `reduce` function that is specific to it. [Array](https://github.com/srdja/Collections-C/blob/c51e17802ed4510a7cc6bf1918a61e36b57e3d51/src/array.c#L881) already...

@ahmedabt That would be awesome!

Hey @qequ, the issue is still up, and of course, you're welcome to contribute :)

Hi @khasanovasad, thanks for the suggestion! We already have an RB tree implemented as the [treetable](https://github.com/srdja/Collections-C/blob/master/src/cc_treetable.c), however, having an additional AVL version would be nice.

Hi @khasanovasad, it depends on what kind of high level container you want to implement. If you want to make another alternative implementation of the table container (which is easily...

This is not bad idea. The most convinient way to implement this would be to keep the callback pointers in the container structure and just call them from appropriate functions...

I don't think that the solution @ankurdh proposed is practical. For one you wouldn't be able to use a List and WatchList interchangeably. Any peace of code that expects a...

- [x] Array - [ ] Deque - [x] List - [x] SList - [ ] HashTable - [ ] TreeTable - [ ] HashSet - [ ] TreeSet

Hey @argonlaser, thanks for looking into the library and your interest in contributing. A PR addressing this issue would be most welcome! However, it would be great if you could...

Yup, you're right, `filter` functions (+ tests) have been implemented for the `Array` so you can use that as a reference, at least on some higher level. As far as...