| /dports/devel/judy/judy-1.0.5/src/ |
| H A D | Judy.h.check.c | 32 uint8_t *CIndex = NULL; in main() local
76 PPvoid = JudySLGet ( PArray, CIndex, PJE0); in main()
77 PPvoid = JudySLIns (PPArray, CIndex, PJE0); in main()
78 myint = JudySLDel (PPArray, CIndex, PJE0); in main()
124 JSLG (PPvoid, PArray, CIndex); in main()
125 JSLI (PPvoid, PArray, CIndex); in main()
126 JSLD (myint, PArray, CIndex); in main()
127 JSLF (PPvoid, PArray, CIndex); in main()
128 JSLN (PPvoid, PArray, CIndex); in main()
129 JSLL (PPvoid, PArray, CIndex); in main()
[all …]
|
| /dports/editors/cooledit/cooledit-3.17.28/widget/ |
| H A D | coolwidget.c | 242 if (CIndex (i)) in find_ident()
252 if (CIndex (i)) in find_ident()
309 if (CIndex (i) != NULL) in widget_check_magic()
917 if ((long) CIndex (i)->ximage->data == (long) CIndex (i)->graphic) in free_single_widget()
935 if (CIndex (i)->tab) in free_single_widget()
938 (*(CIndex (i)->destroy)) (CIndex (i)); in free_single_widget()
939 if (CIndex (i)->text) in free_single_widget()
946 (*(CIndex (i)->free_user)) (CIndex (i)->user); in free_single_widget()
949 free (CIndex (i)); in free_single_widget()
950 CIndex (i) = NULL; in free_single_widget()
[all …]
|
| H A D | disable.c | 147 if (CIndex (i)) in CSetDisable()
148 switch (regexp_match ((char *) ident, CIndex (i)->ident, match_file)) { in CSetDisable()
150 CIndex (i)->disabled = disable; in CSetDisable()
159 if (CIndex (i)) in CSetDisable()
160 CIndex (i)->disabled = disable; in CSetDisable()
190 if (CIndex (i)) { in CBackupState()
192 if(CIndex (i)->disabled != 0) in CBackupState()
202 if (CIndex (i)) in CRestoreState()
204 CIndex (i)->disabled = ((s->state[i / 32] & (0x1L << (i % 32))) != 0); in CRestoreState()
|
| H A D | focus.c | 451 if (CIndex (i)->takes_focus && !CIndex(i)->disabled) in CNextFocus()
452 return CIndex (i); in CNextFocus()
453 w = CIndex (i); in CNextFocus()
471 if (CIndex (i)->takes_focus && !CIndex(i)->disabled) in CPreviousFocus()
472 return CIndex (i); in CPreviousFocus()
473 w = CIndex (i); in CPreviousFocus()
487 w = CIndex (i); in CChildFocus()
498 return CIndex (i); in CChildFocus()
499 w = CIndex (i); in CChildFocus()
515 if (CIndex (i)->takes_focus && !CIndex (i)->disabled) { in CFindFirstDescendent()
[all …]
|
| /dports/devel/judy/judy-1.0.5/src/JudyCommon/ |
| H A D | JudyCascade.c | 515 CIndex = PLeaf[0]; in j__udyCascade2()
678 CIndex = PLeaf[End]; in j__udyCascade2()
737 CIndex = StageA[0]; in j__udyCascade3()
887 CIndex = StageA[End]; in j__udyCascade3()
956 CIndex = StageA[0]; in j__udyCascade4()
1099 CIndex = StageA[End]; in j__udyCascade4()
1165 CIndex = StageA[0]; in j__udyCascade5()
1290 CIndex = StageA[End]; in j__udyCascade5()
1357 CIndex = StageA[0]; in j__udyCascade6()
1550 CIndex = StageA[0]; in j__udyCascade7()
[all …]
|
| /dports/biology/sra-tools/sra-tools-2.11.0/ncbi-vdb/libs/klib/judy/ |
| H A D | JudyCascade.c | 513 CIndex = PLeaf[0]; in j__udyCascade2()
676 CIndex = PLeaf[End]; in j__udyCascade2()
735 CIndex = StageA[0]; in j__udyCascade3()
885 CIndex = StageA[End]; in j__udyCascade3()
954 CIndex = StageA[0]; in j__udyCascade4()
1097 CIndex = StageA[End]; in j__udyCascade4()
1163 CIndex = StageA[0]; in j__udyCascade5()
1288 CIndex = StageA[End]; in j__udyCascade5()
1355 CIndex = StageA[0]; in j__udyCascade6()
1548 CIndex = StageA[0]; in j__udyCascade7()
[all …]
|
| /dports/biology/ncbi-vdb/ncbi-vdb-2.11.0/libs/klib/judy/ |
| H A D | JudyCascade.c | 513 CIndex = PLeaf[0]; in j__udyCascade2()
676 CIndex = PLeaf[End]; in j__udyCascade2()
735 CIndex = StageA[0]; in j__udyCascade3()
885 CIndex = StageA[End]; in j__udyCascade3()
954 CIndex = StageA[0]; in j__udyCascade4()
1097 CIndex = StageA[End]; in j__udyCascade4()
1163 CIndex = StageA[0]; in j__udyCascade5()
1288 CIndex = StageA[End]; in j__udyCascade5()
1355 CIndex = StageA[0]; in j__udyCascade6()
1548 CIndex = StageA[0]; in j__udyCascade7()
[all …]
|
| /dports/graphics/apngasm/apngasm-2.91/7z/ |
| H A D | BinTree.h | 6 typedef UINT32 CIndex; typedef
11 CIndex Left;
12 CIndex Right;
20 CIndex *m_Hash;
23 CIndex *m_Hash2;
25 CIndex *m_Hash3;
34 void NormalizeLinks(CIndex *anArray, UINT32 aNumItems, INT32 aSubValue);
|
| H A D | BinTreeMain.h | 87 m_Hash = new CIndex[aSize + 1]; in Create()
247 CIndex *aPtrLeft = &m_Son[m_Pos].Right; in GetLongestMatch()
248 CIndex *aPtrRight = &m_Son[m_Pos].Left; in GetLongestMatch()
397 CIndex *aPtrLeft = &m_Son[m_Pos].Right; in DummyLongestMatch()
398 CIndex *aPtrRight = &m_Son[m_Pos].Left; in DummyLongestMatch()
471 void CInTree::NormalizeLinks(CIndex *anArray, UINT32 aNumItems, INT32 aSubValue) in NormalizeLinks()
488 NormalizeLinks((CIndex *)(m_Son + aStartItem), m_HistorySize * 2, aSubValue); in Normalize()
|
| /dports/archivers/advancecomp/advancecomp-2.1-6-g7b08f7a/7z/ |
| H A D | BinTree.h | 6 typedef UINT32 CIndex; typedef
11 CIndex Left;
12 CIndex Right;
20 CIndex *m_Hash;
23 CIndex *m_Hash2;
25 CIndex *m_Hash3;
34 void NormalizeLinks(CIndex *anArray, UINT32 aNumItems, INT32 aSubValue);
|
| H A D | BinTreeMain.h | 87 m_Hash = new CIndex[aSize + 1]; in Create()
247 CIndex *aPtrLeft = &m_Son[m_Pos].Right; in GetLongestMatch()
248 CIndex *aPtrRight = &m_Son[m_Pos].Left; in GetLongestMatch()
397 CIndex *aPtrLeft = &m_Son[m_Pos].Right; in DummyLongestMatch()
398 CIndex *aPtrRight = &m_Son[m_Pos].Left; in DummyLongestMatch()
471 void CInTree::NormalizeLinks(CIndex *anArray, UINT32 aNumItems, INT32 aSubValue) in NormalizeLinks()
488 NormalizeLinks((CIndex *)(m_Son + aStartItem), m_HistorySize * 2, aSubValue); in Normalize()
|
| /dports/archivers/upx/upx-3.96/src/lzma-sdk/C/7zip/Compress/LZ/BinTree/ |
| H A D | BinTreeMain.h | 134 if (sizeInBytes / sizeof(CIndex) != numItems) in Create()
136 _hash = (CIndex *)BigAlloc(sizeInBytes); in Create()
265 CIndex *son = _son; in GetMatches()
270 CIndex *ptr0 = son + (_cyclicBufferPos << 1) + 1; in GetMatches()
271 CIndex *ptr1 = son + (_cyclicBufferPos << 1); in GetMatches()
301 CIndex *pair = son + in GetMatches()
414 CIndex *son = _son; in Skip()
415 CIndex *ptr0 = son + (_cyclicBufferPos << 1) + 1; in Skip()
416 CIndex *ptr1 = son + (_cyclicBufferPos << 1); in Skip()
433 CIndex *pair = son + (cyclicPos << 1); in Skip()
[all …]
|
| H A D | BinTree.h | 8 typedef UInt32 CIndex; typedef
20 CIndex *_hash;
21 CIndex *_son;
|
| /dports/sysutils/afflib/AFFLIBv3-3.7.16/lzma443/C/7zip/Compress/LZ/BinTree/ |
| H A D | BinTreeMain.h | 134 if (sizeInBytes / sizeof(CIndex) != numItems) in Create()
136 _hash = (CIndex *)BigAlloc(sizeInBytes); in Create()
265 CIndex *son = _son; in GetMatches()
270 CIndex *ptr0 = son + (_cyclicBufferPos << 1) + 1; in GetMatches()
271 CIndex *ptr1 = son + (_cyclicBufferPos << 1); in GetMatches()
301 CIndex *pair = son + in GetMatches()
414 CIndex *son = _son; in Skip()
415 CIndex *ptr0 = son + (_cyclicBufferPos << 1) + 1; in Skip()
416 CIndex *ptr1 = son + (_cyclicBufferPos << 1); in Skip()
433 CIndex *pair = son + (cyclicPos << 1); in Skip()
[all …]
|
| H A D | BinTree.h | 8 typedef UInt32 CIndex; typedef
20 CIndex *_hash;
21 CIndex *_son;
|
| /dports/lang/spidermonkey60/firefox-60.9.0/build/build-clang/ |
| H A D | return-empty-string-non-mangled.patch | 6 diff --git a/clang/tools/libclang/CIndex.cpp b/clang/tools/libclang/CIndex.cpp
7 --- a/clang/tools/libclang/CIndex.cpp
8 +++ b/clang/tools/libclang/CIndex.cpp
|
| /dports/www/firefox-legacy/firefox-52.8.0esr/build/build-clang/ |
| H A D | return-empty-string-non-mangled.patch | 6 diff --git a/clang/tools/libclang/CIndex.cpp b/clang/tools/libclang/CIndex.cpp
7 --- a/clang/tools/libclang/CIndex.cpp
8 +++ b/clang/tools/libclang/CIndex.cpp
|
| H A D | query-selector-visibility.patch | 36 diff --git a/clang/tools/libclang/CIndex.cpp b/clang/tools/libclang/CIndex.cpp
38 --- a/clang/tools/libclang/CIndex.cpp
39 +++ b/clang/tools/libclang/CIndex.cpp
|
| /dports/games/criticalmass/CriticalMass-1.5/utils/lzma/SRC/7zip/Compress/LZ/BinTree/ |
| H A D | BinTreeMain.h | 96 _hash = (CIndex *)BigAlloc((kHashSizeSum + _cyclicBufferSize * 2) * sizeof(CIndex)); in Create()
211 CIndex *son = _hash + kHashSizeSum; in STDMETHODIMP_()
212 CIndex *ptr0 = son + (_cyclicBufferPos << 1) + 1; in STDMETHODIMP_()
213 CIndex *ptr1 = son + (_cyclicBufferPos << 1); in STDMETHODIMP_()
255 CIndex *pair = son + (cyclicPos << 1); in STDMETHODIMP_()
324 CIndex *son = _hash + kHashSizeSum; in STDMETHODIMP_()
325 CIndex *ptr0 = son + (_cyclicBufferPos << 1) + 1; in STDMETHODIMP_()
326 CIndex *ptr1 = son + (_cyclicBufferPos << 1); in STDMETHODIMP_()
352 CIndex *pair = son + (cyclicPos << 1); in STDMETHODIMP_()
386 CIndex *items = _hash; in Normalize()
|
| /dports/archivers/lzmalib/lzmalib-0.0.1/7zip/Compress/LZ/BinTree/ |
| H A D | BinTreeMain.h | 96 _hash = (CIndex *)BigAlloc((kHashSizeSum + _cyclicBufferSize * 2) * sizeof(CIndex)); in Create()
211 CIndex *son = _hash + kHashSizeSum; in STDMETHODIMP_()
212 CIndex *ptr0 = son + (_cyclicBufferPos << 1) + 1; in STDMETHODIMP_()
213 CIndex *ptr1 = son + (_cyclicBufferPos << 1); in STDMETHODIMP_()
255 CIndex *pair = son + (cyclicPos << 1); in STDMETHODIMP_()
324 CIndex *son = _hash + kHashSizeSum; in STDMETHODIMP_()
325 CIndex *ptr0 = son + (_cyclicBufferPos << 1) + 1; in STDMETHODIMP_()
326 CIndex *ptr1 = son + (_cyclicBufferPos << 1); in STDMETHODIMP_()
352 CIndex *pair = son + (cyclicPos << 1); in STDMETHODIMP_()
386 CIndex *items = _hash; in Normalize()
|
| /dports/games/criticalmass/CriticalMass-1.5/utils/lzma/SRC/7zip/Compress/LZ/Patricia/ |
| H A D | Pat.h | 26 typedef UInt32 CIndex; typedef
37 typedef UInt32 CIndex; typedef
40 typedef CIndex CIndex2;
44 const UInt32 kNumBitsInIndex = sizeof(CIndex) * 8;
49 typedef CIndex CMatchPointer;
55 CIndex NodePointer;
248 void AddInternalNode(CNodePointer aNode, CIndex *aNodePointerPointer, in AddInternalNode()
|
| /dports/archivers/lzmalib/lzmalib-0.0.1/7zip/Compress/LZ/Patricia/ |
| H A D | Pat.h | 26 typedef UInt32 CIndex; typedef
37 typedef UInt32 CIndex; typedef
40 typedef CIndex CIndex2;
44 const UInt32 kNumBitsInIndex = sizeof(CIndex) * 8;
49 typedef CIndex CMatchPointer;
55 CIndex NodePointer;
248 void AddInternalNode(CNodePointer aNode, CIndex *aNodePointerPointer, in AddInternalNode()
|
| /dports/editors/fpc-ide/fpc-3.2.2/packages/ide/ |
| H A D | fpcodcmp.pas | 107 CIndex, Index, i : sw_integer;
115 Text:=CodeCompleteWords^.Lookup(WordS,CIndex);
116 OK:=(CIndex<>-1) and (length(Text)<>length(WordS));
118 if OK and ShowOnlyUnique and (CIndex<CodeCompleteWords^.Count-1) then
120 St:=PString(CodeCompleteWords^.At(CIndex+1))^;
167 if ShowOnlyUnique and (Index<>-1) and (CIndex<>-1) then
234 CIndex : sw_integer;
244 UnitsCodeCompleteWords^.LookUp(st,CIndex);
245 if CIndex<>-1 then
|
| /dports/lang/fpc-source/fpc-3.2.2/packages/ide/ |
| H A D | fpcodcmp.pas | 107 CIndex, Index, i : sw_integer;
115 Text:=CodeCompleteWords^.Lookup(WordS,CIndex);
116 OK:=(CIndex<>-1) and (length(Text)<>length(WordS));
118 if OK and ShowOnlyUnique and (CIndex<CodeCompleteWords^.Count-1) then
120 St:=PString(CodeCompleteWords^.At(CIndex+1))^;
167 if ShowOnlyUnique and (Index<>-1) and (CIndex<>-1) then
234 CIndex : sw_integer;
244 UnitsCodeCompleteWords^.LookUp(st,CIndex);
245 if CIndex<>-1 then
|
| /dports/biology/plink/plink-ng-79b2df8c/2.0/cindex/src/ |
| H A D | RcppExports.cpp | 9 double CIndex(NumericVector yhat, NumericVector y, SEXP status, Nullable<NumericVector> w);
18 rcpp_result_gen = Rcpp::wrap(CIndex(yhat, y, status, w)); in _cindex_CIndex()
|