文宇祥
I've tested list that performs nearly identical to array on `iter` and `cons` if it's elements constructed in a batch.
List constructing without cons operator is painful. Will we consider add a cons operator for list like data structures?
You can use immutable collection(s), for mutable collection(s), we have no guarantee on modify self while iterating. ``` fn main { let mut values = @immut/sorted_set.from_array([1, 2, 3]) for value...
/cc @peter-jerry-ye
Add runtime check will result performance penalty. Maybe we should provide an eslint rule like thing. For rust: it's automatically solved by borrow check.
Maybe we should provide an `Array2D` for matrix uses.
I think bytes should encoded as byte[], which byte is number of 0-255.
At least we can report warning on constant one?
Additional notes: **Operation that find the given value using a given key** - op_get - get
Would we introduce a new type `SortedArray` of `Array`? So that we can just use `SortedArray::find` and not use `Array::binary_find`.