IntervalMap (B2R2) | B2R2

IntervalMap Module

Namespace: B2R2
Assembly: B2R2.Core.dll

Helper module for IntervalMap.

Functions and values

Function or value	Description
`add i v arg3` Full Usage: `add i v arg3` Parameters: i : `AddrRange` v : `'a` arg2 : `IntervalMap<'a>` Returns: `IntervalMap<'a>`	Add an item to the interval tree. i : `AddrRange` v : `'a` arg2 : `IntervalMap<'a>` Returns: `IntervalMap<'a>`
`addByTuple (il, ih) v m` Full Usage: `addByTuple (il, ih) v m` Parameters: il : `Addr` ih : `Addr` v : `'a` m : `IntervalMap<'a>` Returns: `IntervalMap<'a>`	Add an item to the interval tree. il : `Addr` ih : `Addr` v : `'a` m : `IntervalMap<'a>` Returns: `IntervalMap<'a>`
`addOrReplace i v m` Full Usage: `addOrReplace i v m` Parameters: i : `AddrRange` v : `'T` m : `IntervalMap<'T>` Returns: `IntervalMap<'T>`	Add a new mapping to the IntervalMap when there is no exactly matching interval. If there is, replace the mapping with the new value. i : `AddrRange` v : `'T` m : `IntervalMap<'T>` Returns: `IntervalMap<'T>`
`contains range m` Full Usage: `contains range m` Parameters: range : `AddrRange` m : `IntervalMap<'T>` Returns: `bool`	Check whether the exact range exists in the interval tree. range : `AddrRange` m : `IntervalMap<'T>` Returns: `bool`
`containsAddr addr m` Full Usage: `containsAddr addr m` Parameters: addr : `Addr` m : `IntervalMap<'a>` Returns: `bool`	Check whether the given address exists in the interval tree. addr : `Addr` m : `IntervalMap<'a>` Returns: `bool`
`empty` Full Usage: `empty` Returns: `IntervalMap<'T>`	Empty interval tree. Returns: `IntervalMap<'T>`
`findAll range arg2` Full Usage: `findAll range arg2` Parameters: range : `AddrRange` arg1 : `IntervalMap<'a>` Returns: `IntervalMapElem<'a> list`	Find all overlapping intervals. range : `AddrRange` arg1 : `IntervalMap<'a>` Returns: `IntervalMapElem<'a> list`
`fold fn acc arg3` Full Usage: `fold fn acc arg3` Parameters: fn : `'a -> AddrRange -> 'T -> 'a` acc : `'a` arg2 : `IntervalMap<'T>` Returns: `'a`	Fold the map. fn : `'a -> AddrRange -> 'T -> 'a` acc : `'a` arg2 : `IntervalMap<'T>` Returns: `'a`
`includeRange range arg2` Full Usage: `includeRange range arg2` Parameters: range : `AddrRange` arg1 : `IntervalMap<'a>` Returns: `bool`	Check whether the given address interval is included in any of the intervals in the interval map. range : `AddrRange` arg1 : `IntervalMap<'a>` Returns: `bool`
`isEmpty m` Full Usage: `isEmpty m` Parameters: m : `IntervalMap<'T>` Returns: `bool`	m : `IntervalMap<'T>` Returns: `bool`
`iter fn m` Full Usage: `iter fn m` Parameters: fn : `AddrRange -> 'a -> unit` m : `IntervalMap<'a>`	Iterate the map. fn : `AddrRange -> 'a -> unit` m : `IntervalMap<'a>`
`remove i arg2` Full Usage: `remove i arg2` Parameters: i : `AddrRange` arg1 : `IntervalMap<'a>` Returns: `IntervalMap<'a>`	Remove the exactly matched interval from the map. i : `AddrRange` arg1 : `IntervalMap<'a>` Returns: `IntervalMap<'a>`
`replace i v arg3` Full Usage: `replace i v arg3` Parameters: i : `AddrRange` v : `'T` arg2 : `IntervalMap<'T>` Returns: `IntervalMap<'T>`	Replace the exactly matched interval from the map to the given one. i : `AddrRange` v : `'T` arg2 : `IntervalMap<'T>` Returns: `IntervalMap<'T>`
`tryFind range m` Full Usage: `tryFind range m` Parameters: range : `AddrRange` m : `IntervalMap<'T>` Returns: `'T option`	Find exactly matching interval. range : `AddrRange` m : `IntervalMap<'T>` Returns: `'T option`
`tryFindByMin addr arg2` Full Usage: `tryFindByMin addr arg2` Parameters: addr : `Addr` arg1 : `IntervalMap<'a>` Returns: `'a option`	Find an interval that has the same low bound (Min) as the given address. addr : `Addr` arg1 : `IntervalMap<'a>` Returns: `'a option`