| Overview |  |
Nested dictionaries.
Copyright 2011-2013 Klarna AB
Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.'maybe'(A, B) = {ok, A} | {error, B}
t() = dict:dict()
| delete/2 | Prune everything below Ks from Map. |
| get/2 | Look up the value associated with the leaf reachable via Ks in Map. |
| get/3 | |
| new/0 | Return a fresh map. |
| set/3 | Set the leaf reachable via Ks in Map to V. |
| to_list/1 | Return the list-representation of Map. |
| update/4 | Update the leaf reachable via Ks in Map to the result of applying F to its current value or V if it doesn't have one. |
Prune everything below Ks from Map.
Look up the value associated with the leaf reachable via Ks in Map.
get(Map, Ks, Default) -> any()
new() -> t()
Return a fresh map.
Set the leaf reachable via Ks in Map to V.
to_list(Map::t()) -> [term()]
Return the list-representation of Map.
Update the leaf reachable via Ks in Map to the result of applying F to its current value or V if it doesn't have one.
Generated by EDoc