@bloomengine/engine 0.3.3 → 0.4.1

package/native/third_party/JoltPhysics/Jolt/Core/Atomics.h

@@ -1,44 +0,0 @@
-// Jolt Physics Library (https://github.com/jrouwe/JoltPhysics)
-// SPDX-FileCopyrightText: 2021 Jorrit Rouwe
-// SPDX-License-Identifier: MIT
-
-#pragma once
-
-JPH_SUPPRESS_WARNINGS_STD_BEGIN
-#include <atomic>
-JPH_SUPPRESS_WARNINGS_STD_END
-
-JPH_NAMESPACE_BEGIN
-
-// Things we're using from STL
-using std::atomic;
-using std::memory_order;
-using std::memory_order_relaxed;
-using std::memory_order_acquire;
-using std::memory_order_release;
-using std::memory_order_acq_rel;
-using std::memory_order_seq_cst;
-
-/// Atomically compute the min(ioAtomic, inValue) and store it in ioAtomic, returns true if value was updated
-template <class T>
-bool AtomicMin(atomic<T> &ioAtomic, const T inValue, const memory_order inMemoryOrder = memory_order_seq_cst)
-{
-	T cur_value = ioAtomic.load(memory_order_relaxed);
-	while (cur_value > inValue)
-		if (ioAtomic.compare_exchange_weak(cur_value, inValue, inMemoryOrder))
-			return true;
-	return false;
-}
-
-/// Atomically compute the max(ioAtomic, inValue) and store it in ioAtomic, returns true if value was updated
-template <class T>
-bool AtomicMax(atomic<T> &ioAtomic, const T inValue, const memory_order inMemoryOrder = memory_order_seq_cst)
-{
-	T cur_value = ioAtomic.load(memory_order_relaxed);
-	while (cur_value < inValue)
-		if (ioAtomic.compare_exchange_weak(cur_value, inValue, inMemoryOrder))
-			return true;
-	return false;
-}
-
-JPH_NAMESPACE_END

package/native/third_party/JoltPhysics/Jolt/Core/BinaryHeap.h

@@ -1,96 +0,0 @@
-// Jolt Physics Library (https://github.com/jrouwe/JoltPhysics)
-// SPDX-FileCopyrightText: 2024 Jorrit Rouwe
-// SPDX-License-Identifier: MIT
-
-#pragma once
-
-JPH_NAMESPACE_BEGIN
-
-/// Push a new element into a binary max-heap.
-/// [inBegin, inEnd - 1) must be a a valid heap. Element inEnd - 1 will be inserted into the heap. The heap will be [inBegin, inEnd) after this call.
-/// inPred is a function that returns true if the first element is less or equal than the second element.
-/// See: https://en.wikipedia.org/wiki/Binary_heap
-template <typename Iterator, typename Pred>
-void BinaryHeapPush(Iterator inBegin, Iterator inEnd, Pred inPred)
-{
-	using diff_t = typename std::iterator_traits<Iterator>::difference_type;
-	using elem_t = typename std::iterator_traits<Iterator>::value_type;
-
-	// New heap size
-	diff_t count = std::distance(inBegin, inEnd);
-
-	// Start from the last element
-	diff_t current = count - 1;
-	while (current > 0)
-	{
-		// Get current element
-		elem_t &current_elem = *(inBegin + current);
-
-		// Get parent element
-		diff_t parent = (current - 1) >> 1;
-		elem_t &parent_elem = *(inBegin + parent);
-
-		// Sort them so that the parent is larger than the child
-		if (inPred(parent_elem, current_elem))
-		{
-			std::swap(parent_elem, current_elem);
-			current = parent;
-		}
-		else
-		{
-			// When there's no change, we're done
-			break;
-		}
-	}
-}
-
-/// Pop an element from a binary max-heap.
-/// [inBegin, inEnd) must be a valid heap. The largest element will be removed from the heap. The heap will be [inBegin, inEnd - 1) after this call.
-/// inPred is a function that returns true if the first element is less or equal than the second element.
-/// See: https://en.wikipedia.org/wiki/Binary_heap
-template <typename Iterator, typename Pred>
-void BinaryHeapPop(Iterator inBegin, Iterator inEnd, Pred inPred)
-{
-	using diff_t = typename std::iterator_traits<Iterator>::difference_type;
-
-	// Begin by moving the highest element to the end, this is the popped element
-	std::swap(*(inEnd - 1), *inBegin);
-
-	// New heap size
-	diff_t count = std::distance(inBegin, inEnd) - 1;
-
-	// Start from the root
-	diff_t largest = 0;
-	for (;;)
-	{
-		// Get first child
-		diff_t child = (largest << 1) + 1;
-
-		// Check if we're beyond the end of the heap, if so the 2nd child is also beyond the end
-		if (child >= count)
-			break;
-
-		// Remember the largest element from the previous iteration
-		diff_t prev_largest = largest;
-
-		// Check if first child is bigger, if so select it
-		if (inPred(*(inBegin + largest), *(inBegin + child)))
-			largest = child;
-
-		// Switch to the second child
-		++child;
-
-		// Check if second child is bigger, if so select it
-		if (child < count && inPred(*(inBegin + largest), *(inBegin + child)))
-			largest = child;
-
-		// If there was no change, we're done
-		if (prev_largest == largest)
-			break;
-
-		// Swap element
-		std::swap(*(inBegin + prev_largest), *(inBegin + largest));
-	}
-}
-
-JPH_NAMESPACE_END

