(编辑:jimmy 日期: 2024/11/19 浏览:2)
本文实例讲述了JS字典Dictionary类定义与用法。分享给大家供大家参考,具体如下:
字典 Dictionary类
/*字典 Dictionary类*/ function Dictionary() { this.add = add; this.datastore = new Array(); this.find = find; this.remove = remove; this.showAll = showAll; this.count = count; this.clear = clear; } function add(key, value) { this.datastore[key] = value; } function find(key) { return this.datastore[key]; } function remove(key) { delete this.datastore[key]; } function showAll() { var str = ""; for(var key in this.datastore) { str += key + " -> " + this.datastore[key] + "; " } console.log(str); } function count() { /*var ss = Object.keys(this.datastore).length; console.log("ssss "+ss); return Object.keys(this.datastore).length;*/ /**/ var n = 0; for(var key in Object.keys(this.datastore)) { ++n; } console.log(n); return n; } function clear() { for(var key in this.datastore) { delete this.datastore[key]; } } var pbook = new Dictionary(); pbook.add("Mike", "723"); pbook.add("Jennifer", "987"); pbook.add("Jonathan", "666"); pbook.showAll();//Mike -> 723; Jennifer -> 987; Jonathan -> 666; pbook.count();//3 pbook.remove("Jennifer"); //pbook.clear(); pbook.showAll();//Mike -> 723; Jonathan -> 666; pbook.count();//2
这里使用在线HTML/CSS/JavaScript代码运行工具:http://tools.jb51.net/code/HtmlJsRun测试上述代码,可得如下运行结果:
更多关于JavaScript相关内容感兴趣的读者可查看本站专题:《JavaScript数据结构与算法技巧总结》、《JavaScript数学运算用法总结》、《JavaScript排序算法总结》、《JavaScript遍历算法与技巧总结》、《JavaScript查找算法技巧总结》及《JavaScript错误与调试技巧总结》
希望本文所述对大家JavaScript程序设计有所帮助。