HomeSort by relevance Sort by last modified time
    Searched refs:TreeTy (Results 1 - 6 of 6) sorted by null

  /external/llvm/include/llvm/ADT/
ImmutableSet.h 366 typedef ImutAVLTree<ImutInfo> TreeTy;
367 typedef typename TreeTy::value_type_ref value_type_ref;
368 typedef typename TreeTy::key_type_ref key_type_ref;
370 typedef DenseMap<unsigned, TreeTy*> CacheTy;
374 std::vector<TreeTy*> createdNodes;
375 std::vector<TreeTy*> freeNodes;
400 TreeTy* add(TreeTy* T, value_type_ref V) {
407 TreeTy* remove(TreeTy* T, key_type_ref V)
    [all...]
ImmutableMap.h 69 typedef ImutAVLTree<ValInfo> TreeTy;
72 TreeTy* Root;
79 explicit ImmutableMap(const TreeTy* R) : Root(const_cast<TreeTy*>(R)) {
98 typename TreeTy::Factory F;
111 TreeTy *T = F.add(Old.Root, std::pair<key_type,data_type>(K,D));
116 TreeTy *T = F.remove(Old.Root,K);
120 typename TreeTy::Factory *getTreeFactory() const {
121 return const_cast<typename TreeTy::Factory *>(&F);
141 TreeTy *getRoot() const
    [all...]
ImmutableIntervalMap.h 88 typedef ImutAVLTree<ImutInfo> TreeTy;
100 TreeTy *Add(TreeTy *T, value_type_ref V) {
106 TreeTy *Find(TreeTy *T, key_type_ref K) {
121 TreeTy *add_internal(value_type_ref V, TreeTy *T) {
140 TreeTy *removeAllOverlaps(TreeTy *T, key_type_ref K) {
152 TreeTy *removeOverlap(TreeTy *T, key_type_ref K, bool &Changed)
    [all...]
  /external/clang/lib/StaticAnalyzer/Core/
BlockCounter.cpp 52 return CountMap(static_cast<CountMap::TreeTy*>(D));
RegionStore.cpp 160 const RegionBindings::TreeTy *T,
161 RegionBindings::TreeTy::Factory *F)
577 static_cast<const RegionBindings::TreeTy*>(store),
    [all...]
  /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ProgramStateTrait.h 67 return p ? data_type((typename data_type::TreeTy*) *p) : data_type(0);
115 return p ? data_type((typename data_type::TreeTy*) *p) : data_type(0);

Completed in 52 milliseconds