vampire-sys 0.5.2

Low-level FFI bindings to the Vampire theorem prover (use the 'vampire' crate instead)
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63

/*
 * This file is part of the source code of the software program
 * Vampire. It is protected by applicable
 * copyright laws.
 *
 * This source code is distributed under the licence found here
 * https://vprover.github.io/license.html
 * and in the source directory
 */
/**
 * @file LiteralMiniIndex.cpp
 * Implements class LiteralMiniIndex.
 */

#include <algorithm>

#include "LiteralMiniIndex.hpp"

namespace Indexing
{

using namespace Lib;
using namespace Kernel;

/*int LiteralMiniIndex::goodPred=0;
int LiteralMiniIndex::badPred=0;*/


bool LiteralMiniIndex::literalHeaderComparator(const Entry& e1, const Entry& e2)
{
  return e1._header<e2._header || ( e1._header==e2._header && e1._weight<e2._weight );
}

void LiteralMiniIndex::init(Clause* cl)
{
  _cnt = cl->length();
  _entries.ensure(cl->length()+1);
  init(cl->literals());
}

LiteralMiniIndex::LiteralMiniIndex(Clause* cl)
: _cnt(cl->length()), _entries(cl->length()+1)
{
  init(cl->literals());
}

LiteralMiniIndex::LiteralMiniIndex(Literal* const * lits, unsigned length)
: _cnt(length), _entries(length+1)
{
  init(lits);
}

void LiteralMiniIndex::init(Literal* const * lits)
{
  ASS_G(_cnt, 0);
  for(unsigned i=0;i<_cnt;i++) {
    _entries[i].init(lits[i]);
  }
  _entries[_cnt].initTerminal();
  std::sort(_entries.begin(), _entries.end()-1,literalHeaderComparator);
}

}