-
A List is a list of fixed length with some objects and modifying it requires creating a new list. From the name "mutable list" one might read that they allow other modifications, some natural ones bei…
-
- list the various types of search algorithms
- do a SysML block diagram of the search algorithm relationships
-
A new section in Chapter 8 should be added about persistent arrays, which are now covered in lecture.
-
Red-Black Tree Implementation
Description: Red-Black Trees are a type of self-balancing binary search tree. Nodes in this tree have an additional "color" property that ensures the tree remains bala…
-
Demonstrate Faust's contract-oriented features with some example programs.
-
Hi! Thank you for publishing this crate. I currently use a `BTreeMap` for ranges and have been looking for a better alternative, so `RangeMap` looks like it might be a great fit.
While I was lookin…
-
We can implement a Van Emde Boas layout, which is based on implicit pointers for immutable trees (read-only transactions).
-
There's a similar issue on the topic for a few years earlier, but I really believe it would be a good idea to have generalized names for common container / sequence / etc operations.
The main purp…
-
I noticed that cJSON does not correctly handle objects with circular references (commit `3249730`).
For instance, I can have 3 objects that points each other, e.g., A->B->C->A, the function `cJSON_D…
-
The counterpart of `recv_buf` in linux kernel is called out-of-order queue, which is often shortened as _ofo queue_. That queue is implemented by a red-black tree so that every time the insertion into…