lbug 0.16.1

An in-process property graph database management system built for query speed and scalability
Documentation 
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

#pragma once

#include "common/types/string_t.h"

namespace lbug {
namespace function {

// The string find algorithm is copied from duckdb. Source code:
// https://github.com/duckdb/duckdb/blob/master/src/function/scalar/string/contains.cpp

struct Find {
    static inline void operation(common::string_t& left, common::string_t& right, int64_t& result) {
        if (right.len == 0) {
            result = 1;
        } else if (right.len > left.len) {
            result = 0;
        }
        result = Find::find(left.getData(), left.len, right.getData(), right.len) + 1;
    }

private:
    template<class UNSIGNED>
    static int64_t unalignedNeedleSizeFind(const uint8_t* haystack, uint32_t haystackLen,
        const uint8_t* needle, uint32_t needleLen, uint32_t firstMatchCharOffset);

    template<class UNSIGNED>
    static int64_t alignedNeedleSizeFind(const uint8_t* haystack, uint32_t haystackLen,
        const uint8_t* needle, uint32_t firstMatchCharOffset);

    static int64_t genericFind(const uint8_t* haystack, uint32_t haystackLen, const uint8_t* needle,
        uint32_t needLen, uint32_t firstMatchCharOffset);

    // Returns the position of the first occurrence of needle in the haystack. If haystack doesn't
    // contain needle, it returns -1.
    static int64_t find(const uint8_t* haystack, uint32_t haystackLen, const uint8_t* needle,
        uint32_t needleLen);
};

} // namespace function
} // namespace lbug