3

I've reviewed the docs and examples for fancytree for hours soaking up all of fancytree's goodness like a sponge but I can't seem to figure how to sort my fancytree object with folders first by using the API calls. I've initially got around the problem by arranging my initial JSON data so that it's already sorted with folders at the top (a requirement of the project) but now I need to add a new folder to the tree and I need to re-sort the object making sure the newly added folder appears at the top of the tree with the others.

I notice there is a curious option for sortChildren() that allows for a defining a custom compare function but I'm having trouble wrapping my head around how to use it.

Any ideas would be much appreciated!

Snippet below on how I am doing things currently (I am populating the new child with data from some form elements):

//add the new foldername to the tree and re-order
var rootNode = jQuery("#document_objects").fancytree("getRootNode");
var childNode = rootNode.addChildren({
    title:    jQuery('#newfoldername').val(),
    tooltip:  jQuery('#description').val(),
    folder:   true
});

rootNode.sortChildren(null, true);

Thanks in advance!

Todd Hammer
  • 183
  • 1
  • 9

2 Answers2

8

sortChildren(cmp, deep) allows to pass a compare function: http://www.wwwendt.de/tech/fancytree/doc/jsdoc/FancytreeNode.html#sortChildren

The default implementation (if you pass null or nothing for the cmp argument) is
function(a, b) { var x = a.title.toLowerCase(), y = b.title.toLowerCase(); return x === y ? 0 : x > y ? 1 : -1; };

but you could add some prefix to force a different order, e.g.:
function(a, b) { var x = (a.isFolder() ? "0" : "1") + a.title.toLowerCase(), y = (b.isFolder() ? "0" : "1") + b.title.toLowerCase(); return x === y ? 0 : x > y ? 1 : -1; };

mar10
  • 14,320
  • 5
  • 39
  • 64
0

Try below code:

var cmp= function(a, b) { 

var x = (a.data.isFolder ? "0" : "1") + a.data.title.toLowerCase(),                    
y = (b.data.isFolder ? "0" : "1") + b.data.title.toLowerCase();                 
return x === y ? 0 : x > y ? 1 : -1;
        };

node.sortChildren(cmp, true);
Dinesh
  • 1