/dports/math/adept/adept-2.0.8/include/adept/ |
H A D | Stack.h | 81 Gap(uIndex start_, uIndex end_) : start(start_), end(end_) {} in Gap() 82 uIndex start; 83 uIndex end; 220 uIndex register_gradients(const uIndex& n) { in register_gradients() 282 uIndex do_register_gradients(const uIndex& n); 293 set_gradients(uIndex start, uIndex end_plus_one, in set_gradients() 313 get_gradients(uIndex start, uIndex end_plus_one, in get_gradients() 328 get_gradients(uIndex start, uIndex end_plus_one, in get_gradients() 586 void add_derivative_dependence(uIndex lhs_index, uIndex rhs_index, in add_derivative_dependence() 677 uIndex mg = 0; in max_gradient_index() [all …]
|
H A D | StackStorage.h | 43 uIndex n; 44 const uIndex n_allocated; 50 index = new uIndex[n_]; in StatementBlock() 58 uIndex* index; 59 uIndex n; 60 uIndex n_allocated 67 uIndex statement_start; 68 uIndex statement_end; 133 void push_lhs_range(const uIndex& first, const uIndex& n, 154 template<uIndex n> [all …]
|
H A D | StackStorageOrig.h | 85 void push_lhs(const uIndex& gradient_index) { in push_lhs() 102 void push_lhs_range(const uIndex& first, uIndex n, uIndex stride = 1) { 103 uIndex last_plus_1 = first+n*stride; 109 for (uIndex i = first; i < last_plus_1; i += stride) { 117 void check_space(uIndex n) { in check_space() 122 template<uIndex n> 137 void initialize(uIndex n) { in initialize() 139 index_ = new uIndex[n]; in initialize() 148 void grow_operation_stack(uIndex min = 0); 149 void grow_statement_stack(uIndex min = 0); [all …]
|
H A D | StackStorageOrigStl.h | 73 void push_lhs(const uIndex& gradient_index) { in push_lhs() 83 void push_lhs_range(const uIndex& first, const uIndex& n, 84 const uIndex& stride = 1) { 85 uIndex last_plus_1 = first+n*stride; 86 for (uIndex i = first; i < last_plus_1; i += stride) { 94 void check_space(const uIndex& n) { } in check_space() 95 template<uIndex n> void check_space_static() { } in check_space_static() 112 void initialize(uIndex n) { in initialize() 121 void grow_operation_stack(uIndex min = 0); 122 void grow_statement_stack(uIndex min = 0); [all …]
|
/dports/math/adept/adept-2.0.8/adept/ |
H A D | jacobian.cpp | 89 uIndex n_extra) const in jacobian_forward_kernel_extra() 101 for (uIndex i = 0; i < n_extra; i++) { in jacobian_forward_kernel_extra() 151 uIndex block_size = MULTIPASS_SIZE; in jacobian_forward_openmp() 362 uIndex block_size = MULTIPASS_SIZE; in jacobian_reverse_openmp() 391 uIndex i_non_zero[MULTIPASS_SIZE]; in jacobian_reverse_openmp() 393 uIndex n_non_zero = 0; in jacobian_reverse_openmp() 525 uIndex i_non_zero[MULTIPASS_SIZE]; in jacobian_reverse() 527 uIndex n_non_zero = 0; in jacobian_reverse() 599 uIndex i_non_zero[MULTIPASS_SIZE]; in jacobian_reverse() 601 uIndex n_non_zero = 0; in jacobian_reverse() [all …]
|
H A D | StackStorageOrig.cpp | 45 StackStorageOrig::grow_operation_stack(uIndex min) in grow_operation_stack() 47 uIndex new_size = 2*n_allocated_operations_; in grow_operation_stack() 52 uIndex* new_index = new uIndex[new_size]; in grow_operation_stack() 55 std::memcpy(new_index, index_, n_operations_*sizeof(uIndex)); in grow_operation_stack() 68 StackStorageOrig::grow_statement_stack(uIndex min) in grow_statement_stack() 70 uIndex new_size = 2*n_allocated_statements_; in grow_statement_stack()
|
/dports/misc/gpsim/gpsim-0.31.0/src/ |
H A D | ValueCollections.h | 91 return uIndex >= GetLowerBound() && uIndex <= GetUpperBound(); in bIsIndexInRange() 101 return GetAt(uIndex); 117 unsigned int uIndex; variable 121 for (uIndex = uFirstIndex + 1; uIndex < uUpper; uIndex++) { 133 uIndex--; 193 for (unsigned int uIndex = 0; uIndex < uSize; uIndex++) { variable 212 return GetAt(uIndex); in GetAt() 217 if (uIndex <= GetUpperBound() && uIndex >= m_uLower) { in GetAt() 236 if ((uIndex + 1 - m_uLower) < m_Array.size() && uIndex >= m_uLower) { in SetAt() 256 return GetAt(uIndex); [all …]
|
H A D | ValueCollections.cc | 60 for (unsigned int uIndex = GetLowerBound(); uIndex < uUpper; uIndex++) { in Set() local 61 SetAt(uIndex, pValue); in Set() 87 for (unsigned int uIndex = pRange->get_leftVal(); uIndex < uEnd; uIndex++) { in SetAt() local 88 SetAt(uIndex, pValue); in SetAt() 155 for (unsigned int uIndex = pRange->get_leftVal(); uIndex < uEnd; uIndex++) { in toString() local 156 Value &Value = GetAt(uIndex); in toString() 193 unsigned int uIndex = (unsigned int)pInt->getVal(); in toString() local 195 if (bIsIndexInRange(uIndex)) { in toString() 196 Value &Value = GetAt(uIndex); in toString() 200 sOut << "Error: Index " << uIndex << " is out of range" << '\n'; in toString()
|
H A D | registers.cc | 604 Value &RegisterCollection::GetAt(unsigned int uIndex, Value *) in GetAt() argument 606 if (uIndex > m_uSize) { in GetAt() 610 m_ReturnValue.set((int)m_ppRegisters[uIndex]->get_value()); in GetAt() 627 if (uIndex > m_uSize) { in SetAt() 637 m_ppRegisters[uIndex]->put((unsigned int)(int)*pInt); in SetAt() 647 unsigned int uIndex; in ConsolidateValues() local 652 for (uIndex = 0; uIndex < m_uSize; uIndex++) { in ConsolidateValues() 653 pReg = m_ppRegisters[uIndex]; in ConsolidateValues() 659 uFirstIndex = uIndex; in ConsolidateValues() 664 uIndex--; in ConsolidateValues() [all …]
|
H A D | processor.cc | 698 if (uIndex < program_memory_size()) { in init_program_memory() 699 …if (program_memory[uIndex] != 0 && program_memory[uIndex]->isa() != instruction::INVALID_INSTRUCTI… in init_program_memory() 701 delete program_memory[uIndex]; in init_program_memory() 706 if (program_memory[uIndex] == 0) { in init_program_memory() 734 if (uIndex < program_memory_size()) { in erase_program_memory() 735 …if (program_memory[uIndex] != 0 && program_memory[uIndex]->isa() != instruction::INVALID_INSTRUCTI… in erase_program_memory() 736 delete program_memory[uIndex]; in erase_program_memory() 768 return (uIndex < program_memory_size() && program_memory[uIndex]) in get_program_memory_at_address() 1968 return getFromIndex(uIndex); in getFromAddress() 2136 putToIndex(uIndex, new_inst); in put_opcode() [all …]
|
/dports/devel/apitrace/apitrace-9.0/thirdparty/directxtex/DirectXTex/ |
H A D | BC4BC5.cpp | 52 if (uIndex == 0) in DecodeFromIndex() 54 if (uIndex == 1) in DecodeFromIndex() 60 uIndex -= 1; in DecodeFromIndex() 61 return (fred_0 * (7-uIndex) + fred_1 * uIndex) / 7.0f; in DecodeFromIndex() 69 uIndex -= 1; in DecodeFromIndex() 70 return (fred_0 * (5-uIndex) + fred_1 * uIndex) / 5.0f; in DecodeFromIndex() 111 if (uIndex == 0) in DecodeFromIndex() 120 return (fred_0 * (7-uIndex) + fred_1 * uIndex) / 7.0f; in DecodeFromIndex() 129 return (fred_0 * (5-uIndex) + fred_1 * uIndex) / 5.0f; in DecodeFromIndex() 326 for (size_t uIndex = 0; uIndex < 8; uIndex++) in FindClosestUNORM() local [all …]
|
/dports/biology/muscle/muscle-3.8.1551/ |
H A D | anchors.cpp | 57 for (unsigned uIndex = 0; uIndex < uCount; ++uIndex) in FindBestColsGrade() local 58 scoreTotal += Score[uIndex]; in FindBestColsGrade() 62 for (unsigned uIndex = 0; uIndex < uCount; ++uIndex) in FindBestColsGrade() local 63 if (Score[uIndex] > scoreMax) in FindBestColsGrade() 64 scoreMax = Score[uIndex]; in FindBestColsGrade() 67 for (unsigned uIndex = 0; uIndex < uCount; ++uIndex) in FindBestColsGrade() local 69 const SCORE s = Score[uIndex]; in FindBestColsGrade() 91 for (unsigned uIndex = 0; uIndex < uColCount; ++uIndex) in FindBestColsCombo() local 93 if (Score[uIndex] < dMinScore) in FindBestColsCombo() 97 if (msa.ColumnHasGap(uIndex)) in FindBestColsCombo() [all …]
|
H A D | distfunc.cpp | 71 assert(uIndex < m_uCount); in SetName() 72 m_Names[uIndex] = strsave(szName); in SetName() 75 void DistFunc::SetId(unsigned uIndex, unsigned uId) in SetId() argument 77 assert(uIndex < m_uCount); in SetId() 78 m_Ids[uIndex] = uId; in SetId() 81 const char *DistFunc::GetName(unsigned uIndex) const in GetName() 83 assert(uIndex < m_uCount); in GetName() 84 return m_Names[uIndex]; in GetName() 87 unsigned DistFunc::GetId(unsigned uIndex) const in GetId() 89 assert(uIndex < m_uCount); in GetId() [all …]
|
H A D | scorehistory.cpp | 44 const unsigned uIndex = uNodeIndex*2 + bRight; in SetScore() local 48 if (!m_bScoreSet[uPrevIter][uIndex]) in SetScore() 53 if (m_Score[uPrevIter][uIndex] == Score) in SetScore() 62 m_Score[uIter][uIndex] = Score; in SetScore() 63 m_bScoreSet[uIter][uIndex] = true; in SetScore() 97 const unsigned uIndex = uNodeIndex*2 + bRight; in GetScore() local 98 if (!m_bScoreSet[uIter][uIndex]) in GetScore() 100 return m_Score[uIter][uIndex]; in GetScore()
|
H A D | refinevert.cpp | 39 for (unsigned uIndex = 0; uIndex < uRangeCount ; ++uIndex) in ColsToRanges() local 42 if (uIndex > 0) in ColsToRanges() 43 uBestColLeft = BestCols[uIndex-1]; in ColsToRanges() 46 if (uIndex < uBestColCount) in ColsToRanges() 47 uBestColRight = BestCols[uIndex]; in ColsToRanges() 49 Ranges[uIndex].m_uBestColLeft = uBestColLeft; in ColsToRanges() 50 Ranges[uIndex].m_uBestColRight = uBestColRight; in ColsToRanges()
|
/dports/biology/ugene/ugene-40.1/src/plugins_3rdparty/umuscle/src/muscle/ |
H A D | distfunc.cpp | 71 assert(uIndex < m_uCount); in SetName() 72 m_Names[uIndex] = strsave(szName); in SetName() 75 void DistFunc::SetId(unsigned uIndex, unsigned uId) in SetId() argument 77 assert(uIndex < m_uCount); in SetId() 78 m_Ids[uIndex] = uId; in SetId() 81 const char *DistFunc::GetName(unsigned uIndex) const in GetName() 83 assert(uIndex < m_uCount); in GetName() 84 return m_Names[uIndex]; in GetName() 87 unsigned DistFunc::GetId(unsigned uIndex) const in GetId() 89 assert(uIndex < m_uCount); in GetId() [all …]
|
H A D | scorehistory.cpp | 46 const unsigned uIndex = uNodeIndex*2 + bRight; in SetScore() local 51 if (!m_bScoreSet[uPrevIter][uIndex]) in SetScore() 57 if (m_Score[uPrevIter][uIndex] == Score) in SetScore() 62 printf("uIndex=%d, Oscillating\n",uIndex); in SetScore() 68 printf("CurrentScore=%g, uIndex=%d\n",Score,uIndex); in SetScore() 70 m_Score[uIter][uIndex] = Score; in SetScore() 71 m_bScoreSet[uIter][uIndex] = true; in SetScore() 104 const unsigned uIndex = uNodeIndex*2 + bRight; in GetScore() local 105 if (!m_bScoreSet[uIter][uIndex]) in GetScore() 107 return m_Score[uIter][uIndex]; in GetScore()
|
H A D | msa.cpp | 152 char c = m_szSeqs[uSeqIndex][uIndex]; in GetChar() 162 char c = GetChar(uSeqIndex, uIndex); in GetLetter() 168 c = m_szSeqs[uSeqIndex][uIndex]; in GetLetter() 196 char c = GetChar(uSeqIndex, uIndex); in GetLetterEx() 226 char c = GetChar(uSeqIndex, uIndex); in IsGap() 233 char c = GetChar(uSeqIndex, uIndex); in IsWildcard() 248 if (uIndex == m_uCacheSeqLength) in SetChar() 261 m_uColCount = uIndex; in SetChar() 265 if (uIndex >= m_uColCount) in SetChar() 266 m_uColCount = uIndex + 1; in SetChar() [all …]
|
/dports/games/retroarch/RetroArch-1.9.7/gfx/include/dxsdk/ |
H A D | xdsp.h | 225 for (UINT32 uIndex=0; uIndex<uCount; ++uIndex) { in __inout_ecount() local 226 ButterflyDIT4_1(pReal[uIndex], pImaginary[uIndex]); in __inout_ecount() 255 for (UINT32 uIndex=0; uIndex<uCount; ++uIndex) { variable 300 for (UINT32 uIndex=0; uIndex<uCount; ++uIndex) { variable 356 for (UINT32 uIndex=0; uIndex<(uTotal_vectors>>2); ++uIndex) { variable 357 const UINT32 n = ((uIndex & uStrideInvMask) << 2) + (uIndex & uStrideMask); 453 for (UINT32 uIndex=0; uIndex<uLength; ++uIndex) { variable 454 UINT32 n = uIndex; 464 for (UINT32 uIndex=0; uIndex<uLength; ++uIndex) { variable 465 UINT32 n = (uIndex>>3); [all …]
|
/dports/irc/kvirc/KVIrc-5.0.0-73-gbdeac0429/src/modules/objects/ |
H A D | KvsObject_comboBox.cpp | 165 kvs_uint_t uIndex, cnt; in KVSO_CLASS_FUNCTION() 178 uIndex, cnt); in KVSO_CLASS_FUNCTION() 179 uIndex = cnt - 1; in KVSO_CLASS_FUNCTION() 181 ((QComboBox *)widget())->setItemText(uIndex, szText); in KVSO_CLASS_FUNCTION() 187 kvs_uint_t uIndex, cnt; in KVSO_CLASS_FUNCTION() 196 uIndex, cnt); in KVSO_CLASS_FUNCTION() 197 uIndex = cnt - 1; in KVSO_CLASS_FUNCTION() 200 ((QComboBox *)widget())->removeItem(uIndex); in KVSO_CLASS_FUNCTION() 290 kvs_uint_t uIndex; in KVSO_CLASS_FUNCTION() 300 kvs_uint_t uIndex; in KVSO_CLASS_FUNCTION() [all …]
|
/dports/math/adept/adept-2.0.8/include/ |
H A D | adept_source.h | 737 uIndex 741 uIndex return_val; in do_register_gradients() 869 const uIndex& n) in unregister_gradients() 1222 uIndex* new_index = new uIndex[new_size]; in grow_operation_stack() 1842 uIndex n_extra) const in jacobian_forward_kernel_extra() 1904 uIndex block_size = MULTIPASS_SIZE; in jacobian_forward_openmp() 2146 uIndex n_non_zero = 0; in jacobian_reverse_openmp() 2278 uIndex i_non_zero[MULTIPASS_SIZE]; in jacobian_reverse() 2280 uIndex n_non_zero = 0; in jacobian_reverse() 2352 uIndex i_non_zero[MULTIPASS_SIZE]; in jacobian_reverse() [all …]
|
/dports/graphics/sharpconstruct/sharpconstruct-0.11/include/ |
H A D | RCHashArray.hpp | 135 for(unsigned long uIndex = 0; uIndex < HASH_SIZE; ++uIndex) { in CRCHashArray() local 137 m_pHashArray[uIndex] = NULL; in CRCHashArray() 148 for(unsigned long uIndex = 0; uIndex < HASH_SIZE; ++uIndex) { in ~CRCHashArray() local 152 SHashArrayNode * pNode = m_pHashArray[uIndex]; in ~CRCHashArray()
|
/dports/games/flightgear/flightgear-2020.3.11/src/GUI/ |
H A D | CarriersLocationModel.cxx | 108 const auto uIndex = static_cast<size_t>(index); in geodForIndex() local 109 if ((index < 0) || (uIndex >= mCarriers.size())) { in geodForIndex() 113 const auto& c = mCarriers.at(uIndex); in geodForIndex() 119 const auto uIndex = static_cast<size_t>(index); in pennantForIndex() local 120 if ((index < 0) || (uIndex >= mCarriers.size())) { in pennantForIndex() 124 const auto& c = mCarriers.at(uIndex); in pennantForIndex() 130 const auto uIndex = static_cast<size_t>(index); in parkingsForIndex() local 131 if ((index < 0) || (uIndex >= mCarriers.size())) { in parkingsForIndex() 135 const auto& c = mCarriers.at(uIndex); in parkingsForIndex()
|
/dports/biology/ugene/ugene-40.1/src/plugins_3rdparty/umuscle/src/ |
H A D | refinevertP.cpp | 61 for (unsigned uIndex = 0; uIndex < uRangeCount ; ++uIndex) in ColsToRanges() local 64 if (uIndex > 0) in ColsToRanges() 65 uBestColLeft = BestCols[uIndex-1]; in ColsToRanges() 68 if (uIndex < uBestColCount) in ColsToRanges() 69 uBestColRight = BestCols[uIndex]; in ColsToRanges() 71 Ranges[uIndex].m_uBestColLeft = uBestColLeft; in ColsToRanges() 72 Ranges[uIndex].m_uBestColRight = uBestColRight; in ColsToRanges()
|
/dports/science/simbody/simbody-Simbody-3.7/Simbody/src/ |
H A D | RigidBodyNode_LoneParticle.cpp | 46 uIndex = nextUSlot; in RBNodeLoneParticle() 178 const Vec3& u = Vec3::getAs(&allU[uIndex]); in realizeVelocity() 221 const Vec3& in = Vec3::getAs(&v[uIndex]); in multiplyBySystemJacobian() 247 Vec3& eps = Vec3::updAs(&jointForces[uIndex]); in calcEquivalentJointForces() 300 Vec3& udot = Vec3::updAs(&allUDot[uIndex]); in calcUDotPass2Outward() 350 Vec3& udot = Vec3::updAs(&allUDot[uIndex]); in multiplyByMInvPass2Outward() 367 const Vec3& udot = Vec3::getAs(&allUDot[uIndex]); in calcBodyAccelerationsFromUdotOutward() 383 Vec3& tau = Vec3::updAs(&allTau[uIndex]); in calcInverseDynamicsPass2Inward() 403 Vec3& tau = Vec3::updAs(&allTau[uIndex]); in multiplyByMPass2Inward() 440 Vec3::updAs(&u[uIndex]) = V_F0M0[1]; in setUToFitVelocityImpl() [all …]
|