Magic-Mirror/gecko-dev
1
0
Fork 0
mirror of https://github.com/mozilla/gecko-dev.git synced 2024-11-26 22:32:46 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Enable the optimized binary insertion node with end-point interpolation. (Sort-of) review: putterman@netscape.com

Browse Source
This commit is contained in:
rjc%netscape.com 2000-01-19 01:44:29 +00:00
parent 114d510275
commit 7ac034530e
2 changed files with 6 additions and 118 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

62
content/xul/templates/src/nsXULSortService.cpp
View File

@ -1641,14 +1641,11 @@ XULSortServiceImpl::InsertContainerNode(nsIRDFCompositeDataSource *db, sortState
{
nsCOMPtr<nsIContent> child;
nsIContent *temp;
// #define OPTIMIZED_BINARY_INSERTION
#ifdef OPTIMIZED_BINARY_INSERTION
// rjc says: The following is an implementaion of a fairly optimal
// binary search insertion sort... with interpolation at either end-point.
PRInt32 direction;
// rjc says: The following is an implementation of a fairly optimal
// binary search insertion sort... with interpolation at either end-point.
if (sortState->lastWasFirst == PR_TRUE)
{
container->ChildAt(0, *getter_AddRefs(child));
@ -1705,59 +1702,6 @@ XULSortServiceImpl::InsertContainerNode(nsIRDFCompositeDataSource *db, sortState
if (direction < 0) right = x-1;
else left = x+1;
}
#else
PRInt32 last = -1, current, direction = 0, delta = numChildren;
while(PR_TRUE)
{
delta = delta / 2;
if (last == -1)
{
current = delta;
}
else if (direction > 0)
{
if (delta == 0) delta = 1;
current = last + delta;
}
else
{
if (delta == 0) delta = 1;
current = last - delta;
}
if (current != last)
{
container->ChildAt(current, *getter_AddRefs(child));
temp = child.get();
// Note: since cacheFirstHint is PR_TRUE, the first node passed
// into inplaceSortCallback() must be the node that doesn't change
direction = inplaceSortCallback(&node, &temp, &sortInfo);
}
if ( (direction == 0) ||
((current == last + 1) && (direction < 0)) ||
((current == last - 1) && (direction > 0)) ||
((current == 0) && (direction < 0)) ||
((current >= numChildren - 1) && (direction > 0)) )
{
if (current >= numChildren)
{
container->AppendChildTo(node, aNotify);
}
else
{
PRInt32 thePos = ((direction > 0) ? current + 1: (current >= 0) ? current : 0);
container->InsertChildAt(node, thePos, aNotify);
}
childAdded = PR_TRUE;
break;
}
last = current;
}
#endif
}
}

62
rdf/content/src/nsXULSortService.cpp
View File

@ -1641,14 +1641,11 @@ XULSortServiceImpl::InsertContainerNode(nsIRDFCompositeDataSource *db, sortState
{
nsCOMPtr<nsIContent> child;
nsIContent *temp;
// #define OPTIMIZED_BINARY_INSERTION
#ifdef OPTIMIZED_BINARY_INSERTION
// rjc says: The following is an implementaion of a fairly optimal
// binary search insertion sort... with interpolation at either end-point.
PRInt32 direction;
// rjc says: The following is an implementation of a fairly optimal
// binary search insertion sort... with interpolation at either end-point.
if (sortState->lastWasFirst == PR_TRUE)
{
container->ChildAt(0, *getter_AddRefs(child));
@ -1705,59 +1702,6 @@ XULSortServiceImpl::InsertContainerNode(nsIRDFCompositeDataSource *db, sortState
if (direction < 0) right = x-1;
else left = x+1;
}
#else
PRInt32 last = -1, current, direction = 0, delta = numChildren;
while(PR_TRUE)
{
delta = delta / 2;
if (last == -1)
{
current = delta;
}
else if (direction > 0)
{
if (delta == 0) delta = 1;
current = last + delta;
}
else
{
if (delta == 0) delta = 1;
current = last - delta;
}
if (current != last)
{
container->ChildAt(current, *getter_AddRefs(child));
temp = child.get();
// Note: since cacheFirstHint is PR_TRUE, the first node passed
// into inplaceSortCallback() must be the node that doesn't change
direction = inplaceSortCallback(&node, &temp, &sortInfo);
}
if ( (direction == 0) ||
((current == last + 1) && (direction < 0)) ||
((current == last - 1) && (direction > 0)) ||
((current == 0) && (direction < 0)) ||
((current >= numChildren - 1) && (direction > 0)) )
{
if (current >= numChildren)
{
container->AppendChildTo(node, aNotify);
}
else
{
PRInt32 thePos = ((direction > 0) ? current + 1: (current >= 0) ? current : 0);
container->InsertChildAt(node, thePos, aNotify);
}
childAdded = PR_TRUE;
break;
}
last = current;
}
#endif
}
}