diff options
| author | = | 2022-05-05 15:23:47 +0200 |
|---|---|---|
| committer | = | 2022-05-05 15:23:47 +0200 |
| commit | 6afe3cc8ec6c009a43950bdbe138cbc2d7a88a4d (patch) | |
| tree | 7c2854537fc1bdf5f5aa8e861cf676204d773967 | |
| parent | 2b1838ecf30fd91575a71b877965ed3363356138 (diff) | |
| download | soikk-DB-6afe3cc8ec6c009a43950bdbe138cbc2d7a88a4d.tar.xz soikk-DB-6afe3cc8ec6c009a43950bdbe138cbc2d7a88a4d.tar.zst | |
Quality of life changes
| -rw-r--r-- | TODO | 1 | ||||
| -rw-r--r-- | db.h | 4 | ||||
| -rw-r--r-- | parser.c | 15 | ||||
| -rw-r--r-- | parser.h | 6 | ||||
| -rw-r--r-- | storage.c | 5 | ||||
| -rw-r--r-- | storage.h | 6 | ||||
| -rw-r--r-- | strings.c | 55 | ||||
| -rw-r--r-- | strings.h | 14 |
8 files changed, 82 insertions, 24 deletions
@@ -0,0 +1 @@ +Try to improve 'sameStr' by maybe not having to check s2[i2] @@ -14,7 +14,7 @@ #include "repl.h" #include "parser.h" #include "storage.h" +#include "strings.h" - -#endif
\ No newline at end of file +#endif @@ -1,19 +1,6 @@ #include "db.h" -uint16_t len(const char *s){ - uint16_t l = -1; - while(s[++l]); - return l; -} - -bool sameStr(const char* s1, const char *s2){ - uint16_t i1 = 0, i2 = 0; - while(s1[i1] && s2[i2] && s1[i1] == s2[i2]) - ++i1, ++i2; - return !s1[i1] && !s2[i2]; -} - int handleMetaCommand(inputBuffer *in){ if(sameStr(in->buffer, ".exit")){ freeInputBuffer(in); @@ -30,4 +17,4 @@ int handleInput(inputBuffer *in){ }else{ printf("normal command\n"); } -}
\ No newline at end of file +} @@ -10,12 +10,8 @@ typedef enum { } metaCommandStatus; -uint16_t len(const char *s); - -bool sameStr(const char* s1, const char *s2); - int handleMetaCommand(inputBuffer *in); int handleInput(inputBuffer *in); -#endif
\ No newline at end of file +#endif @@ -6,6 +6,7 @@ row *newRow(const char path[MAXPATH]){ memcpy(nr->path, path, MAXPATH); memcpy(nr->tags, "\0", MAXTAGS); nr->numTags = 0; + nr->lenTags = 0; return nr; } @@ -113,6 +114,7 @@ void insertTag(row *r, char *tag){ } r->tags[tagnum] = '\0'; r->numTags = l; + r->lenTags = tagnum; } // Remove a tag from the tags array in the row r @@ -153,4 +155,5 @@ void removeTag(row *r, char *tag){ } r->tags[tagnum] = '\0'; r->numTags = l; -}
\ No newline at end of file + r->lenTags = tagnum; +} @@ -10,7 +10,9 @@ typedef struct{ char path[MAXPATH]; char tags[MAXTAGS]; - int numTags; + uint16_t numTags; + uint16_t lentags; + } row; @@ -26,4 +28,4 @@ void insertTag(row *r, char *tag); void removeTag(row *r, char *tag); -#endif
\ No newline at end of file +#endif diff --git a/strings.c b/strings.c new file mode 100644 index 0000000..30e00e7 --- /dev/null +++ b/strings.c @@ -0,0 +1,55 @@ +#include "db.h" + + +uint16_t len(const char *s){ + uint16_t l = -1; + while(s[++l]); + return l; +} + +bool sameStr(const char *s1, const char *s2){ + uint16_t i1 = 0, i2 = 0; + while(s1[i1] && s2[i2] && s1[i1] == s2[i2]) + ++i1, ++i2; + return !s1[i1] && !s2[i2]; +} + + +static int *table(char *y, int n, char sep){ + int *tb = calloc(n, sizeof(int)); + if(tb == NULL){ + fprintf(stderr, "Error callocating array (table)"); + exit(EXIT_FAILURE); + } + + int lSep = n-1; + for(int i = n-1; i >= 0; --i){ + if(y[i] == sep){ + tb[i] = 1; + lSep = i; + }else if(y[i] != '\0'){ + tb[i] = lSep-i; + } + } + return tb; +} + + +ssize_t strInTags(const char *tags, int n, const char *ndl, int m, char sep){ + int *tb = table(tags, n, sep); + + for(int i = 0; i < n; ){ + int j = 0; + while(j < m && tags[i+j] == ndl[j]){ + ++j; + } + if(j == m){ + return i; + } + if(tags[i+j] != ndl[j]){ + i += tb[i]; + } + } + return -1; +} + diff --git a/strings.h b/strings.h new file mode 100644 index 0000000..db3c3e1 --- /dev/null +++ b/strings.h @@ -0,0 +1,14 @@ +#ifndef STRINGS_H +#define STRINGS_H + +#include "db.h" + + +uint16_t len(const char *s); + +bool sameStr(const char *s1, const char *s2); + +ssize_t strInTags(const char *tags, int n, const char *ndl, int m, char sep); + + +#endif |
