利用MOB API接口，纯前端实现用登陆、注册、个人信息增删改查等功能
说一下需求。我的壁纸网站需要升级一个云同步功能，同步用户收藏的图片信息。但是我的服务器后台由于配置等原因实在无力去实现这套功能。
那么无意中看到一个第三方API居然可以免费实现用户系统的功能。。。那么就稍微花了一丢丢时间，实现了一个围绕这个api的纯前端的demo。
另外还用到了2个纯前端的 md5 加密 和 base64 加密解密的js，代码一起贴在后面了。
使用了多个第三方接口，包括
掌淘科技提供的 用户系统 API 和 K-V 数据存储API
http://api.mob.com/product/api/detail/12
http://api.mob.com/product/api/detail/32
使用前需要去他们官网注册一个mod key 网址 http://reg.mob.com
在此需要感谢一下 掌淘科技 http://www.mob.com 提供的非常强大的免费API
用户系统 API 官方说明如下
但是他的用户资料和用户数据都需要token,而实际测试发现每次登陆后token只能用一次就过期了，或者说第二次开始很大几率返回error
所以信息的增删改查使用另一个api实现 K-V 数据存储API 官方说明如下
首先说明一下，mob提供的接口，大部分都是针对安卓或者IOS上的APP或者小程序去设计的SDK。
但是！实际当中MOB API里的API都是通过HTTP GET方式请求的
所以前后端其实都可以实现，只是前端实现坑稍微多了一点
比如
直接用ajax调用会报错：No 'Access-Control-Allow-Origin' header 因为跨域了
那么如果不信邪非要用怎么办呢？
我的解决方案是用ajax jsonp来跨域
还是报错 Uncaught SyntaxError: Unexpected token : 因为用 jsoup不支持 返回 json 数据
那么如果不信邪非要用怎么办呢？
用yahoo提供的jsoup转json api可以实现 https://developer.yahoo.com/yql/?guccounter=1
(需要注意的是！这种实现方法显然是极不安全的！)
基本上就是这些，后面直接贴demo代码。
注意text.html里面的var key = ''; 需要填入你申请的mob的apikey，如果没有可以去免费申请一个 reg.mob.com
OK、那么直接上代码
text.html
<!DOCTYPE html>
<html>
<head>
<meta charset="UTF-8">
<title>test</title>
</head>
<body>
<input type="text" name="username" id='username'><input type="password" name="password" id="password">
<button id="login">登陆</button><button id="reg">注册</button>
<input type="text" name="text" id="item"><input type="text" name="text" id="value">
<button id='put' disabled="true">put</button>
<button id='query' disabled="true">query</button>
<button id='clear'>clear</button>
<span id="msg">未登录</span>
<br>
<span id="span"></span>
<script type="text/javascript" src="http://apps.bdimg.com/libs/jquery/2.1.4/jquery.min.js"></script>
<script type="text/javascript" src="md5.js"></script>
<script type="text/javascript" src="base64.js"></script>
<script type="text/javascript">
var key = '';//mod key 需要你自己去免费注册一个appkey 网址reg.mob.com
var yql = 'http://query.yahooapis.com/v1/public/yql';//yahoo jsonp2json
var times = 10;
var uid = '';
var token = '';
var base = new Base64();
$(function(){
var username = localStorage.getItem("username");
var password = localStorage.getItem("password");
if(username && password){
login(username,password);
initToken();
}
$('#reg').on('click',function(){
//这里的邮箱只是mob为了防止重复注册用的，没有任何功能，但一个邮箱只能注册一次
rigister($('#username').val(),$('#password').val(),'666@123.cn');
});
$('#login').on('click',function(){
login($('#username').val(),$('#password').val());
initToken();
});
$('#put').on('click',function(){
var item = $('#item').val();
var value = $('#value').val();
// put(uid,token,item,value);
kvPut(uid,item,value);
});
$('#query').on('click',function(){
var item = $('#item').val();
// query(uid,item);
kvGet(uid,item);
});
$('#clear').on('click',function(){
$('#span').text('');
});
//rigister('tczmh2', '123456','123@123.cn');
// login('tczmh2','123456');
});
function kvPut(uid,k,v){
k = base.encode(k);
v = base.encode(v);
var url = "http://apicloud.mob.com/ucache/put";
var query = 'select * from json where url="' + url + '?'
+ 'key=' + key + '&'
+ 'table=' + uid + '&'
+ 'k=' + k + '&'
+ 'v=' + v
+'"';
show(query);
$.ajax({
url:yql,
type:'get',
dataType: 'jsonp',
cache: false,
data: {
q: query,
format: 'json'
},
success:function(data){
var json = data.query.results.json;
show(json.retCode);
show(json.msg);
}
});
}
function kvGet(uid,k){
k = base.encode(k);
var url = "http://apicloud.mob.com/ucache/get";
var query = 'select * from json where url="' + url + '?'
+ 'key=' + key + '&'
+ 'table=' + uid + '&'
+ 'k=' + k
+'"';
show(query);
$.ajax({
url:yql,
type:'get',
dataType: 'jsonp',
cache: false,
data: {
q: query,
format: 'json'
},
success:function(data){
var json = data.query.results.json;
show(json.retCode);
show(json.msg);
show(json.result.k);
show(json.result.v);
}
});
}
/** 跟在登陆以后执行，因为登陆是异步操作，这里每秒1次共10次获取sessionStorage中的uid和token */
function initToken(){
uid = sessionStorage.getItem("uid");
token = sessionStorage.getItem("token");
if(times > 0){
if(!uid || !token){
times --;
setTimeout('initToken()', 1000);
show('initToken 不成功 '+times);
}else{
show('initToken 成功 '+times);
show(uid);
show(token);
$('#put').attr('disabled',false);
$('#query').attr('disabled',false);
}
}else{
show('initToken超时');
}
}
/** 登陆 */
function login(username, password){
var hash = hex_md5(password);
var url = "http://apicloud.mob.com/user/login";
var query = 'select * from json where url="' + url + '?'
+ 'key=' + key + '&'
+ 'username=' + username + '&'
+ 'password=' + hash
+'"';
show(query);
$.ajax({
url:yql,
type:'get',
dataType: 'jsonp',
cache: false,
data: {
q: query,
format: 'json'
},
success:function(data){
var json = data.query.results.json;
show(json.retCode);
show(json.msg);
// 异步存入 sessionStorage
sessionStorage.setItem("uid", json.result.uid);
sessionStorage.setItem("token", json.result.token);
// 长期保存用户名密码，可以用来自动登陆
localStorage.setItem("username",username);
localStorage.setItem("password",password);
$('#msg').text('已登录');
}
});
}
/** 注册 */
function rigister(username, password, email){
var hash = hex_md5(password);
var url = "http://apicloud.mob.com/user/rigister";
var query = 'select * from json where url="' + url + '?'
+ 'key=' + key + '&'
+ 'username=' + username + '&'
+ 'password=' + hash + '&'
+ 'email=' + email
+'"';
show(query);
$.ajax({
url:yql,
type:'get',
dataType: 'jsonp',
cache: false,
data: {
q: query,
format: 'json'
},
success:function(data){
var json = data.query.results.json;
show(json.retCode);//状态码 200为正常 其余有错
show(json.msg);//success为正常 其余为错误信息
show(json.result);//uid
}
});
}
function show(msg){
$('#span').append(msg+'<br>--------------------------<br>');
}
</script>
</body>
</html>md5.js
/*
* A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
* Digest Algorithm, as defined in RFC 1321.
* Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.
* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
* Distributed under the BSD License
* See http://pajhome.org.uk/crypt/md5 for more info.
*/
/*
* Configurable variables. You may need to tweak these to be compatible with
* the server-side, but the defaults work in most cases.
*/
var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */
var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */
/*
* These are the functions you'll usually want to call
* They take string arguments and return either hex or base-64 encoded strings
*/
function hex_md5(s){ return binl2hex(core_md5(str2binl(s), s.length * chrsz));}
function b64_md5(s){ return binl2b64(core_md5(str2binl(s), s.length * chrsz));}
function str_md5(s){ return binl2str(core_md5(str2binl(s), s.length * chrsz));}
function hex_hmac_md5(key, data) { return binl2hex(core_hmac_md5(key, data)); }
function b64_hmac_md5(key, data) { return binl2b64(core_hmac_md5(key, data)); }
function str_hmac_md5(key, data) { return binl2str(core_hmac_md5(key, data)); }
/*
* Perform a simple self-test to see if the VM is working
*/
function md5_vm_test()
{
return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";
}
/*
* Calculate the MD5 of an array of little-endian words, and a bit length
*/
function core_md5(x, len)
{
/* append padding */
x[len >> 5] |= 0x80 << ((len) % 32);
x[(((len + 64) >>> 9) << 4) + 14] = len;
var a = 1732584193;
var b = -271733879;
var c = -1732584194;
var d = 271733878;
for(var i = 0; i < x.length; i += 16)
{
var olda = a;
var oldb = b;
var oldc = c;
var oldd = d;
a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);
b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);
c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);
d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
c = md5_ff(c, d, a, b, x[i+10], 17, -42063);
b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);
d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);
c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);
a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);
b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);
c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);
b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);
d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);
a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);
b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);
a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);
b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);
a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);
c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);
d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);
a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);
c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);
b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);
a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);
c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);
d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);
b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);
d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);
c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);
a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);
b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);
a = safe_add(a, olda);
b = safe_add(b, oldb);
c = safe_add(c, oldc);
d = safe_add(d, oldd);
}
return Array(a, b, c, d);
}
/*
* These functions implement the four basic operations the algorithm uses.
*/
function md5_cmn(q, a, b, x, s, t)
{
return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);
}
function md5_ff(a, b, c, d, x, s, t)
{
return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
}
function md5_gg(a, b, c, d, x, s, t)
{
return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
}
function md5_hh(a, b, c, d, x, s, t)
{
return md5_cmn(b ^ c ^ d, a, b, x, s, t);
}
function md5_ii(a, b, c, d, x, s, t)
{
return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
}
/*
* Calculate the HMAC-MD5, of a key and some data
*/
function core_hmac_md5(key, data)
{
var bkey = str2binl(key);
if(bkey.length > 16) bkey = core_md5(bkey, key.length * chrsz);
var ipad = Array(16), opad = Array(16);
for(var i = 0; i < 16; i++)
{
ipad[i] = bkey[i] ^ 0x36363636;
opad[i] = bkey[i] ^ 0x5C5C5C5C;
}
var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz);
return core_md5(opad.concat(hash), 512 + 128);
}
/*
* Add integers, wrapping at 2^32. This uses 16-bit operations internally
* to work around bugs in some JS interpreters.
*/
function safe_add(x, y)
{
var lsw = (x & 0xFFFF) + (y & 0xFFFF);
var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
return (msw << 16) | (lsw & 0xFFFF);
}
/*
* Bitwise rotate a 32-bit number to the left.
*/
function bit_rol(num, cnt)
{
return (num << cnt) | (num >>> (32 - cnt));
}
/*
* Convert a string to an array of little-endian words
* If chrsz is ASCII, characters >255 have their hi-byte silently ignored.
*/
function str2binl(str)
{
var bin = Array();
var mask = (1 << chrsz) - 1;
for(var i = 0; i < str.length * chrsz; i += chrsz)
bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (i%32);
return bin;
}
/*
* Convert an array of little-endian words to a string
*/
function binl2str(bin)
{
var str = "";
var mask = (1 << chrsz) - 1;
for(var i = 0; i < bin.length * 32; i += chrsz)
str += String.fromCharCode((bin[i>>5] >>> (i % 32)) & mask);
return str;
}
/*
* Convert an array of little-endian words to a hex string.
*/
function binl2hex(binarray)
{
var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
var str = "";
for(var i = 0; i < binarray.length * 4; i++)
{
str += hex_tab.charAt((binarray[i>>] >> ((i%4)*8+4)) & 0xF) +
hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF);
}
return str;
}
/*
* Convert an array of little-endian words to a base-64 string
*/
function binl2b64(binarray)
{
var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
var str = "";
for(var i = 0; i < binarray.length * 4; i += 3)
{
var triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) << 16)
| (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 )
| ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF);
for(var j = 0; j < 4; j++)
{
if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
}
}
return str;
}base64.js
function Base64() {
// private property
_keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
// public method for encoding
this.encode = function (input) {
var output = "";
var chr1, chr2, chr3, enc1, enc2, enc3, enc4;
var i = 0;
input = _utf8_encode(input);
while (i < input.length) {
chr1 = input.charCodeAt(i++);
chr2 = input.charCodeAt(i++);
chr3 = input.charCodeAt(i++);
enc1 = chr1 >> 2;
enc2 = ((chr1 & 3) << 4) | (chr2 >> 4);
enc3 = ((chr2 & 15) << 2) | (chr3 >> 6);
enc4 = chr3 & 63;
if (isNaN(chr2)) {
enc3 = enc4 = 64;
} else if (isNaN(chr3)) {
enc4 = 64;
}
output = output +
_keyStr.charAt(enc1) + _keyStr.charAt(enc2) +
_keyStr.charAt(enc3) + _keyStr.charAt(enc4);
}
return output;
}
// public method for decoding
this.decode = function (input) {
var output = "";
var chr1, chr2, chr3;
var enc1, enc2, enc3, enc4;
var i = 0;
input = input.replace(/[^A-Za-z0-9\+\/\=]/g, "");
while (i < input.length) {
enc1 = _keyStr.indexOf(input.charAt(i++));
enc2 = _keyStr.indexOf(input.charAt(i++));
enc3 = _keyStr.indexOf(input.charAt(i++));
enc4 = _keyStr.indexOf(input.charAt(i++));
chr1 = (enc1 << 2) | (enc2 >> 4);
chr2 = ((enc2 & 15) << 4) | (enc3 >> 2);
chr3 = ((enc3 & 3) << 6) | enc4;
output = output + String.fromCharCode(chr1);
if (enc3 != 64) {
output = output + String.fromCharCode(chr2);
}
if (enc4 != 64) {
output = output + String.fromCharCode(chr3);
}
}
output = _utf8_decode(output);
return output;
}
// private method for UTF-8 encoding
_utf8_encode = function (string) {
string = string.replace(/\r\n/g,"\n");
var utftext = "";
for (var n = 0; n < string.length; n++) {
var c = string.charCodeAt(n);
if (c < 128) {
utftext += String.fromCharCode(c);
} else if((c > 127) && (c < 2048)) {
utftext += String.fromCharCode((c >> 6) | 192);
utftext += String.fromCharCode((c & 63) | 128);
} else {
utftext += String.fromCharCode((c >> 12) | 224);
utftext += String.fromCharCode(((c >> 6) & 63) | 128);
utftext += String.fromCharCode((c & 63) | 128);
}
}
return utftext;
}
// private method for UTF-8 decoding
_utf8_decode = function (utftext) {
var string = "";
var i = 0;
var c = c1 = c2 = 0;
while ( i < utftext.length ) {
c = utftext.charCodeAt(i);
if (c < 128) {
string += String.fromCharCode(c);
i++;
} else if((c > 191) && (c < 224)) {
c2 = utftext.charCodeAt(i+1);
string += String.fromCharCode(((c & 31) << 6) | (c2 & 63));
i += 2;
} else {
c2 = utftext.charCodeAt(i+1);
c3 = utftext.charCodeAt(i+2);
string += String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63));
i += 3;
}
}
return string;
}
}
测试入口test.html 效果如下图
送人玫瑰,手留余香
