This chapter represents documentation about basic elements. More...

Topics
	Iterators
	simple alternative to boost/iterator_range

Classes
class	MR::BitSet
	container of bits More...

class	MR::TaggedBitSet< T >
	container of bits representing specific indices (faces, verts or edges) More...

class	MR::SetBitIteratorT< T >
	iterator to enumerate all indices with set bits in BitSet class or its derivatives More...

class	MR::Buffer< V, I >
	std::vector<V>-like container that is 1) resized without initialization of its elements, 2) much simplified: no push_back and many other methods More...

class	MR::Heap< T, I, P >
	stores map from element id in[0, size) to T; More...

class	MR::Logger
	Make default spd logger. More...

class	MR::LoggingStreambuf
	A custom streambuf that outputs things directly to the default `spdlog` logger. More...

class	MR::RestoringStreamsSink

class	MR::Timer

struct	MR::SimpleTimeRecord

struct	MR::TimeRecord

struct	MR::ThreadRootTimeRecord

class	MR::UnionFind< I >
	Simple union find data structure. More...

class	MR::Vector< T, I >
	std::vector<T>-like container that requires specific indexing type, More...

Functions
MRMESH_API bool	MR::operator== (const BitSet &a, const BitSet &b)
	compare that two bit sets have the same set bits (they can be equal even if sizes are distinct but last bits are off)

template<typename T >
bool	MR::operator== (const TaggedBitSet< T > &a, const TaggedBitSet< T > &b)

template<typename T , typename U >
void	MR::operator== (const TaggedBitSet< T > &a, const TaggedBitSet< U > &b)=delete
	prohibit comparison of unrelated sets

template<typename T >
std::function< bool(Id< T >)>	MR::makePredicate (const TaggedBitSet< T > *bitset)

template<typename T >
std::function< bool(Id< T >)>	MR::makePredicate (const TaggedBitSet< T > &bitset)

template<typename T >
bool	MR::contains (const TaggedBitSet< T > *bitset, Id< T > id)

template<typename T >
bool	MR::contains (const TaggedBitSet< T > &bitset, Id< T > id)

template<typename T >
bool	MR::operator== (const SetBitIteratorT< T > &a, const SetBitIteratorT< T > &b)

template<typename T >
bool	MR::operator!= (const SetBitIteratorT< T > &a, const SetBitIteratorT< T > &b)

auto	MR::begin (const BitSet &a)

auto	MR::end (const BitSet &)

template<typename T >
auto	MR::begin (const TaggedBitSet< T > &a)

template<typename T >
auto	MR::end (const TaggedBitSet< T > &)

template<typename T >
Vector< int, Id< T > >	MR::makeVectorWithSeqNums (const TaggedBitSet< T > &bs)
	creates a Vector where for each set bit of input bitset its sequential number starting from 0 is returned; and -1 for reset bits

template<typename T >
HashMap< Id< T >, int >	MR::makeHashMapWithSeqNums (const TaggedBitSet< T > &bs)
	creates a HashMap where for each set bit of input bitset its sequential number starting from 0 is returned

BitSet	MR::operator& (const BitSet &a, const BitSet &b)

BitSet	MR::operator\| (const BitSet &a, const BitSet &b)

BitSet	MR::operator^ (const BitSet &a, const BitSet &b)

BitSet	MR::operator- (const BitSet &a, const BitSet &b)

template<typename T >
TaggedBitSet< T >	MR::operator& (const TaggedBitSet< T > &a, const TaggedBitSet< T > &b)

template<typename T >
TaggedBitSet< T >	MR::operator\| (const TaggedBitSet< T > &a, const TaggedBitSet< T > &b)

template<typename T >
TaggedBitSet< T >	MR::operator^ (const TaggedBitSet< T > &a, const TaggedBitSet< T > &b)

template<typename T >
TaggedBitSet< T >	MR::operator- (const TaggedBitSet< T > &a, const TaggedBitSet< T > &b)

template<typename IndexType , typename F >
void	MR::BitSetParallelForAll (IndexType begin, IndexType end, F f)

template<typename BS , typename F >
void	MR::BitSetParallelForAll (const BS &bs, F f)

