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
64
65
66
67

/*
 * 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
 */

#include "Lib/Stack.hpp"

#include "Test/UnitTesting.hpp"

using namespace std;
using namespace Lib;



TEST_FUN(stackDelIterator)
{
  Stack<unsigned> st1;

  int cnt=100; //must be even
  for(int i=0;i<cnt;i++) {
    st1.push(i);
  }
  
  {
    Stack<unsigned>::StableDelIterator dit1(st1);
    ALWAYS(dit1.hasNext());
    ALWAYS(dit1.next()==0);
    dit1.del();
    ALWAYS(dit1.hasNext());
    ALWAYS(dit1.next()==1);
  }

  ASS_EQ((int)st1.size(),cnt-1);
  
  {
    Stack<unsigned>::StableDelIterator dit2(st1);
    for(int i=1;i<cnt;i++) {
      ALWAYS(dit2.hasNext());
      ALWAYS((int)dit2.next()==i);
    }
    dit2.del();
  }
  ASS_EQ((int)st1.size(),cnt-2);
  ASS_EQ((int)st1.top(),cnt-2);
  st1.push(cnt-1);

  {
    Stack<unsigned>::StableDelIterator dit3(st1);
    while(dit3.hasNext()) {
      if(dit3.next()%2==0) {
	dit3.del();
      }
    }
  }
  ASS_EQ((int)st1.size(),cnt/2);
  {
    Stack<unsigned>::StableDelIterator dit4(st1);
    while(dit4.hasNext()) {
      ALWAYS(dit4.next()%2==1);
    }
  }
}