The C++ map type is probably usually a binary tree (although the exact specifics are up to the compiler). The equivalent in Julia is probably https://github.com/JuliaLang/DataStructures.jl#overview-of-sorted-containers
On Sat, May 2, 2015 at 3:38 PM Kevin Squire <[email protected]> wrote: > Hi Krishna, > > It's a little unclear exactly what you were looking for, and your link to > the cplusplus site was just to the front page. Can you give a few more > details (and a better link)? > > Thanks, > Kevin > > > On Saturday, May 2, 2015, Krishna Subramanian <[email protected]> wrote: > >> So I guess the answer is no at this time for ordered search and >> retrieval. >> >> Thanks for confirming. >> >> >> >> On Friday, May 1, 2015 at 9:11:45 PM UTC-4, [email protected] wrote: >>> >>> >>> >>> On Saturday, May 2, 2015 at 7:53:28 AM UTC+10, Krishna Subramanian wrote: >>>> >>>> Hello, >>>> >>>> I am learning my ropes with Julia and come from a C++/Perl background. >>>> In the C++/STL, we have map which implements upper_bound/lower_bound >>>> operations [see Cplusplus.com]. >>>> >>>> Do we have something similar in Julia? >>>> >>> >>> The standard Julia `Dict` and `Set` types are similar to the C++ >>> `unordered_map` and `unordered_set` types and like the C++ ones don't have >>> upper/lower_bound. >>> >>> >>> >>>> >>>> Thanks. >>>> >>>
