llvm::IntervalMapImpl::BranchNode< KeyT, ValT, N, Traits > Class Template Reference

#include <IntervalMap.h>

Inheritance diagram for llvm::IntervalMapImpl::BranchNode< KeyT, ValT, N, Traits >:

Collaboration diagram for llvm::IntervalMapImpl::BranchNode< KeyT, ValT, N, Traits >:

List of all members.

Public Member Functions
const KeyT &	stop (unsigned i) const
const NodeRef &	subtree (unsigned i) const
KeyT &	stop (unsigned i)
NodeRef &	subtree (unsigned i)
unsigned	findFrom (unsigned i, unsigned Size, KeyT x) const
unsigned	safeFind (unsigned i, KeyT x) const
NodeRef	safeLookup (KeyT x) const
void	insert (unsigned i, unsigned Size, NodeRef Node, KeyT Stop)

---

Detailed Description

template<typename KeyT, typename ValT, unsigned N, typename Traits>
class llvm::IntervalMapImpl::BranchNode< KeyT, ValT, N, Traits >

Definition at line 697 of file IntervalMap.h.

---

Member Function Documentation

template<typename KeyT, typename ValT, unsigned N, typename Traits>

unsigned llvm::IntervalMapImpl::BranchNode< KeyT, ValT, N, Traits >::findFrom	(	unsigned	i,
		unsigned	Size,
		KeyT	x
	)		const [inline]

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

Parameters:

i	Starting index for the search.
Size	Number of elements in node.
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.

Definition at line 711 of file IntervalMap.h.

template<typename KeyT, typename ValT, unsigned N, typename Traits>

void llvm::IntervalMapImpl::BranchNode< KeyT, ValT, N, Traits >::insert	(	unsigned	i,
		unsigned	Size,
		NodeRef	Node,
		KeyT	Stop
	)		[inline]

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

Parameters:

i	Insert position, following entries will be shifted.
Size	Number of elements in node.
Node	Subtree to insert.
Stop	Last key in subtree.

Definition at line 746 of file IntervalMap.h.

template<typename KeyT, typename ValT, unsigned N, typename Traits>

unsigned llvm::IntervalMapImpl::BranchNode< KeyT, ValT, N, Traits >::safeFind	(	unsigned	i,
		KeyT	x
	)		const [inline]

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

Parameters:

i	Starting index for the search.
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.

Definition at line 725 of file IntervalMap.h.

template<typename KeyT, typename ValT, unsigned N, typename Traits>

NodeRef llvm::IntervalMapImpl::BranchNode< KeyT, ValT, N, Traits >::safeLookup

(

KeyT

x

)

const [inline]

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

Parameters:

x	Key to search for.

Returns:

Subtree containing x

Definition at line 737 of file IntervalMap.h.

template<typename KeyT, typename ValT, unsigned N, typename Traits>

const KeyT& llvm::IntervalMapImpl::BranchNode< KeyT, ValT, N, Traits >::stop

(

unsigned

i

)

const [inline]

Definition at line 699 of file IntervalMap.h.

Referenced by llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator::treeAdvanceTo().

template<typename KeyT, typename ValT, unsigned N, typename Traits>

KeyT& llvm::IntervalMapImpl::BranchNode< KeyT, ValT, N, Traits >::stop

(

unsigned

i

)

[inline]

Definition at line 702 of file IntervalMap.h.

template<typename KeyT, typename ValT, unsigned N, typename Traits>

const NodeRef& llvm::IntervalMapImpl::BranchNode< KeyT, ValT, N, Traits >::subtree

(

unsigned

i

)

const [inline]

Definition at line 700 of file IntervalMap.h.

template<typename KeyT, typename ValT, unsigned N, typename Traits>

NodeRef& llvm::IntervalMapImpl::BranchNode< KeyT, ValT, N, Traits >::subtree

(

unsigned

i

)

[inline]

Definition at line 703 of file IntervalMap.h.

---

The documentation for this class was generated from the following file:

• IntervalMap.h