Daniel Dunbar 7b75fbf224 Add DenseMap::lookup: ...

/// lookup - Return the entry for the specified key, or a default
  /// constructed value if no such entry exists.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@55523 91177308-0d34-0410-b5e6-96231b3b80d8

2008-08-29 00:48:44 +00:00

..

APFloat.h

add convenience 'constructors'

2008-06-30 18:02:44 +00:00

APInt.h

Switch the asmprinter (.ll) and all the stuff it requires over to

2008-08-23 22:23:09 +00:00

APSInt.h

Switch the asmprinter (.ll) and all the stuff it requires over to

2008-08-23 22:23:09 +00:00

BitVector.h

Prune and tidy #includes.

2008-05-29 19:52:31 +00:00

DenseMap.h

Add DenseMap::lookup:

2008-08-29 00:48:44 +00:00

DenseSet.h

Make DenseMap's insert return a pair, to more closely resemble std::map.

2008-07-07 17:46:23 +00:00

DepthFirstIterator.h

…

EquivalenceClasses.h

…

FoldingSet.h

Add a clear() method to FoldingSet.

2008-08-23 00:42:16 +00:00

GraphTraits.h

…

hash_map.h.in

Update guards

2008-05-29 18:17:53 +00:00

hash_set.h.in

Update guards

2008-05-29 18:17:53 +00:00

HashExtras.h

…

ilist_node.h

Fold the useful features of alist and alist_node into ilist, and

2008-07-28 21:51:04 +00:00

ilist.h

Removed unused parameters.

2008-08-01 05:50:13 +00:00

ImmutableList.h

Minor tweaks to the ImmutableList iterator interface.

2008-07-11 22:43:07 +00:00

ImmutableMap.h

Removed redundant ctor.

2008-08-14 21:17:07 +00:00

ImmutableSet.h

…

IndexedMap.h

…

IntrusiveRefCntPtr.h

…

iterator

Remove guard, so *each* inclusion will result in a warning

2008-05-29 21:57:11 +00:00

iterator.h.in

Update guards

2008-05-29 18:17:53 +00:00

OwningPtr.h

…

PostOrderIterator.h

…

PriorityQueue.h

Add a clear() method to PriorityQueue.

2008-06-23 23:47:46 +00:00

SCCIterator.h

…

ScopedHashTable.h

Add a simple, but efficient, generic scoped hash table

2008-06-09 00:42:10 +00:00

SetOperations.h

…

SetVector.h

…

SmallPtrSet.h

…

SmallSet.h

…

SmallString.h

…

SmallVector.h

Fix SmallVector's size calculation so that a size of 0 is

2008-08-22 16:07:55 +00:00

SparseBitVector.h

Fold the useful features of alist and alist_node into ilist, and

2008-07-28 21:51:04 +00:00

Statistic.h

…

STLExtras.h

Don't use std::advance just to increment or decrement by one.

2008-07-07 18:39:33 +00:00

StringExtras.h

…

StringMap.h

optimize StringMap::clear

2008-07-02 05:30:45 +00:00

StringSet.h

…

Tree.h

…

Trie.h

…

UniqueVector.h

…

VectorExtras.h

…