#include "bucket.h"
#include "pbqp_edge_t.h"
+#include "pbqp_node.h"
#include "pbqp_node_t.h"
int edge_bucket_contains(pbqp_edge_bucket bucket, pbqp_edge *edge)
return edge;
}
+void node_bucket_shrink(pbqp_node_bucket *bucket, unsigned len)
+{
+ ARR_SHRINKLEN(*bucket, len);
+}
+
int node_bucket_contains(pbqp_node_bucket bucket, pbqp_node *node)
{
assert(node);
&& bucket[node->bucket_index] == node;
}
+void node_bucket_copy(pbqp_node_bucket *dst, pbqp_node_bucket src)
+{
+ unsigned src_index;
+ unsigned src_length = node_bucket_get_length(src);
+
+ for (src_index = 0; src_index < src_length; ++src_index) {
+ node_bucket_insert(dst, src[src_index]);
+ }
+}
+
void node_bucket_free(pbqp_node_bucket *bucket)
{
DEL_ARR_F(*bucket);
assert(node_bucket_contains(*bucket, node));
assert(bucket_len > 0);
- node_index = node->index;
+ node_index = node->bucket_index;
other = (*bucket)[bucket_len - 1];
other->bucket_index = node_index;
(*bucket)[node_index] = other;
ARR_SHRINKLEN(*bucket, (int)bucket_len - 1);
node->bucket_index = UINT_MAX;
}
+
+void node_bucket_deep_copy(pbqp *pbqp, pbqp_node_bucket *dst, pbqp_node_bucket src)
+{
+ unsigned bucket_index;
+ unsigned bucket_length;
+
+ node_bucket_init(dst);
+ bucket_length = node_bucket_get_length(src);
+
+ for (bucket_index = 0; bucket_index < bucket_length; ++bucket_index) {
+ node_bucket_insert(dst, pbqp_node_deep_copy(pbqp, *dst, src[bucket_index]));
+ }
+}