An array hash data structure where array is allocated up front with specific size and each element is assigned to each index based on hash function. Each element in an array is a Vec. Each collision of hash will be push into Vec. When number of added element reach certain size, it will scale the size of array by 2x and all old entry will be moved from old array to new one. All of this happen behind the scene. User will not effect by such operation.
ArrayHashBuilder::default() build() method on the instance to obtain ArrayHashput() to put new data into array. This method always put or replace existing value.try_put() to put new data into array if it is not already exist.get() to retrieve a value that was put into it by a key of a type that is hashable and comparable to key.smart_get() to retrieve a value when key is of smart pointer type. This will help reduce time processor required to construct a smart pointer of the same type as key itself.coerce_get() to retrieve a value when key is of a type that can be borrowed as another type which isn't implement PartialEq<K> to the original type. remove() to remove a value out of this array by a key of a type that is hashable and comparable to key.smart_remove() to retrieve a value when key is of smart pointer type. This will help reduce time processor required to construct a smart pointer of the same type as key itself.coerce_remove() to remove a value when key is of a type that can be borrowed as another type which isn't implement PartialEq<K> to the original type. contains_iter to test whether current array have every entry that the iterator yield.to_builder to obtain ArrayHashBuilder with current spec out of existing array.iter() to iterate over the array entry.iter_mut() to iterate and mutate the array entry. This iterator shall not be used to mutate the entry key.drain() to obtain an iterator that keep draining all data from this array out.drain_with() to obtain an iterator that drain some specific entry out when predicate return true.split_by() which return another array and move all value that satisfy the predicate into new array.is_hasher_eq() to check whether two array have equivalence hasher.ArrayHash::try_put is now return Result. When it fail to put, it return Err with given key/value along with reference to current value associated with given key. When it succeed, it return Ok with reference to value that was put into array.if let Some(v) = array_hash.try_put(key, value), it'd become if let Err((key, value, cur_val) = array_hash.try_put(key, value)if array_hash.try_put(key, value).is_some(), it'd become if array_hash.try_put(key, value).is_err()if array_hash.try_put(key, value).is_none(), it'd become if array_hash.try_put(key, value).is_ok()array_hash.try_put(key, value);, it'd become array_hash.try_put(key, value).unwrap()let cur_v = array_hash.try_put(key, value).unwrap(), it'd become let (_, _, cur_v) = array_hash.try_put(key, value).unwrap_err()PartialEq of ArrayHash need both comparator and comparatee to be exactly the same. This including Hasher which must be seed by exactly the same number. The ideal usage is to fill largest array first then use ArrayHash::to_builder to build second array. If it is impossible, consider construct an ArrayHash that is large enough to stored everything without reaching max_load_factor then use ArrayHash::to_builder or clone that ArrayHashBuilder to build every array.ArrayHash::is_hasher_eq to test whether two array can be compared. If two arrays are using different type of hasher, it will immediately yield compile error. If it use the same type of hasher but it use different seed, it will return false. Otherwise, it is comparable via == operator.== operator on two arrays are safe. It will compile error similar to ArrayHash::is_hasher_eq. In fact, in PartialEq implementation, it use ArrayHash::is_hasher_eq to check first if it is comparable. However, it will always return false if two array use different seed even if both array have exactly the same elements in it.== operator to compare two arrays than using ArrayHash::contains_iter as contains_iter will need to hash every key return by iter. The contains_iter method is suitable in case where two arrays are using different hasher type or built from different `ArrayHashBuilder.ArrayHash::try_put moved given key and value but doesn't guarantee to put the key and value in.
It now return Result. If the key and value is successfully put, it return Ok((&V)) where &V is the reference to value that was put. If it fail to put, it return Err((K, V)) where K is the given key and V is given value.
Fix hash defect. When hashing on ArrayHash itself which may cause two hash to be different eventhough, == of two array is true. This is because PartialEq doesn't compare max_load_factor but in 0.1.4 hash take max_load_factor to calculate the hash.
ArrayHash and ArrayHashBuilder are now implements Hash and PartialEq
ArrayHash::is_hasher_eq to check if two array use exactly the same hasher.ArrayHash::coerce_get and ArrayHash::coerce_remove that accept a borrowed type that doesn't implement PartialEq<K> with the stored entryArrayHash::smart_remove which is counterpart of ArrayHash::smart_get that is usable when both stored key and query can be deref into the same type.core::convert::From<ArrayHash> for ArrayHashBuilder.ArrayHash::to_builder to retrieve a ArrayHashBuilder that can build an ArrayHash with exactly same spec as current ArrayHash.ArrayHash::contains_iter that check if this array contain every entry that given iter yield.
ArrayHash::get and ArrayHash::remove parameter is now generic instead of fixing it to be the same type as the one being key. Now any types that implements PartialEq<K> + Hash can be used as parameter.
ArrayHash key and value no longer need to implement clone. The reason behind this is because there are two place where it need to clone key and value. Both of it is for purpose of allocating Vec. However, in both place, it need no actual clone on key nor value. It allocate an empty Vec. Therefore, cloning empty Vec would have no different impact on performance comparing to looping to construct an empty Vec. With this reason, it would be easier for library user to have lesser number of constraint on key/value.