template<typename BS , typename F >
void	MR::BitSetParallelForAllRanged (const BS &bs, F f)

template<typename BS , typename F >
bool	MR::BitSetParallelForAllRanged (const BS &bs, F f, ProgressCallback progressCb, size_t reportProgressEveryBit=1024)

template<typename BS , typename F >
bool	MR::BitSetParallelForAll (const BS &bs, F f, ProgressCallback progressCb, size_t reportProgressEveryBit=1024)

template<typename BS , typename F , typename ... Cb>
auto	MR::BitSetParallelFor (const BS &bs, F f, Cb &&... cb)

template<typename BS , typename F , typename ... Cb>
auto	MR::BitSetParallelForReset (const BS &bs, F f, Cb &&... cb)

template<typename T >
size_t	MR::heapBytes (const std::vector< T > &vec)
	returns the amount of memory given vector occupies on heap

template<typename T >
size_t	MR::heapBytes (const std::unique_ptr< T > &ptr)
	returns the amount of memory this smart pointer and its pointed object own together on heap

template<typename T >
size_t	MR::heapBytes (const std::shared_ptr< T > &ptr)
	returns the amount of memory this smart pointer and its pointed object own together on heap

MRMESH_API void	MR::setupLoggerByDefault ()

MRMESH_API void	MR::redirectSTDStreamsToLogger ()

MRMESH_API void	MR::printStacktraceOnCrash ()
	Print stacktrace on application crash.

template<typename I , typename F >
void	MR::ParallelFor (I begin, I end, F &&f)
	executes given function f for each span element [begin, end)

template<typename I , typename F >
bool	MR::ParallelFor (I begin, I end, F &&f, ProgressCallback cb, size_t reportProgressEvery=1024)
	executes given function f for each span element [begin, end)

template<typename T , typename ... F>
auto	MR::ParallelFor (const std::vector< T > &v, F &&... f)
	executes given function f for each vector element in parallel threads

template<typename T , typename I , typename ... F>
auto	MR::ParallelFor (const Vector< T, I > &v, F &&... f)
	executes given function f for each vector element in parallel threads

template<typename T >
std::pair< T, T >	MR::parallelMinMax (const std::vector< T > &vec, const T *topExcluding=nullptr)

template<typename T , typename I >
auto	MR::parallelMinMaxArg (const Vector< T, I > &vec, const T *topExcluding=nullptr)

MRMESH_API void	MR::vertMapsComposition (VertMap &a2b, const VertMap &b2c)
	updates a2b map to a2c map using b2c map

MRMESH_API VertMap	MR::vertMapsComposition (const VertMap &a2b, const VertMap &b2c)
	returns map a2c from a2b and b2c maps

MRMESH_API void	MR::edgeMapsComposition (EdgeMap &a2b, const EdgeMap &b2c)
	updates a2b map to a2c map using b2c map

MRMESH_API EdgeMap	MR::edgeMapsComposition (const EdgeMap &a2b, const EdgeMap &b2c)
	returns map a2c from a2b and b2c maps

MRMESH_API void	MR::faceMapsComposition (FaceMap &a2b, const FaceMap &b2c)
	updates a2b map to a2c map using b2c map

MRMESH_API FaceMap	MR::faceMapsComposition (const FaceMap &a2b, const FaceMap &b2c)
	returns map a2c from a2b and b2c maps

MRMESH_API size_t	MR::findSubstringCaseInsensitive (const std::string &string, const std::string &substring)

MRMESH_API int	MR::calcDamerauLevenshteinDistance (const std::string &stringA, const std::string &stringB, bool caseSensitive=true)

MRMESH_API std::vector< std::string >	MR::split (const std::string &string, const std::string &delimiter)

MRMESH_API std::wstring	MR::utf8ToWide (const char *utf8)
	converts UTF8-encoded string into UTF16-encoded string

MRMESH_API std::string	MR::systemToUtf8 (const std::string &system)
	converts system encoded string to UTF8-encoded string

MRMESH_API std::string	MR::utf8ToSystem (const std::string &utf8)

