首页 > 代码库 > js39---组合模式,查找遍历树
js39---组合模式,查找遍历树
/** *有这样一个需求 *有一个学校有2个班(一班,二班) *每个班级分2个小组(一班一组,一班二组,二班一组,二班二组) *学校计算机教室有限,每一个小组分着来上课. *考试的时候大家一起考 *请用程序来模拟这个需求 */ (function(){ //不用组合模式 //学校类 var school = function(name){ this.name = name; //班级 var classes = new Array(); this.addClasses = function(cla){ classes.push(cla); return this; } this.getClasses = function(){ return classes; } } //班级类 var classes = function(name){ this.name = name; var groups = new Array(); this.getGroup = function(){ return groups; } this.addGroup = function(group){ groups.push(group); return this; } } //组 var group = function(name){ this.name = name; var students = new Array(); this.getStudent = function(){ return students; } this.addStudent = function(stu){ students.push(stu); return this; } } //学生类 var student = function(name){ this.name = name; this.goToClass = function(){ document.write(this.name+" 去上课"); } this.finishClass = function(){ document.write(this.name+" 下课"); } } //测试 var a = new student("a"); var b = new student("b"); var c = new student("c"); var d = new student("d"); var e = new student("e"); var f = new student("f"); var g = new student("g"); var h = new student("h"); var i = new student("i"); var one = new classes("一班"); var oneOne = new group("一班一组"); oneOne.addStudent(a).addStudent(b); var oneTwo = new group("一班二组"); oneTwo.addStudent(c).addStudent(d); one.addGroup(oneOne).addGroup(oneTwo); var two = new classes("二班"); var twoOne = new group("二班一组"); twoOne.addStudent(e).addStudent(f); var twoTwo = new group("二班二组"); twoTwo.addStudent(g).addStudent(h).addStudent(i) two.addGroup(twoOne).addGroup(twoTwo); var usPcat = new school("波斯卡特计算机培训学校"); usPcat.addClasses(one).addClasses(two); //调用 就写一个 一班一组去上课 var classes= usPcat.getClasses(); for (var i = 0; i < classes.length; i++) { if(classes[i].name == "一班"){ for (var j = 0; j < classes[i].getGroup().length; j++) { // document.write(classes[i].getGroup()[j]) if(classes[i].getGroup()[j].name == "一班一组"){ var s = classes[i].getGroup()[j].getStudent(); for (var k = 0; k < s.length; k++) { s[k].goToClass(); } } } } } //我快些吐了 //这种方法一定不是和业务的扩展 })()
/** * 组合模式 */ (function(){ //统一接口 var composite = new Interface("composite",["getChildByName","add"]); var student= new Interface("composite",["goToClass","finishClass"]); //定义组合类 var compositeObj = function(name){ this.name = name; this.type = "com";//默认是组合类 var childs = new Array(); //得到相关的所有孩子节点 this.getChildByName = function(name){ //涉及到递归 var toChilds = new Array(); if(!name){//没有传名字,左根遍历树 for (var i = 0; i < childs.length; i++) { if(childs[i].type == "com"){ toChilds = toChilds.concat(childs[i].getChildByName()); }else{ toChilds.push(childs[i]); } } }else{//左先根查找树 for (var i = 0; i < childs.length; i++) { if(childs[i].name == name){ if(childs[i].type == "com"){ toChilds = toChilds.concat(childs[i].getChildByName()); break; }else{ toChilds.push(childs[i]); break; } }else{ if(childs[i].type == "com"){ toChilds = toChilds.concat(childs[i].getChildByName(name)); } } } } return toChilds; } //增加子节点 this.add = function(child){ childs.push(child); return this; } //去上课 this.goToClass = function(name){ var toChilds = this.getChildByName(name); for (var i = 0; i < toChilds.length; i++) { toChilds[i].goToClass(); } } //下课 this.finishClass = function(name){ var toChilds = this.getChildByName(name); for (var i = 0; i < toChilds.length; i++) { toChilds[i].finishClass(); } } Interface.ensureImplements(this,composite,student) } //定义叶子类 var studentObj = function(name){ this.name = name; this.type = "stu";//默认是叶子 //得到相关的所有孩子节点 this.getChildByName = function(name){ if(this.name == name){ return this; }else{ return null; } } //增加子节点 this.add = function(child){ throw new Error("add 不成被初始化(在叶子了中)"); } //去上课 this.goToClass = function(name){ document.write(this.name +" 去上课<br>"); } //下课 this.finishClass = function(name){ document.write(this.name +" 下课<br>"); } Interface.ensureImplements(this,composite,student) } //测试 var a = new studentObj("a"); var b = new studentObj("b"); var c = new studentObj("c"); var d = new studentObj("d"); var e = new studentObj("e"); var f = new studentObj("f"); var g = new studentObj("g"); var h = new studentObj("h"); var i = new studentObj("i"); var one = new compositeObj("一班"); var oneOne = new compositeObj("一班一组"); oneOne.add(a).add(b); var oneTwo = new compositeObj("一班二组"); oneTwo.add(c).add(d); one.add(oneOne).add(oneTwo); var two = new compositeObj("二班"); var twoOne = new compositeObj("二班一组"); twoOne.add(e).add(f); var twoTwo = new compositeObj("二班二组"); twoTwo.add(g).add(h).add(i) two.add(twoOne).add(twoTwo); var usPcat = new compositeObj("波斯卡特计算机培训学校"); usPcat.add(one).add(two); //客户端调用API usPcat.goToClass(); document.write("-------------------------<br>"); usPcat.goToClass("一班"); document.write("-------------------------<br>"); usPcat.goToClass("二班一组"); document.write("-------------------------<br>"); usPcat.goToClass("a"); })()
js39---组合模式,查找遍历树
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。