aboutsummaryrefslogtreecommitdiff
path: root/assets/blender/ks/signal_ks_singlemesh.blend
diff options
context:
space:
mode:
Diffstat (limited to 'assets/blender/ks/signal_ks_singlemesh.blend')
0 files changed, 0 insertions, 0 deletions
generated by cgit v1.2.3 (git 2.39.1) at 2025-07-20 13:22:06 +0000
/a> 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 
/*
Minetest
Copyright (C) 2015 est31 <mtest31@outlook.com>

This program is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU Lesser General Public License for more details.

You should have received a copy of the GNU Lesser General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/

#ifndef AREASTORE_H_
#define AREASTORE_H_

#include "irr_v3d.h"
#include "noise.h" // for PcgRandom
#include <map>
#include <list>
#include <vector>
#include <istream>
#include "util/container.h"
#include "util/numeric.h"
#ifndef ANDROID
	#include "cmake_config.h"
#endif
#if USE_SPATIAL
	#include <spatialindex/SpatialIndex.h>
	#include "util/serialize.h"
#endif

#define AST_EXTREMIFY(min, max, pa, pb) \
	(min).X = MYMIN((pa).X, (pb).X);    \
	(min).Y = MYMIN((pa).Y, (pb).Y);    \
	(min).Z = MYMIN((pa).Z, (pb).Z);    \
	(max).X = MYMAX((pa).X, (pb).X);    \
	(max).Y = MYMAX((pa).Y, (pb).Y);    \
	(max).Z = MYMAX((pa).Z, (pb).Z);

#define AREA_ID_INVALID 0

struct Area {
	Area(const v3s16 &minedge, const v3s16 &maxedge)
	{
		this->minedge = minedge;
		this->maxedge = maxedge;
	}

	Area() {}

	void extremifyEdges()
	{
		v3s16 nminedge;
		v3s16 nmaxedge;

		AST_EXTREMIFY(nminedge, nmaxedge, minedge, maxedge)

		maxedge = nmaxedge;
		minedge = nminedge;
	}

	u32 id;
	v3s16 minedge;
	v3s16 maxedge;
	std::string data;
};

std::vector<std::string> get_areastore_typenames();

class AreaStore {
protected:
	// TODO change to unordered_map when we can
	std::map<u32, Area> areas_map;
	void invalidateCache();
	virtual void getAreasForPosImpl(std::vector<Area *> *result, v3s16 pos) = 0;
	bool cache_enabled; // don't write to this from subclasses, only read.
public:
	virtual void insertArea(const Area &a) = 0;
	virtual void reserve(size_t count) {};
	virtual bool removeArea(u32 id) = 0;
	void getAreasForPos(std::vector<Area *> *result, v3s16 pos);
	virtual void getAreasInArea(std::vector<Area *> *result,
		v3s16 minedge, v3s16 maxedge, bool accept_overlap) = 0;

#if 0
	// calls a passed function for every stored area, until the
	// callback returns true. If that happens, it returns true,
	// if the search is exhausted, it returns false
	virtual bool forEach(bool (*callback)(void *args, Area *a), void *args) const = 0;
#endif

	virtual ~AreaStore()
	{}

	AreaStore() :
		cache_enabled(true),
		m_cacheblock_radius(64),
		m_res_cache(1000, &cacheMiss, this),