MRMESH_API std::string	MR::wideToUtf8 (const wchar_t *wide)
	converts wide null terminating string to UTF8-encoded string

const std::string &	MR::asString (const std::string &s)

const std::string &	MR::asU8String (const std::string &s)

std::string	MR::asString (std::string &&s)

std::string	MR::asU8String (std::string &&s)

std::filesystem::path	MR::pathFromUtf8 (const std::string &s)

std::filesystem::path	MR::pathFromUtf8 (const char *s)

std::string	MR::utf8string (const std::filesystem::path &path)
	returns filename as UTF8-encoded string

MRMESH_API void	MR::printTimingTreeAtEnd (bool on, double minTimeSec=0.1)

MRMESH_API void	MR::printCurrentTimerBranch ()
	prints current timer branch

MRMESH_API void	MR::printTimingTreeAndStop (double minTimeSec=0.1)

MRMESH_API void	MR::registerThreadRootTimeRecord (ThreadRootTimeRecord &root)
	installs given record in the current thread (no record must be installed before)

MRMESH_API void	MR::unregisterThreadRootTimeRecord (ThreadRootTimeRecord &root)
	un-installs given record in the current thread

template<typename M >
TaggedBitSet< T >	MR::TaggedBitSet< T >::getMapping (const M &map) const

