Skip to content

A cache. A set which compares elements in a customisable way without overriding the eq() and hash() functions on the type itself.

License

Apache-2.0, MIT licenses found

Licenses found

Apache-2.0
LICENSE-APACHE
MIT
LICENSE-MIT
Notifications You must be signed in to change notification settings

dhardy/hashindexed

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Hash-indexed collection

You could call this a cache, or a kind of set. It is a simple wrapper around HashSet to allow values of type T to be stored in a set indexed by some type K, where values of type K can be somehow "extracted" from those of type T.

Check documentation on type HashIndexed for usage.

License

Licensed under either of

at your option.

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

About

A cache. A set which compares elements in a customisable way without overriding the eq() and hash() functions on the type itself.

Resources

License

Apache-2.0, MIT licenses found

Licenses found

Apache-2.0
LICENSE-APACHE
MIT
LICENSE-MIT

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages