Import Geant4 8.1.0 source tree

2016-06-09 14:44:26 +02:00
parent 8a51e0bc40
commit 216a75eeb1
8717 changed files with 360418 additions and 141343 deletions
@@ -0,0 +1,89 @@
+/*
+Copyright (c) 2003-2006, Troy Aaron Johnson
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+  * Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+  * Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+  * Neither the name of Troy Aaron Johnson nor the names of any
+    contributors may be used to endorse or promote products derived from
+    this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGE.
+*/
+
+class bfs_iterator : public virtual iterator
+{
+  friend class tree;
+
+  private:
+
+    std::list<tree_node<N>*> queue;
+
+    typedef bool (*PruningPredicate)(const iterator& iter);
+    PruningPredicate prune_pred;
+
+    explicit bfs_iterator(tree_node<N>* current) : iterator(current), prune_pred(NULL) { }
+
+  public:
+
+    bfs_iterator(void) : prune_pred(NULL) { }
+    bfs_iterator(const iterator& iter) : iterator(iter), prune_pred(NULL) { }
+
+    bfs_iterator endBfs(void) { return bfs_iterator(NULL); }
+
+    bfs_iterator& operator ++ (void)
+    {
+      /* this line necessary for g++ 3.4 onward */
+      tree_node<N>*& current = this->current;
+
+      assert(current != NULL);
+
+      if (prune_pred == NULL || !prune_pred(*this))
+      {
+        for (tree_node<N>* p = current->first_child;
+             p != NULL; p = p->next_sibling)
+        {
+          queue.push_front(p);
+        }
+      }
+
+      if (queue.empty())
+      {
+        current = NULL;
+      }
+      else
+      {
+        current = queue.back();
+        queue.pop_back();
+      }
+
+      return *this;
+    }
+
+    /** When the iterator points to a node, and the pruning predicate
+     * returns true, the children of the node are not added to the BFS
+     * queue.  True means prune everything beneath the node passed
+     * to the predicate.  A NULL predicate disables pruning. */
+    void pruneOn(PruningPredicate prune_pred)
+    {
+      this->prune_pred = prune_pred;
+    }
+};
+