template<typename M >
TaggedBitSet< T >	MR::TaggedBitSet< T >::getMapping (const M &map, size_t resSize) const

	MR::Heap< T, I, P >::Heap (size_t size, T def={}, P pred={})
	constructs heap for given number of elements, assigning given default value to each element

	MR::Heap< T, I, P >::Heap (std::vector< Element > elms, P pred={})
	constructs heap from given elements (id's shall not repeat and have spaces, but can be arbitrary shuffled)

void	MR::Heap< T, I, P >::resize (size_t size, T def={})
	increases the size of the heap by adding elements at the end

void	MR::Heap< T, I, P >::setValue (I elemId, const T &newVal)
	sets new value to given element

void	MR::Heap< T, I, P >::setLargerValue (I elemId, const T &newVal)
	sets new value to given element, which shall be larger/smaller than the current value

void	MR::Heap< T, I, P >::setSmallerValue (I elemId, const T &newVal)

Detailed Description

This chapter represents documentation about basic elements.

Function Documentation

◆ asString() [1/2]

const std::string & MR::asString ( const std::string & s )

inline

◆ asString() [2/2]

std::string MR::asString ( std::string && s )

inline

◆ asU8String() [1/2]

const std::string & MR::asU8String ( const std::string & s )

inline

◆ asU8String() [2/2]

std::string MR::asU8String ( std::string && s )

inline

◆ begin() [1/2]

auto MR::begin ( const BitSet & a )

inline

◆ begin() [2/2]

template<typename T >

auto MR::begin ( const TaggedBitSet< T > & a )

inline

◆ BitSetParallelFor()

template<typename BS , typename F , typename ... Cb>

auto MR::BitSetParallelFor	(	const BS &	bs,
		F	f,
		Cb &&...	cb )

executes given function f for every set bit in bs in parallel threads; it is guaranteed that every individual block in bit-set is processed by one thread only

◆ BitSetParallelForAll() [1/3]

template<typename BS , typename F >

void MR::BitSetParallelForAll	(	const BS &	bs,
		F	f )

executes given function f for each bit in bs in parallel threads; it is guaranteed that every individual block in bit-set is processed by one thread only

◆ BitSetParallelForAll() [2/3]

template<typename BS , typename F >

bool MR::BitSetParallelForAll	(	const BS &	bs,
		F	f,
		ProgressCallback	progressCb,
		size_t	reportProgressEveryBit = 1024 )

executes given function f for each bit in bs in parallel threads; it is guaranteed that every individual block in bit-set is processed by one thread only; reports progress from calling thread only;

Returns: false if the processing was canceled by progressCb

◆ BitSetParallelForAll() [3/3]

template<typename IndexType , typename F >

void MR::BitSetParallelForAll	(	IndexType	begin,
		IndexType	end,
		F	f )

executes given function f for each index in [begin, end) in parallel threads; it is guaranteed that every individual block in BitSet is processed by one thread only

◆ BitSetParallelForAllRanged() [1/2]

template<typename BS , typename F >

void MR::BitSetParallelForAllRanged	(	const BS &	bs,
		F	f )

executes given function f( IndexId, rangeBeginId, rangeEndId ) for each bit in bs in parallel threads; rangeBeginId, rangeEndId - boundaries of thread range in parallel processing it is guaranteed that every individual block in bit-set is processed by one thread only;

◆ BitSetParallelForAllRanged() [2/2]

template<typename BS , typename F >

bool MR::BitSetParallelForAllRanged	(	const BS &	bs,
		F	f,
		ProgressCallback	progressCb,
		size_t	reportProgressEveryBit = 1024 )

executes given function f( IndexId, rangeBeginId, rangeEndId ) for each bit in bs in parallel threads; rangeBeginId, rangeEndId - boundaries of thread range in parallel processing it is guaranteed that every individual block in bit-set is processed by one thread only; reports progress from calling thread only;

Returns: false if the processing was canceled by progressCb

◆ BitSetParallelForReset()

template<typename BS , typename F , typename ... Cb>

auto MR::BitSetParallelForReset	(	const BS &	bs,
		F	f,
		Cb &&...	cb )

executes given function f for every reset bit in bs in parallel threads; it is guaranteed that every individual block in bit-set is processed by one thread only

◆ calcDamerauLevenshteinDistance()

MRMESH_API int MR::calcDamerauLevenshteinDistance	(	const std::string &	stringA,
		const std::string &	stringB,
		bool	caseSensitive = true )

Calculates Damerau-Levenshtein distance between to strings

◆ contains() [1/2]

template<typename T >

bool MR::contains	(	const TaggedBitSet< T > &	bitset,
		Id< T >	id )

inline

◆ contains() [2/2]

template<typename T >

bool MR::contains	(	const TaggedBitSet< T > *	bitset,
		Id< T >	id )

inline

◆ edgeMapsComposition() [1/2]

MRMESH_API EdgeMap MR::edgeMapsComposition	(	const EdgeMap &	a2b,
		const EdgeMap &	b2c )

returns map a2c from a2b and b2c maps

◆ edgeMapsComposition() [2/2]

MRMESH_API void MR::edgeMapsComposition	(	EdgeMap &	a2b,
		const EdgeMap &	b2c )

updates a2b map to a2c map using b2c map

◆ end() [1/2]

auto MR::end ( const BitSet & )

inline

◆ end() [2/2]

template<typename T >

auto MR::end ( const TaggedBitSet< T > & )

inline

◆ faceMapsComposition() [1/2]

MRMESH_API FaceMap MR::faceMapsComposition	(	const FaceMap &	a2b,
		const FaceMap &	b2c )

returns map a2c from a2b and b2c maps

◆ faceMapsComposition() [2/2]

MRMESH_API void MR::faceMapsComposition	(	FaceMap &	a2b,
		const FaceMap &	b2c )

updates a2b map to a2c map using b2c map

◆ findSubstringCaseInsensitive()

MRMESH_API size_t MR::findSubstringCaseInsensitive	(	const std::string &	string,
		const std::string &	substring )

Finds the substring in the string.

Returns: position, npos if not found

◆ getMapping() [1/2]

template<typename T >

template<typename M >

TaggedBitSet< T > MR::TaggedBitSet< T >::getMapping ( const M & map ) const

◆ getMapping() [2/2]

template<typename T >

template<typename M >

TaggedBitSet< T > MR::TaggedBitSet< T >::getMapping	(	const M &	map,
		size_t	resSize ) const

◆ Heap() [1/2]

template<typename T , typename I , typename P >

MR::Heap< T, I, P >::Heap	(	size_t	size,
		T	def = {},
		P	pred = {} )

explicit

constructs heap for given number of elements, assigning given default value to each element

◆ Heap() [2/2]

template<typename T , typename I , typename P >

MR::Heap< T, I, P >::Heap	(	std::vector< Element >	elms,
		P	pred = {} )

constructs heap from given elements (id's shall not repeat and have spaces, but can be arbitrary shuffled)

◆ heapBytes() [1/3]

template<typename T >

size_t MR::heapBytes ( const std::shared_ptr< T > & ptr )

inline

returns the amount of memory this smart pointer and its pointed object own together on heap

◆ heapBytes() [2/3]

template<typename T >

size_t MR::heapBytes ( const std::unique_ptr< T > & ptr )

inline

returns the amount of memory this smart pointer and its pointed object own together on heap

◆ heapBytes() [3/3]

template<typename T >

size_t MR::heapBytes ( const std::vector< T > & vec )

inline

returns the amount of memory given vector occupies on heap

◆ makeHashMapWithSeqNums()

template<typename T >

HashMap< Id< T >, int > MR::makeHashMapWithSeqNums ( const TaggedBitSet< T > & bs )

creates a HashMap where for each set bit of input bitset its sequential number starting from 0 is returned

◆ makePredicate() [1/2]

template<typename T >

std::function< bool(Id< T >)> MR::makePredicate ( const TaggedBitSet< T > & bitset )

inline

◆ makePredicate() [2/2]

template<typename T >

std::function< bool(Id< T >)> MR::makePredicate ( const TaggedBitSet< T > * bitset )

inline

◆ makeVectorWithSeqNums()

template<typename T >

Vector< int, Id< T > > MR::makeVectorWithSeqNums ( const TaggedBitSet< T > & bs )

creates a Vector where for each set bit of input bitset its sequential number starting from 0 is returned; and -1 for reset bits

◆ operator!=()

template<typename T >

bool MR::operator!=	(	const SetBitIteratorT< T > &	a,
		const SetBitIteratorT< T > &	b )

inline

◆ operator&() [1/2]

BitSet MR::operator&	(	const BitSet &	a,
		const BitSet &	b )

inline

◆ operator&() [2/2]

template<typename T >

TaggedBitSet< T > MR::operator&	(	const TaggedBitSet< T > &	a,
		const TaggedBitSet< T > &	b )

inline

◆ operator-() [1/2]

BitSet MR::operator-	(	const BitSet &	a,
		const BitSet &	b )

inline

◆ operator-() [2/2]

template<typename T >

TaggedBitSet< T > MR::operator-	(	const TaggedBitSet< T > &	a,
		const TaggedBitSet< T > &	b )

inline

◆ operator==() [1/4]

MRMESH_API bool MR::operator==	(	const BitSet &	a,
		const BitSet &	b )

compare that two bit sets have the same set bits (they can be equal even if sizes are distinct but last bits are off)

◆ operator==() [2/4]

template<typename T >

bool MR::operator==	(	const SetBitIteratorT< T > &	a,
		const SetBitIteratorT< T > &	b )

inline

◆ operator==() [3/4]

template<typename T >

bool MR::operator==	(	const TaggedBitSet< T > &	a,
		const TaggedBitSet< T > &	b )

inline

◆ operator==() [4/4]

template<typename T , typename U >

void MR::operator==	(	const TaggedBitSet< T > &	a,
		const TaggedBitSet< U > &	b )

delete

prohibit comparison of unrelated sets

◆ operator^() [1/2]

BitSet MR::operator^	(	const BitSet &	a,
		const BitSet &	b )

inline

◆ operator^() [2/2]

template<typename T >

TaggedBitSet< T > MR::operator^	(	const TaggedBitSet< T > &	a,
		const TaggedBitSet< T > &	b )

inline

◆ operator|() [1/2]

BitSet MR::operator\|	(	const BitSet &	a,
		const BitSet &	b )

inline

◆ operator|() [2/2]

template<typename T >

TaggedBitSet< T > MR::operator\|	(	const TaggedBitSet< T > &	a,
		const TaggedBitSet< T > &	b )

inline

◆ ParallelFor() [1/4]

template<typename T , typename ... F>

auto MR::ParallelFor	(	const std::vector< T > &	v,
		F &&...	f )

inline

executes given function f for each vector element in parallel threads

◆ ParallelFor() [2/4]

template<typename T , typename I , typename ... F>

auto MR::ParallelFor	(	const Vector< T, I > &	v,
		F &&...	f )

inline

executes given function f for each vector element in parallel threads

◆ ParallelFor() [3/4]

template<typename I , typename F >

void MR::ParallelFor	(	I	begin,
		I	end,
		F &&	f )

executes given function f for each span element [begin, end)

◆ ParallelFor() [4/4]

template<typename I , typename F >

bool MR::ParallelFor	(	I	begin,
		I	end,
		F &&	f,
		ProgressCallback	cb,
		size_t	reportProgressEvery = 1024 )

executes given function f for each span element [begin, end)

◆ parallelMinMax()

template<typename T >

std::pair< T, T > MR::parallelMinMax	(	const std::vector< T > &	vec,
		const T *	topExcluding = nullptr )

finds minimal and maximal elements in given vector in parallel;

Parameters

topExcluding if provided then all values in the array equal or larger by absolute value than it will be ignored

◆ parallelMinMaxArg()

template<typename T , typename I >

auto MR::parallelMinMaxArg	(	const Vector< T, I > &	vec,
		const T *	topExcluding = nullptr )

finds minimal and maximal elements and their indices in given vector in parallel;

Parameters

topExcluding if provided then all values in the array equal or larger by absolute value than it will be ignored

◆ pathFromUtf8() [1/2]

std::filesystem::path MR::pathFromUtf8 ( const char * s )

inline

◆ pathFromUtf8() [2/2]

std::filesystem::path MR::pathFromUtf8 ( const std::string & s )

inline

◆ printCurrentTimerBranch()

MRMESH_API void MR::printCurrentTimerBranch ( )

prints current timer branch

◆ printStacktraceOnCrash()

MRMESH_API void MR::printStacktraceOnCrash ( )

Print stacktrace on application crash.

◆ printTimingTreeAndStop()

MRMESH_API void MR::printTimingTreeAndStop ( double minTimeSec = 0.1 )

prints the current timing tree, then calls printTimingTreeAtEnd( false );

Parameters

minTimeSec omit printing records with time spent less than given value in seconds

◆ printTimingTreeAtEnd()

MRMESH_API void MR::printTimingTreeAtEnd	(	bool	on,
		double	minTimeSec = 0.1 )

enables or disables printing of timing tree when application terminates

Parameters

minTimeSec omit printing records with time spent less than given value in seconds

◆ redirectSTDStreamsToLogger()

MRMESH_API void MR::redirectSTDStreamsToLogger ( )

Redirects stdcout stdcerr stdclog to default logger

Note: do not call this function directly if you use MR::setupLoggerByDefault()

◆ registerThreadRootTimeRecord()

MRMESH_API void MR::registerThreadRootTimeRecord ( ThreadRootTimeRecord & root )

installs given record in the current thread (no record must be installed before)

◆ resize()

template<typename T , typename I , typename P >

void MR::Heap< T, I, P >::resize	(	size_t	size,
		T	def = {} )

increases the size of the heap by adding elements at the end

◆ setLargerValue()

template<typename T , typename I , typename P >

void MR::Heap< T, I, P >::setLargerValue	(	I	elemId,
		const T &	newVal )

sets new value to given element, which shall be larger/smaller than the current value

◆ setSmallerValue()

template<typename T , typename I , typename P >

void MR::Heap< T, I, P >::setSmallerValue	(	I	elemId,
		const T &	newVal )

◆ setupLoggerByDefault()

MRMESH_API void MR::setupLoggerByDefault ( )

Setups logger: 1) makes stdout sink 2) makes file sink (MRLog.txt) 3) redirect std streams to logger 4) print stacktrace on crash (not in wasm) log level - trace

