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
|
/*
* Copyright 2014 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#ifndef SkBBHFactory_DEFINED
#define SkBBHFactory_DEFINED
#include "include/core/SkRefCnt.h"
#include "include/core/SkTypes.h"
// TODO(kjlubick) fix client users and then make this a forward declare
#include "include/core/SkRect.h" // IWYU pragma: keep
#include <cstddef>
#include <vector>
class SkBBoxHierarchy : public SkRefCnt {
public:
struct Metadata {
bool isDraw; // The corresponding SkRect bounds a draw command, not a pure state change.
};
/**
* Insert N bounding boxes into the hierarchy.
*/
virtual void insert(const SkRect[], int N) = 0;
virtual void insert(const SkRect[], const Metadata[], int N);
/**
* Populate results with the indices of bounding boxes intersecting that query.
*/
virtual void search(const SkRect& query, std::vector<int>* results) const = 0;
/**
* Return approximate size in memory of *this.
*/
virtual size_t bytesUsed() const = 0;
protected:
SkBBoxHierarchy() = default;
SkBBoxHierarchy(const SkBBoxHierarchy&) = delete;
SkBBoxHierarchy& operator=(const SkBBoxHierarchy&) = delete;
};
class SK_API SkBBHFactory {
public:
/**
* Allocate a new SkBBoxHierarchy. Return NULL on failure.
*/
virtual sk_sp<SkBBoxHierarchy> operator()() const = 0;
virtual ~SkBBHFactory() {}
protected:
SkBBHFactory() = default;
SkBBHFactory(const SkBBHFactory&) = delete;
SkBBHFactory& operator=(const SkBBHFactory&) = delete;
};
class SK_API SkRTreeFactory : public SkBBHFactory {
public:
sk_sp<SkBBoxHierarchy> operator()() const override;
};
#endif
|
