/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/contrib/src/stc/scintilla/src/ |
H A D | PropSet.cxx | 801 sorted = false; 807 sorted = false; 821 sorted = false; 851 if (!sorted) { 852 sorted = true; 903 if (!sorted) { 904 sorted = true; 1010 if (!sorted) { 1011 sorted = true; 1137 if (!sorted) { [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/docs/latex/wx/ |
H A D | arrstrng.tex | 36 not be used with sorted array (basically, all which break the order of items) 67 Copy constructor. Note that when an array is assigned to a sorted array, its contents is 68 automatically sorted during construction. 122 {\bf Warning:} For sorted arrays, the index of the inserted item will not be, 124 the item is inserted at the correct position to keep the array sorted and not 200 {\bf Warning:} this function should not be used with sorted arrays because it 261 {\bf Warning:} this function should not be used with sorted array because it 295 {\bf Warning:} this function should not be used with sorted array because it
|
H A D | dataviewmodel.tex | 239 data itself. Rather, it provides a sorted interface for 260 which this model is supposed to present in a sorted way. 272 Returns true if the data is sorted in ascending order.
|
H A D | array.tex | 65 its items in the sorted order (according to this function). Thus, it is 313 This macro defines a new sorted array class named {\it name} and containing 336 wxSortedArrayInt sorted(CompareInts); 563 in the sorted array is used for wxSortedArray (this is why searchFromEnd 694 wxSortedArray doesn't have this function because it is always sorted.
|
H A D | docmanag.tex | 451 will have to choose from is sorted or not when shown the choice box dialog. 473 will have to choose from is sorted or not when shown the choice box dialog.
|
H A D | listbox.tex | 40 \twocolitem{\windowstyle{wxLB\_SORT}}{The listbox contents are sorted in alphabetical order.}
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/aMule-2.3.1/src/ |
H A D | MuleListCtrl.cpp | 599 bool sorted = true; 604 sorted &= (CompareItems(GetItemData(item - 1), data) <= 0); 608 if (sorted && (item < GetItemCount() - 1)) { 609 sorted &= (CompareItems(GetItemData(item + 1), data) >= 0); 612 return sorted;
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/libexif-0.6.19/test/ |
H A D | Makefile.in | 38 test-sorted$(EXEEXT) 41 test-tagtable$(EXEEXT) test-sorted$(EXEEXT) 87 test_sorted_SOURCES = test-sorted.c 88 test_sorted_OBJECTS = test-sorted.$(OBJEXT) 116 test-sorted.c test-tagtable.c test-value.c 118 test-sorted.c test-tagtable.c test-value.c 358 test-sorted$(EXEEXT): $(test_sorted_OBJECTS) $(test_sorted_DEPENDENCIES) 359 @rm -f test-sorted$(EXEEXT) 378 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/test-sorted.Po@am__quote@
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/ffmpeg-2.3.4/libavcodec/ |
H A D | h264_refs.c | 100 static int add_sorted(H264Picture **sorted, H264Picture **src, int len, int limit, int dir) argument 112 sorted[out_i] = src[i]; 117 limit = sorted[out_i++]->poc - dir; 127 H264Picture *sorted[32]; local 137 len = add_sorted(sorted, h->short_ref, h->short_ref_count, cur_poc, 1 ^ list); 138 len += add_sorted(sorted + len, h->short_ref, h->short_ref_count, cur_poc, 0 ^ list); 142 sorted, len, 0, h->picture_structure);
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libav-0.8.8/libavcodec/ |
H A D | h264_refs.c | 87 static int add_sorted(Picture **sorted, Picture **src, int len, int limit, int dir){ argument 98 sorted[out_i]= src[i]; 103 limit= sorted[out_i++]->poc - dir; 113 Picture *sorted[32]; local 123 len= add_sorted(sorted , h->short_ref, h->short_ref_count, cur_poc, 1^list); 124 len+=add_sorted(sorted+len, h->short_ref, h->short_ref_count, cur_poc, 0^list); 126 len= build_def_list(h->default_ref_list[list] , sorted , len, 0, s->picture_structure);
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/utils/HelpGen/src/ |
H A D | scriptbinder.h | 263 bool sorted = false
|
H A D | scriptbinder.cpp | 324 bool sorted 332 m_SortOn ( sorted ),
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/cramfs/ |
H A D | inode.c | 399 int sorted; local 402 sorted = CRAMFS_SB(dir->i_sb)->flags & CRAMFS_FLAG_SORTED_DIRS; 411 /* Try to take advantage of sorted directories */ 412 if (sorted && (dentry->d_name.name[0] < name[0])) 443 if (sorted)
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libantlr3c-3.2/src/ |
H A D | antlr3collections.c | 1260 // Valid request, return the sorted pointer 2264 * numerical node indexes, which can then be sorted topologically such that 2265 * any node is sorted after all its dependent nodes. 2298 topo->sorted = NULL; // Nothing sorted at the start 2471 // them all before we drop through and add this node into the sorted 2506 // So we just add the node into the sorted list at the 2509 topo->sorted[topo->limit++] = node; 2534 // entries to accomodate the sorted list and another to accomodate 2537 topo->sorted [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/transmission/transmission-2.73/libtransmission/ |
H A D | utils.c | 1433 int * sorted = NULL; local 1435 /* build a sorted number array */ 1441 sorted = tr_new( int, n ); 1446 sorted[n2++] = i; 1448 qsort( sorted, n, sizeof( int ), compareInt ); 1454 if( !n || uniq[n-1] != sorted[i] ) 1455 uniq[n++] = sorted[i]; 1457 tr_free( sorted );
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/nfsd/ |
H A D | nfs4acl.c | 347 int sorted = 0, i; local 352 while (!sorted) { 353 sorted = 1; 357 sorted = 0;
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/test/ |
H A D | test006.tcl | 15 # TEST Then do the same for unsorted and sorted dups. 21 # For methods supporting dups, run the test with sorted and 24 foreach {sort flags} {unsorted -dup sorted "-dup -dupsort"} {
|
H A D | test078.tcl | 101 {b sorted "-dup -dupsort" c unsorted "-dup"} {
|
H A D | test095.tcl | 63 # once with sorted dups. 64 foreach { dflag sort } { -dup unsorted {-dup -dupsort} sorted } {
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libantlr3c-3.2/include/ |
H A D | antlr3collections.h | 395 * to be sorted will be numeric indexes into some other structure such as an ANTLR3_VECTOR. 398 * array of the sorted noded indexes, in case you are not sorting ANTLR3_VECTORS but 417 * A vector used to build up the sorted output order. Note that 421 pANTLR3_UINT32 sorted; member in struct:ANTLR3_TOPO_struct 452 * One more than the largest node index that is contained in edges/sorted. 479 * A method that returns a pointer to an array of sorted node indexes. 480 * The array is sorted in topological sorted order. Note that the array 483 * was 16, then the returned array will be the sorted order of the first 16 487 * NB: If the structure that contains the array is freed, then the sorted [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/libvorbis-1.2.3/vq/ |
H A D | vqgen.c | 330 v->sorted=1; 365 if(!v->sorted)vqgen_sortmesh(v);
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libunistring-0.9.3/lib/uniname/ |
H A D | gen-uninames.lisp | 17 (sorted nil :type list) 94 :sorted '() 99 (push word (word-list-sorted word-list)) 110 :sorted '() 113 (setf (word-list-sorted word-list) 114 (sort (word-list-sorted word-list) #'string<) 117 (reduce #'+ (mapcar #'length (word-list-sorted word-list))) 120 (length (word-list-sorted word-list)) 143 (dolist (word (word-list-sorted word-list)) 166 (when (word-list-sorted wor [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gettext-0.17/gettext-tools/gnulib-lib/uniname/ |
H A D | gen-uninames.lisp | 17 (sorted nil :type list) 92 :sorted '() 97 (push word (word-list-sorted word-list)) 108 :sorted '() 111 (setf (word-list-sorted word-list) 112 (sort (word-list-sorted word-list) #'string<) 115 (reduce #'+ (mapcar #'length (word-list-sorted word-list))) 118 (length (word-list-sorted word-list)) 141 (dolist (word (word-list-sorted word-list)) 164 (when (word-list-sorted wor [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/ext3/ |
H A D | xattr.c | 41 * entry descriptors are kept sorted. In inodes, they are unsorted. The 190 const char *name, size_t size, int sorted) 206 if (cmp <= 0 && (sorted || cmp == 0)) 189 ext3_xattr_find_entry(struct ext3_xattr_entry **pentry, int name_index, const char *name, size_t size, int sorted) argument
|
/netgear-R7000-V1.0.7.12_1.2.5/src/router/squashfs-4.2/ |
H A D | mksquashfs.c | 302 /* flag indicating whether files are sorted using sort list(s) */ 303 int sorted = 0; variable 2482 if(!sorted) 3620 if(sorted) { 3628 if(sorted) 3920 if(!sorted) 5051 sorted ++;
|