/*

* jQuery UI Nested Sortable

* v 1.3.6 / 28 apr 2011

* http://mjsarfatti.com/sandbox/nestedSortable

*

* Depends:

* jquery.ui.sortable.js 1.8+

*

* License CC BY-SA 3.0

* Copyright 2010-2011, Manuele J Sarfatti

*/

(function($) {

$.widget("ui.nestedSortable", $.extend({}, $.ui.sortable.prototype, {

options: {

tabSize: 20,

disableNesting: 'ui-nestedSortable-no-nesting',

errorClass: 'ui-nestedSortable-error',

listType: 'ol',

maxLevels: 0,

revertOnError: 1

},//options

_create: function() {

this.element.data('sortable', this.element.data('nestedSortable'));

return $.ui.sortable.prototype._create.apply(this, arguments);

},//create

destroy: function() {

this.element

.removeData("nestedSortable")

.unbind(".nestedSortable");

return $.ui.sortable.prototype.destroy.apply(this, arguments);

},//destroy

_mouseDrag: function(event) {

//Compute the helpers position

this.position = this._generatePosition(event);

this.positionAbs = this._convertPositionTo("absolute");

if (!this.lastPositionAbs) {

this.lastPositionAbs = this.positionAbs;

}

//Do scrolling

if(this.options.scroll) {

var o = this.options, scrolled = false;

if(this.scrollParent[0] != document && this.scrollParent[0].tagName != 'HTML') {

if((this.overflowOffset.top + this.scrollParent[0].offsetHeight) - event.pageY < o.scrollSensitivity)

this.scrollParent[0].scrollTop = scrolled = this.scrollParent[0].scrollTop + o.scrollSpeed;

else if(event.pageY - this.overflowOffset.top < o.scrollSensitivity)

this.scrollParent[0].scrollTop = scrolled = this.scrollParent[0].scrollTop - o.scrollSpeed;

if((this.overflowOffset.left + this.scrollParent[0].offsetWidth) - event.pageX < o.scrollSensitivity)

this.scrollParent[0].scrollLeft = scrolled = this.scrollParent[0].scrollLeft + o.scrollSpeed;

else if(event.pageX - this.overflowOffset.left < o.scrollSensitivity)

this.scrollParent[0].scrollLeft = scrolled = this.scrollParent[0].scrollLeft - o.scrollSpeed;

} else {

if(event.pageY - $(document).scrollTop() < o.scrollSensitivity)

scrolled = $(document).scrollTop($(document).scrollTop() - o.scrollSpeed);

else if($(window).height() - (event.pageY - $(document).scrollTop()) < o.scrollSensitivity)

scrolled = $(document).scrollTop($(document).scrollTop() + o.scrollSpeed);

if(event.pageX - $(document).scrollLeft() < o.scrollSensitivity)

scrolled = $(document).scrollLeft($(document).scrollLeft() - o.scrollSpeed);

else if($(window).width() - (event.pageX - $(document).scrollLeft()) < o.scrollSensitivity)

scrolled = $(document).scrollLeft($(document).scrollLeft() + o.scrollSpeed);

}

if(scrolled !== false && $.ui.ddmanager && !o.dropBehaviour)

$.ui.ddmanager.prepareOffsets(this, event);

}

//Regenerate the absolute position used for position checks

this.positionAbs = this._convertPositionTo("absolute");

//Set the helper position

if(!this.options.axis || this.options.axis != "y") this.helper[0].style.left = this.position.left+'px';

if(!this.options.axis || this.options.axis != "x") this.helper[0].style.top = this.position.top+'px';

//Rearrange

for (var i = this.items.length - 1; i >= 0; i--) {

//Cache variables and intersection, continue if no intersection

var item = this.items[i], itemElement = item.item[0], intersection = this._intersectsWithPointer(item);

if (!intersection) continue;

if(itemElement != this.currentItem[0] //cannot intersect with itself

&& this.placeholder[intersection == 1 ? "next" : "prev"]()[0] != itemElement //no useless actions that have been done before

&& !$.contains(this.placeholder[0], itemElement) //no action if the item moved is the parent of the item checked

&& (this.options.type == 'semi-dynamic' ? !$.contains(this.element[0], itemElement) : true)

//&& itemElement.parentNode == this.placeholder[0].parentNode // only rearrange items within the same container

) {

$(itemElement).mouseenter();

this.direction = intersection == 1 ? "down" : "up";

if (this.options.tolerance == "pointer" || this._intersectsWithSides(item)) {

$(itemElement).mouseleave();

this._rearrange(event, item);

} else {

break;

}

// Clear emtpy ul's/ol's

this._clearEmpty(itemElement);

this._trigger("change", event, this._uiHash());

break;

}

}

var parentItem = (this.placeholder[0].parentNode.parentNode

&& $(this.placeholder[0].parentNode.parentNode).closest('.ui-sortable').length)

? $(this.placeholder[0].parentNode.parentNode)

: null,

level = this._getLevel(this.placeholder),

childLevels = this._getChildLevels(this.helper),

previousItem = this.placeholder[0].previousSibling ? $(this.placeholder[0].previousSibling) : null;

if (previousItem != null) {

while (previousItem[0].nodeName.toLowerCase() != 'li' || previousItem[0] == this.currentItem[0] || previousItem[0] == this.helper[0]) {

if (previousItem[0].previousSibling) {

previousItem = $(previousItem[0].previousSibling);

} else {

previousItem = null;

break;

}

}

}

newList = document.createElement(o.listType);

this.beyondMaxLevels = 0;

// If the item is moved to the left, send it to its parent level

if (parentItem != null && this.positionAbs.left < parentItem.offset().left) {

parentItem.after(this.placeholder[0]);

this._clearEmpty(parentItem[0]);

this._trigger("change", event, this._uiHash());

}

// If the item is below another one and is moved to the right, make it a children of it

else if (previousItem != null && this.positionAbs.left > previousItem.offset().left + o.tabSize) {

this._isAllowed(previousItem, level+childLevels+1);

if (!previousItem.children(o.listType).length) {

previousItem[0].appendChild(newList);

}

previousItem.children(o.listType)[0].appendChild(this.placeholder[0]);

this._trigger("change", event, this._uiHash());

}

else {

this._isAllowed(parentItem, level+childLevels);

}

//Post events to containers

this._contactContainers(event);

//Interconnect with droppables

if($.ui.ddmanager) $.ui.ddmanager.drag(this, event);

//Call callbacks

this._trigger('sort', event, this._uiHash());

this.lastPositionAbs = this.positionAbs;

return false;

},//_mouseDrag

_mouseStop: function(event, noPropagation) {

// If the item is in a position not allowed, send it back

if (this.beyondMaxLevels) {

this.placeholder.removeClass(this.options.errorClass);

if (this.options.revertOnError) {

if (this.domPosition.prev) {

$(this.domPosition.prev).after(this.placeholder);

} else {

$(this.domPosition.parent).prepend(this.placeholder);

}

this._trigger("revert", event, this._uiHash());

} else {

var parent = this.placeholder.parent().closest(this.options.items);

for (var i = this.beyondMaxLevels - 1; i > 0; i--) {

parent = parent.parent().closest(this.options.items);

}

parent.after(this.placeholder);

this._trigger("change", event, this._uiHash());

}

}

// Clean last empty ul/ol

for (var i = this.items.length - 1; i >= 0; i--) {

var item = this.items[i].item[0];

this._clearEmpty(item);

}

$.ui.sortable.prototype._mouseStop.apply(this, arguments);

},//_mouseStop

serialize: function(o) {

// 'o' is a hash of the options of the plugin (?)

// items is an array the dom elements lifted from the page, so we can work on them.

// It looks something like [li#menu_item_37.menu_item, li#menu_item_38.menu_item, ...]

var items = this._getItemsAsjQuery(o && o.connected),

str = []; o = o || {};

// Now we go through each of these items

$(items).each(function() {

var res = ($(o.item || this).attr(o.attribute || 'id') || '')

.match(

o.expression || (/(.+)[-=_](.+)/)),

pid = ($(o.item || this).parent(o.listType)

.parent('li')

.attr(o.attribute || 'id') || '')

.match(o.expression || (/(.+)[-=_](.+)/));

// At this point...

// 'res' looks like this: ["menu_item_47", "menu_item", "47"]

// pid looks like this, IF the item (res) has a parent: ["menu_item_46", "menu_item", "46"]

// Here we setup the response's parent_id

if (res) {

// Updated the following line to have res[0] (instead of res[2]), which will make the itemName be menu_item_47

itemName = (o.key && o.expression ? res[1] : res[0]);

// itemScope looks like this: menu_item[menu_item_37]

itemScope = o.key || res[1] + '[' + itemName + ']'

//create the parentId string, which will look like menu_item[menu_item_37][parent_id]=root

parentStr = itemScope + '[parent_id]=' + (pid ? (o.key && o.expression ? pid[1] : pid[2]) : 'root')

//create the position string, which will look like menu_item[menu_item_37][position]=0

//this is 0-based position

positionStr = itemScope + '[position]=' + $(this).index();

//push the parentStr and positionStr strings into the str array

str.push(parentStr);

str.push(positionStr);

}

});

if(!str.length && o.key) {

str.push(o.key + '=');

}

return str.join('&');

},//serialize

toHierarchy: function(o) {

o = o || {};

var sDepth = o.startDepthCount || 0,

ret = [];

$(this.element).children('li').each(function () {

var level = _recursiveItems($(this));

ret.push(level);

});

return ret;

function _recursiveItems(li) {

var id = ($(li).attr(o.attribute || 'id') || '').match(o.expression || (/(.+)[-=_](.+)/));

if (id) {

var item = {"id" : id[2]};

if ($(li).children(o.listType).children('li').length > 0) {

item.children = [];

$(li).children(o.listType).children('li').each(function() {

var level = _recursiveItems($(this));

item.children.push(level);

});

}

return item;

}

}

},//toHierarchy

toArray: function(o) {

o = o || {};

var sDepth = o.startDepthCount || 0,

ret = [],

left = 2;

ret.push({

"item_id": 'root',

"parent_id": 'none',

"depth": sDepth,

"left": '1',

"right": ($('li', this.element).length + 1) * 2

});

$(this.element).children('li').each(function () {

left = _recursiveArray(this, sDepth + 1, left);

});

ret = ret.sort(function(a,b){ return (a.left - b.left); });

return ret;

function _recursiveArray(item, depth, left) {

var right = left + 1,

id,

pid;

if ($(item).children(o.listType).children('li').length > 0) {

depth ++;

$(item).children(o.listType).children('li').each(function () {

right = _recursiveArray($(this), depth, right);

});

depth --;

}

id = ($(item).attr(o.attribute || 'id')).match(o.expression || (/(.+)[-=_](.+)/));

if (depth === sDepth + 1) {

pid = 'root';

} else {

var parentItem = ($(item).parent(o.listType)

.parent('li')

.attr(o.attribute || 'id'))

.match(o.expression || (/(.+)[-=_](.+)/));

pid = parentItem[2];

}

if (id) {

ret.push({"item_id": id[2], "parent_id": pid, "depth": depth, "left": left, "right": right});

}

left = right + 1;

return left;

} //_recursiveArray

},//toArray

_clearEmpty: function(item) {

var emptyList = $(item).children(this.options.listType);

if (emptyList.length && !emptyList.children().length) {

emptyList.remove();

}

},//_clearEmpty

_getLevel: function(item) {

var level = 1;

if (this.options.listType) {

var list = item.closest(this.options.listType);

while (!list.is('.ui-sortable')) {

level++;

list = list.parent().closest(this.options.listType);

}

}

return level;

}, //_getLevel

_getChildLevels: function(parent, depth) {

var self = this,

o = this.options,

result = 0;

depth = depth || 0;

$(parent).children(o.listType).children(o.items).each(function (index, child) {

result = Math.max(self._getChildLevels(child, depth + 1), result);

});

return depth ? result + 1 : result;

}, //_getChildLevels

_isAllowed: function(parentItem, levels) {

var o = this.options;

// Are we trying to nest under a no-nest or are we nesting too deep?

if (parentItem == null || !(parentItem.hasClass(o.disableNesting))) {

if (o.maxLevels < levels && o.maxLevels != 0) {

this.placeholder.addClass(o.errorClass);

this.beyondMaxLevels = levels - o.maxLevels;

} else {

this.placeholder.removeClass(o.errorClass);

this.beyondMaxLevels = 0;

}

} else {

this.placeholder.addClass(o.errorClass);

if (o.maxLevels < levels && o.maxLevels != 0) {

this.beyondMaxLevels = levels - o.maxLevels;

} else {

this.beyondMaxLevels = 1;

}

}

} //_isAllowed

}));//widget

$.ui.nestedSortable.prototype.options = $.extend({}, $.ui.sortable.prototype.options, $.ui.nestedSortable.prototype.options);

})(jQuery);