From 8316697801a73a14a2fe3845e0d0f5add63a18be Mon Sep 17 00:00:00 2001 From: Dejan Jovanović Date: Fri, 12 Feb 2010 01:07:22 +0000 Subject: Changes to hashing that solve the xinetd boolean benchmark in 14s (from ~25min). Switched to standard hash_set, hash_map, new hash for the vector of node values (from boost), changed the hash for nodes to be over id's, all the hash values are now size_t. The parser is down from 11s to 10s on the benchmark, so most of the solve time is parsing and we need to figure this out. --- src/parser/smt/smt_parser.g | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'src/parser/smt') diff --git a/src/parser/smt/smt_parser.g b/src/parser/smt/smt_parser.g index dbc9e1a21..4ecac0418 100644 --- a/src/parser/smt/smt_parser.g +++ b/src/parser/smt/smt_parser.g @@ -117,7 +117,7 @@ benchAttribute returns [Command* smt_command = 0] annotatedFormula returns [CVC4::Expr formula] { Debug("parser") << "annotated formula: " << LT(1)->getText() << endl; - Kind kind; + Kind kind = UNDEFINED_KIND; vector args; } : /* a built-in operator application */ -- cgit v1.2.3