初始化

lmxdawn · Dec 25, 2016 · c3a150d · c3a150d
commit c3a150d
Show file tree

Hide file tree

Showing 150 changed files with 8,591 additions and 0 deletions.
diff --git a/.gitignore b/.gitignore
@@ -0,0 +1,4 @@
+.idea
+composer.lock
+*.log
+thinkphp
diff --git a/101_188.swf b/101_188.swf
diff --git a/2_Flat_logo_on_transparent.png b/2_Flat_logo_on_transparent.png
diff --git a/README.md b/README.md
@@ -0,0 +1 @@
+# 测试项目,比较乱
diff --git a/ajax_test.html b/ajax_test.html
@@ -0,0 +1,52 @@
+<!DOCTYPE html>
+<!--
+To change this license header, choose License Headers in Project Properties.
+To change this template file, choose Tools | Templates
+and open the template in the editor.
+-->
+<html>
+    <head>
+
+
+        <title>TODO supply a title</title>
+        <meta charset="UTF-8">
+        <meta name="viewport" content="width=device-width, initial-scale=1.0">
+
+        <script src="./jquery-1.7.min.js"></script>
+        <link rel="shortcut icon" href="./favicon.ico">
+
+    </head>
+    <body>
+        <button id="ajax">测试ajax跨域</button>
+
+        <div>
+
+
+        </div>
+
+        <script>
+            $(function () {
+                $("#ajax").click(function () {
+                    var _url = 'http://www.bbb.com/test.php?jsoncallback=?';
+                    //var _url = 'http://www.aaa.com/test.php?jsoncallback=?';
+                    $.ajax({
+                        type:'get',
+                        url:_url,
+                        dataType:'json',
+                        success : function(json){
+                            alert(json.name)
+                            console.log(json);
+                        },
+                        error : function(){
+                            console.log("失败");
+                        }
+                    });
+                    return false;
+                });
+
+            });
+
+        </script>
+
+    </body>
+</html>
diff --git a/code.php b/code.php
@@ -0,0 +1,62 @@
+<?php
+
+session_start();
+function random($len) {
+    $srcstr = "1a2s3d4f5g6hj8k9qwertyupzxcvbnm";
+    mt_srand();
+    $strs = "";
+    for ($i = 0; $i < $len; $i++) {
+        $strs .= $srcstr[mt_rand(0, 30)];
+    }
+    return $strs;
+}
+
+//随机生成的字符串
+$str = random(4); 
+
+//验证码图片的宽度
+$width  = 50;      
+
+//验证码图片的高度
+$height = 25;     
+
+//声明需要创建的图层的图片格式
+@ header("Content-Type:image/png");
+
+//创建一个图层
+$im = imagecreate($width, $height);
+
+//背景色
+$back = imagecolorallocate($im, 0xFF, 0xFF, 0xFF);
+
+//模糊点颜色
+$pix  = imagecolorallocate($im, 187, 230, 247);
+
+//字体色
+$font = imagecolorallocate($im, 41, 163, 238);
+
+//绘模糊作用的点
+mt_srand();
+for ($i = 0; $i < 1000; $i++) {
+    imagesetpixel($im, mt_rand(0, $width), mt_rand(0, $height), $pix);
+}
+
+//输出字符
+imagestring($im, 5, 7, 5, $str, $font);
+
+//输出矩形
+imagerectangle($im, 0, 0, $width -1, $height -1, $font);
+
+//输出图片
+imagepng($im);
+
+imagedestroy($im);
+
+$str = md5($str);
+
+//选择 cookie
+//SetCookie("verification", $str, time() + 7200, "/");
+
+//选择 Session
+$_SESSION["verification"] = $str;
+?>
diff --git a/favicon.ico b/favicon.ico
diff --git a/java-rsa/Barrett.js b/java-rsa/Barrett.js
@@ -0,0 +1,74 @@
+// BarrettMu, a class for performing Barrett modular reduction computations in
+// JavaScript.
+//
+// Requires BigInt.js.
+//
+// Copyright 2004-2005 David Shapiro.
+//
+// You may use, re-use, abuse, copy, and modify this code to your liking, but
+// please keep this header.
+//
+// Thanks!
+// 
+// Dave Shapiro
+// dave@ohdave.com 
+
+function BarrettMu(m)
+{
+	this.modulus = biCopy(m);
+	this.k = biHighIndex(this.modulus) + 1;
+	var b2k = new BigInt();
+	b2k.digits[2 * this.k] = 1; // b2k = b^(2k)
+	this.mu = biDivide(b2k, this.modulus);
+	this.bkplus1 = new BigInt();
+	this.bkplus1.digits[this.k + 1] = 1; // bkplus1 = b^(k+1)
+	this.modulo = BarrettMu_modulo;
+	this.multiplyMod = BarrettMu_multiplyMod;
+	this.powMod = BarrettMu_powMod;
+}
+
+function BarrettMu_modulo(x)
+{
+	var q1 = biDivideByRadixPower(x, this.k - 1);
+	var q2 = biMultiply(q1, this.mu);
+	var q3 = biDivideByRadixPower(q2, this.k + 1);
+	var r1 = biModuloByRadixPower(x, this.k + 1);
+	var r2term = biMultiply(q3, this.modulus);
+	var r2 = biModuloByRadixPower(r2term, this.k + 1);
+	var r = biSubtract(r1, r2);
+	if (r.isNeg) {
+		r = biAdd(r, this.bkplus1);
+	}
+	var rgtem = biCompare(r, this.modulus) >= 0;
+	while (rgtem) {
+		r = biSubtract(r, this.modulus);
+		rgtem = biCompare(r, this.modulus) >= 0;
+	}
+	return r;
+}
+
+function BarrettMu_multiplyMod(x, y)
+{
+	/*
+	x = this.modulo(x);
+	y = this.modulo(y);
+	*/
+	var xy = biMultiply(x, y);
+	return this.modulo(xy);
+}
+
+function BarrettMu_powMod(x, y)
+{
+	var result = new BigInt();
+	result.digits[0] = 1;
+	var a = x;
+	var k = y;
+	while (true) {
+		if ((k.digits[0] & 1) != 0) result = this.multiplyMod(result, a);
+		k = biShiftRight(k, 1);
+		if (k.digits[0] == 0 && biHighIndex(k) == 0) break;
+		a = this.multiplyMod(a, a);
+	}
+	return result;
+}
+