|
|
@@ -0,0 +1,150 @@
|
|
|
+#include <stdlib.h>
|
|
|
+#include <string.h>
|
|
|
+#include <inttypes.h>
|
|
|
+#include <time.h>
|
|
|
+
|
|
|
+#include <misc/substring.h>
|
|
|
+#include <misc/debug.h>
|
|
|
+#include <misc/balloc.h>
|
|
|
+
|
|
|
+static int find_substring_slow (const char *str, size_t str_len, const char *sub, size_t sub_len, size_t *out_pos)
|
|
|
+{
|
|
|
+ ASSERT(sub_len > 0)
|
|
|
+
|
|
|
+ if (str_len < sub_len) {
|
|
|
+ return 0;
|
|
|
+ }
|
|
|
+
|
|
|
+ for (size_t i = 0; i <= str_len - sub_len; i++) {
|
|
|
+ if (!memcmp(str + i, sub, sub_len)) {
|
|
|
+ *out_pos = i;
|
|
|
+ return 1;
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ return 0;
|
|
|
+}
|
|
|
+
|
|
|
+static void print_data (const char *str, size_t str_len)
|
|
|
+{
|
|
|
+ while (str_len > 0) {
|
|
|
+ printf("%02"PRIx8" ", (uint8_t)(*str));
|
|
|
+ str++;
|
|
|
+ str_len--;
|
|
|
+ }
|
|
|
+ printf("\n");
|
|
|
+}
|
|
|
+
|
|
|
+static void print_table (const size_t *table, size_t len)
|
|
|
+{
|
|
|
+ for (size_t i = 1; i < len; i++) {
|
|
|
+ printf("%zu ", table[i]);
|
|
|
+ }
|
|
|
+ printf("\n");
|
|
|
+}
|
|
|
+
|
|
|
+static void test_tables (int len, int count)
|
|
|
+{
|
|
|
+ ASSERT(len > 0)
|
|
|
+ ASSERT(count >= 0)
|
|
|
+
|
|
|
+ char *word = BAllocSize(bsize_fromint(len));
|
|
|
+ ASSERT_FORCE(word)
|
|
|
+
|
|
|
+ size_t *table = BAllocSize(bsize_mul(bsize_fromint(len), bsize_fromsize(sizeof(table[0]))));
|
|
|
+ ASSERT_FORCE(table)
|
|
|
+
|
|
|
+ for (int i = 0; i < count; i++) {
|
|
|
+ for (int j = 0; j < len; j++) {
|
|
|
+ word[j] = rand() % 2;
|
|
|
+ }
|
|
|
+
|
|
|
+ build_substring_backtrack_table(word, len, table);
|
|
|
+
|
|
|
+ for (int j = 1; j < len; j++) {
|
|
|
+ for (int k = j - 1; k >= 0; k--) {
|
|
|
+ if (!memcmp(word + j - k, word, k)) {
|
|
|
+ ASSERT_FORCE(table[j] == k)
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ }
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ BFree(table);
|
|
|
+ BFree(word);
|
|
|
+}
|
|
|
+
|
|
|
+static void test_substring (int word_len, int text_len, int word_count, int text_count)
|
|
|
+{
|
|
|
+ assert(word_len > 0);
|
|
|
+ assert(text_len >= 0);
|
|
|
+ assert(word_count >= 0);
|
|
|
+ assert(text_count >= 0);
|
|
|
+
|
|
|
+ char *word = BAllocSize(bsize_fromint(word_len));
|
|
|
+ ASSERT_FORCE(word)
|
|
|
+
|
|
|
+ size_t *table = BAllocSize(bsize_mul(bsize_fromint(word_len), bsize_fromsize(sizeof(table[0]))));
|
|
|
+ ASSERT_FORCE(table)
|
|
|
+
|
|
|
+ char *text = BAllocSize(bsize_fromint(text_len));
|
|
|
+ ASSERT_FORCE(text)
|
|
|
+
|
|
|
+ for (int i = 0; i < word_count; i++) {
|
|
|
+ for (int j = 0; j < word_len; j++) {
|
|
|
+ word[j] = rand() % 2;
|
|
|
+ }
|
|
|
+
|
|
|
+ build_substring_backtrack_table(word, word_len, table);
|
|
|
+
|
|
|
+ for (int j = 0; j < text_count; j++) {
|
|
|
+ for (int k = 0; k < text_len; k++) {
|
|
|
+ text[k] = rand() % 2;
|
|
|
+ }
|
|
|
+
|
|
|
+ size_t pos;
|
|
|
+ int res = find_substring(text, text_len, word, word_len, table, &pos);
|
|
|
+
|
|
|
+ size_t spos;
|
|
|
+ int sres = find_substring_slow(text, text_len, word, word_len, &spos);
|
|
|
+
|
|
|
+ ASSERT_FORCE(res == sres)
|
|
|
+ if (res) {
|
|
|
+ ASSERT_FORCE(pos == spos)
|
|
|
+ }
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ BFree(text);
|
|
|
+ BFree(table);
|
|
|
+ BFree(word);
|
|
|
+}
|
|
|
+
|
|
|
+int main (int argc, char *argv[])
|
|
|
+{
|
|
|
+ if (argc != 7) {
|
|
|
+ printf("Usage: %s <tables length> <tables count> <word len> <text len> <word count> <text count>\n", (argc == 0 ? "" : argv[0]));
|
|
|
+ return 1;
|
|
|
+ }
|
|
|
+
|
|
|
+ int tables_len = atoi(argv[1]);
|
|
|
+ int tables_count = atoi(argv[2]);
|
|
|
+ int word_len = atoi(argv[3]);
|
|
|
+ int text_len = atoi(argv[4]);
|
|
|
+ int word_count = atoi(argv[5]);
|
|
|
+ int text_count = atoi(argv[6]);
|
|
|
+
|
|
|
+ if (tables_len <= 0 || tables_count < 0 || word_len <= 0 || text_len < 0 || word_count < 0 || text_count < 0) {
|
|
|
+ printf("Bad arguments.\n");
|
|
|
+ return 1;
|
|
|
+ }
|
|
|
+
|
|
|
+ srand(time(NULL));
|
|
|
+
|
|
|
+ test_tables(tables_len, tables_count);
|
|
|
+
|
|
|
+ test_substring(word_len, text_len, word_count, text_count);
|
|
|
+
|
|
|
+ return 0;
|
|
|
+}
|