Hugging Face's logo

Datasets:
PV-SJTU
/
PV-Bench

Tasks:
Text Generation
Modalities:
Text
Formats:
json
Languages:
English
Size:
< 1K
Tags:
formal-verification
program-verification
separation-logic
theorem-proving
coq
rocq
Libraries:
Datasets
pandas
Polars
License:
Dataset card Data Studio Files
xet
 Community
1
PV-Bench
File size: 2,532 Bytes
bff4ec7
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
void pqdk_sift_up(int *key, int *data, int *pos, int data_bound,
                  int n, int idx)

{
  int child = idx;

  while (child > 0) {
    int parent = (child - 1) / 2;

    if (key[parent] <= key[child]) {
      break;
    }

    int tmp_key = key[parent];
    int tmp_data = data[parent];

    pos[data[parent]] = child;
    pos[data[child]] = parent;
    key[parent] = key[child];
    data[parent] = data[child];
    key[child] = tmp_key;
    data[child] = tmp_data;

    child = parent;
  }
}

void pqdk_sift_down(int *key, int *data, int *pos, int data_bound,
                    int n, int idx)

{
  int current = idx;

  while (current * 2 + 1 < n) {
    int left = current * 2 + 1;
    int right = left + 1;
    int smallest = left;

    if (right < n && key[right] < key[left]) {
      smallest = right;
    }

    if (key[current] <= key[smallest]) {
      break;
    }

    int tmp_key = key[current];
    int tmp_data = data[current];

    pos[data[current]] = smallest;
    pos[data[smallest]] = current;
    key[current] = key[smallest];
    data[current] = data[smallest];
    key[smallest] = tmp_key;
    data[smallest] = tmp_data;

    current = smallest;
  }
}

void pqdk_push(int *key, int *data, int *pos, int *size,
               int data_bound, int data_x, int key_x)

{
  int n0 = *size;

  key[n0] = key_x;
  data[n0] = data_x;
  pos[data_x] = n0;
  *size = n0 + 1;

  
  pqdk_sift_up(key, data, pos, data_bound, n0 + 1, n0);
}

void pqdk_decrease_key(int *key, int *data, int *pos, int *size,
                       int data_bound, int data_x, int key_x)

{

  int n0 = *size;
  int idx = pos[data_x];

  key[idx] = key_x;

  
  pqdk_sift_up(key, data, pos, data_bound, n0, idx);
}

void pqdk_update_or_push(int *key, int *data, int *pos, int *size,
                         int data_bound, int data_x, int key_x)

{

  int idx = pos[data_x];
  if (idx < 0) {

    pqdk_push(key, data, pos, size, data_bound, data_x, key_x);
  } else {

    pqdk_decrease_key(key, data, pos, size, data_bound, data_x, key_x);
  }

}

void pqdk_pop(int *key, int *data, int *pos, int *size,
              int data_bound, int *data_out, int *key_out)

{

  int n0 = *size;
  int result_key = key[0];
  int result_data = data[0];
  *key_out = result_key;
  *data_out = result_data;

  pos[result_data] = -1;

  if (n0 == 1) {
    *size = 0;

    return;
  }

  pos[data[n0 - 1]] = 0;
  key[0] = key[n0 - 1];
  data[0] = data[n0 - 1];

  *size = n0 - 1;

  
  pqdk_sift_down(key, data, pos, data_bound, n0 - 1, 0);
}