zoukankan      html  css  js  c++  java
  • Javascript 代码洁癖

    var Global={};
    Global.namespace=function(str){
    	var arr=str.split("."),o=Global;
    	for(var i=(arr[0])=="Global" ? 1 : 0;i<arr.length;i++){
    		o[arr[i]]=o[arr[i]] || {};
    		o=o[arr[i]];
    	}
    }
    Global.namespace("Dom");
    Global.namespace("Event");
    /****************************************/
    
    var Myfun=function(){
    	var event=Global.event,
    	    dom=Global.Dom;
    	    
    }
    
    /***************************************/
    var demo=(function(){
    
    	var options={
    		age:23,
    		sex:"nan",
    		name:"wangwenfei"
    	};
    	return {
    		toAge:function(){
    			console.log(options.age);
    		},
    		toSex:function(){
    			console.log(options.sex);
    		},
    		toName:function(){
    			console.log(options.name);
    		}
    	}
    
    }())
    /***************************************/
    var module=(function(){
    	var foo="bar";
    	var module=function(){
    		this.age="12";
    		this.sex="nv";
    		this.name="module";
    		this.val=foo;
    	};
    	module.prototype={
    		constructor:module,
    		toAge:function(){
    			console.log(this.age);
    		},
    		toVal:function(){
    			console.log(this.val);
    		}
    	};
    	return module;	
    }())
    /***************************************/
    
    var DataStore=(function(){
    	var data=[];
    	return {
    		toPush:function(value){
    			return data.push(value);
    		},
    		toSlice:function(k){
    		
    			return data.slice(k);
    		},
    		toLength:function(){
    			return data.length;
    		}
    	}
    })()
    
    /***************************************/
    //Sandbox Module
    
    function Sandbox(){
    	var args=Array.prototype.slice.call(arguments),
    		callback=args.pop(),
    		modules=(args[0] && typeof args[0]==="string") ? args : args[0],
    		i;
    		if(!(this instanceof Sandbox)){
    			return new Sandbox(modules,callback);
    		}
    		this.a=1;
    		this.b=2;
    		
    		if(!modules || modules==="*"){
    			modules=[];
    			for(i in Sandbox.modules){
    				if(Sandbox.modules.hasOwnProperty(i)){
    					modules.push(i);
    				}
    			}
    		}
    		for(i=0;i<modules.length;i++){
    			Sandbox.modules[modules[i]](this);
    		}
    		callback(this);
    }
    
    Sandbox.prototype={
    	name:"My Application",
    	version:"1.0",
    	getName:function(){
    		return this.name;
    	}
    }
    /***************************************/
    if(typeof Function.prototype.metho !=="function"){
    	Function.prototype.method=function(name,implementation){
    		this.prototype[name]=implementation;
    		return this;
    	}
    }
    /***************************************/
    

      貌似我有代码洁癖 坑爹

  • 相关阅读:
    【LeetCode】Binary Tree Upside Down
    【LeetCode】171. Excel Sheet Column Number
    【LeetCode】Longest Substring with At Most Two Distinct Characters (2 solutions)
    【Algorithm】回溯法与深度优先遍历的异同
    【C++】自定义比较函数小结
    【LeetCode】4. Median of Two Sorted Arrays (2 solutions)
    【LeetCode】3. Longest Substring Without Repeating Characters (2 solutions)
    【LeetCode】Add Two Numbers
    【LeetCode】5. Longest Palindromic Substring
    【LeetCode】6. ZigZag Conversion
  • 原文地址:https://www.cnblogs.com/wangwenfei/p/javascript.html
Copyright © 2011-2022 走看看