Merge pull request #17 from dhendriks/6-Remove_author_tags

6 remove author tags

Author: dhendriks

CONTRIBUTORS.md

@@ -0,0 +1,11 @@
+Notes:
+
+* Partly based on BuDDy by Jørn Lind-Nielsen.
+* Forked from Sourceforge's JavaBDD by John Whaley.
+
+Contributors for com.github.javabdd:
+
+* Dennis Hendriks
+* Konstantinos Triantafyllidis
+* Martijn Goorden
+* Sander Thuijsman

src/main/java/com/github/javabdd/BDD.java

@@ -20,8 +20,6 @@
  * Use an implementation of BDDFactory to create BDD objects.
  * </p>
  *
- * @author John Whaley
- *
  * @see com.github.javabdd.BDDFactory
  * @see com.github.javabdd.BDDDomain#set()
  */
@@ -833,8 +831,6 @@ public BDDIterator iterator(final BDDVarSet var) {
     /**
      * BDDIterator is used to iterate through the satisfying assignments of a BDD. It includes the ability to check if
      * bits are dont-cares and skip them.
-     *
-     * @author jwhaley
      */
     public static class BDDIterator implements Iterator<BDD> {
         final BDDFactory f;

src/main/java/com/github/javabdd/BDDBitVector.java

@@ -8,8 +8,6 @@
 
 /**
  * Bit vector implementation for BDDs.
- *
- * @author John Whaley
  */
 public abstract class BDDBitVector {
     protected BDD[] bitvec;

src/main/java/com/github/javabdd/BDDDomain.java

@@ -20,7 +20,6 @@
  * Use <tt>BDDFactory.extDomain()</tt> to create one or more domains with a specified list of sizes.
  * </p>
  *
- * @author John Whaley
  * @see com.github.javabdd.BDDFactory#extDomain(int[])
  */
 public abstract class BDDDomain {

src/main/java/com/github/javabdd/BDDException.java

@@ -6,8 +6,6 @@
 
 /**
  * An exception caused by an invalid BDD operation.
- *
- * @author John Whaley
  */
 public class BDDException extends RuntimeException {
     /**

src/main/java/com/github/javabdd/BDDFactory.java

@@ -26,8 +26,6 @@
 /**
  * Interface for the creation and manipulation of BDDs.
  *
- * @author John Whaley
- *
  * @see com.github.javabdd.BDD
  */
 public abstract class BDDFactory {
@@ -1186,8 +1184,6 @@ public void addVarBlock(BDDVarSet var, boolean fixed) {
 
     /**
      * Stores statistics about garbage collections.
-     *
-     * @author jwhaley
      */
     public static class GCStats {
         public int nodes;
@@ -1239,8 +1235,6 @@ public GCStats getGCStats() {
 
     /**
      * Stores statistics about reordering.
-     *
-     * @author jwhaley
      */
     public static class ReorderStats {
         public long time;
@@ -1290,10 +1284,6 @@ public ReorderStats getReorderStats() {
 
     /**
      * Stores statistics about the operator cache.
-     *
-     * @author jwhaley
-     * @author sthuijsman
-     * @author mgoorden
      */
     public static class CacheStats {
         protected boolean enabled = false;
@@ -1422,8 +1412,6 @@ public CacheStats getCacheStats() {
 
     /**
      * Stores statistics about the maximum BDD nodes usage.
-     *
-     * @author mgoorden
      */
     public static class MaxUsedBddNodesStats {
         protected boolean enabled = false;
@@ -1471,8 +1459,6 @@ public MaxUsedBddNodesStats getMaxUsedBddNodesStats() {
     /**
      * Stores continuously statistics about the BDD nodes usage and BDD operations, where BDD operations is a proxy for
      * time.
-     *
-     * @author mgoorden
      */
     public static class ContinuousStats {
         protected boolean enabled = false;

src/main/java/com/github/javabdd/BDDFactoryIntImpl.java

@@ -9,8 +9,6 @@
 
 /**
  * A shared superclass for BDD factories that refer to BDDs as ints.
- *
- * @author jwhaley
  */
 public abstract class BDDFactoryIntImpl extends BDDFactory {
     static final boolean USE_FINALIZER = false;

src/main/java/com/github/javabdd/BDDPairing.java

@@ -6,8 +6,6 @@
 
 /**
  * Encodes a table of variable pairs. This is used for replacing variables in a BDD.
- *
- * @author John Whaley
  */
 public abstract class BDDPairing {
     /**

src/main/java/com/github/javabdd/BDDVarSet.java

@@ -4,13 +4,9 @@
 
 package com.github.javabdd;
 
-//import java.util.Arrays;
-
 /**
  * Some BDD methods, namely <tt>exist()</tt>, <tt>forall()</tt>, <tt>unique()</tt>, <tt>relprod()</tt>,
  * <tt>applyAll()</tt>, <tt>applyEx()</tt>, <tt>applyUni()</tt>, and <tt>satCount()</tt> take a BDDVarSet argument.
- *
- * @author jwhaley
  */
 public abstract class BDDVarSet {
     /**
@@ -178,8 +174,6 @@ public final boolean equals(Object o) {
 
     /**
      * Default implementation of BDDVarSet based on BDDs.
-     *
-     * @author jwhaley
      */
     public static class DefaultImpl extends BDDVarSet {
         /**

src/main/java/com/github/javabdd/BitString.java

@@ -27,8 +27,6 @@
  * size is related to the implementation of a bit set, so it may change with implementation. The length of a bit set
  * related to the logical length of a bit set and is defined independently of implementation.
  * </p>
- *
- * @author John Whaley
  */
 public final class BitString implements Cloneable, java.io.Serializable {
     /**

src/main/java/com/github/javabdd/FindBestOrder.java

@@ -15,8 +15,6 @@
 
 /**
  * Find best order.
- *
- * @author jwhaley
  */
 public class FindBestOrder {
     static BDDFactory bdd = null;

src/main/java/com/github/javabdd/JFactory.java

@@ -21,8 +21,6 @@
 /**
  * This is a 100% Java implementation of the BDD factory. It is based on the C source code for BuDDy. As such, the
  * implementation is very ugly, but it works. Like BuDDy, it uses a reference counting scheme for garbage collection.
- *
- * @author John Whaley
  */
 public class JFactory extends BDDFactoryIntImpl {
     /**** Options ****/

src/main/java/com/github/javabdd/TryVarOrder.java

@@ -17,8 +17,6 @@
 
 /**
  * Try var order.
- *
- * @author jwhaley
  */
 public class TryVarOrder {
     /** BDD Factory, reused if possible. */