package/native/third_party/JoltPhysics/Jolt/Core/ByteBuffer.h

@@ -1,74 +0,0 @@
-// Jolt Physics Library (https://github.com/jrouwe/JoltPhysics)
-// SPDX-FileCopyrightText: 2021 Jorrit Rouwe
-// SPDX-License-Identifier: MIT
-
-#pragma once
-
-#include <Jolt/Core/STLAlignedAllocator.h>
-
-JPH_NAMESPACE_BEGIN
-
-/// Underlying data type for ByteBuffer
-using ByteBufferVector = Array<uint8, STLAlignedAllocator<uint8, JPH_CACHE_LINE_SIZE>>;
-
-/// Simple byte buffer, aligned to a cache line
-class ByteBuffer : public ByteBufferVector
-{
-public:
-	/// Align the size to a multiple of inSize, returns the length after alignment
-	size_t			Align(size_t inSize)
-	{
-		// Assert power of 2
-		JPH_ASSERT(IsPowerOf2(inSize));
-
-		// Calculate new size and resize buffer
-		size_t s = AlignUp(size(), inSize);
-		resize(s, 0);
-
-		return s;
-	}
-
-	/// Allocate block of data of inSize elements and return the pointer
-	template <class Type>
-	Type *			Allocate(size_t inSize = 1)
-	{
-		// Reserve space
-		size_t s = size();
-		resize(s + inSize * sizeof(Type));
-
-		// Get data pointer
-		Type *data = reinterpret_cast<Type *>(&at(s));
-
-		// Construct elements
-		for (Type *d = data, *d_end = data + inSize; d < d_end; ++d)
-			new (d) Type;
-
-		// Return pointer
-		return data;
-	}
-
-	/// Append inData to the buffer
-	template <class Type>
-	void			AppendVector(const Array<Type> &inData)
-	{
-		size_t size = inData.size() * sizeof(Type);
-		uint8 *data = Allocate<uint8>(size);
-		memcpy(data, &inData[0], size);
-	}
-
-	/// Get object at inPosition (an offset in bytes)
-	template <class Type>
-	const Type *	Get(size_t inPosition) const
-	{
-		return reinterpret_cast<const Type *>(&at(inPosition));
-	}
-
-	/// Get object at inPosition (an offset in bytes)
-	template <class Type>
-	Type *			Get(size_t inPosition)
-	{
-		return reinterpret_cast<Type *>(&at(inPosition));
-	}
-};
-
-JPH_NAMESPACE_END

package/native/third_party/JoltPhysics/Jolt/Core/Color.cpp

@@ -1,38 +0,0 @@
-// Jolt Physics Library (https://github.com/jrouwe/JoltPhysics)
-// SPDX-FileCopyrightText: 2021 Jorrit Rouwe
-// SPDX-License-Identifier: MIT
-
-#include <Jolt/Jolt.h>
-
-#include <Jolt/Core/Color.h>
-
-JPH_NAMESPACE_BEGIN
-
-// Predefined colors
-const Color Color::sBlack(0, 0, 0);
-const Color Color::sDarkRed(128, 0, 0);
-const Color Color::sRed(255, 0, 0);
-const Color Color::sDarkGreen(0, 128, 0);
-const Color Color::sGreen(0, 255, 0);
-const Color Color::sDarkBlue(0, 0, 128);
-const Color Color::sBlue(0, 0, 255);
-const Color Color::sYellow(255, 255, 0);
-const Color Color::sPurple(255, 0, 255);
-const Color Color::sCyan(0, 255, 255);
-const Color Color::sOrange(255, 128, 0);
-const Color Color::sDarkOrange(128, 64, 0);
-const Color Color::sGrey(128, 128, 128);
-const Color Color::sLightGrey(192, 192, 192);
-const Color Color::sWhite(255, 255, 255);
-
-// Generated by: http://phrogz.net/css/distinct-colors.html (this algo: https://en.wikipedia.org/wiki/Color_difference#CMC_l:c_.281984.29)
-static constexpr Color sColors[] = { Color(255, 0, 0), Color(204, 143, 102), Color(226, 242, 0), Color(41, 166, 124), Color(0, 170, 255), Color(69, 38, 153), Color(153, 38, 130), Color(229, 57, 80), Color(204, 0, 0), Color(255, 170, 0), Color(85, 128, 0), Color(64, 255, 217), Color(0, 75, 140), Color(161, 115, 230), Color(242, 61, 157), Color(178, 101, 89), Color(140, 94, 0), Color(181, 217, 108), Color(64, 242, 255), Color(77, 117, 153), Color(157, 61, 242), Color(140, 0, 56), Color(127, 57, 32), Color(204, 173, 51), Color(64, 255, 64), Color(38, 145, 153), Color(0, 102, 255), Color(242, 0, 226), Color(153, 77, 107), Color(229, 92, 0), Color(140, 126, 70), Color(0, 179, 71), Color(0, 194, 242), Color(27, 0, 204), Color(230, 115, 222), Color(127, 0, 17) };
-
-Color Color::sGetDistinctColor(int inIndex)
-{
-	JPH_ASSERT(inIndex >= 0);
-
-	return sColors[inIndex % (sizeof(sColors) / sizeof(uint32))];
-}
-
-JPH_NAMESPACE_END

