v     SafemNone&',-FQSTV/ !SafeNone &'-FQSTVB [A map-like container optimized for the execution of range queries. The key must have an "" instance and the value must have #8 instance whose append operation is also commutative.TO(1). The monoidal concatenation of all values in the map. This is equivalent to  $ $.yGet the monoidal concatenation of all values in the range. The bounds are both inclusive. Either bound can be omitted.6Fold over the keys in the map along with their values.Get the keys of the map.-Convert the map to a list of key-value pairs.+Build a map from a list of key-value pairs.Insert a key associated with a value into the map. If the key already exists, the existing value and the new value are combined using the # instance for v. The implementation of %q is expected to be commutative, so the order in which the old and new values are combined is not specified. oCombine two maps. If the same key exists in both maps, the values associated with it are combined using the # instance for v. Note that the # instance of  defines % as  . Split the map at the target key. The map that is the first element of the tuple has keys lower than the target. The map that is the third element of the tuple has keys higher than the target. The second element of the tuple is the value at the key if the key was found. bCombine two vicinities. All keys is the first one must be less than all keys in the second one. *Create a map with a single key-value pair. Lower bound Upper boundVicinity     &'()*+,-./      !"#$ %&'()*()+(),--./01234$vicinity-0.1.0-94r7U1IpZY6wPdEB4jcgB Data.VicinityData.NatData.Nat.ArithmeticData.VicinitiesVicinitytotallookupquery foldrWithKeykeystoListfromListinsertunion splitLookupuncheckedConcat singleton$fShowT$fFoldableTree $fShowTree$fFoldableVicinity$fMonoidVicinity$fSemigroupVicinity $fOrdVicinity $fEqVicinity$fShowVicinity$fShowNNatSZGteSNatnatDiffzeroSNatsuccSNatcaseGteghc-prim GHC.ClassesOrdbaseGHC.BaseMonoidNothingmappendTreeTBRLFNT1T2