@awayjs/renderer
Version:
Renderer for AwayJS
142 lines (141 loc) • 3.84 kB
JavaScript
/**
* @class away.sort.RenderableMergeSort
*/
var RenderableMergeSort = /** @class */ (function () {
function RenderableMergeSort() {
}
RenderableMergeSort.prototype.sortBlendedRenderables = function (head) {
var headB;
var fast;
var slow;
if (!head || !head.next) {
return head;
}
// split in two sublists
slow = head;
fast = head.next;
while (fast) {
fast = fast.next;
if (fast) {
slow = slow.next;
fast = fast.next;
}
}
headB = slow.next;
slow.next = null;
// recurse
head = this.sortBlendedRenderables(head);
headB = this.sortBlendedRenderables(headB);
// merge sublists while respecting order
var result;
var curr;
var l;
if (!head)
return headB;
if (!headB)
return head;
while (head && headB) {
if (head.zIndex < headB.zIndex) {
l = head;
head = head.next;
}
else {
l = headB;
headB = headB.next;
}
if (!result)
result = l;
else
curr.next = l;
curr = l;
}
if (head)
curr.next = head;
else if (headB)
curr.next = headB;
return result;
};
RenderableMergeSort.prototype.sortOpaqueRenderables = function (head) {
var headB;
var fast, slow;
if (!head || !head.next) {
return head;
}
// split in two sublists
slow = head;
fast = head.next;
while (fast) {
fast = fast.next;
if (fast) {
slow = slow.next;
fast = fast.next;
}
}
headB = slow.next;
slow.next = null;
// recurse
head = this.sortOpaqueRenderables(head);
headB = this.sortOpaqueRenderables(headB);
// merge sublists while respecting order
var result;
var curr;
var l;
var cmp = 0;
if (!head)
return headB;
if (!headB)
return head;
while (head && headB && head != null && headB != null) {
// first sort per render order id (reduces program3D switches),
// then on render object id (reduces setting props),
// then on zIndex (reduces overdraw)
var aid = head.renderOrderId;
var bid = headB.renderOrderId;
if (aid == bid) {
var ma = head.materialID;
var mb = headB.materialID;
if (ma == mb) {
if (head.zIndex < headB.zIndex)
cmp = 1;
else
cmp = -1;
}
else if (ma > mb) {
cmp = 1;
}
else {
cmp = -1;
}
}
else if (aid > bid) {
cmp = 1;
}
else {
cmp = -1;
}
if (cmp < 0) {
l = head;
head = head.next;
}
else {
l = headB;
headB = headB.next;
}
if (!result) {
result = l;
curr = l;
}
else {
curr.next = l;
curr = l;
}
}
if (head)
curr.next = head;
else if (headB)
curr.next = headB;
return result;
};
return RenderableMergeSort;
}());
export { RenderableMergeSort };