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
41
42

// Copyright 2018 The RE2 Authors.  All Rights Reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

#ifndef UTIL_POD_ARRAY_H_
#define UTIL_POD_ARRAY_H_

#include <memory>
#include <type_traits>

namespace lbug {
namespace regex {

template<typename T>
class PODArray {
public:
    static_assert(std::is_trivial<T>::value && std::is_standard_layout<T>::value, "T must be POD");

    PODArray() : ptr_() {}
    explicit PODArray(int len) : ptr_(std::allocator<T>().allocate(len), Deleter(len)) {}

    T* data() const { return ptr_.get(); }

    int size() const { return ptr_.get_deleter().len_; }

    T& operator[](int pos) const { return ptr_[pos]; }

private:
    struct Deleter {
        Deleter() : len_(0) {}
        explicit Deleter(int len) : len_(len) {}

        void operator()(T* ptr) const { std::allocator<T>().deallocate(ptr, len_); }

        int len_;
    };

    std::unique_ptr<T[], Deleter> ptr_;
};
} // namespace regex
} // namespace lbug
#endif // UTIL_POD_ARRAY_H_