Home
last modified time | relevance | path

Searched refs:k (Results 1 – 25 of 454) sorted by relevance

12345678910>>...19

/trunk/main/scaddins/source/analysis/
H A Dbessel.cxx98 double k= 0.0; in BesselJ() local
124 k = 2.0; in BesselJ()
130 for (k =1.0; k<= N-1; k = k + 1.0) in BesselJ()
148 k = k + 1.0; in BesselJ()
161 k = k + 1.0; in BesselJ()
354 double k = 1.0; in Bessely0() local
365 k = k + 1; in Bessely0()
384 k=k+1; in Bessely0()
409 double k = 1.0; in Bessely1() local
422 k = k + 1.0; in Bessely1()
[all …]
/trunk/main/qadevOOo/java/OOoRunner/src/main/java/ifc/beans/
H A D_XMultiHierarchicalPropertySet.java90 for (int k = 0; k < oldValues.length; k++) { in _setHierarchicalPropertyValues()
91 newValues[k] = ValueChanger.changePValue(oldValues[k]); in _setHierarchicalPropertyValues()
98 for (int k = 0; k < pNames.length; k++) { in _setHierarchicalPropertyValues()
131 for (int k = 0; k < name.length; k++) { in checkType()
132 if (type[k].equals("Boolean")) { in checkType()
135 if (!(value[k] instanceof Boolean)) { in checkType()
137 log.println("Expected " + type[k]); in checkType()
140 } else if (type[k].equals("Short")) { in checkType()
141 result &= (value[k] instanceof Short); in checkType()
143 if (!(value[k] instanceof Short)) { in checkType()
[all …]
/trunk/main/i18npool/source/textconversion/
H A Dgenconv_dict.cxx94 sal_Int32 count, address, i, j, k; in make_hhc_char() local
142 for (k = 0; k < 0x100; k++) { in make_hhc_char()
164 for (k = 0; k < 0x10; k++) { in make_hhc_char()
165 sal_Unicode c = Hanja2HangulData[((i*0x10+j)*0x10)+k]; in make_hhc_char()
184 sal_Int32 address, i, j, k; in make_stc_char() local
218 for (k = 0; k < 0x100; k++) { in make_stc_char()
240 for (k = 0; k < 0x10; k++) { in make_stc_char()
255 for (k = 0; k < 0x100; k++) { in make_stc_char()
277 for (k = 0; k < 0x10; k++) { in make_stc_char()
292 for (k = 0; k < 0x100; k++) { in make_stc_char()
[all …]
/trunk/main/qadevOOo/java/OOoRunner/src/main/java/ifc/util/
H A D_XSortable.java83 for (int k = 0; k < oPV.length; k++) { in _createSortDescriptor()
84 log.println("DescriptorProperty " + k + ": Name=" + in _createSortDescriptor()
85 oPV[k].Name + "; Value=" + oPV[k].Value); in _createSortDescriptor()
87 if (oPV[k].Name.equals("SortFields")) { in _createSortDescriptor()
168 for (int k = 0; k < TableFields.length; k++) { in modifyDescriptor()
169 TableFields[k].IsAscending = isSortAscending; in modifyDescriptor()
173 TableFields[k].CollatorAlgorithm = "numeric"; in modifyDescriptor()
195 for (int k = 0; k < oPV.length; k++) { in modifyDescriptor()
196 log.println("DescriptorProperty " + k + ": Name=" + in modifyDescriptor()
197 oPV[k].Name + "; Value=" + oPV[k].Value); in modifyDescriptor()
[all …]
/trunk/main/basegfx/source/workbench/
H A Dgauss.hxx52 int max, i, j, k; /* *must* be signed, when looping like: j>=0 ! */ in eliminate() local
68 for(k=0; k<cols; ++k) in eliminate()
70 temp = matrix[ i*cols + k ]; in eliminate()
71 matrix[ i*cols + k ] = matrix[ max*cols + k ]; in eliminate()
72 matrix[ max*cols + k ] = temp; in eliminate()
77 for(k=cols-1; k>=i; --k) in eliminate()
78 matrix[ j*cols + k ] -= matrix[ i*cols + k ] * in eliminate()
114 int j,k; /* *must* be signed, when looping like: j>=0 ! */ in substitute() local
120 for(k=j+1; k<cols-1; ++k) in substitute()
121 temp += matrix[ j*cols + k ] * result[k]; in substitute()
H A Dbezierclip.cxx331 for( k=0; k<poly.size(); ++k ) in Impl_calcSafeParams_clip()
333 cout << poly[k].x << " " << poly[k].y << endl; in Impl_calcSafeParams_clip()
338 for( k=0; k<convHull.size(); ++k ) in Impl_calcSafeParams_clip()
340 cout << convHull[k].x << " " << convHull[k].y << endl; in Impl_calcSafeParams_clip()
853 for( d=0.0, k=::std::max(0,i-n); k<=k_max && k<=i; ++k ) in Impl_calcSafeParams_focus()
1412 for( k=0; k<convHull.size(); ++k ) in main()
1668 for( k=0; k<poly.size(); ++k ) in main()
1670 cout << poly[k].x << " " << poly[k].y << endl; in main()
1675 for( k=0; k<convHull.size(); ++k ) in main()
2037 for( k=0; k<result.size(); ++k ) in main()
[all …]
/trunk/main/lingucomponent/source/hyphenator/altlinuxhyph/hyphen/
H A Dhyphenimp.cxx178 for (k = 0; k < nLen2; ++k) in getLocales()
186 k = 0; in getLocales()
206 k = 0; in getLocales()
224 aDicts[k].apCC = new CharClass( aDicts[k].aLoc ); in getLocales()
288 int k = 0; in hyphenate() local
302 k = -1; in hyphenate()
306 k = j; in hyphenate()
310 if (k != -1) in hyphenate()
553 int k; in createPossibleHyphens() local
566 k = -1; in createPossibleHyphens()
[all …]
/trunk/main/sal/rtl/source/
H A Dcipher.c678 k++; in __rtl_cipherBF_init()
680 k = 0; in __rtl_cipherBF_init()
697 for (k = 0; k < 256; k += 2) in __rtl_cipherBF_init()
878 sal_uInt32 k; in __rtl_cipherBF_updateCFB() local
883 if (k == 0) in __rtl_cipherBF_updateCFB()
896 iv[k] ^= *pData; in __rtl_cipherBF_updateCFB()
902 iv[k] = *pData; in __rtl_cipherBF_updateCFB()
1179 for (k = 0; k < nKeyLen; k++) L[k] = pKeyData[k]; in rtl_cipherARCFOUR_init_Impl()
1182 for (k = 0; k < n; k++) L[k] = pKeyData[k]; in rtl_cipherARCFOUR_init_Impl()
1219 for (k = 0; k < nDatLen; k++) in rtl_cipherARCFOUR_update_Impl()
[all …]
H A Drandom.c169 sal_sSize j, k; in __rtl_random_seedPool() local
180 k = (pImpl->m_nIndex + j) - RTL_RANDOM_SIZE_POOL; in __rtl_random_seedPool()
181 if (k > 0) in __rtl_random_seedPool()
186 pImpl->m_hDigest, &(pImpl->m_pData[0]), k); in __rtl_random_seedPool()
199 for (k = 0; k < j; k++) in __rtl_random_seedPool()
201 pImpl->m_pData[pImpl->m_nIndex++] ^= pImpl->m_pDigest[k]; in __rtl_random_seedPool()
220 sal_Int32 j, k; in __rtl_random_readPool() local
234 k = (pImpl->m_nIndex + j) - pImpl->m_nData; in __rtl_random_readPool()
235 if (k > 0) in __rtl_random_readPool()
240 pImpl->m_hDigest, &(pImpl->m_pData[0]), k); in __rtl_random_readPool()
[all …]
H A Dalloc_impl.h108 k |= 32, n >>= 32; in highbit()
115 k |= 4, n >>= 4; in highbit()
119 k++; in highbit()
121 return (k); in highbit()
141 k |= 32, n >>= 32; in lowbit()
144 k |= 16, n >>= 16; in lowbit()
146 k |= 8, n >>= 8; in lowbit()
148 k |= 4, n >>= 4; in lowbit()
150 k |= 2, n >>= 2; in lowbit()
152 k++; in lowbit()
[all …]
/trunk/main/hyphen/
H A Dhyphen-2.7.1-read-charset.patch5 if (k == 0) {
6 for (i=0;i<MAX_NAME;i++) dict[k]->cset[i]= 0;
7 - if (fgets(dict[k]->cset, sizeof(dict[k]->cset),f) != NULL) {
9 - if ((dict[k]->cset[i] == '\r') || (dict[k]->cset[i] == '\n'))
10 - dict[k]->cset[i] = 0;
12 - dict[k]->cset[0] = 0;
14 + fgets(dict[k]->cset, sizeof(dict[k]->cset),f);
16 + if ((dict[k]->cset[i] == '\r') || (dict[k]->cset[i] == '\n'))
17 + dict[k]->cset[i] = 0;
18 dict[k]->utf8 = (strcmp(dict[k]->cset, "UTF-8") == 0);
[all …]
/trunk/main/libtextcat/data/new_fingerprints/lm/
H A Dmingo.lm5 k 788
57 'k 86
68 kë 72
127 kê 45
131 a'k 44
133 ák 43
170 ëk 35
172 ök 35
187 ôk 33
207 kö 29
[all …]
/trunk/extras/l10n/source/hu/
H A Dlocalize.sdf1617 …rulók és vállalati szponzorok tervezték, fejlesztették, tesztelték, fordították, dokumentálták, tá…
21793 ….src 0 string STR_SVT_FONTMAP_SCREENONLY 0 hu Ez egy képernyő-betűkészlet. A nyomtatott kép kül…
33217 …id3150740 67 0 hu Ahogy az interaktív képek különbözőképpen használhatók, különböző formátumokba…
40565 …red\01\06040100.xhp 0 help par_id1421246 0 hu A -- B (A, szóköz, kötőjel, kötőjel, szóköz, B) …
44734 …u A középső sor a következő alapvonal-alakzatokat tartalmazza: \<emph\>Felső körív\</emph\>, \<emp…
46194 … par_id4601886 0 hu Ha üres mezők találhatók a költségoszlopban, akkor használja a következő ké…
48160 …_id3151389 8 0 hu Meghatározza a változók és operátorok közötti, a vonalak közötti és a gyökjele…
55008 …_id3150417 105 0 hu Az \<emph\>érték:\</emph\> az ellenőrizni kívánt érték, szám, logikai érték,…
57395 …középső értékét. Páratlan számú értéket tartalmazó halmazban a középső érték a halmaz közepén elhe…
60609 …k\</emph\> a jelenérték. A készpénzérték a készpénzletét vagy a természetbeni juttatás aktuális ké…
[all …]
/trunk/main/svl/source/misc/
H A Dinethist.cxx260 hash_entry h = a[k]; in downheap()
261 while (k < n / 2) in downheap()
263 sal_uInt16 i = k + k + 1; in downheap()
266 a[k] = a[i]; in downheap()
267 k = i; in downheap()
269 a[k] = h; in downheap()
279 for (sal_uInt16 k = (n - 1) / 2 + 1; k > 0; k--) in heapsort() local
280 downheap (a, n, k - 1); in heapsort()
345 sal_uInt16 k = find (h); in putUrl() local
346 if ((k < capacity()) && (m_pHash[k] == h)) in putUrl()
[all …]
/trunk/main/i18npool/source/search/
H A Dtextsearch.cxx246 for ( int k = 0; k < sres.startOffset.getLength(); k++ ) in searchForward() local
260 if (sres.endOffset[k]) in searchForward()
261 sres.endOffset[k] = offset[sres.endOffset[k]-1] + 1; in searchForward()
289 for ( int k = 0; k < sres2.startOffset.getLength(); k++ ) in searchForward() local
292 sres2.startOffset[k] = offset[sres2.startOffset[k]-1] + 1; in searchForward()
294 sres2.endOffset[k] = offset[sres2.endOffset[k]-1] + 1; in searchForward()
343 for ( int k = 0; k < sres.startOffset.getLength(); k++ ) in searchBackward() local
346 sres.startOffset[k] = offset[sres.startOffset[k] - 1] + 1; in searchBackward()
386 for( int k = 0; k < sres2.startOffset.getLength(); k++ ) in searchBackward() local
389 sres2.startOffset[k] = offset[sres2.startOffset[k]-1]+1; in searchBackward()
[all …]
/trunk/main/qadevOOo/java/OOoRunner/src/main/java/ifc/sheet/
H A D_XSheetFilterableEx.java84 for (int k = 0; k < fields.length; k++) { in checkFilterDescriptor()
85 log.println("StringValue(" + k + "): " + fields[k].StringValue); in checkFilterDescriptor()
86 log.println("IsNumeric(" + k + "): " + fields[k].IsNumeric); in checkFilterDescriptor()
87 log.println("NumericValue(" + k + "): " + fields[k].NumericValue); in checkFilterDescriptor()
88 log.println("Field(" + k + "): " + fields[k].Field); in checkFilterDescriptor()
89 log.println("Connection(" + k + "): " + fields[k].Connection); in checkFilterDescriptor()
90 log.println("Operator(" + k + "): " + fields[k].Operator); in checkFilterDescriptor()
/trunk/main/qadevOOo/java/OOoRunner/src/main/java/ifc/accessibility/
H A D_XAccessibleSelection.java213 for (int k = 0; k < SelectableChildCount; k++) { in _isAccessibleChildSelected()
216 if (isSelectable(tEnv.getTestObject(), k)) { in _isAccessibleChildSelected()
217 oObj.selectAccessibleChild(k); in _isAccessibleChildSelected()
434 int k = 0; in _getSelectedAccessibleChild() local
436 for (k = 0; k < SelectableChildCount; k++) { in _getSelectedAccessibleChild()
439 if (isSelectable(tEnv.getTestObject(), k)) { in _getSelectedAccessibleChild()
440 oObj.selectAccessibleChild(k); in _getSelectedAccessibleChild()
453 "\toObj.selectAccessibleChild("+k+")\n" + in _getSelectedAccessibleChild()
511 for (int k = 0; k < maxCount; k++) { in _deselectAccessibleChild()
514 if (oObj.isAccessibleChildSelected(k)) { in _deselectAccessibleChild()
[all …]
/trunk/main/extensions/workben/
H A Dtestpgp.cxx226 while (k > 0) in setBuffer()
229 m_buffer.realloc (n + k); in setBuffer()
232 n += k; in setBuffer()
234 rtl_zeroMemory (buffer, k); in setBuffer()
282 k = VOS_BOUND(k, 0, nBytesToRead); in readBytes()
283 if (k > 0) in readBytes()
285 rData.realloc(k); in readBytes()
288 m_position += k; in readBytes()
290 return k; in readBytes()
322 return ((k > 0) ? k : 0); in available()
[all …]
/trunk/main/connectivity/source/drivers/macab/
H A DMacabRecords.cxx372 sal_Int32 i, j, k; in createHeaderForRecordType() local
379 k = 0; in createHeaderForRecordType()
407 k++; in createHeaderForRecordType()
582 sal_Int32 i,j,k; in createHeaderForProperty() local
642 for(i = 0, j = 0, k = 0; i < multiLengthSecondLevel; i++,k++) in createHeaderForProperty()
647 k = 0; in createHeaderForProperty()
676 sal_Int32 i,j,k; in createHeaderForProperty() local
720 for(i = 0, j = 0, k = 0; i < length; i++,k++) in createHeaderForProperty()
725 k = 0; in createHeaderForProperty()
780 for(i = 0, j = 0, k = 0; i < length; i++,k++) in createHeaderForProperty()
[all …]
/trunk/main/qadevOOo/java/OOoRunner/src/main/java/util/
H A DAccessibilityTools.java134 k = 50; in getAccessibleObjectForRoleIgnoreShowing_()
137 for (int i = 0; i < k; i++) { in getAccessibleObjectForRoleIgnoreShowing_()
165 k = 50; in getAccessibleObjectForRole_()
168 for (int i = 0; i < k; i++) { in getAccessibleObjectForRole_()
216 k = 50; in getAccessibleObjectForRoleIgnoreShowing()
219 for (int i = 0; i < k; i++) { in getAccessibleObjectForRoleIgnoreShowing()
258 k = 50; in getAccessibleObjectForRole()
261 for (int i = 0; i < k; i++) { in getAccessibleObjectForRole()
367 k = 50; in printAccessibleTree()
370 for (int i = 0; i < k; i++) { in printAccessibleTree()
[all …]
/trunk/main/sdext/source/pdfimport/xpdfwrapper/
H A Dwrapper_gpl.cxx37 int k = 0; in main() local
38 while (k < argc) in main()
40 if (!strcmp(argv[k], "-f")) in main()
42 outputFile = argv[k+1]; in main()
44 for (int j = k; j < argc; ++j) in main()
47 else if (!strcmp(argv[k], "-opw")) in main()
49 ownerPassword = argv[k+1]; in main()
51 for (int j = k; j < argc; ++j) in main()
54 else if (!strcmp(argv[k], "-upw")) in main()
56 userPassword = argv[k+1]; in main()
[all …]
/trunk/main/linguistic/source/
H A Dmisc.cxx192 sal_Int32 & Value( int i, int k );
207 sal_Int32 & IntArray2D::Value( int i, int k ) in Value() argument
210 DBG_ASSERT( 0 <= k && k < n2, "first index out of range" ); in Value()
212 return pData[ i * n2 + k ]; in Value()
228 sal_Int32 i, k; in LevDistance() local
231 for (k = 0; k <= nLen2; ++k) in LevDistance()
232 aData.Value(0, k) = k; in LevDistance()
235 for (k = 1; k <= nLen2; ++k) in LevDistance()
244 if (2 < i && 2 < k) in LevDistance()
249 if (rTxt2.getStr()[k - 2] != c2k) in LevDistance()
[all …]
/trunk/main/qadevOOo/java/OOoRunner/src/main/java/ifc/lang/
H A D_XMultiServiceFactory.java125 for (int k = 0; k < services.length; k++) { in _createInstance()
127 log.println("Creating Instance: " + services[k]); in _createInstance()
129 Object Inst = oObj.createInstance(services[k]); in _createInstance()
174 for (int k = 0; k < sNames.length; k++) { in _createInstanceWithArguments()
175 log.println("Creating service '" + sNames[k] + in _createInstanceWithArguments()
179 Object Inst = oObj.createInstanceWithArguments(sNames[k], in _createInstanceWithArguments()
180 args[k]); in _createInstanceWithArguments()
/trunk/main/codemaker/source/codemaker/
H A Dunotype.cxx75 sal_Int32 k = j; in decompose() local
77 ++k; // skip '<' or ',' in decompose()
78 sal_Int32 l = k; in decompose()
94 arguments->push_back(type.copy(k, l - k)); in decompose()
95 k = l; in decompose()
96 } while (k != len && type[k] != '>'); in decompose()
97 OSL_ASSERT(k == len - 1 && type[k] == '>'); in decompose()
/trunk/main/sc/source/core/tool/
H A Dinterpr5.cxx697 for (SCSIZE k=0; k < l; ++k) in lcl_LUP_decompose() local
716 if (k != kp) in lcl_LUP_decompose()
738 double fTmp = mA->GetDouble( k, i) / mA->GetDouble( k, k); in lcl_LUP_decompose()
992 for (SCSIZE k = 0; k < nC1; k++) in ScMatMult() local
1855 for (SCSIZE k = 0; k < m; k++) in lcl_MFastMult() local
1856 sum += pA->GetDouble(k,row) * pB->GetDouble(col,k); in lcl_MFastMult()
2162 for (SCSIZE k=0; k < nR; k++) in lcl_CalculateColumnMeans() local
2174 for (SCSIZE k=0; k < nR; k++) in lcl_CalculateRowMeans() local
2187 for (SCSIZE k = 0; k < nR; k++) in lcl_CalculateColumnsDelta() local
2195 for (SCSIZE k = 0; k < nR; k++) in lcl_CalculateRowsDelta() local
[all …]

Completed in 1607 milliseconds

12345678910>>...19