indent classes, align by spaces

libs/instancelib.h

@@ -33,116 +33,116 @@
 
 class InstanceSubgraphWalker : public scene::Traversable::Walker
 {
-scene::Instantiable::Observer* m_observer;
-mutable scene::Path m_path;
-mutable Stack<scene::Instance*> m_parent;
+	scene::Instantiable::Observer* m_observer;
+	mutable scene::Path m_path;
+	mutable Stack<scene::Instance*> m_parent;
 public:
-InstanceSubgraphWalker( scene::Instantiable::Observer* observer, const scene::Path& path, scene::Instance* parent )
-	: m_observer( observer ), m_path( path ), m_parent( parent ){
-}
-bool pre( scene::Node& node ) const {
-	m_path.push( makeReference( node ) );
-	scene::Instance* instance = Node_getInstantiable( node )->create( m_path, m_parent.top() );
-	m_observer->insert( instance );
-	Node_getInstantiable( node )->insert( m_observer, m_path, instance );
-	m_parent.push( instance );
-	return true;
-}
-void post( scene::Node& node ) const {
-	m_path.pop();
-	m_parent.pop();
-}
+	InstanceSubgraphWalker( scene::Instantiable::Observer* observer, const scene::Path& path, scene::Instance* parent )
+		: m_observer( observer ), m_path( path ), m_parent( parent ){
+	}
+	bool pre( scene::Node& node ) const {
+		m_path.push( makeReference( node ) );
+		scene::Instance* instance = Node_getInstantiable( node )->create( m_path, m_parent.top() );
+		m_observer->insert( instance );
+		Node_getInstantiable( node )->insert( m_observer, m_path, instance );
+		m_parent.push( instance );
+		return true;
+	}
+	void post( scene::Node& node ) const {
+		m_path.pop();
+		m_parent.pop();
+	}
 };
 
 class UninstanceSubgraphWalker : public scene::Traversable::Walker
 {
-scene::Instantiable::Observer* m_observer;
-mutable scene::Path m_path;
+	scene::Instantiable::Observer* m_observer;
+	mutable scene::Path m_path;
 public:
-UninstanceSubgraphWalker( scene::Instantiable::Observer* observer, const scene::Path& parent )
-	: m_observer( observer ), m_path( parent ){
-}
-bool pre( scene::Node& node ) const {
-	m_path.push( makeReference( node ) );
-	return true;
-}
-void post( scene::Node& node ) const {
-	scene::Instance* instance = Node_getInstantiable( node )->erase( m_observer, m_path );
-	m_observer->erase( instance );
-	delete instance;
-	m_path.pop();
-}
+	UninstanceSubgraphWalker( scene::Instantiable::Observer* observer, const scene::Path& parent )
+		: m_observer( observer ), m_path( parent ){
+	}
+	bool pre( scene::Node& node ) const {
+		m_path.push( makeReference( node ) );
+		return true;
+	}
+	void post( scene::Node& node ) const {
+		scene::Instance* instance = Node_getInstantiable( node )->erase( m_observer, m_path );
+		m_observer->erase( instance );
+		delete instance;
+		m_path.pop();
+	}
 };
 
 class InstanceSet : public scene::Traversable::Observer
 {
-typedef std::pair<scene::Instantiable::Observer*, PathConstReference> CachePath;
+	typedef std::pair<scene::Instantiable::Observer*, PathConstReference> CachePath;
 
-typedef CachePath key_type;
+	typedef CachePath key_type;
 
-typedef std::map<key_type, scene::Instance*> InstanceMap;
-InstanceMap m_instances;
+	typedef std::map<key_type, scene::Instance*> InstanceMap;
+	InstanceMap m_instances;
 public:
 
-typedef InstanceMap::iterator iterator;
+	typedef InstanceMap::iterator iterator;
 
-iterator begin(){
-	return m_instances.begin();
-}
-iterator end(){
-	return m_instances.end();
-}
+	iterator begin(){
+		return m_instances.begin();
+	}
+	iterator end(){
+		return m_instances.end();
+	}
 
 // traverse observer
-void insert( scene::Node& child ){
-	for ( iterator i = begin(); i != end(); ++i )
-	{
-		Node_traverseSubgraph( child, InstanceSubgraphWalker( ( *i ).first.first, ( *i ).first.second, ( *i ).second ) );
-		( *i ).second->boundsChanged();
+	void insert( scene::Node& child ){
+		for ( iterator i = begin(); i != end(); ++i )
+		{
+			Node_traverseSubgraph( child, InstanceSubgraphWalker( ( *i ).first.first, ( *i ).first.second, ( *i ).second ) );
+			( *i ).second->boundsChanged();
+		}
 	}
-}
-void erase( scene::Node& child ){
-	for ( iterator i = begin(); i != end(); ++i )
-	{
-		Node_traverseSubgraph( child, UninstanceSubgraphWalker( ( *i ).first.first, ( *i ).first.second ) );
-		( *i ).second->boundsChanged();
+	void erase( scene::Node& child ){
+		for ( iterator i = begin(); i != end(); ++i )
+		{
+			Node_traverseSubgraph( child, UninstanceSubgraphWalker( ( *i ).first.first, ( *i ).first.second ) );
+			( *i ).second->boundsChanged();
+		}
 	}
-}
 
 // instance
-void forEachInstance( const scene::Instantiable::Visitor& visitor ){
-	for ( iterator i = begin(); i != end(); ++i )
-	{
-		visitor.visit( *( *i ).second );
+	void forEachInstance( const scene::Instantiable::Visitor& visitor ){
+		for ( iterator i = begin(); i != end(); ++i )
+		{
+			visitor.visit( *( *i ).second );
+		}
 	}
-}
 
-void insert( scene::Instantiable::Observer* observer, const scene::Path& path, scene::Instance* instance ){
-	const bool inserted = m_instances.insert( InstanceMap::value_type( key_type( observer, PathConstReference( instance->path() ) ), instance ) ).second;
-	ASSERT_MESSAGE( inserted, "InstanceSet::insert - element already exists" );
-}
-scene::Instance* erase( scene::Instantiable::Observer* observer, const scene::Path& path ){
-	InstanceMap::iterator i = m_instances.find( key_type( observer, PathConstReference( path ) ) );
-	ASSERT_MESSAGE( i != m_instances.end(), "InstanceSet::erase - failed to find element" );
-	scene::Instance* instance = i->second;
-	m_instances.erase( i );
-	return instance;
-}
+	void insert( scene::Instantiable::Observer* observer, const scene::Path& path, scene::Instance* instance ){
+		const bool inserted = m_instances.insert( InstanceMap::value_type( key_type( observer, PathConstReference( instance->path() ) ), instance ) ).second;
+		ASSERT_MESSAGE( inserted, "InstanceSet::insert - element already exists" );
+	}
+	scene::Instance* erase( scene::Instantiable::Observer* observer, const scene::Path& path ){
+		InstanceMap::iterator i = m_instances.find( key_type( observer, PathConstReference( path ) ) );
+		ASSERT_MESSAGE( i != m_instances.end(), "InstanceSet::erase - failed to find element" );
+		scene::Instance* instance = i->second;
+		m_instances.erase( i );
+		return instance;
+	}
 
-void transformChanged(){
-	for ( InstanceMap::iterator i = m_instances.begin(); i != m_instances.end(); ++i )
-	{
-		( *i ).second->transformChanged();
+	void transformChanged(){
+		for ( InstanceMap::iterator i = m_instances.begin(); i != m_instances.end(); ++i )
+		{
+			( *i ).second->transformChanged();
+		}
 	}
-}
-typedef MemberCaller<InstanceSet, &InstanceSet::transformChanged> TransformChangedCaller;
-void boundsChanged(){
-	for ( InstanceMap::iterator i = m_instances.begin(); i != m_instances.end(); ++i )
-	{
-		( *i ).second->boundsChanged();
+	typedef MemberCaller<InstanceSet, &InstanceSet::transformChanged> TransformChangedCaller;
+	void boundsChanged(){
+		for ( InstanceMap::iterator i = m_instances.begin(); i != m_instances.end(); ++i )
+		{
+			( *i ).second->boundsChanged();
+		}
 	}
-}
-typedef MemberCaller<InstanceSet, &InstanceSet::boundsChanged> BoundsChangedCaller;
+	typedef MemberCaller<InstanceSet, &InstanceSet::boundsChanged> BoundsChangedCaller;
 };
 
 template<typename Functor>
@@ -157,19 +157,19 @@ template<typename Type>
 class InstanceEvaluateTransform
 {
 public:
-inline void operator()( scene::Instance& instance ) const {
-	InstanceTypeCast<Type>::cast( instance )->evaluateTransform();
-}
+	inline void operator()( scene::Instance& instance ) const {
+		InstanceTypeCast<Type>::cast( instance )->evaluateTransform();
+	}
 };
 
 template<typename Type>
 class InstanceSetEvaluateTransform
 {
 public:
-static void apply( InstanceSet& instances ){
-	InstanceSet_forEach( instances, InstanceEvaluateTransform<Type>() );
-}
-typedef ReferenceCaller<InstanceSet, &InstanceSetEvaluateTransform<Type>::apply> Caller;
+	static void apply( InstanceSet& instances ){
+		InstanceSet_forEach( instances, InstanceEvaluateTransform<Type>() );
+	}
+	typedef ReferenceCaller<InstanceSet, &InstanceSetEvaluateTransform<Type>::apply> Caller;
 };
 
 #endif