676 |
|
} |
677 |
|
} |
678 |
|
|
679 |
< |
void atLeaf(int l, int h) { |
679 |
> |
void atLeaf(int l, int h) { |
680 |
|
if (pap.hasFilter()) |
681 |
|
filteredAtLeaf(l, h); |
682 |
|
else { |
689 |
|
} |
690 |
|
} |
691 |
|
|
692 |
< |
void filteredAtLeaf(int l, int h) { |
692 |
> |
void filteredAtLeaf(int l, int h) { |
693 |
|
for (int i = l; i < h; ++i) { |
694 |
|
if (pap.isSelected(i)) { |
695 |
|
Object x = pap.oget(i); |
772 |
|
} |
773 |
|
} |
774 |
|
|
775 |
< |
void filteredAtLeaf(int l, int h) { |
775 |
> |
void filteredAtLeaf(int l, int h) { |
776 |
|
for (int i = l; i < h; ++i) { |
777 |
|
if (pap.isSelected(i)) { |
778 |
|
double x = pap.dget(i); |
843 |
|
} |
844 |
|
} |
845 |
|
|
846 |
< |
void atLeaf(int l, int h) { |
846 |
> |
void atLeaf(int l, int h) { |
847 |
|
if (pap.hasFilter()) |
848 |
|
filteredAtLeaf(l, h); |
849 |
|
else { |
857 |
|
} |
858 |
|
} |
859 |
|
|
860 |
< |
void filteredAtLeaf(int l, int h) { |
860 |
> |
void filteredAtLeaf(int l, int h) { |
861 |
|
for (int i = l; i < h; ++i) { |
862 |
|
if (pap.isSelected(i)) { |
863 |
|
long x = pap.lget(i); |
1574 |
|
} |
1575 |
|
|
1576 |
|
/** |
1577 |
< |
* Return new array holding all elements. |
1577 |
> |
* Returns new array holding all elements. |
1578 |
|
*/ |
1579 |
|
Object[] uniqueObjects(int size) { |
1580 |
|
Object[] src = pap.ogetArray(); |
1887 |
|
} |
1888 |
|
|
1889 |
|
/** |
1890 |
< |
* Perform merging for FJSorter. If big enough, splits Left |
1890 |
> |
* Performs merging for FJSorter. If big enough, splits Left |
1891 |
|
* partition in half; finds the greatest point in Right partition |
1892 |
|
* less than the beginning of the second half of Left via binary |
1893 |
|
* search; and then, in parallel, merges left half of Left with |