this.count--;
return;
}
} while (Boolean(i = i.next))
},
exists: function (_key)
{
/// <summary>
/// 检查链表类中是否存在一个key
/// </summary>
/// <param type="String">
/// key的值
/// </param>
/// <returns type="Boolean">
/// </returns>
var i = this.root;
while (Boolean(i = i.next))
if (i.Key == _key)
return true;
return false;
},
removeAll: function ()
{
/// <summary>
/// 清空链表类
/// </summary>
this.root = new linkNode(null, null);
this.end = this.root;
this.count = 0;
},
Obj2str: function (o)
{
if (o == undefined)
{
return "";
}
var r = [];
if (typeof o == "string")
return "\"" + o.replace(/([\"\\])/g, "\\$1").replace(/(\n)/g, "\\n").replace(/(\r)/g, "\\r").replace(/(\t)/g, "\\t") + "\"";
if (typeof o == "object")
{
if (!o.sort)
{
for (var i in o)
r.push("\"" + i + "\":" + this.Obj2str(o[i]));
r = "{" + r.join() + "}";
}
else
{
for (var i = 0; i < o.length; i++)
r.push(this.Obj2str(o[i]))
r = "[" + r.join() + "]";
}
return r;
}
return o.toString().replace(/\"\:/g, '":""');
},
getJSON: function ()
{
/// <summary>
/// 转换成JSON字符串
/// </summary>
/// <returns type="String">
/// </returns>
//内部方法,用于递归
var me = this;
var getChild = function (node)
{
var str = "";
str += "{\"Key\":\"" + node.Key + "\",\"Value\":" + me.Obj2str(node.Value);
if (node.next != null)
str += ",\"next\":" + getChild(node.next);
else
str += ",\"next\":\"null\"";
str += "}";
return str;
};
var link = "{\"root\":{\"Key\":\"null\",\"Value\":\"null\",\"next\":";
if (this.count == 0)//如果空表
{
return "{\"root\":{\"Key\":\"null\",\"Value\":\"null\",\"next\":\"null\"},\"end\":{\"Key\":\"null\",\"Value\":\"null\",\"next\":\"null\"},\"count\":\"0\"}";
}
link += getChild(this.root.next) + "}";
//加上end
link += ",\"end\":{\"Key\":\"" + this.end.Key + "\",\"Value\":" + me.Obj2str(this.end.Value) + ",\"next\":\"null\"";
link += "},\"count\":\"" + this.count + "\"}";
return link;
},
getArrayJSON: function ()
{
/// <summary>
/// 转所有节点的value换成JSON字符串,数组格式
/// </summary>
/// <returns type="String">
/// </returns>
var link = "{\"link\":[";
var i = this.root;
while (Boolean(i = i.next))
{
link += this.Obj2str(i.Value) + ",";
}
link = link.substr(0, link.length - 1);
link += "]}";
return link;
},
sort: function (fn)
{
/// <summary>
/// 对链表进行排序
/// </summary>
/// <param type="Function">
/// 比较两个链表元素大小的方法,当返回真时,此方法的参数所指的节点将往下沉
/// </param>
if (fn != null)
{
js单向链表的具体实现实例(2)
内容版权声明:除非注明,否则皆为本站原创文章。