Changeset ea3eb06 for translator/SymTab/StackTable.cc

Timestamp:

Nov 22, 2014, 4:51:46 PM (10 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:

d11f789

Parents:

3c70d38

Message:

formatting changes

File:

• translator/SymTab/StackTable.cc (modified) (2 diffs)

translator/SymTab/StackTable.cc

@@ -1 @@
-/*
- * This file is part of the Cforall project
- *
- * $Id: StackTable.cc,v 1.3 2002/09/19 21:02:44 rcbilson Exp $
- *
- */
- 
 #include <cassert>
 
@@ -11 +4 @@
 
 namespace SymTab {
+    template< typename Element, typename ConflictFunction >
+    StackTable< Element, ConflictFunction >::StackTable() : scopeLevel( 0 )
+    {}
 
-template< typename Element, typename ConflictFunction >
-StackTable< Element, ConflictFunction >::StackTable()
-  : scopeLevel( 0 )
-{
-}
+    template< typename Element, typename ConflictFunction >
+    void StackTable< Element, ConflictFunction >::enterScope() {
+        scopeLevel++;
+    }
 
-template< typename Element, typename ConflictFunction >
-void 
-StackTable< Element, ConflictFunction >::enterScope()
-{
-  scopeLevel++;
-}
+    template< typename Element, typename ConflictFunction >
+    void StackTable< Element, ConflictFunction >::leaveScope() {
+        for ( typename TableType::iterator it = table.begin(); it != table.end(); ++it ) {
+            std::stack< Entry >& entry = it->second;
+            if ( !entry.empty() && entry.top().second == scopeLevel ) {
+                entry.pop();
+            }
+        }
+        scopeLevel--;
+        assert( scopeLevel >= 0 );
+    }
 
-template< typename Element, typename ConflictFunction >
-void 
-StackTable< Element, ConflictFunction >::leaveScope()
-{
-  for( typename TableType::iterator it = table.begin(); it != table.end(); ++it ) {
-    std::stack< Entry >& entry = it->second;
-    if( !entry.empty() && entry.top().second == scopeLevel ) {
-      entry.pop();
+    template< typename Element, typename ConflictFunction >
+    void StackTable< Element, ConflictFunction >::add( Element *type ) {
+        std::stack< Entry >& entry = table[ type->get_name() ];
+        if ( !entry.empty() && entry.top().second == scopeLevel ) {
+            entry.top().first = conflictFunction( entry.top().first, type );
+        } else {
+            entry.push( Entry( type, scopeLevel ) );
+        }
     }
-  }
-      
-  scopeLevel--;
-  assert( scopeLevel >= 0 );
-}
 
-template< typename Element, typename ConflictFunction >
-void 
-StackTable< Element, ConflictFunction >::add( Element *type )
-{
-  std::stack< Entry >& entry = table[ type->get_name() ];
-  if( !entry.empty() && entry.top().second == scopeLevel ) {
-    entry.top().first = conflictFunction( entry.top().first, type );
-  } else {
-    entry.push( Entry( type, scopeLevel ) );
-  }
-}
+    template< typename Element, typename ConflictFunction >
+    void StackTable< Element, ConflictFunction >::add( std::string fwdDeclName ) {
+        add( new Element( fwdDeclName ) );
+    }
 
-template< typename Element, typename ConflictFunction >
-void 
-StackTable< Element, ConflictFunction >::add( std::string fwdDeclName )
-{
-  add( new Element( fwdDeclName ) );
-}
+    template< typename Element, typename ConflictFunction >
+    Element *StackTable< Element, ConflictFunction >::lookup( std::string id ) const {
+        typename TableType::const_iterator it = table.find( id );
+        if ( it == table.end() ) {
+            return 0;
+        } else if ( !it->second.empty() ) {
+            return it->second.top().first;
+        } else {
+            return 0;
+        }
+    }
 
-template< typename Element, typename ConflictFunction >
-Element *
-StackTable< Element, ConflictFunction >::lookup( std::string id ) const
-{
-  typename TableType::const_iterator it = table.find( id );
-  if( it == table.end() ) {
-    return 0;
-  } else if( !it->second.empty() ) {
-    return it->second.top().first;
-  } else {
-    return 0;
-  }
-}
-
-template< typename Element, typename ConflictFunction >
-void 
-StackTable< Element, ConflictFunction >::dump( std::ostream &os ) const
-{
-  for( typename TableType::const_iterator it = table.begin(); it != table.end(); ++it ) {
-    const std::stack< Entry >& entry = it->second;
-    if( !entry.empty() && entry.top().second == scopeLevel ) {
-      os << it->first << std::endl;
+    template< typename Element, typename ConflictFunction >
+    void StackTable< Element, ConflictFunction >::dump( std::ostream &os ) const {
+        for ( typename TableType::const_iterator it = table.begin(); it != table.end(); ++it ) {
+            const std::stack< Entry >& entry = it->second;
+            if ( !entry.empty() && entry.top().second == scopeLevel ) {
+                os << it->first << std::endl;
+            }
+        }
     }
-  }
-}
-
-} // namespace SymTab
+} // SymTab