◆ setValue()

template<typename T , typename I , typename P >

void MR::Heap< T, I, P >::setValue	(	I	elemId,
		const T &	newVal )

sets new value to given element

◆ split()

MRMESH_API std::vector< std::string > MR::split	(	const std::string &	string,
		const std::string &	delimiter )

Splits given string by delimiter.

Returns: vector of split strings

◆ systemToUtf8()

MRMESH_API std::string MR::systemToUtf8 ( const std::string & system )

converts system encoded string to UTF8-encoded string

◆ unregisterThreadRootTimeRecord()

MRMESH_API void MR::unregisterThreadRootTimeRecord ( ThreadRootTimeRecord & root )

un-installs given record in the current thread

◆ utf8string()

std::string MR::utf8string ( const std::filesystem::path & path )

inline

returns filename as UTF8-encoded string

◆ utf8ToSystem()

MRMESH_API std::string MR::utf8ToSystem ( const std::string & utf8 )

converts UTF8-encoded string to system encoded string, returns empty string if such conversion cannot be made

◆ utf8ToWide()

MRMESH_API std::wstring MR::utf8ToWide ( const char * utf8 )

converts UTF8-encoded string into UTF16-encoded string

◆ vertMapsComposition() [1/2]

MRMESH_API VertMap MR::vertMapsComposition	(	const VertMap &	a2b,
		const VertMap &	b2c )

