d007281c9a
Change-Id: Ic44e24057b95bb014504f02a736fb4341afc8971 Reviewed-on: https://skia-review.googlesource.com/c/skia/+/304856 Commit-Queue: Mike Klein <mtklein@google.com> Reviewed-by: Mike Klein <mtklein@google.com>
56 lines
1.3 KiB
C++
56 lines
1.3 KiB
C++
/*
|
|
* 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/SkRect.h"
|
|
#include "include/core/SkRefCnt.h"
|
|
#include "include/core/SkTypes.h"
|
|
#include <vector>
|
|
|
|
class SkBBoxHierarchy : public SkRefCnt {
|
|
public:
|
|
SkBBoxHierarchy() {}
|
|
|
|
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;
|
|
};
|
|
|
|
class SK_API SkBBHFactory {
|
|
public:
|
|
/**
|
|
* Allocate a new SkBBoxHierarchy. Return NULL on failure.
|
|
*/
|
|
virtual sk_sp<SkBBoxHierarchy> operator()() const = 0;
|
|
virtual ~SkBBHFactory() {}
|
|
};
|
|
|
|
class SK_API SkRTreeFactory : public SkBBHFactory {
|
|
public:
|
|
sk_sp<SkBBoxHierarchy> operator()() const override;
|
|
};
|
|
|
|
#endif
|