class BranchNode

Declaration

template <typename KeyT,
          typename ValT,
          unsigned int N,
          typename Traits>
class BranchNode { /* full declaration omitted */ };

Declared at: llvm/include/llvm/ADT/IntervalMap.h:700

Templates

KeyT

ValT

unsigned int N

Traits

Method Overview

• public unsigned int findFrom(unsigned int i, unsigned int Size, KeyT x) const
• public void insert(unsigned int i, unsigned int Size, llvm::IntervalMapImpl::NodeRef Node, KeyT Stop)
• public unsigned int safeFind(unsigned int i, KeyT x) const
• public llvm::IntervalMapImpl::NodeRef safeLookup(KeyT x) const
• public const KeyT & stop(unsigned int i) const
• public KeyT & stop(unsigned int i)
• public const llvm::IntervalMapImpl::NodeRef & subtree(unsigned int i) const
• public llvm::IntervalMapImpl::NodeRef & subtree(unsigned int i)

Methods

¶unsigned int findFrom(unsigned int i,
                      unsigned int Size,
                      KeyT x) const

Description

findFrom - Find the first subtree after i that may contain x.

Declared at: llvm/include/llvm/ADT/IntervalMap.h:714

Parameters

unsigned int i

Starting index for the search.

unsigned int Size

Number of elements in node.

KeyT x

Key to search for.

Returns

First index with !stopLess(key[i], x), or size. This is the first subtree that can possibly contain x.

¶void insert(unsigned int i,
            unsigned int Size,
            llvm::IntervalMapImpl::NodeRef Node,
            KeyT Stop)

Description

insert - Insert a new (subtree, stop) pair.

Declared at: llvm/include/llvm/ADT/IntervalMap.h:749

Parameters

unsigned int i

Insert position, following entries will be shifted.

unsigned int Size

Number of elements in node.

llvm::IntervalMapImpl::NodeRef Node

Subtree to insert.

KeyT Stop

Last key in subtree.

¶unsigned int safeFind(unsigned int i,
                      KeyT x) const

Description

safeFind - Find a subtree that is known to exist. This is the same as findFrom except is it assumed that x is in range.

Declared at: llvm/include/llvm/ADT/IntervalMap.h:728

Parameters

unsigned int i

Starting index for the search.

KeyT x

Key to search for.

Returns

First index with !stopLess(key[i], x), never size. This is the first subtree that can possibly contain x.

¶llvm::IntervalMapImpl::NodeRef safeLookup(
    KeyT x) const

Description

safeLookup - Get the subtree containing x, Assuming that x is in range.

Declared at: llvm/include/llvm/ADT/IntervalMap.h:740

Parameters

KeyT x

Key to search for.

Returns

Subtree containing x

¶const KeyT& stop(unsigned int i) const

Declared at: llvm/include/llvm/ADT/IntervalMap.h:702

Parameters

unsigned int i

¶KeyT& stop(unsigned int i)

Declared at: llvm/include/llvm/ADT/IntervalMap.h:705

Parameters

unsigned int i

¶const llvm::IntervalMapImpl::NodeRef& subtree(
    unsigned int i) const

Declared at: llvm/include/llvm/ADT/IntervalMap.h:703

Parameters

unsigned int i

¶llvm::IntervalMapImpl::NodeRef& subtree(
    unsigned int i)

Declared at: llvm/include/llvm/ADT/IntervalMap.h:706

Parameters

unsigned int i