mirror of
https://github.com/felt/tippecanoe.git
synced 2026-10-02 16:35:40 +02:00
Erica Fischer
c5f2f0da34
* Plumb bounding boxes through potential intersections
* Quick bbox reject for bins that can't possibly intersect
* Inching toward attribute accumulation in megatile handling
* Some sort of test for how all these things interact with each other.
Automatic numeric attribute accumulation does *not* apply to attributes
that have an explicit attribute accumulator set, because the order of
operations is too messy and weird
* More sketching
* More sketching
* Actually do some accumulation
* Put all that behind an --accumulate-numeric flag
* Use the same attribute accumulation logic in binning as in megatiles
* Fix backwards conditional
* Add means, but somehow I have some counts of 0
* Handle aggregated attributes with no base attribute in the feature
* Checkpoint before I break everything
* Found a flaw, now to debug
* Fix a typo that broke accumulation
* Add binning tests
* Make sure IDs make it through on the bins
* Fix count/mean accumulation
* Make the numeric accumulation prefix configurable
* Make sure the accumulate test still works with a different prefix
* Forgot to update this test
* More testing to make sure cluster sizes make it all the way through
* Fix neglected --accumulate-attribute when binning
* Mark unexercised attribute accumulation cases as "can't happen"
* Factor out numeric preservation
* Attrs with the accumulation prefix are just preserved, not accumulated
* Test behavior of prefixed attributes
* Plumbing for exclude and exclude-prefix
* Implement and test attribute prefix stripping in overzoom
* Update version and changelog
* For debugging, make an attribute list of source feature IDs
* Revert "For debugging, make an attribute list of source feature IDs"
This reverts commit 65fc99c9d1.
56 lines
1.9 KiB
C++
56 lines
1.9 KiB
C++
#ifndef OPTIONS_HPP
|
|
#define OPTIONS_HPP
|
|
|
|
#define A_DEBUG_POLYGON ((int) '@')
|
|
#define A_CLUSTER_DENSEST_AS_NEEDED ((int) 'C')
|
|
#define A_COALESCE_FRACTION_AS_NEEDED ((int) 'D')
|
|
#define A_INCREASE_GAMMA_AS_NEEDED ((int) 'G')
|
|
#define A_CONVERT_NUMERIC_IDS ((int) 'I')
|
|
#define A_GRID_LOW_ZOOMS ((int) 'L')
|
|
#define A_COALESCE_SMALLEST_AS_NEEDED ((int) 'N')
|
|
#define A_GENERATE_POLYGON_LABEL_POINTS ((int) 'P')
|
|
#define A_PREFER_RADIX_SORT ((int) 'R')
|
|
#define A_COALESCE_DENSEST_AS_NEEDED ((int) 'S')
|
|
#define A_CALCULATE_INDEX ((int) 'X')
|
|
#define A_DETECT_SHARED_BORDERS ((int) 'b')
|
|
#define A_COALESCE ((int) 'c')
|
|
#define A_DROP_FRACTION_AS_NEEDED ((int) 'd')
|
|
#define A_EXTEND_ZOOMS ((int) 'e')
|
|
#define A_CALCULATE_FEATURE_DENSITY ((int) 'g')
|
|
#define A_HILBERT ((int) 'h')
|
|
#define A_GENERATE_IDS ((int) 'i')
|
|
#define A_LINE_DROP ((int) 'l')
|
|
#define A_DROP_SMALLEST_AS_NEEDED ((int) 'n')
|
|
#define A_REORDER ((int) 'o')
|
|
#define A_POLYGON_DROP ((int) 'p')
|
|
#define A_REVERSE ((int) 'r')
|
|
#define A_DROP_DENSEST_AS_NEEDED ((int) 's')
|
|
#define A_VARIABLE_DEPTH_PYRAMID ((int) 't')
|
|
#define A_VISVALINGAM ((int) 'v')
|
|
#define A_DETECT_WRAPAROUND ((int) 'w')
|
|
|
|
#define P_TILE_COMPRESSION ((int) 'C')
|
|
#define P_DUPLICATION ((int) 'D')
|
|
#define P_SINGLE_PRECISION ((int) 'N')
|
|
#define P_SIMPLIFY_LOW ((int) 'S')
|
|
#define P_TINY_POLYGON_REDUCTION_AT_MAXZOOM ((int) 'T')
|
|
#define P_REVERSE_SOURCE_POLYGON_WINDING ((int) 'W')
|
|
#define P_BASEZOOM_ABOVE_MAXZOOM ((int) 'b')
|
|
#define P_CLIPPING ((int) 'c')
|
|
#define P_DYNAMIC_DROP ((int) 'd')
|
|
#define P_EMPTY_CSV_COLUMNS ((int) 'e')
|
|
#define P_FEATURE_LIMIT ((int) 'f')
|
|
#define P_TILE_STATS ((int) 'g')
|
|
#define P_INPUT_ORDER ((int) 'i')
|
|
#define P_KILOBYTE_LIMIT ((int) 'k')
|
|
#define P_SIMPLIFY_SHARED_NODES ((int) 'n')
|
|
#define P_POLYGON_SPLIT ((int) 'p')
|
|
#define P_SIMPLIFY ((int) 's')
|
|
#define P_TINY_POLYGON_REDUCTION ((int) 't')
|
|
#define P_USE_SOURCE_POLYGON_WINDING ((int) 'w')
|
|
|
|
extern int prevent[256];
|
|
extern int additional[256];
|
|
|
|
#endif
|