returns map a2c from a2b and b2c maps

◆ vertMapsComposition() [2/2]

MRMESH_API void MR::vertMapsComposition	(	VertMap &	a2b,
		const VertMap &	b2c )

updates a2b map to a2c map using b2c map

◆ wideToUtf8()

MRMESH_API std::string MR::wideToUtf8 ( const wchar_t * wide )

converts wide null terminating string to UTF8-encoded string

Topics

Classes

Functions

Detailed Description

Function Documentation

◆ asString() [1/2]

◆ asString() [2/2]

◆ asU8String() [1/2]

◆ asU8String() [2/2]

◆ begin() [1/2]

◆ begin() [2/2]

◆ BitSetParallelFor()

◆ BitSetParallelForAll() [1/3]

◆ BitSetParallelForAll() [2/3]

◆ BitSetParallelForAll() [3/3]

◆ BitSetParallelForAllRanged() [1/2]

◆ BitSetParallelForAllRanged() [2/2]

◆ BitSetParallelForReset()

◆ calcDamerauLevenshteinDistance()

◆ contains() [1/2]

◆ contains() [2/2]

◆ edgeMapsComposition() [1/2]

◆ edgeMapsComposition() [2/2]

◆ end() [1/2]

◆ end() [2/2]

◆ faceMapsComposition() [1/2]

