Blame | Letzte Änderung | Log anzeigen | RSS feed
/*** ### Unique plugin** Enforces that no nodes with the same name can coexist as siblings.*//*globals jQuery, define, exports, require */(function (factory) {"use strict";if (typeof define === 'function' && define.amd) {define('jstree.unique', ['jquery','jstree'], factory);}else if(typeof exports === 'object') {factory(require('jquery'), require('jstree'));}else {factory(jQuery, jQuery.jstree);}}(function ($, jstree, undefined) {"use strict";if($.jstree.plugins.unique) { return; }/*** stores all defaults for the unique plugin* @name $.jstree.defaults.unique* @plugin unique*/$.jstree.defaults.unique = {/*** Indicates if the comparison should be case sensitive. Default is `false`.* @name $.jstree.defaults.unique.case_sensitive* @plugin unique*/case_sensitive : false,/*** A callback executed in the instance's scope when a new node is created and the name is already taken, the two arguments are the conflicting name and the counter. The default will produce results like `New node (2)`.* @name $.jstree.defaults.unique.duplicate* @plugin unique*/duplicate : function (name, counter) {return name + ' (' + counter + ')';}};$.jstree.plugins.unique = function (options, parent) {this.check = function (chk, obj, par, pos, more) {if(parent.check.call(this, chk, obj, par, pos, more) === false) { return false; }obj = obj && obj.id ? obj : this.get_node(obj);par = par && par.id ? par : this.get_node(par);if(!par || !par.children) { return true; }var n = chk === "rename_node" ? pos : obj.text,c = [],s = this.settings.unique.case_sensitive,m = this._model.data, i, j;for(i = 0, j = par.children.length; i < j; i++) {c.push(s ? m[par.children[i]].text : m[par.children[i]].text.toLowerCase());}if(!s) { n = n.toLowerCase(); }switch(chk) {case "delete_node":return true;case "rename_node":i = ($.inArray(n, c) === -1 || (obj.text && obj.text[ s ? 'toString' : 'toLowerCase']() === n));if(!i) {this._data.core.last_error = { 'error' : 'check', 'plugin' : 'unique', 'id' : 'unique_01', 'reason' : 'Child with name ' + n + ' already exists. Preventing: ' + chk, 'data' : JSON.stringify({ 'chk' : chk, 'pos' : pos, 'obj' : obj && obj.id ? obj.id : false, 'par' : par && par.id ? par.id : false }) };}return i;case "create_node":i = ($.inArray(n, c) === -1);if(!i) {this._data.core.last_error = { 'error' : 'check', 'plugin' : 'unique', 'id' : 'unique_04', 'reason' : 'Child with name ' + n + ' already exists. Preventing: ' + chk, 'data' : JSON.stringify({ 'chk' : chk, 'pos' : pos, 'obj' : obj && obj.id ? obj.id : false, 'par' : par && par.id ? par.id : false }) };}return i;case "copy_node":i = ($.inArray(n, c) === -1);if(!i) {this._data.core.last_error = { 'error' : 'check', 'plugin' : 'unique', 'id' : 'unique_02', 'reason' : 'Child with name ' + n + ' already exists. Preventing: ' + chk, 'data' : JSON.stringify({ 'chk' : chk, 'pos' : pos, 'obj' : obj && obj.id ? obj.id : false, 'par' : par && par.id ? par.id : false }) };}return i;case "move_node":i = ( (obj.parent === par.id && (!more || !more.is_multi)) || $.inArray(n, c) === -1);if(!i) {this._data.core.last_error = { 'error' : 'check', 'plugin' : 'unique', 'id' : 'unique_03', 'reason' : 'Child with name ' + n + ' already exists. Preventing: ' + chk, 'data' : JSON.stringify({ 'chk' : chk, 'pos' : pos, 'obj' : obj && obj.id ? obj.id : false, 'par' : par && par.id ? par.id : false }) };}return i;}return true;};this.create_node = function (par, node, pos, callback, is_loaded) {if(!node || node.text === undefined) {if(par === null) {par = $.jstree.root;}par = this.get_node(par);if(!par) {return parent.create_node.call(this, par, node, pos, callback, is_loaded);}pos = pos === undefined ? "last" : pos;if(!pos.toString().match(/^(before|after)$/) && !is_loaded && !this.is_loaded(par)) {return parent.create_node.call(this, par, node, pos, callback, is_loaded);}if(!node) { node = {}; }var tmp, n, dpc, i, j, m = this._model.data, s = this.settings.unique.case_sensitive, cb = this.settings.unique.duplicate;n = tmp = this.get_string('New node');dpc = [];for(i = 0, j = par.children.length; i < j; i++) {dpc.push(s ? m[par.children[i]].text : m[par.children[i]].text.toLowerCase());}i = 1;while($.inArray(s ? n : n.toLowerCase(), dpc) !== -1) {n = cb.call(this, tmp, (++i)).toString();}node.text = n;}return parent.create_node.call(this, par, node, pos, callback, is_loaded);};};// include the unique plugin by default// $.jstree.defaults.plugins.push("unique");}));