Changeset 4b7cce6 for src/ResolvExpr/Candidate.hpp

Timestamp:

Jun 11, 2019, 3:42:10 PM (5 years ago)

Author:

Aaron Moss <a3moss@…>

Branches:

ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, pthread-emulation, qualifiedEnum

Children:

432ce7a

Parents:

3da7c19

Message:

Fill in CandidateFinder? boilerplate in resolver port

File:

• src/ResolvExpr/Candidate.hpp (modified) (3 diffs)

src/ResolvExpr/Candidate.hpp

@@ -30 +30 @@
         /// A list of unresolved assertions
         using AssertionList = std::vector<AssertionSet::value_type>;
+
+        /// Convenience to merge AssertionList into AssertionSet
+        static inline void mergeAssertionSet( AssertionSet & dst, const AssertionList & src ) {
+                for ( const auto & s : src ) { dst.emplace( s ); }
+        }
 }
 
@@ -43 +48 @@
         ast::AssertionList need;   ///< Assertions which need to be resolved
 
-        Candidate() = default;
+        Candidate() : expr(), cost( Cost::zero ), cvtCost( Cost::zero ), env(), open(), need() {}
+        
+        Candidate( const ast::Expr * x, const ast::TypeEnvironment & e )
+        : expr( x ), cost( Cost::zero ), cvtCost( Cost::zero ), env( e ), open(), need() {}
+
+        Candidate( const Candidate & o, const ast::Expr * x )
+        : expr( x ), cost( o.cost ), cvtCost( Cost::zero ), env( o.env ), open( o.open ), 
+          need( o.need ) {}
+        
+        Candidate( 
+                const ast::Expr * x, ast::TypeEnvironment && e, ast::OpenVarSet && o, 
+                ast::AssertionSet && n, const Cost & c )
+        : expr( x ), cost( c ), cvtCost( Cost::zero ), env( std::move( e ) ), open( std::move( o ) ), 
+          need( n.begin(), n.end() ) {}
 };
 
@@ -51 +69 @@
 /// List of candidates
 using CandidateList = std::vector< CandidateRef >;
+
+/// Sum the cost of a list of candidates
+static inline Cost sumCost( const CandidateList & candidates ) {
+        Cost total = Cost::zero;
+        for ( const CandidateRef & r : candidates ) { total += r->cost; }
+        return total;
+}
 
 /// Holdover behaviour from old `findMinCost` -- xxx -- can maybe be eliminated?