-
Notifications
You must be signed in to change notification settings - Fork 80
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
The Map[K, V].find() API design discussion #12
Comments
The return value of Rather, we would need to create a new inverse function to
Which is certainly a possibility. |
Oh, I see, I've made a mistake. Actually, I want to do a range search; e.g. : func (m *Map[K, V]) RangeDo(keyLow, keyHigh K, fn func(key K, value Value)) {...} then, used like this: m := NewMap[int, string](...)
// ... some init actions
m.RangeDo(10, 100, func(key K, value Value) {... }) so, I think, I need |
For an inclusive range operation you can use the
|
Does this mean we are doing a full scan on the dataset? A range query on a btree would be best to leverage the btree structure and achieve a O(log n) complexity. |
can you export
to public domain, like:
for method to use:
The text was updated successfully, but these errors were encountered: