| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright 2014 Google Inc. | 2 * Copyright 2014 Google Inc. |
| 3 * | 3 * |
| 4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
| 5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
| 6 */ | 6 */ |
| 7 | 7 |
| 8 #ifndef SkBBHFactory_DEFINED | 8 #ifndef SkBBHFactory_DEFINED |
| 9 #define SkBBHFactory_DEFINED | 9 #define SkBBHFactory_DEFINED |
| 10 | 10 |
| 11 #include "SkSize.h" | 11 #include "SkSize.h" |
| 12 #include "SkPoint.h" | 12 #include "SkPoint.h" |
| 13 | 13 |
| 14 class SkBBoxHierarchy; | 14 class SkBBoxHierarchy; |
| 15 | 15 |
| 16 class SkBBHFactory { | 16 class SK_API SkBBHFactory { |
| 17 public: | 17 public: |
| 18 /** | 18 /** |
| 19 * Allocate a new SkBBoxHierarchy. Return NULL on failure. | 19 * Allocate a new SkBBoxHierarchy. Return NULL on failure. |
| 20 */ | 20 */ |
| 21 virtual SkBBoxHierarchy* operator()(int width, int height) const = 0; | 21 virtual SkBBoxHierarchy* operator()(int width, int height) const = 0; |
| 22 virtual ~SkBBHFactory() {}; | 22 virtual ~SkBBHFactory() {}; |
| 23 }; | 23 }; |
| 24 | 24 |
| 25 class SkQuadTreeFactory : public SkBBHFactory { | 25 class SK_API SkQuadTreeFactory : public SkBBHFactory { |
| 26 public: | 26 public: |
| 27 virtual SkBBoxHierarchy* operator()(int width, int height) const SK_OVERRIDE
; | 27 virtual SkBBoxHierarchy* operator()(int width, int height) const SK_OVERRIDE
; |
| 28 private: | 28 private: |
| 29 typedef SkBBHFactory INHERITED; | 29 typedef SkBBHFactory INHERITED; |
| 30 }; | 30 }; |
| 31 | 31 |
| 32 | 32 |
| 33 class SkRTreeFactory : public SkBBHFactory { | 33 class SK_API SkRTreeFactory : public SkBBHFactory { |
| 34 public: | 34 public: |
| 35 virtual SkBBoxHierarchy* operator()(int width, int height) const SK_OVERRIDE
; | 35 virtual SkBBoxHierarchy* operator()(int width, int height) const SK_OVERRIDE
; |
| 36 private: | 36 private: |
| 37 typedef SkBBHFactory INHERITED; | 37 typedef SkBBHFactory INHERITED; |
| 38 }; | 38 }; |
| 39 | 39 |
| 40 class SkTileGridFactory : public SkBBHFactory { | 40 class SK_API SkTileGridFactory : public SkBBHFactory { |
| 41 public: | 41 public: |
| 42 struct TileGridInfo { | 42 struct TileGridInfo { |
| 43 /** Tile placement interval */ | 43 /** Tile placement interval */ |
| 44 SkISize fTileInterval; | 44 SkISize fTileInterval; |
| 45 | 45 |
| 46 /** Pixel coverage overlap between adjacent tiles */ | 46 /** Pixel coverage overlap between adjacent tiles */ |
| 47 SkISize fMargin; | 47 SkISize fMargin; |
| 48 | 48 |
| 49 /** Offset added to device-space bounding box positions to convert | 49 /** Offset added to device-space bounding box positions to convert |
| 50 * them to tile-grid space. This can be used to adjust the "phase" | 50 * them to tile-grid space. This can be used to adjust the "phase" |
| 51 * of the tile grid to match probable query rectangles that will be | 51 * of the tile grid to match probable query rectangles that will be |
| 52 * used to search into the tile grid. As long as the offset is smaller | 52 * used to search into the tile grid. As long as the offset is smaller |
| 53 * or equal to the margin, there is no need to extend the domain of | 53 * or equal to the margin, there is no need to extend the domain of |
| 54 * the tile grid to prevent data loss. | 54 * the tile grid to prevent data loss. |
| 55 */ | 55 */ |
| 56 SkIPoint fOffset; | 56 SkIPoint fOffset; |
| 57 }; | 57 }; |
| 58 | 58 |
| 59 SkTileGridFactory(const TileGridInfo& info) : fInfo(info) { } | 59 SkTileGridFactory(const TileGridInfo& info) : fInfo(info) { } |
| 60 | 60 |
| 61 virtual SkBBoxHierarchy* operator()(int width, int height) const SK_OVERRIDE
; | 61 virtual SkBBoxHierarchy* operator()(int width, int height) const SK_OVERRIDE
; |
| 62 | 62 |
| 63 private: | 63 private: |
| 64 TileGridInfo fInfo; | 64 TileGridInfo fInfo; |
| 65 | 65 |
| 66 typedef SkBBHFactory INHERITED; | 66 typedef SkBBHFactory INHERITED; |
| 67 }; | 67 }; |
| 68 | 68 |
| 69 #endif | 69 #endif |
| OLD | NEW |