◆ faceMapsComposition() [2/2]

◆ findSubstringCaseInsensitive()

◆ getMapping() [1/2]

◆ getMapping() [2/2]

◆ Heap() [1/2]

◆ Heap() [2/2]

◆ heapBytes() [1/3]

◆ heapBytes() [2/3]

◆ heapBytes() [3/3]

◆ makeHashMapWithSeqNums()

◆ makePredicate() [1/2]

◆ makePredicate() [2/2]

◆ makeVectorWithSeqNums()

◆ operator!=()

◆ operator&() [1/2]

◆ operator&() [2/2]

◆ operator-() [1/2]

◆ operator-() [2/2]

◆ operator==() [1/4]

◆ operator==() [2/4]

◆ operator==() [3/4]

◆ operator==() [4/4]

◆ operator^() [1/2]

◆ operator^() [2/2]

◆ operator|() [1/2]

◆ operator|() [2/2]

◆ ParallelFor() [1/4]

◆ ParallelFor() [2/4]

◆ ParallelFor() [3/4]

◆ ParallelFor() [4/4]

◆ parallelMinMax()

◆ parallelMinMaxArg()

◆ pathFromUtf8() [1/2]

◆ pathFromUtf8() [2/2]

◆ printCurrentTimerBranch()

◆ printStacktraceOnCrash()

◆ printTimingTreeAndStop()

◆ printTimingTreeAtEnd()

◆ redirectSTDStreamsToLogger()

◆ registerThreadRootTimeRecord()

◆ resize()

◆ setLargerValue()

◆ setSmallerValue()

◆ setupLoggerByDefault()

◆ setValue()

◆ split()

◆ systemToUtf8()

◆ unregisterThreadRootTimeRecord()

◆ utf8string()

◆ utf8ToSystem()

◆ utf8ToWide()

◆ vertMapsComposition() [1/2]

◆ vertMapsComposition() [2/2]

◆ wideToUtf8()