Home
last modified time | relevance | path

Searched refs:m (Results 1 – 3 of 3) sorted by relevance

/TaskScheduler/ThirdParty/Squish/
H A Dmaths.cpp71 Sym3x3 m; in GetMultiplicity1Evector() local
81 u[0] = m[3]*m[5] - m[4]*m[4]; in GetMultiplicity1Evector()
82 u[1] = m[2]*m[4] - m[1]*m[5]; in GetMultiplicity1Evector()
83 u[2] = m[1]*m[4] - m[2]*m[3]; in GetMultiplicity1Evector()
84 u[3] = m[0]*m[5] - m[2]*m[2]; in GetMultiplicity1Evector()
85 u[4] = m[1]*m[2] - m[4]*m[0]; in GetMultiplicity1Evector()
86 u[5] = m[0]*m[3] - m[1]*m[1]; in GetMultiplicity1Evector()
145 return Vec3( -m[1], m[0], 0.0f ); in GetMultiplicity2Evector()
148 return Vec3( m[2], 0.0f, -m[0] ); in GetMultiplicity2Evector()
152 return Vec3( 0.0f, -m[4], m[3] ); in GetMultiplicity2Evector()
[all …]
H A Dclusterfit.cpp231 for( int m = 0; m < besti; ++m ) in Compress3() local
232 unordered[order[m]] = 0; in Compress3()
233 for( int m = besti; m < bestj; ++m ) in Compress3() local
234 unordered[order[m]] = 2; in Compress3()
235 for( int m = bestj; m < count; ++m ) in Compress3() local
236 unordered[order[m]] = 1; in Compress3()
374 for( int m = 0; m < besti; ++m ) in Compress4() local
375 unordered[order[m]] = 0; in Compress4()
376 for( int m = besti; m < bestj; ++m ) in Compress4() local
378 for( int m = bestj; m < bestk; ++m ) in Compress4() local
[all …]
/TaskScheduler/Scheduler/Doxygen/
H A DDoxyfile787 # *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc, *.m, *.markdown,
817 *.m \