Minor cleanup, remove unused files.

1 files changed, 0 insertions, 128 deletions

diff --git a/src/util/trans_closure.cpp b/src/util/trans_closure.cpp
deleted file mode 100644
index 02b51d751..000000000
--- a/src/util/trans_closure.cpp
+++ /dev/null
@@ -1,128 +0,0 @@
-/*********************                                                        */
-/*! \file trans_closure.cpp
- ** \verbatim
- ** Original author: Clark Barrett
- ** Major contributors: Andrew Reynolds
- ** Minor contributors (to current version): Dejan Jovanovic, Morgan Deters
- ** This file is part of the CVC4 project.
- ** Copyright (c) 2009-2014  New York University and The University of Iowa
- ** See the file COPYING in the top-level source directory for licensing
- ** information.\endverbatim
- **
- ** \brief The transitive closure module implementation
- **
- ** Implementation file for TransitiveClosure class.
- **/
-
-
-#include "util/trans_closure.h"
-#include "util/cvc4_assert.h"
-
-
-using namespace std;
-
-
-namespace CVC4 {
-
-
-TransitiveClosure::~TransitiveClosure() {
-  unsigned i;
-  for (i = 0; i < adjMatrix.size(); ++i) {
-    if (adjMatrix[i]) {
-      adjMatrix[i]->deleteSelf();
-    }
-  }
-}
-
-
-bool TransitiveClosure::addEdge(unsigned i, unsigned j)
-{
-  Debug("trans-closure") << "Add edge " << i << " -> " << j << std::endl;
-  // Check for loops
-  Assert(i != j, "Cannot add self-loop");
-  if (adjIndex.get() > j && adjMatrix[j] != NULL && adjMatrix[j]->read(i)) {
-    return true;
-  }
-
-  // Grow matrix if necessary
-  unsigned maxSize = ((i > j) ? i : j) + 1;
-  while (maxSize > adjIndex.get()) {
-    if( maxSize > adjMatrix.size() ){
-      adjMatrix.push_back(NULL);
-    }else if( adjMatrix[adjIndex.get()]!=NULL ){
-      adjMatrix[adjIndex.get()]->clear();
-    }
-    adjIndex.set( adjIndex.get() + 1 );
-  }
-
-  // Add edge from i to j and everything j can reach
-  if (adjMatrix[i] == NULL) {
-    adjMatrix[i] = new (true) CDBV(d_context);
-  }
-  adjMatrix[i]->write(j);
-  if (adjMatrix[j] != NULL) {
-    adjMatrix[i]->merge(adjMatrix[j]);
-  }
-
-  // Add edges from everything that can reach i to j and everything that j can reach
-  unsigned k;
-  for (k = 0; k < adjIndex.get(); ++k) {
-    if (adjMatrix[k] != NULL && adjMatrix[k]->read(i)) {
-      adjMatrix[k]->write(j);
-      if (adjMatrix[j] != NULL) {
-        adjMatrix[k]->merge(adjMatrix[j]);
-      }
-    }
-  }
-
-  return false;
-}
-
-bool TransitiveClosure::isConnected(unsigned i, unsigned j)
-{
-  if( i>=adjIndex.get() || j>adjIndex.get() ){//adjMatrix.size() ){
-    return false;
-  }else{
-    return adjMatrix[i] != NULL && adjMatrix[i]->read(j);
-  }
-}
-
-void TransitiveClosure::debugPrintMatrix()
-{
-  unsigned i,j;
-  for (i = 0; i < adjIndex.get(); ++i) {
-    for (j = 0; j < adjIndex.get(); ++j) {
-      if (adjMatrix[i] != NULL && adjMatrix[i]->read(j)) {
-        Debug("trans-closure") << "1 ";
-      }
-      else Debug("trans-closure") << "0 ";
-    }
-    Debug("trans-closure") << endl;
-  }
-}
-
-unsigned TransitiveClosureNode::getId( Node i ){
-  context::CDHashMap< Node, unsigned, NodeHashFunction >::iterator it = nodeMap.find( i );
-  if( it==nodeMap.end() ){
-    unsigned c = d_counter.get();
-    nodeMap[i] = c;
-    d_counter.set( c + 1 );
-    return c;
-  }
-  return (*it).second;
-}
-
-void TransitiveClosureNode::debugPrint(){
-  for( int i=0; i<(int)currEdges.size(); i++ ){
-    Debug("trans-closure") << "currEdges[ " << i << " ] = "
-                           << currEdges[i].first << " -> " << currEdges[i].second;
-    int id1 = getId( currEdges[i].first );
-    int id2 = getId( currEdges[i].second );
-    Debug("trans-closure") << " { " << id1 << " -> " << id2 << " } ";
-    Debug("trans-closure") << std::endl;
-  }
-  debugPrintMatrix();
-}
-
-
-}/* CVC4 namespace */