4 #include "pbqp_edge_t.h"
6 #include "pbqp_node_t.h"
8 int edge_bucket_contains(pbqp_edge_bucket bucket, pbqp_edge *edge)
12 return edge->bucket_index < edge_bucket_get_length(bucket)
13 && bucket[edge->bucket_index] == edge;
16 void edge_bucket_free(pbqp_edge_bucket *bucket)
22 unsigned edge_bucket_get_length(pbqp_edge_bucket bucket)
24 return ARR_LEN(bucket);
27 void edge_bucket_init(pbqp_edge_bucket *bucket)
29 *bucket = NEW_ARR_F(pbqp_edge *, 0);
32 void edge_bucket_insert(pbqp_edge_bucket *bucket, pbqp_edge *edge)
34 edge->bucket_index = edge_bucket_get_length(*bucket);
35 ARR_APP1(pbqp_edge *, *bucket, edge);
38 pbqp_edge *edge_bucket_pop(pbqp_edge_bucket *bucket)
40 unsigned bucket_len = edge_bucket_get_length(*bucket);
43 assert(bucket_len > 0);
45 edge = (*bucket)[bucket_len - 1];
47 ARR_SHRINKLEN(*bucket, (int)bucket_len - 1);
48 edge->bucket_index = UINT_MAX;
53 void node_bucket_shrink(pbqp_node_bucket *bucket, unsigned len)
55 ARR_SHRINKLEN(*bucket, len);
58 int node_bucket_contains(pbqp_node_bucket bucket, pbqp_node *node)
62 return node->bucket_index < node_bucket_get_length(bucket)
63 && bucket[node->bucket_index] == node;
66 void node_bucket_copy(pbqp_node_bucket *dst, pbqp_node_bucket src)
69 unsigned src_length = node_bucket_get_length(src);
71 for (src_index = 0; src_index < src_length; ++src_index) {
72 node_bucket_insert(dst, src[src_index]);
76 void node_bucket_update(pbqp *pbqp, pbqp_node_bucket bucket)
79 unsigned length = node_bucket_get_length(bucket);
81 for (index = 0; index < length; ++index) {
82 pbqp->nodes[bucket[index]->index] = bucket[index];
86 void node_bucket_free(pbqp_node_bucket *bucket)
92 unsigned node_bucket_get_length(pbqp_node_bucket bucket)
94 return ARR_LEN(bucket);
97 void node_bucket_init(pbqp_node_bucket *bucket)
99 *bucket = NEW_ARR_F(pbqp_node *, 0);
102 void node_bucket_insert(pbqp_node_bucket *bucket, pbqp_node *node)
104 node->bucket_index = node_bucket_get_length(*bucket);
105 ARR_APP1(pbqp_node *, *bucket, node);
108 pbqp_node *node_bucket_pop(pbqp_node_bucket *bucket)
110 unsigned bucket_len = node_bucket_get_length(*bucket);
113 assert(bucket_len > 0);
115 node = (*bucket)[bucket_len - 1];
118 ARR_SHRINKLEN(*bucket, (int)bucket_len - 1);
119 node->bucket_index = UINT_MAX;
124 void node_bucket_remove(pbqp_node_bucket *bucket, pbqp_node *node)
126 unsigned bucket_len = node_bucket_get_length(*bucket);
131 assert(node_bucket_contains(*bucket, node));
132 assert(bucket_len > 0);
134 node_index = node->bucket_index;
135 other = (*bucket)[bucket_len - 1];
136 other->bucket_index = node_index;
137 (*bucket)[node_index] = other;
139 ARR_SHRINKLEN(*bucket, (int)bucket_len - 1);
140 node->bucket_index = UINT_MAX;
143 void node_bucket_deep_copy(pbqp *pbqp, pbqp_node_bucket *dst, pbqp_node_bucket src)
145 unsigned bucket_index;
146 unsigned bucket_length;
148 bucket_length = node_bucket_get_length(src);
150 for (bucket_index = 0; bucket_index < bucket_length; ++bucket_index) {
151 node_bucket_insert(dst, pbqp_node_deep_copy(pbqp, *dst, src[bucket_index]));