Changeset a32b204 for translator/InitTweak/diet_map.h

Timestamp:

May 17, 2015, 1:19:35 PM (9 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, ctor, deferred_resn, demangler, enum, forall-pointer-decay, gc_noraii, jacob/cs343-translation, jenkins-sandbox, master, memory, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, string, with_gc

Children:

0dd3a2f

Parents:

b87a5ed

Message:

licencing: second groups of files

File:

• translator/InitTweak/diet_map.h (modified) (6 diffs)

translator/InitTweak/diet_map.h

@@ -34 +34 @@
     diet_tree() : root(0), left(0), right(0) {}
     ~diet_tree() {
-      if( root != 0 ) { delete root; root = 0; }
-      if( left != 0 ) { delete left; left = 0; }
-      if( right != 0 ) { delete right; right = 0; }
+      if ( root != 0 ) { delete root; root = 0; }
+      if ( left != 0 ) { delete left; left = 0; }
+      if ( right != 0 ) { delete right; right = 0; }
     }
 
@@ -45 +45 @@
       else {
         value_type lo = root->get_lo(), hi = root->get_hi();
-        if( _lo < lo ) {
-          if( _hi > hi ) {
+        if ( _lo < lo ) {
+          if ( _hi > hi ) {
             /* can either minimize the work or minimize the number of nodes.
                Let's minimize the work. */
@@ -54 +54 @@
             right->insert( _hi, hi );
             return;
-          } else if( _hi < lo ) {
+          } else if ( _hi < lo ) {
             if ( left == 0 ) left = new diet_tree<T>();
             left->insert( _lo, _hi );
-          } else if( _hi <= hi ) {
+          } else if ( _hi <= hi ) {
             if ( left == 0 ) left = new diet_tree<T>();
             left->insert( _lo, _hi );
@@ -65 +65 @@
           root->set_range(_lo,_hi);
         } else if ( _hi > hi) {
-          if( _lo > hi ) {
+          if ( _lo > hi ) {
             if ( right == 0 ) right = new diet_tree<T>();
             right->insert( _lo, _hi );
-          } else if( _lo < hi ) {
+          } else if ( _lo < hi ) {
             root->set_range(lo, _lo);
             if ( right == 0 ) right = new diet_tree<T>();
@@ -152 +152 @@
       assert(current != 0);
       if ( current->right == 0 )
-        if ( !st.empty() )
+        if ( ! st.empty() )
           { current = st.top(); st.pop(); }
         else
@@ -173 +173 @@
       assert(current != 0);
       diet_tree<T> *next = 0;
-      while( current->left != 0 ) {
+      while ( current->left != 0 ) {
         next = current->left; st.push( current ); current = next;
       }