javascript列表入门
来源:互联网 发布:国内论文数据库 编辑:程序博客网 时间:2024/06/17 12:45
[javascript]
// Created by LJF on 2017/01/14// Reference "data structure and algorithm with javascript"function list() {this.listSize = 0;this.pos = 0;this.dataStore = [];this.clear = clear;this.find = find;this.toString = toString;this.insert = insert;this.append = append;this.remove = remove;this.front = front;this.end = end;this.prev = prev;this.next = next;this.length =length;this.currPos = currPos;this.moveTo = moveTo;this.getElement = getElement;this.length = length;this.contains = contains;}function append(element) {this.dataStore[this.listSize++] = element;}function find(element) {for(var i = 0; i < this.dataStore.length; ++i){if(this.dataStore[i] == element){return i;}return -1; }}function remove(element) {var foundAt = this.find(element);if(foundAt > -1){this.dataStore.splice(foundAt, 1);--this.listSize;return true;}return false;}function length() {return this.listSize;}function toString() {return this.dataStore;}function insert(element, after) {var insertPos = this.find(after)if(insertPos > -1){this.dataStore.splice(insertPos+1, 0, element);++this.listSize;return true;}return false;}function clear() {delete this.dataStore;this.dataStore = [];this.listSize = this.pos = 0;}function contains(element) {for(var i = 0; i < this.dataStore.length; ++i){if(this.dataStore[i] == element){return true;}}return false;}function front() { this.pos = 0; } function end() { this.pos = this.listSize-1; } function prev() { if (this.pos > 0){ --this.pos; } } function next() { if (this.pos < this.listSize-1){ ++this.pos; }} function currPos() { return this.pos; } function moveTo(position) { this.pos = position; }function getElement() {return this.dataStore[this.pos];}// Extract the data from the file and then save the data in an arrayfunction createArr(file) {var arr = read(file).split("\n");for (var i = 0; i < arr.length; ++i) {arr[i] = arr[i].trim();}return arr;}// Define the displayList functionfunction displayList(list) {for(list.front(); list.currPos() < list.length; list.next){if(list.getElement() instanceof Customer){console.log(list.getElement()["name"] + "," + list.getElement()["movie"]);}else{console.log(list.getElement());}}}// This function used to check out moviesfunction checkOut(name, movie, filmList, customerList) {if(movieList.contains(movie)){var c = new Customer(name, movie);customerList.append(c);filmList.remove(movie);}else{console.log(movie + "is not available.");}}
0 0
- javascript列表入门
- javascript列表
- Javascript入门
- javascript 入门
- Javascript入门
- JavaScript入门
- javascript入门
- javascript入门
- JavaScript入门
- JavaScript 入门
- Javascript入门
- JavaScript入门
- Javascript入门
- JavaScript入门
- javascript入门
- javascript入门
- javascript入门
- JavaScript入门
- 牛客刷题(c++常用函数)
- 在shell脚本中调用另一个脚本的三种不同方法(fork, exec, source)
- ubuntu14.04 64bit中非编译安装ffmpeg
- Manifest.xml 入门基础 (五)<Activity>标签
- 前端开发者不得不知的ES6十大特性
- javascript列表入门
- 平面直线图(PSLG)模板
- 新罕布什尔南方大学Graduation 新罕布什尔南方大学CertifiCate
- Countries in War poj 3114 (有向图的双连通分量+缩点+最短路flyod)
- PHP命名空间(Namespace)的使用详解
- POJ-3268 Silver Cow Party(最短路spfa算法)
- 知道这20个正则表达式,能让你少写1,000行代码
- POJ 1845Sumdiv(数论)
- CodeForces - 757B Bash's Big Day (分解素因子)