ocean v6.2.0 (2021-12-09T10:56:40Z)

SortedMap.take

ocean util container SortedMap SortedMap

Time complexity: O(log n)

  1. bool take(V v)
  2. bool take(K key, V value)
    class SortedMap(K, V, alias Reap = Container.reap, alias Heap = Container.DefaultCollect)
    final
    bool
    take
    (
    K key
    ,
    ref V value
    )

Meta

Source

See Implementation

ocean util container SortedMap SortedMap aliasesconstructorsdestructorsfunctionsvariables

Page generated by adrdox