Hash :
f990b98e
Author :
Thomas de Grivel
Date :
2022-12-06T13:37:43
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 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154
/* c3
* Copyright 2022 kmx.io <contact@kmx.io>
*
* Permission is hereby granted to use this software excepted
* on Apple computers granted the above copyright notice and
* this permission paragraph are included in all copies and
* substantial portions of this software.
*
* THIS SOFTWARE IS PROVIDED "AS-IS" WITHOUT ANY GUARANTEE OF
* PURPOSE AND PERFORMANCE. IN NO EVENT WHATSOEVER SHALL THE
* AUTHOR BE CONSIDERED LIABLE FOR THE USE AND PERFORMANCE OF
* THIS SOFTWARE.
*/
#include <assert.h>
#include <err.h>
#include "buf.h"
#include "buf_inspect.h"
#include "hash.h"
#include "fact.h"
#include "tag.h"
#include "u8.h"
s8 fact_compare (const s_fact *a, const s_fact *b)
{
s8 r;
if (a == b)
return 0;
if (!a)
return -1;
if (!b)
return 1;
if ((r = tag_compare(a->subject, b->subject)))
return r;
if ((r = tag_compare(a->predicate, b->predicate)))
return r;
r = tag_compare(a->object, b->object);
return r;
}
s8 fact_compare_unbound_var_count (const s_fact *a,
const s_fact *b)
{
u8 ca;
u8 cb;
if (a == b)
return 0;
if (!a)
return -1;
if (!b)
return 1;
ca = 0;
cb = 0;
if (tag_is_unbound_var(a->subject))
ca++;
if (tag_is_unbound_var(a->predicate))
ca++;
if (tag_is_unbound_var(a->object))
ca++;
if (tag_is_unbound_var(b->subject))
cb++;
if (tag_is_unbound_var(b->predicate))
cb++;
if (tag_is_unbound_var(b->object))
cb++;
return u8_compare(ca, cb);
}
s8 fact_compare_pos (const s_fact *a, const s_fact *b)
{
s8 r;
if (a == b)
return 0;
if (!a)
return -1;
if (!b)
return 1;
if ((r = tag_compare(a->predicate, b->predicate)))
return r;
if ((r = tag_compare(a->object, b->object)))
return r;
r = tag_compare(a->subject, b->subject);
return r;
}
s8 fact_compare_osp (const s_fact *a, const s_fact *b)
{
s8 r;
if (a == b)
return 0;
if (!a)
return -1;
if (!b)
return 1;
if ((r = tag_compare(a->object, b->object)))
return r;
if ((r = tag_compare(a->subject, b->subject)))
return r;
r = tag_compare(a->predicate, b->predicate);
return r;
}
s_fact * fact_copy (const s_fact *src, s_fact *dest)
{
assert(src);
assert(dest);
*dest = *src;
return dest;
}
uw fact_hash (const s_fact *fact)
{
t_hash_context context;
assert(fact);
hash_init(&context);
fact_hash_update(&context, fact);
return hash_result(&context);
}
t_hash_context * fact_hash_update (t_hash_context *context,
const s_fact *fact)
{
tag_hash_update(context, fact->subject);
tag_hash_update(context, fact->predicate);
return tag_hash_update(context, fact->object);
}
s_fact * fact_init (s_fact *fact, const s_tag *subject,
const s_tag *predicate, const s_tag *object)
{
assert(fact);
fact->subject = subject;
fact->predicate = predicate;
fact->object = object;
fact->id = 0;
return fact;
}
s_str * fact_inspect (const s_fact *fact, s_str *dest)
{
s_buf buf;
sw size;
if ((size = buf_inspect_fact_size(fact)) < 0) {
assert(! "fact_inspect: size error");
errx(1, "fact_inspect: size error");
return NULL;
}
buf_init_alloc(&buf, size);
if (buf_inspect_fact(&buf, fact) != size) {
assert(! "fact_inspect: inspect error");
errx(1, "fact_inspect: inspect error");
return NULL;
}
return buf_to_str(&buf, dest);
}