src/theory/rep_set.h

   1 /*********************                                                        */
   2 /*! \file rep_set.h
   3  ** \verbatim
   4  ** Original author: Andrew Reynolds
   5  ** Major contributors: Morgan Deters
   6  ** Minor contributors (to current version): none
   7  ** This file is part of the CVC4 project.
   8  ** Copyright (c) 2009-2014  New York University and The University of Iowa
   9  ** See the file COPYING in the top-level source directory for licensing
  10  ** information.\endverbatim
  11  **
  12  ** \brief Representative set class and utilities
  13  **/
  14
  15 #include "cvc4_private.h"
  16
  17 #ifndef __CVC4__THEORY__REP_SET_H
  18 #define __CVC4__THEORY__REP_SET_H
  19
  20 #include "expr/node.h"
  21 #include <map>
  22
  23 namespace CVC4 {
  24 namespace theory {
  25
  26 class QuantifiersEngine;
  27
  28 /** this class stores a representative set */
  29 class RepSet {
  30 public:
  31   RepSet(){}
  32   ~RepSet(){}
  33   std::map< TypeNode, std::vector< Node > > d_type_reps;
  34   std::map< TypeNode, bool > d_type_complete;
  35   std::map< Node, int > d_tmap;
  36   // map from values to terms they were assigned for
  37   std::map< Node, Node > d_values_to_terms;
  38   /** clear the set */
  39   void clear();
  40   /** has type */
  41   bool hasType( TypeNode tn ) const { return d_type_reps.find( tn )!=d_type_reps.end(); }
  42   /** has rep */
  43   bool hasRep( TypeNode tn, Node n );
  44   /** get cardinality for type */
  45   int getNumRepresentatives( TypeNode tn ) const;
  46   /** add representative for type */
  47   void add( TypeNode tn, Node n );
  48   /** returns index in d_type_reps for node n */
  49   int getIndexFor( Node n ) const;
  50   /** complete all values */
  51   void complete( TypeNode t );
  52   /** debug print */
  53   void toStream(std::ostream& out);
  54 };/* class RepSet */
  55
  56 //representative domain
  57 typedef std::vector< int > RepDomain;
  58
  59 /** this class iterates over a RepSet */
  60 class RepSetIterator {
  61 public:
  62   enum {
  63     ENUM_DOMAIN_ELEMENTS,
  64     ENUM_RANGE,
  65   };
  66 private:
  67   QuantifiersEngine * d_qe;
  68   //initialize function
  69   bool initialize();
  70   //for enum ranges
  71   std::map< int, Node > d_lower_bounds;
  72   //domain size
  73   int domainSize( int i );
  74   //node this is rep set iterator is for
  75   Node d_owner;
  76   //reset index
  77   bool resetIndex( int i, bool initial = false );
  78   /** set index order */
  79   void setIndexOrder( std::vector< int >& indexOrder );
  80 public:
  81   RepSetIterator( QuantifiersEngine * qe, RepSet* rs );
  82   ~RepSetIterator(){}
  83   //set that this iterator will be iterating over instantiations for a quantifier
  84   bool setQuantifier( Node f );
  85   //set that this iterator will be iterating over the domain of a function
  86   bool setFunctionDomain( Node op );
  87 public:
  88   //pointer to model
  89   RepSet* d_rep_set;
  90   //enumeration type?
  91   std::vector< int > d_enum_type;
  92   //index we are considering
  93   std::vector< int > d_index;
  94   //types we are considering
  95   std::vector< TypeNode > d_types;
  96   //domain we are considering
  97   std::vector< RepDomain > d_domain;
  98   //are we only considering a strict subset of the domain of the quantifier?
  99   bool d_incomplete;
 100   //ordering for variables we are indexing over
 101   //  for example, given reps = { a, b } and quantifier forall( x, y, z ) P( x, y, z ) with d_index_order = { 2, 0, 1 },
 102   //    then we consider instantiations in this order:
 103   //      a/x a/y a/z
 104   //      a/x b/y a/z
 105   //      b/x a/y a/z
 106   //      b/x b/y a/z
 107   //      ...
 108   std::vector< int > d_index_order;
 109   //variables to index they are considered at
 110   //  for example, if d_index_order = { 2, 0, 1 }
 111   //    then d_var_order = { 0 -> 1, 1 -> 2, 2 -> 0 }
 112   std::map< int, int > d_var_order;
 113   //intervals
 114   std::map< int, Node > d_bounds[2];
 115 public:
 116   /** increment the iterator at index=counter */
 117   int increment2( int counter );
 118   /** increment the iterator */
 119   int increment();
 120   /** is the iterator finished? */
 121   bool isFinished();
 122   /** get the i_th term we are considering */
 123   Node getTerm( int i );
 124   /** get the number of terms we are considering */
 125   int getNumTerms() { return (int)d_index_order.size(); }
 126   /** debug print */
 127   void debugPrint( const char* c );
 128   void debugPrintSmall( const char* c );
 129 };/* class RepSetIterator */
 130
 131 }/* CVC4::theory namespace */
 132 }/* CVC4 namespace */
 133
 134 #endif /* __CVC4__THEORY__REP_SET_H */