3 #include "tableentry.h"
6 #include "ordergraph.h"
7 #include "orderelement.h"
9 #include "decomposeorderresolver.h"
11 #define HASHNEXT(hash, newval) {hash += newval; hash += hash << 10; hash ^= hash >> 6;}
12 #define HASHFINAL(hash) {hash += hash << 3; hash ^= hash >> 11; hash += hash << 15;}
14 unsigned int table_entry_hash_function(TableEntry *This) {
16 for (uint i = 0; i < This->inputSize; i++) {
17 HASHNEXT(h, This->inputs[i]);
23 bool table_entry_equals(TableEntry *key1, TableEntry *key2) {
24 if (key1->inputSize != key2->inputSize)
26 for (uint i = 0; i < key1->inputSize; i++)
27 if (key1->inputs[i] != key2->inputs[i])
32 unsigned int order_node_hash_function(OrderNodeKey *This) {
33 return (uint) This->id;
36 bool order_node_equals(OrderNodeKey *key1, OrderNodeKey *key2) {
37 return key1->id == key2->id;
40 unsigned int order_edge_hash_function(OrderEdge *This) {
42 HASHNEXT(hash, (uint)(uintptr_t) This->sink);
43 HASHNEXT(hash, (uint)(uintptr_t) This->source);
48 bool order_edge_equals(OrderEdge *key1, OrderEdge *key2) {
49 return key1->sink == key2->sink && key1->source == key2->source;
52 unsigned int order_element_hash_function(OrderElement *This) {
53 return This->getHash();
56 bool order_element_equals(OrderElement *key1, OrderElement *key2) {
57 return key1->equals(key2);
60 unsigned int order_pair_hash_function(OrderPair *This) {
62 HASHNEXT(hash, This->first);
63 HASHNEXT(hash, This->second);
68 bool order_pair_equals(OrderPair *key1, OrderPair *key2) {
69 return key1->first == key2->first && key1->second == key2->second;
72 unsigned int doredge_hash_function(DOREdge *key) {
74 HASHNEXT(hash, (uint) key->newfirst);
75 HASHNEXT(hash, (uint) key->newsecond);
80 bool doredge_equals(DOREdge *key1, DOREdge *key2) {
81 return key1->newfirst == key2->newfirst &&
82 key1->newsecond == key2->newsecond;