package/native/third_party/JoltPhysics/Jolt/Core/Color.h

@@ -1,98 +0,0 @@
-// Jolt Physics Library (https://github.com/jrouwe/JoltPhysics)
-// SPDX-FileCopyrightText: 2021 Jorrit Rouwe
-// SPDX-License-Identifier: MIT
-
-#pragma once
-
-JPH_NAMESPACE_BEGIN
-
-class Color;
-
-/// Type to use for passing arguments to a function
-using ColorArg = Color;
-
-/// Class that holds an RGBA color with 8-bits per component
-class JPH_EXPORT_GCC_BUG_WORKAROUND [[nodiscard]] Color
-{
-public:
-	/// Constructors
-							Color() = default; ///< Intentionally not initialized for performance reasons
-							Color(const Color &inRHS) = default;
-	Color &					operator = (const Color &inRHS) = default;
-	explicit constexpr		Color(uint32 inColor)													: mU32(inColor) { }
-	constexpr				Color(uint8 inRed, uint8 inGreen, uint8 inBlue, uint8 inAlpha = 255)	: r(inRed), g(inGreen), b(inBlue), a(inAlpha) { }
-	constexpr				Color(ColorArg inRHS, uint8 inAlpha)									: r(inRHS.r), g(inRHS.g), b(inRHS.b), a(inAlpha) { }
-
-	/// Comparison
-	inline bool				operator == (ColorArg inRHS) const										{ return mU32 == inRHS.mU32; }
-	inline bool				operator != (ColorArg inRHS) const										{ return mU32 != inRHS.mU32; }
-
-	/// Convert to uint32
-	uint32					GetUInt32() const														{ return mU32; }
-
-	/// Element access, 0 = red, 1 = green, 2 = blue, 3 = alpha
-	inline uint8			operator () (uint inIdx) const											{ JPH_ASSERT(inIdx < 4); return (&r)[inIdx]; }
-	inline uint8 &			operator () (uint inIdx)												{ JPH_ASSERT(inIdx < 4); return (&r)[inIdx]; }
-
-	/// Multiply two colors
-	inline Color			operator * (const Color &inRHS) const									{ return Color(uint8((uint32(r) * inRHS.r) >> 8), uint8((uint32(g) * inRHS.g) >> 8), uint8((uint32(b) * inRHS.b) >> 8), uint8((uint32(a) * inRHS.a) >> 8)); }
-
-	/// Multiply color with intensity in the range [0, 1]
-	inline Color			operator * (float inIntensity) const									{ return Color(uint8(r * inIntensity), uint8(g * inIntensity), uint8(b * inIntensity), a); }
-
-	/// Convert to Vec4 with range [0, 1]
-	inline Vec4				ToVec4() const															{ return Vec4(r, g, b, a) / 255.0f; }
-
-	/// Get grayscale intensity of color
-	inline uint8			GetIntensity() const													{ return uint8((uint32(r) * 54 + g * 183 + b * 19) >> 8); }
-
-	/// Get a visually distinct color
-	static Color			sGetDistinctColor(int inIndex);
-
-	/// Get a color value on the gradient from green through yellow to red
-	/// @param inValue Value in the range [0, 1], 0 = green, 0.5 = yellow, 1 = red
-	static Color			sGreenRedGradient(float inValue)
-	{
-		if (inValue < 0.0f)
-			return Color::sGreen;
-		else if (inValue < 0.5f)
-			return Color(uint8(510.0f * inValue), 255, 0);
-		else if (inValue < 1.0f)
-			return Color(255, uint8(510.0f * (1.0f - inValue)), 0);
-		else
-			return Color::sRed;
-	}
-
-	/// Predefined colors
-	static const Color		sBlack;
-	static const Color		sDarkRed;
-	static const Color		sRed;
-	static const Color		sDarkGreen;
-	static const Color		sGreen;
-	static const Color		sDarkBlue;
-	static const Color		sBlue;
-	static const Color		sYellow;
-	static const Color		sPurple;
-	static const Color		sCyan;
-	static const Color		sOrange;
-	static const Color		sDarkOrange;
-	static const Color		sGrey;
-	static const Color		sLightGrey;
-	static const Color		sWhite;
-
-	union
-	{
-		uint32				mU32;																	///< Combined value for red, green, blue and alpha
-		struct
-		{
-			uint8			r;																		///< Red channel
-			uint8			g;																		///< Green channel
-			uint8			b;																		///< Blue channel
-			uint8			a;																		///< Alpha channel
-		};
-	};
-};
-
-static_assert(std::is_trivial<Color>(), "Is supposed to be a trivial type!");
-
-JPH_NAMESPACE_END