ADT Directory Reference

Directory dependency graph for ADT:

Files
file	AllocatorList.h [code]
file	Any.h [code]
file	APFloat.h [code]
	This file declares a class to represent arbitrary precision floating point values and provide a variety of arithmetic operations on them.
file	APInt.h [code]
	This file implements a class to represent arbitrary precision integral constant values and operations on them.
file	APSInt.h [code]
file	ArrayRef.h [code]
file	bit.h [code]
file	BitmaskEnum.h [code]
file	BitVector.h [code]
file	BreadthFirstIterator.h [code]
file	CachedHashString.h [code]
file	DAGDeltaAlgorithm.h [code]
file	DeltaAlgorithm.h [code]
file	DenseMap.h [code]
file	DenseMapInfo.h [code]
file	DenseSet.h [code]
file	DepthFirstIterator.h [code]
file	edit_distance.h [code]
file	EpochTracker.h [code]
file	EquivalenceClasses.h [code]
file	fallible_iterator.h [code]
file	FoldingSet.h [code]
file	FunctionExtras.h [code]
	This file provides a collection of function (or more generally, callable) type erasure utilities supplementing those provided by the standard library in <function>.
file	GraphTraits.h [code]
file	Hashing.h [code]
file	ilist.h [code]
file	ilist_base.h [code]
file	ilist_iterator.h [code]
file	ilist_node.h [code]
file	ilist_node_base.h [code]
file	ilist_node_options.h [code]
file	ImmutableList.h [code]
file	ImmutableMap.h [code]
file	ImmutableSet.h [code]
file	IndexedMap.h [code]
file	IntEqClasses.h [code]
file	IntervalMap.h [code]
file	IntrusiveRefCntPtr.h [code]
file	iterator.h [code]
file	iterator_range.h [code]
	This provides a very simple, boring adaptor for a begin and end iterator into a range type.
file	MapVector.h [code]
file	None.h [code]
file	Optional.h [code]
file	PackedVector.h [code]
file	PointerEmbeddedInt.h [code]
file	PointerIntPair.h [code]
file	PointerSumType.h [code]
file	PointerUnion.h [code]
file	PostOrderIterator.h [code]
file	PriorityQueue.h [code]
file	PriorityWorklist.h [code]
	This file provides a priority worklist.
file	SCCIterator.h [code]
	This builds on the llvm/ADT/GraphTraits.h file to find the strongly connected components (SCCs) of a graph in O(N+E) time using Tarjan's DFS algorithm.
file	ScopedHashTable.h [code]
file	ScopeExit.h [code]
file	Sequence.h [code]
	This routine provides some synthesis utilities to produce sequences of values.
file	SetOperations.h [code]
file	SetVector.h [code]
file	simple_ilist.h [code]
file	SmallBitVector.h [code]
file	SmallPtrSet.h [code]
file	SmallSet.h [code]
file	SmallString.h [code]
file	SmallVector.h [code]
file	SparseBitVector.h [code]
file	SparseMultiSet.h [code]
file	SparseSet.h [code]
file	Statistic.h [code]
file	STLExtras.h [code]
file	StringExtras.h [code]
file	StringMap.h [code]
file	StringRef.h [code]
file	StringSet.h [code]
file	StringSwitch.h [code]
file	TinyPtrVector.h [code]
file	Triple.h [code]
file	Twine.h [code]
file	UniqueVector.h [code]
file	VariadicFunction.h [code]