projects
/
oota-llvm.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Fixed bug in SmallDenseMap where it wouldn't leave enough space for an empty bucket...
[oota-llvm.git]
/
include
/
llvm
/
ADT
/
ImmutableIntervalMap.h
diff --git
a/include/llvm/ADT/ImmutableIntervalMap.h
b/include/llvm/ADT/ImmutableIntervalMap.h
index d3196ca23df90289663acefe9af054a9eeb30ba5..fa7ccb975e52b3cb055c0931bd2c498391009b9e 100644
(file)
--- a/
include/llvm/ADT/ImmutableIntervalMap.h
+++ b/
include/llvm/ADT/ImmutableIntervalMap.h
@@
-10,6
+10,10
@@
// This file defines the ImmutableIntervalMap class.
//
//===----------------------------------------------------------------------===//
// This file defines the ImmutableIntervalMap class.
//
//===----------------------------------------------------------------------===//
+
+#ifndef LLVM_ADT_IMMUTABLE_INTERVAL_MAP_H
+#define LLVM_ADT_IMMUTABLE_INTERVAL_MAP_H
+
#include "llvm/ADT/ImmutableMap.h"
namespace llvm {
#include "llvm/ADT/ImmutableMap.h"
namespace llvm {
@@
-215,7
+219,7
@@
public:
ImmutableIntervalMap add(ImmutableIntervalMap Old,
key_type_ref K, data_type_ref D) {
ImmutableIntervalMap add(ImmutableIntervalMap Old,
key_type_ref K, data_type_ref D) {
- TreeTy *T = F.add(Old.Root, std::
make_
pair<key_type, data_type>(K, D));
+ TreeTy *T = F.add(Old.Root, std::pair<key_type, data_type>(K, D));
return ImmutableIntervalMap(F.getCanonicalTree(T));
}
return ImmutableIntervalMap(F.getCanonicalTree(T));
}
@@
-240,3
+244,5
@@
private:
};
} // end namespace llvm
};
} // end namespace llvm
+
+#endif