function checkIsZenkaku(value) {
	  for (var i = 0; i < value.length; ++i) {
	    var c = value.charCodeAt(i);
	    //  半角カタカナは不許可
	    if (c < 256 || (c >= 0xff61 && c <= 0xff9f)) {
	      return false;
	    }
	  }
	  return true;
	}
	function getByteCount(value) {
	  var count = 0;
	  for ( var i = 0; i < value.length; ++i ) {
	    var sub = value.substring(i, i + 1);
	    var sub2 = toZenkaku(sub);
	    //全角の場合２バイト追加。
	    if( checkIsZenkaku(sub2) ){
	      count += 2;
	    } else {
	      count += 1;
	    }
	  }
	  return count;
	}
	function toHankakuSUJI(motoText) {
		txt = "０１２３４５６７８９０ー－-";
		zen = "01234567890---";
		str = "";
		for (i=0; i<motoText.length; i++)
		{
			c = motoText.charAt(i);
			n = txt.indexOf(c,0);
			if (n >= 0) c = zen.charAt(n);
			str += c;
		}
		return str;
	}


	function toHankakuSUJI2(motoText) {
		txt = "０１２３４５６７８９０ー－-,、";
		zen = "01234567890";
		str = "";
		for (i=0; i<motoText.length; i++)
		{
			c = motoText.charAt(i);
			n = txt.indexOf(c,0);
			if (n >= 0) c = zen.charAt(n);
			str += c;
		}
		return str;
	}


	function toHankakuEISUJI(motoText) {
		txt  = "０１２３４５６７８９０－ー。．＿＋＠";
		txt += "ＡＢＣＤＥＦＧＨＩＪＫＬＭＮＯＰＱＲＳＴＵＶＷＸＹＺ";
		txt += "ａｂｃｄｅｆｇｈｉｊｋｌｍｎｏｐｑｒｓｔｕｖｗｘｙｚ";
		zen  = "01234567890--.._+@";
		zen += "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
		zen += "abcdefghijklmnopqrstuvwxyz";

		
		str = "";
		for (i=0; i<motoText.length; i++)
		{
			c = motoText.charAt(i);
			n = txt.indexOf(c,0);
			if (n >= 0) c = zen.charAt(n);
			str += c;
		}
		return str;
	}


	function toZenkaku(motoText) {
		txt = "ｱｲｳｴｵｶｷｸｹｺｻｼｽｾｿﾀﾁﾂﾃﾄﾅﾆﾇﾈﾉﾊﾋﾌﾍﾎﾏﾐﾑﾒﾓﾔﾕﾖﾗﾘﾙﾚﾛﾜｦﾝｧｨｩｪｫｬｭｮｯ､｡ｰ｢｣ﾞﾟ";
		zen = "アイウエオカキクケコサシスセソタチツテトナニヌネノ";
		zen+= "ハヒフヘホマミムメモヤユヨラリルレロワヲンァィゥェォャュョッ、。ー「」　　";
		str = "";
		for (i=0; i<motoText.length; i++)
		{
			c = motoText.charAt(i);
			n = txt.indexOf(c,0);
			if (n >= 0) c = zen.charAt(n);
			str += c;
		}
		return str;
	}

	function NumberCheck(str_in) {
		var nLoop = 0;
		var nCheck = 0;
		var nOK = 0;
		arrNumber = new Array("1","2","3","4","5","6","7","8","9","0");
		//開始
		for (nLoop = 0; nLoop < str_in.length; nLoop++){
			for (nCheck = 0; nCheck < arrNumber.length; nCheck++){
				//数字check
				if (str_in.substring(nLoop, nLoop+1)== arrNumber[nCheck]){
					nOK++;
				}
			}
		}
		//結果表示
		if (nOK == str_in.length){
			return 1;
		}else{
			return 0;
		}
	}