Enford před 5 roky
rodič
revize
7b44d1acb2
100 změnil soubory, kde provedl 16915 přidání a 0 odebrání
  1. 45 0
      src/main/webapp/static/oss/baiduapi.html
  2. 345 0
      src/main/webapp/static/oss/ie-ossupload.js
  3. 53 0
      src/main/webapp/static/oss/index.html
  4. 135 0
      src/main/webapp/static/oss/lib/base64.js
  5. 7 0
      src/main/webapp/static/oss/lib/crypto1/aes/aes-min.js
  6. 373 0
      src/main/webapp/static/oss/lib/crypto1/aes/aes.js
  7. 7 0
      src/main/webapp/static/oss/lib/crypto1/cbc/cbc-min.js
  8. 71 0
      src/main/webapp/static/oss/lib/crypto1/cbc/cbc.js
  9. 7 0
      src/main/webapp/static/oss/lib/crypto1/crypto-md5/crypto-md5.js
  10. 7 0
      src/main/webapp/static/oss/lib/crypto1/crypto-sha1-hmac-pbkdf2-marc4/crypto-sha1-hmac-pbkdf2-marc4.js
  11. 7 0
      src/main/webapp/static/oss/lib/crypto1/crypto-sha1-hmac-pbkdf2-ofb-aes/crypto-sha1-hmac-pbkdf2-ofb-aes.js
  12. 7 0
      src/main/webapp/static/oss/lib/crypto1/crypto-sha1-hmac-pbkdf2-rabbit/crypto-sha1-hmac-pbkdf2-rabbit.js
  13. 7 0
      src/main/webapp/static/oss/lib/crypto1/crypto-sha1-hmac-pbkdf2/crypto-sha1-hmac-pbkdf2.js
  14. 7 0
      src/main/webapp/static/oss/lib/crypto1/crypto-sha1/crypto-sha1.js
  15. 7 0
      src/main/webapp/static/oss/lib/crypto1/crypto-sha256/crypto-sha256.js
  16. 7 0
      src/main/webapp/static/oss/lib/crypto1/crypto/crypto-min.js
  17. 182 0
      src/main/webapp/static/oss/lib/crypto1/crypto/crypto.js
  18. 7 0
      src/main/webapp/static/oss/lib/crypto1/hmac/hmac-min.js
  19. 36 0
      src/main/webapp/static/oss/lib/crypto1/hmac/hmac.js
  20. 7 0
      src/main/webapp/static/oss/lib/crypto1/marc4/marc4-min.js
  21. 110 0
      src/main/webapp/static/oss/lib/crypto1/marc4/marc4.js
  22. 7 0
      src/main/webapp/static/oss/lib/crypto1/md5/md5-min.js
  23. 147 0
      src/main/webapp/static/oss/lib/crypto1/md5/md5.js
  24. 7 0
      src/main/webapp/static/oss/lib/crypto1/ofb/ofb-min.js
  25. 35 0
      src/main/webapp/static/oss/lib/crypto1/ofb/ofb.js
  26. 7 0
      src/main/webapp/static/oss/lib/crypto1/pbkdf2/pbkdf2-min.js
  27. 50 0
      src/main/webapp/static/oss/lib/crypto1/pbkdf2/pbkdf2.js
  28. 7 0
      src/main/webapp/static/oss/lib/crypto1/rabbit/rabbit-min.js
  29. 214 0
      src/main/webapp/static/oss/lib/crypto1/rabbit/rabbit.js
  30. 7 0
      src/main/webapp/static/oss/lib/crypto1/sha1/sha1-min.js
  31. 81 0
      src/main/webapp/static/oss/lib/crypto1/sha1/sha1.js
  32. 7 0
      src/main/webapp/static/oss/lib/crypto1/sha256/sha256-min.js
  33. 125 0
      src/main/webapp/static/oss/lib/crypto1/sha256/sha256.js
  34. binární
      src/main/webapp/static/oss/lib/plupload-2.1.2/js/Moxie.swf
  35. binární
      src/main/webapp/static/oss/lib/plupload-2.1.2/js/Moxie.xap
  36. 185 0
      src/main/webapp/static/oss/lib/plupload-2.1.2/js/jquery.plupload.queue.css
  37. 1 0
      src/main/webapp/static/oss/lib/plupload-2.1.2/js/jquery.plupload.queue.min.js
  38. 10726 0
      src/main/webapp/static/oss/lib/plupload-2.1.2/js/moxie.js
  39. 15 0
      src/main/webapp/static/oss/lib/plupload-2.1.2/js/moxie.min.js
  40. 2332 0
      src/main/webapp/static/oss/lib/plupload-2.1.2/js/plupload.dev.js
  41. 28 0
      src/main/webapp/static/oss/lib/plupload-2.1.2/js/plupload.full.min.js
  42. 339 0
      src/main/webapp/static/oss/lib/plupload-2.1.2/license.txt
  43. 147 0
      src/main/webapp/static/oss/lib/plupload-2.1.2/readme.md
  44. 27 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/bower.json
  45. 85 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/examples/custom.html
  46. 27 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/examples/dump.php
  47. 217 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/examples/events.html
  48. 139 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/examples/jquery/all_runtimes.html
  49. 113 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/examples/jquery/jquery_ui_widget.html
  50. 66 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/examples/jquery/queue_widget.html
  51. 125 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/examples/jquery/s3.php
  52. 125 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/examples/upload.php
  53. binární
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/Moxie.swf
  54. binární
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/Moxie.xap
  55. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ar.js
  56. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/az.js
  57. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/bg.js
  58. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/bs.js
  59. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ca.js
  60. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/cs.js
  61. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/cy.js
  62. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/da.js
  63. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/de.js
  64. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/el.js
  65. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/en.js
  66. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/es.js
  67. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/et.js
  68. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/fa.js
  69. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/fi.js
  70. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/fr.js
  71. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/he.js
  72. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/hr.js
  73. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/hu.js
  74. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/hy.js
  75. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/id.js
  76. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/it.js
  77. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ja.js
  78. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ka.js
  79. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/kk.js
  80. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/km.js
  81. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ko.js
  82. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ku_IQ.js
  83. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/lt.js
  84. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/lv.js
  85. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ms.js
  86. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/nl.js
  87. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/pl.js
  88. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/pt.js
  89. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/pt_BR.js
  90. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ro.js
  91. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ru.js
  92. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/sk.js
  93. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/sl.js
  94. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/sq.js
  95. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/sr.js
  96. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/sv.js
  97. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/th_TH.js
  98. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/tr.js
  99. 2 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/uk_UA.js
  100. 0 0
      src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/vi.js

+ 45 - 0
src/main/webapp/static/oss/baiduapi.html

@@ -0,0 +1,45 @@
+<html>
+<head>
+  <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
+  <meta name="viewport" content="initial-scale=1.0, user-scalable=no" />
+  <style type="text/css">
+    body, html{width: 100%;height: 100%;margin:0;font-family:"微软雅黑";}
+    #allmap{height:500px;width:100%;}
+    #r-result{width:100%; font-size:14px;}
+  </style>
+  <script type="text/javascript" src="http://api.map.baidu.com/api?v=2.0&ak=loaxPeDrzZ6xgvSMwiI8M61I5mK6l8dB"></script>
+  <title>城市名定位</title>
+</head>
+<body>
+  <div id="allmap"></div>
+  <div id="r-result">
+    城市名: <input id="cityName" type="text" style="width:100px; margin-right:10px;" />
+    <input type="button" value="查询" onclick="theLocation()" />
+  </div>
+</body>
+</html>
+<script type="text/javascript">
+  // 百度地图API功能
+  var map = new BMap.Map("allmap");
+  var point = new BMap.Point(116.331398,39.897445);
+  map.centerAndZoom(point,11);
+
+  function theLocation(){
+    var city = document.getElementById("cityName").value;
+    if(city != ""){
+      map.centerAndZoom(city,11);      // 用城市名设置地图中心点
+    }
+     
+      }
+   map.enableScrollWheelZoom(true);  
+   function showInfo(e){
+     console.log(e.point.lng + ", " + e.point.lat)
+      var point = new BMap.Point(e.point.lng,e.point.lat);    //用所定位的经纬度查找所在地省市街道等信息
+            var gc = new BMap.Geocoder();
+            gc.getLocation(point, function(rs){
+               var addComp = rs.addressComponents;
+               console.log(rs.address);//地址信息             
+            });
+      }
+      map.addEventListener("click", showInfo);
+</script>

+ 345 - 0
src/main/webapp/static/oss/ie-ossupload.js

@@ -0,0 +1,345 @@
+var requestUrl;
+var returnUrl;
+
+function IsSupportMultipartUpload()
+{
+    var userAgent = navigator.userAgent; //取得浏览器的userAgent字符串
+    var isIE = userAgent.indexOf("compatible") > -1 && userAgent.indexOf("MSIE") > -1 && !isOpera; //判断是否IE浏览器
+    return !isIE;
+}
+
+function IsSupportH5()
+{
+    var userAgent = navigator.userAgent;
+    var isEdge = userAgent.indexOf("Edge") > -1;
+    if(isEdge)
+        return true;
+    var reIE = new RegExp("MSIE (\\d+\\.\\d+);");
+    reIE.test(userAgent);
+    var fIEVersion = parseFloat(RegExp["$1"]);
+    if(fIEVersion >= 10)
+        return true;
+    else
+        return false;
+}
+// var accessid= 'LTAIzG5m63BhoGa7';
+// var accesskey= 'J0mEs8AYtgGWrfC54cSGgUXHCOOjvS';
+// var host = 'http://cdn.gangwaninfo.com';
+// var now = timestamp = Date.parse(new Date()) / 1000;
+// var policyText = {
+//     "expiration": "2020-01-01T12:00:00.000Z", //设置该Policy的失效时间,超过这个失效时间之后,就没有办法通过这个policy上传文件了
+//     "conditions": [
+//         ["content-length-range", 0, 1048576000] // 设置上传文件的大小限制
+//     ]
+// };
+//
+// var policyBase64 = Base64.encode(JSON.stringify(policyText))
+// message = policyBase64
+// var bytes = Crypto.HMAC(Crypto.SHA1, message, accesskey, { asBytes: true }) ;
+// var signature = Crypto.util.bytesToBase64(bytes);
+
+var accessid ="";
+var exdate = null;
+var host = "";
+var signature = "";
+var policyBase64 = "";
+
+
+function multipartUploadWithSts(storeAs, file,attachmentId,attachmentFlag,uploadPath,divId,size, cpt) {
+    console.log("-----------------------start");
+
+
+        if(IsSupportH5())
+        {
+            var cur = new Date();
+            if(exdate != null && cur < exdate)
+                uploadDirect(storeAs,file,attachmentId,attachmentFlag,uploadPath.replace('http://gangwan-app.oss-cn-hangzhou.aliyuncs.com', host),divId,size);
+            else
+            {
+                $.ajax({
+                    type:'get',
+                    url: realPath+"/a/previewController/getDirectAccess",
+                    dataType: 'JSON',
+                    success: function(result){
+                        console.log(result.accessid);
+
+                        accessid = result.accessid;
+                        var tDate = new Date();
+                        tDate.setTime(result.expire);
+                        exdate = tDate;
+                        host=result.host;
+                        signature=result.signature;
+                        policyBase64=result.policy;
+
+                        uploadDirect(storeAs,file,attachmentId,attachmentFlag,uploadPath.replace('http://gangwan-app.oss-cn-hangzhou.aliyuncs.com', host),divId,size);
+                    },
+                    error: function(){
+                        alert("获取密钥信息失败");
+                    }
+                });
+            }
+
+        }
+        else
+        {
+            alert("当前版本浏览器不支持文件上传,请使用IE10及以上版本或其他浏览器!");
+        }
+};
+
+function uploadDirect(storeAs,file,attachmentId,attachmentFlag,uploadPath,divId,size)
+{
+    var request = new FormData();
+    request.append("OSSAccessKeyId",accessid);
+    request.append("policy",policyBase64);
+    request.append("Signature",signature);
+
+    request.append("key",storeAs);
+    request.append("success_action_status",'200');
+    request.append('file', file,file.name);
+
+    $.ajax({
+        url : host,
+        data : request,
+        processData: false,
+//cache: false,
+//async: false,
+        contentType: false,
+        type : 'POST',
+        xhr: function() { //用以显示上传进度
+            var xhr = $.ajaxSettings.xhr();
+            if (xhr.upload) {
+                xhr.upload.addEventListener('progress', function(evt) {
+                    uploadProgress(evt, divId, file.name);
+                }, false);
+            }
+            return xhr;
+        },
+        success : function(data, status, request) {
+            returnUrl = realPath+"/a/sys/workattachment/saveAttachment";
+            $.ajax({
+                type:'post',
+                url:returnUrl,
+                data:{
+                    "attachmentName":file['name'],
+                    "attachmentId":attachmentId,
+                    "attachmentFlag":attachmentFlag,
+                    "url":uploadPath
+                },
+                success:function(data){
+                    console.log('ajax requst : ' + data.status);
+                    if(data.status=="Success"){
+                        parent.layer.msg("上传成功!",{icon:1});
+                        var lenght =$(".trIdAdds").length+size;
+                        var addFile = "addFile"+divId;
+                        var str = '<tr class="trIdAdds">'+
+                            '<td class="text-center">' ;
+                        if (isContains("jpg,png,gif,bmp,jpeg",data.type)){
+                            str = str +'<img src="'+data.url+'" width="50" height="50" onclick="openDialogView(\'预览\',\''+realPath+ '/a/sys/picturepreview/picturePreview?url=' +data.url+ '\',\'90%\',\'90%\')" alt="'+data.attachmentName+'"/>';
+                        }else if(isContains("pdf",data.type)){
+                            str = str + '<a class="attention-info" href="javascript:void(0)" onclick="preview(\'预览\',\''+data.url+'\',\'90%\',\'90%\',\'1\')">'+data.attachmentName+'</a>';
+                        }else {
+                            str = str + '<a class="attention-info" href="javascript:void(0)" onclick="preview(\'预览\',\''+data.url+'\',\'90%\',\'90%\')">'+data.attachmentName+'</a>';
+                        }
+                        str = str +'</td>'+
+                            '<td >'+data.createByName+'</td>'+
+                            '<td >'+data.createDate+
+                            '<input name="workAttachments['+lenght+'].id" type="hidden" readonly="readonly" maxlength="20" style="width:140px;" class="form-control" value=""/>'+
+                            '<input name="workAttachments['+lenght+'].attachmentId" type="hidden" readonly="readonly" maxlength="20" style="width:140px;" class="form-control" value="'+data.attachmentId+'"/>'+
+                            '<input name="workAttachments['+lenght+'].url" type="hidden" readonly="readonly" maxlength="20" style="width:140px;" class="form-control" value="'+data.url+'"/>'+
+                            '<input name="workAttachments['+lenght+'].attachmentName" type="hidden" readonly="readonly" maxlength="20" style="width:140px;" class="form-control" value="'+data.attachmentName+'"/>'+
+                            '<input name="workAttachments['+lenght+'].createBy.id" type="hidden" readonly="readonly" maxlength="20" style="width:140px;" class="form-control" value="'+data.createBy+'"/>'+
+                            '<input name="workAttachments['+lenght+'].type" type="hidden" readonly="readonly" maxlength="20" style="width:140px;" class="form-control" value="'+data.type+'"/>'+
+                            '<input name="workAttachments['+lenght+'].attachmentFlag" type="hidden" readonly="readonly" maxlength="20" style="width:140px;" class="form-control" value="'+data.attachmentFlag+'"/>'+
+                            '</td>'+
+                            '<td class="op-td">'+
+                            '<div class="op-btn-box">' +
+                            '<a href="javascript:location.href=\''+realPath+'/a/workfullmanage/workFullManage/downLoadAttach?file=\'+encodeURIComponent(\''+data.url+'\');" class="op-btn op-btn-download"><i class="fa fa-download"></i>&nbsp;下载</a>'+
+                            '<a href="javascript:void(0)" onclick="deleteFileFromAliyun(this,\''+realPath+'/a/sys/workattachment/deleteFileFromAliyun?url='+encodeURIComponent(data.url)+'&id='+data.id+'&type=2\',\''+addFile+'\',\''+divId+'\')" class="op-btn op-btn-delete" ><i class="fa fa-trash"></i>&nbsp;删除</a>'+
+                            '</div>' +
+                            '</td>'+
+                            '</tr>';
+                        console.log("file:"+divId);
+                        console.log("str="+str);
+                        $("#file"+divId).append(str);
+                        // $("img").not(".upload_ico").each(function () {
+                        //     var num = 1 ;
+                        //     $(this).live("click",function () {
+                        //         var flag = num%2;
+                        //         if(flag == 1){
+                        //             $(this).css("width","90%");
+                        //             $(this).css("height","90%");
+                        //             num++;
+                        //         }else if(flag ==0){
+                        //             $(this).css("width","50px");
+                        //             $(this).css("height","50px");
+                        //             num++;
+                        //         }
+                        //     })
+                        // });
+                    }else {
+                        parent.layer.msg("上传失败!",{icon:2});
+                    }
+                }
+            })
+
+        },
+        error : function(returndata) {
+            alert("文件上传失败!");
+        }
+    });
+}
+
+function uploadProgress(e, divId, name) {
+    var percent = e.loaded / e.total;
+    var p = Math.floor(percent*100);
+    $("#jindutiao"+divId).attr("style","width: "+p+"%");
+    $("#jindutiao"+divId).attr("aria-valuenow",p+"%");
+    $("#baifenbi"+divId).html(p+"%");
+    $("#fileName"+divId).html(name);
+}
+
+function multitest (ossClient, storeAs, file,attachmentId,attachmentFlag,uploadPath,divId, size,cpt) {
+
+};
+
+// function multipartUploadWithSts(storeAs, file,attachmentId,attachmentFlag,uploadPath,divId,size, cpt) {
+//     console.log("-----------------------start");
+//     requestUrl = realPath+"/a/previewController/getAccess";
+//     OSS.urllib.request(requestUrl, {method: 'GET'}, function (err, response) {
+//         if (err) {
+//             return alert(err);
+//         }
+//         try {
+//             result = JSON.parse(response);
+//         } catch (e) {
+//             errmsg = 'parse sts response info error: ' + e.message;
+//             return alert(errmsg);
+//         }
+//         console.log("---------result"+result);
+//         client = new OSS.Wrapper({
+//             accessKeyId: result.AccessKeyId,
+//             accessKeySecret: result.AccessKeySecret,
+//             stsToken: result.SecurityToken,
+//             bucket: result.Bucket,
+//             endpoint: result.Endpoint,
+//             timeout:'30000'
+//         });
+//         multitest(client, storeAs, file,attachmentId,attachmentFlag,uploadPath.replace('http://gangwan-app.oss-cn-hangzhou.aliyuncs.com', result.AliyunUrl),divId,size, cpt);
+//     })
+// };
+//
+// function multitest (ossClient, storeAs, file,attachmentId,attachmentFlag,uploadPath,divId, size,cpt) {
+//     var names =  storeAs.split("/");
+//     var name = names[names.length-1];
+//     ossClient.multipartUpload(storeAs, file,{
+//         partSize: 1 * 1024 * 1024,
+//         parallel: 5,
+//         progress: function* (percent, cpt) {
+//             console.log(cpt);
+//             console.log('Progress: ' + percent);
+//             var p = Math.floor(percent*100);
+//             $("#jindutiao"+divId).attr("style","width: "+p+"%");
+//             $("#jindutiao"+divId).attr("aria-valuenow",p+"%");
+//             $("#baifenbi"+divId).html(p+"%");
+//             $("#fileName"+divId).html(name);
+//             checkpoint_temp = cpt;
+//         }
+//     }).then(function (result) {
+//         console.log("uploadPath:"+uploadPath);
+//         console.log("rusult:"+result);
+//         console.log("end-------result:");
+//         returnUrl = realPath+"/a/sys/workattachment/saveAttachment";
+//         $.ajax({
+//             type:'post',
+//             url:returnUrl,
+//             data:{
+//                 "attachmentName":file['name'],
+//                 "attachmentId":attachmentId,
+//                 "attachmentFlag":attachmentFlag,
+//                 "url":uploadPath
+//             },
+//             success:function(data){
+//                 console.log('ajax requst : ' + data.status);
+//                 if(data.status=="Success"){
+//                     parent.layer.msg("上传成功!",{icon:1});
+//                     var lenght =$(".trIdAdds").length+size;
+//                     var addFile = "addFile"+divId;
+//                     var str = '<tr class="trIdAdds">'+
+//                         '<td>' ;
+//                     if (isContains("jpg,png,gif,bmp,jpeg",data.type)){
+//                         str = str +'<img src="'+data.url+'" width="50" height="50" alt="'+data.attachmentName+'"/>';
+//                     }else if(isContains("pdf",data.type)){
+//                         str = str + '<a href="javascript:void(0)" onclick="preview(\'预览\',\''+data.url+'\',\'800px\',\'500px\',\'1\')">'+data.attachmentName+'</a>';
+//                     }else {
+//                         str = str + '<a href="javascript:void(0)" onclick="preview(\'预览\',\''+data.url+'\',\'800px\',\'500px\')">'+data.attachmentName+'</a>';
+//                     }
+//                     str = str +'</td>'+
+//                         '<td>'+data.createByName+'</td>'+
+//                         '<td>'+data.createDate+
+//                         '<input name="workAttachments['+lenght+'].id" type="hidden" readonly="readonly" maxlength="20" style="width:140px;" class="form-control" value=""/>'+
+//                         '<input name="workAttachments['+lenght+'].attachmentId" type="hidden" readonly="readonly" maxlength="20" style="width:140px;" class="form-control" value="'+data.attachmentId+'"/>'+
+//                         '<input name="workAttachments['+lenght+'].url" type="hidden" readonly="readonly" maxlength="20" style="width:140px;" class="form-control" value="'+data.url+'"/>'+
+//                         '<input name="workAttachments['+lenght+'].attachmentName" type="hidden" readonly="readonly" maxlength="20" style="width:140px;" class="form-control" value="'+data.attachmentName+'"/>'+
+//                         '<input name="workAttachments['+lenght+'].createBy.id" type="hidden" readonly="readonly" maxlength="20" style="width:140px;" class="form-control" value="'+data.createBy+'"/>'+
+//                         '<input name="workAttachments['+lenght+'].type" type="hidden" readonly="readonly" maxlength="20" style="width:140px;" class="form-control" value="'+data.type+'"/>'+
+//                         '<input name="workAttachments['+lenght+'].attachmentFlag" type="hidden" readonly="readonly" maxlength="20" style="width:140px;" class="form-control" value="'+data.attachmentFlag+'"/>'+
+//                         '</td>'+
+//                         '<td>'+
+//                         '<a href="'+realPath+'/a/workfullmanage/workFullManage/downLoadAttach?file='+data.url+'" class="btn btn-success btn-xs">下载</a>'+
+//                         '    <a href="javascript:void(0)" onclick="deleteFileFromAliyun(this,\''+realPath+'/a/sys/workattachment/deleteFileFromAliyun?url='+data.url+'&id='+data.id+'&type=2\','+addFile+')" class="btn btn-danger btn-xs" >删除</a>'+
+//                         '    </td>'+
+//                         '</tr>';
+//                     console.log("file:"+divId);
+//                     console.log("str="+str);
+//                     $("#file"+divId).append(str);
+//                     $("img").not(".upload_ico").each(function () {
+//                         var num = 1 ;
+//                         $(this).live("click",function () {
+//                             var flag = num%2;
+//                             if(flag == 1){
+//                                 $(this).css("width","90%");
+//                                 $(this).css("height","90%");
+//                                 num++;
+//                             }else if(flag ==0){
+//                                 $(this).css("width","50px");
+//                                 $(this).css("height","50px");
+//                                 num++;
+//                             }
+//                         })
+//                     });
+//                 }else {
+//                     parent.layer.msg("上传失败!",{icon:2});
+//                 }
+//             }
+//         })
+//     }).catch(function (err) {
+//         console.log("err------ err:");
+//         console.log(err);
+//         multipartUploadWithSts(storeAs, file,attachmentId,attachmentFlag,uploadPath, size,checkpoint_temp);
+//     });
+// };
+function isContains(str, substr) {
+    return str.indexOf(substr) >= 0;
+}
+
+function deleteFileFromAliyun(obj,deleteUrl,addFile,divId){
+    if (divId!=null && divId!= undefined && divId != ''){
+        divId = "_attachment";
+    }
+    var fileDiv = divId.substr(1,divId.length)+"_file";
+    $("#"+fileDiv).val("");
+    $.ajax({
+        type:"post",
+        url:deleteUrl,
+        success:function(data){
+            if(data.str){
+                parent.layer.msg('删除成功',{icon:1});
+                $(obj).parent().parent().parent().remove();
+                $("#"+addFile).hide();
+                $("#jindutiao"+divId).hide();
+            }else {
+                parent.layer.msg('删除失败',{icon:2});
+            }
+        }
+    });
+}

+ 53 - 0
src/main/webapp/static/oss/index.html

@@ -0,0 +1,53 @@
+<!DOCTYPE html>
+<html>
+<head>
+	<meta http-equiv="content-type" content="text/html; charset=UTF-8"/>
+	<title>OSS web直传</title>
+	<link rel="stylesheet" type="text/css" href="style.css"/>
+	<meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1, user-scalable=no">
+</head>
+<body>
+
+<h2>OSS web直传---直接在JS签名</h2>
+<ol>
+<li>基于plupload封装 </li>
+<li>支持html5,flash,silverlight,html4 等协议上传</li>
+<li>可以运行在PC浏览器,手机浏览器,微信</li>
+<li>可以选择多文件上传</li>
+<li>显示上传进度条</li>
+<li>可以控制上传文件的大小</li>
+<li>最关键的是,让你10分钟之内就能移植到你的系统,实现以上牛逼的功能!</li>
+<li>注意一点,bucket必须设置了Cors(Post打勾),不然没有办法上传</li>
+<li>注意一点,把upload.js 里面的host/accessid/accesskey改成您上传所需要的信息即可</li>
+<li>此方法是直接在前端签名,有accessid/accesskey泄漏的风险, 线上生产请使用后端签名例子<a href="https://help.aliyun.com/document_detail/oss/practice/pc_web_upload/js_php_upload.html">点击查看详细文档</a></li>
+</ol>
+<br>
+<form name=theform>
+<input type="radio" name="myradio" value="local_name" checked=true/> 上传文件名字保持本地文件名字
+<input type="radio" name="myradio" value="random_name" /> 上传文件名字是随机文件名
+<br/>
+上传到指定目录:<input type="text" id='dirname' placeholder="如果不填,默认是上传到根目录" size=50>
+</form>
+
+<h4>您所选择的文件列表:</h4>
+<div id="ossfile">你的浏览器不支持flash,Silverlight或者HTML5!</div>
+
+<br/>
+
+<div id="container">
+	<a id="selectfiles" href="javascript:void(0);" class='btn'>选择文件</a>
+	<a id="postfiles" href="javascript:void(0);" class='btn'>开始上传</a>
+</div>
+
+<pre id="console"></pre>
+
+<p>&nbsp;</p>
+
+</body>
+<script type="text/javascript" src="lib/crypto1/crypto/crypto.js"></script>
+<script type="text/javascript" src="lib/crypto1/hmac/hmac.js"></script>
+<script type="text/javascript" src="lib/crypto1/sha1/sha1.js"></script>
+<script type="text/javascript" src="lib/base64.js"></script>
+<script type="text/javascript" src="lib/plupload-2.1.2/js/plupload.full.min.js"></script>
+<script type="text/javascript" src="upload.js"></script>
+</html>

+ 135 - 0
src/main/webapp/static/oss/lib/base64.js

@@ -0,0 +1,135 @@
+    var Base64 = {
+
+        // private property
+        _keyStr : "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",
+
+        // public method for encoding
+        encode : function (input) {
+            var output = "";
+            var chr1, chr2, chr3, enc1, enc2, enc3, enc4;
+            var i = 0;
+
+            input = Base64._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 +
+                this._keyStr.charAt(enc1) + this._keyStr.charAt(enc2) +
+                this._keyStr.charAt(enc3) + this._keyStr.charAt(enc4);
+
+            }
+
+            return output;
+        },
+
+        // public method for decoding
+        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 = this._keyStr.indexOf(input.charAt(i++));
+                enc2 = this._keyStr.indexOf(input.charAt(i++));
+                enc3 = this._keyStr.indexOf(input.charAt(i++));
+                enc4 = this._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 = Base64._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;
+        }
+
+    }

Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/aes/aes-min.js


+ 373 - 0
src/main/webapp/static/oss/lib/crypto1/aes/aes.js

@@ -0,0 +1,373 @@
+/*!
+ * Crypto-JS v1.1.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2009, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcut
+var util = Crypto.util;
+
+// Precomputed SBOX
+var SBOX = [ 0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5,
+             0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76,
+             0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0,
+             0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0,
+             0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc,
+             0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15,
+             0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a,
+             0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75,
+             0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0,
+             0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84,
+             0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b,
+             0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf,
+             0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85,
+             0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8,
+             0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5,
+             0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2,
+             0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17,
+             0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73,
+             0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88,
+             0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb,
+             0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c,
+             0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79,
+             0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9,
+             0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08,
+             0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6,
+             0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a,
+             0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e,
+             0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e,
+             0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94,
+             0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf,
+             0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68,
+             0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16 ];
+
+// Compute inverse SBOX lookup table
+for (var INVSBOX = [], i = 0; i < 256; i++) INVSBOX[SBOX[i]] = i;
+
+// Compute mulitplication in GF(2^8) lookup tables
+var MULT2 = [],
+    MULT3 = [],
+    MULT9 = [],
+    MULTB = [],
+    MULTD = [],
+    MULTE = [];
+
+function xtime(a, b) {
+	for (var result = 0, i = 0; i < 8; i++) {
+		if (b & 1) result ^= a;
+		var hiBitSet = a & 0x80;
+		a = (a << 1) & 0xFF;
+		if (hiBitSet) a ^= 0x1b;
+		b >>>= 1;
+	}
+	return result;
+}
+
+for (var i = 0; i < 256; i++) {
+	MULT2[i] = xtime(i,2);
+	MULT3[i] = xtime(i,3);
+	MULT9[i] = xtime(i,9);
+	MULTB[i] = xtime(i,0xB);
+	MULTD[i] = xtime(i,0xD);
+	MULTE[i] = xtime(i,0xE);
+}
+
+// Precomputed RCon lookup
+var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];
+
+// Inner state
+var state = [[], [], [], []],
+    keylength,
+    nrounds,
+    keyschedule;
+
+var AES = Crypto.AES = {
+
+	/**
+	 * Public API
+	 */
+
+	encrypt: function (message, password, mode) {
+
+		var
+
+		    // Convert to bytes
+		    m = util.stringToBytes(message),
+
+		    // Generate random IV
+		    iv = util.randomBytes(AES._blocksize * 4),
+
+		    // Generate key
+		    k = Crypto.PBKDF2(password, util.bytesToString(iv), 32, { asBytes: true });
+
+		// Determine mode
+		mode = mode || Crypto.mode.OFB;
+
+		// Encrypt
+		AES._init(k);
+		mode.encrypt(AES, m, iv);
+
+		// Return ciphertext
+		return util.bytesToBase64(iv.concat(m));
+
+	},
+
+	decrypt: function (ciphertext, password, mode) {
+
+		var
+
+		    // Convert to bytes
+		    c = util.base64ToBytes(ciphertext),
+
+		    // Separate IV and message
+		    iv = c.splice(0, AES._blocksize * 4),
+
+		    // Generate key
+		    k = Crypto.PBKDF2(password, util.bytesToString(iv), 32, { asBytes: true });
+
+		// Determine mode
+		mode = mode || Crypto.mode.OFB;
+
+		// Decrypt
+		AES._init(k);
+		mode.decrypt(AES, c, iv);
+
+		// Return plaintext
+		return util.bytesToString(c);
+
+	},
+
+
+	/**
+	 * Package private methods and properties
+	 */
+
+	_blocksize: 4,
+
+	_encryptblock: function (m, offset) {
+
+		// Set input
+		for (var row = 0; row < AES._blocksize; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] = m[offset + col * 4 + row];
+		}
+
+		// Add round key
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] ^= keyschedule[col][row];
+		}
+
+		for (var round = 1; round < nrounds; round++) {
+
+			// Sub bytes
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] = SBOX[state[row][col]];
+			}
+
+			// Shift rows
+			state[1].push(state[1].shift());
+			state[2].push(state[2].shift());
+			state[2].push(state[2].shift());
+			state[3].unshift(state[3].pop());
+
+			// Mix columns
+			for (var col = 0; col < 4; col++) {
+
+				var s0 = state[0][col],
+				    s1 = state[1][col],
+				    s2 = state[2][col],
+				    s3 = state[3][col];
+
+				state[0][col] = MULT2[s0] ^ MULT3[s1] ^ s2 ^ s3;
+				state[1][col] = s0 ^ MULT2[s1] ^ MULT3[s2] ^ s3;
+				state[2][col] = s0 ^ s1 ^ MULT2[s2] ^ MULT3[s3];
+				state[3][col] = MULT3[s0] ^ s1 ^ s2 ^ MULT2[s3];
+
+			}
+
+			// Add round key
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] ^= keyschedule[round * 4 + col][row];
+			}
+
+		}
+
+		// Sub bytes
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] = SBOX[state[row][col]];
+		}
+
+		// Shift rows
+		state[1].push(state[1].shift());
+		state[2].push(state[2].shift());
+		state[2].push(state[2].shift());
+		state[3].unshift(state[3].pop());
+
+		// Add round key
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] ^= keyschedule[nrounds * 4 + col][row];
+		}
+
+		// Set output
+		for (var row = 0; row < AES._blocksize; row++) {
+			for (var col = 0; col < 4; col++)
+				m[offset + col * 4 + row] = state[row][col];
+		}
+
+	},
+
+	_decryptblock: function (c, offset) {
+
+		// Set input
+		for (var row = 0; row < AES._blocksize; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] = c[offset + col * 4 + row];
+		}
+
+		// Add round key
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] ^= keyschedule[nrounds * 4 + col][row];
+		}
+
+		for (var round = 1; round < nrounds; round++) {
+
+			// Inv shift rows
+			state[1].unshift(state[1].pop());
+			state[2].push(state[2].shift());
+			state[2].push(state[2].shift());
+			state[3].push(state[3].shift());
+
+			// Inv sub bytes
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] = INVSBOX[state[row][col]];
+			}
+
+			// Add round key
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] ^= keyschedule[(nrounds - round) * 4 + col][row];
+			}
+
+			// Inv mix columns
+			for (var col = 0; col < 4; col++) {
+
+				var s0 = state[0][col],
+				    s1 = state[1][col],
+				    s2 = state[2][col],
+				    s3 = state[3][col];
+
+				state[0][col] = MULTE[s0] ^ MULTB[s1] ^ MULTD[s2] ^ MULT9[s3];
+				state[1][col] = MULT9[s0] ^ MULTE[s1] ^ MULTB[s2] ^ MULTD[s3];
+				state[2][col] = MULTD[s0] ^ MULT9[s1] ^ MULTE[s2] ^ MULTB[s3];
+				state[3][col] = MULTB[s0] ^ MULTD[s1] ^ MULT9[s2] ^ MULTE[s3];
+
+			}
+
+		}
+
+		// Inv shift rows
+		state[1].unshift(state[1].pop());
+		state[2].push(state[2].shift());
+		state[2].push(state[2].shift());
+		state[3].push(state[3].shift());
+
+		// Inv sub bytes
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] = INVSBOX[state[row][col]];
+		}
+
+		// Add round key
+		for (var row = 0; row < 4; row++) {
+			for (var col = 0; col < 4; col++)
+				state[row][col] ^= keyschedule[col][row];
+		}
+
+		// Set output
+		for (var row = 0; row < AES._blocksize; row++) {
+			for (var col = 0; col < 4; col++)
+				c[offset + col * 4 + row] = state[row][col];
+		}
+
+	},
+
+
+	/**
+	 * Private methods
+	 */
+
+	_init: function (k) {
+		keylength = k.length / 4;
+		nrounds = keylength + 6;
+		AES._keyexpansion(k);
+	},
+
+	// Generate a key schedule
+	_keyexpansion: function (k) {
+
+		keyschedule = [];
+
+		for (var row = 0; row < keylength; row++) {
+			keyschedule[row] = [
+				k[row * 4],
+				k[row * 4 + 1],
+				k[row * 4 + 2],
+				k[row * 4 + 3]
+			];
+		}
+
+		for (var row = keylength; row < AES._blocksize * (nrounds + 1); row++) {
+
+			var temp = [
+				keyschedule[row - 1][0],
+				keyschedule[row - 1][1],
+				keyschedule[row - 1][2],
+				keyschedule[row - 1][3]
+			];
+
+			if (row % keylength == 0) {
+
+				// Rot word
+				temp.push(temp.shift());
+
+				// Sub word
+				temp[0] = SBOX[temp[0]];
+				temp[1] = SBOX[temp[1]];
+				temp[2] = SBOX[temp[2]];
+				temp[3] = SBOX[temp[3]];
+
+				temp[0] ^= RCON[row / keylength];
+
+			} else if (keylength > 6 && row % keylength == 4) {
+
+				// Sub word
+				temp[0] = SBOX[temp[0]];
+				temp[1] = SBOX[temp[1]];
+				temp[2] = SBOX[temp[2]];
+				temp[3] = SBOX[temp[3]];
+
+			}
+
+			keyschedule[row] = [
+				keyschedule[row - keylength][0] ^ temp[0],
+				keyschedule[row - keylength][1] ^ temp[1],
+				keyschedule[row - keylength][2] ^ temp[2],
+				keyschedule[row - keylength][3] ^ temp[3]
+			];
+
+		}
+
+	}
+
+};
+
+})();

+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/cbc/cbc-min.js

@@ -0,0 +1,7 @@
+/*
+ * Crypto-JS v1.1.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2009, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+Crypto.mode.CBC={encrypt:function(b,a,c){var f=b._blocksize*4;a.push(128);for(var e=0;e<a.length;e+=f){if(e==0){for(var d=0;d<f;d++){a[d]^=c[d]}}else{for(var d=0;d<f;d++){a[e+d]^=a[e+d-f]}}b._encryptblock(a,e)}},decrypt:function(a,j,d){var h=a._blocksize*4;for(var g=0;g<j.length;g+=h){var b=j.slice(g,g+h);a._decryptblock(j,g);if(g==0){for(var e=0;e<h;e++){j[e]^=d[e]}}else{for(var e=0;e<h;e++){j[g+e]^=f[e]}}var f=b}while(j.pop()!=128){}}};

+ 71 - 0
src/main/webapp/static/oss/lib/crypto1/cbc/cbc.js

@@ -0,0 +1,71 @@
+/*!
+ * Crypto-JS v1.1.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2009, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+Crypto.mode.CBC = {
+
+	encrypt: function (cipher, m, iv) {
+
+		var blockSizeInBytes = cipher._blocksize * 4;
+
+		// Pad
+		m.push(0x80);
+
+		// Encrypt each block
+		for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
+
+			if (offset == 0) {
+				// XOR first block using IV
+				for (var i = 0; i < blockSizeInBytes; i++)
+					m[i] ^= iv[i];
+			}
+			else {
+				// XOR this block using previous crypted block
+				for (var i = 0; i < blockSizeInBytes; i++)
+					m[offset + i] ^= m[offset + i - blockSizeInBytes];
+			}
+
+			// Encrypt block
+			cipher._encryptblock(m, offset);
+
+		}
+
+	},
+
+	decrypt: function (cipher, c, iv) {
+
+		var blockSizeInBytes = cipher._blocksize * 4;
+
+		// Decrypt each block
+		for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
+
+			// Save this crypted block
+			var thisCryptedBlock = c.slice(offset, offset + blockSizeInBytes);
+
+			// Decrypt block
+			cipher._decryptblock(c, offset);
+
+			if (offset == 0) {
+				// XOR first block using IV
+				for (var i = 0; i < blockSizeInBytes; i++)
+					c[i] ^= iv[i];
+			}
+			else {
+				// XOR decrypted block using previous crypted block
+				for (var i = 0; i < blockSizeInBytes; i++)
+					c[offset + i] ^= prevCryptedBlock[i];
+			}
+
+			// This crypted block is the new previous crypted block
+			var prevCryptedBlock = thisCryptedBlock;
+
+		}
+
+		// Strip padding
+		while (c.pop() != 0x80) ;
+
+	}
+
+};

Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/crypto-md5/crypto-md5.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/crypto-sha1-hmac-pbkdf2-marc4/crypto-sha1-hmac-pbkdf2-marc4.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/crypto-sha1-hmac-pbkdf2-ofb-aes/crypto-sha1-hmac-pbkdf2-ofb-aes.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/crypto-sha1-hmac-pbkdf2-rabbit/crypto-sha1-hmac-pbkdf2-rabbit.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/crypto-sha1-hmac-pbkdf2/crypto-sha1-hmac-pbkdf2.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/crypto-sha1/crypto-sha1.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/crypto-sha256/crypto-sha256.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/crypto/crypto-min.js


+ 182 - 0
src/main/webapp/static/oss/lib/crypto1/crypto/crypto.js

@@ -0,0 +1,182 @@
+/*!
+ * Crypto-JS v1.1.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2009, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+var base64map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+
+// Global Crypto object
+window.Crypto = {};
+
+// Crypto utilities
+var util = Crypto.util = {
+
+	// Bit-wise rotate left
+	rotl: function (n, b) {
+		return (n << b) | (n >>> (32 - b));
+	},
+
+	// Bit-wise rotate right
+	rotr: function (n, b) {
+		return (n << (32 - b)) | (n >>> b);
+	},
+
+	// Swap big-endian to little-endian and vice versa
+	endian: function (n) {
+
+		// If number given, swap endian
+		if (n.constructor == Number) {
+			return util.rotl(n,  8) & 0x00FF00FF |
+			       util.rotl(n, 24) & 0xFF00FF00;
+		}
+
+		// Else, assume array and swap all items
+		for (var i = 0; i < n.length; i++)
+			n[i] = util.endian(n[i]);
+		return n;
+
+	},
+
+	// Generate an array of any length of random bytes
+	randomBytes: function (n) {
+		for (var bytes = []; n > 0; n--)
+			bytes.push(Math.floor(Math.random() * 256));
+		return bytes;
+	},
+
+	// Convert a string to a byte array
+	stringToBytes: function (str) {
+		var bytes = [];
+		for (var i = 0; i < str.length; i++)
+			bytes.push(str.charCodeAt(i));
+		return bytes;
+	},
+
+	// Convert a byte array to a string
+	bytesToString: function (bytes) {
+		var str = [];
+		for (var i = 0; i < bytes.length; i++)
+			str.push(String.fromCharCode(bytes[i]));
+		return str.join("");
+	},
+
+	// Convert a string to big-endian 32-bit words
+	stringToWords: function (str) {
+		var words = [];
+		for (var c = 0, b = 0; c < str.length; c++, b += 8)
+			words[b >>> 5] |= str.charCodeAt(c) << (24 - b % 32);
+		return words;
+	},
+
+	// Convert a byte array to big-endian 32-bits words
+	bytesToWords: function (bytes) {
+		var words = [];
+		for (var i = 0, b = 0; i < bytes.length; i++, b += 8)
+			words[b >>> 5] |= bytes[i] << (24 - b % 32);
+		return words;
+	},
+
+	// Convert big-endian 32-bit words to a byte array
+	wordsToBytes: function (words) {
+		var bytes = [];
+		for (var b = 0; b < words.length * 32; b += 8)
+			bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF);
+		return bytes;
+	},
+
+	// Convert a byte array to a hex string
+	bytesToHex: function (bytes) {
+		var hex = [];
+		for (var i = 0; i < bytes.length; i++) {
+			hex.push((bytes[i] >>> 4).toString(16));
+			hex.push((bytes[i] & 0xF).toString(16));
+		}
+		return hex.join("");
+	},
+
+	// Convert a hex string to a byte array
+	hexToBytes: function (hex) {
+		var bytes = [];
+		for (var c = 0; c < hex.length; c += 2)
+			bytes.push(parseInt(hex.substr(c, 2), 16));
+		return bytes;
+	},
+
+	// Convert a byte array to a base-64 string
+	bytesToBase64: function (bytes) {
+
+		// Use browser-native function if it exists
+		if (typeof btoa == "function") return btoa(util.bytesToString(bytes));
+
+		var base64 = [],
+		    overflow;
+
+		for (var i = 0; i < bytes.length; i++) {
+			switch (i % 3) {
+				case 0:
+					base64.push(base64map.charAt(bytes[i] >>> 2));
+					overflow = (bytes[i] & 0x3) << 4;
+					break;
+				case 1:
+					base64.push(base64map.charAt(overflow | (bytes[i] >>> 4)));
+					overflow = (bytes[i] & 0xF) << 2;
+					break;
+				case 2:
+					base64.push(base64map.charAt(overflow | (bytes[i] >>> 6)));
+					base64.push(base64map.charAt(bytes[i] & 0x3F));
+					overflow = -1;
+			}
+		}
+
+		// Encode overflow bits, if there are any
+		if (overflow != undefined && overflow != -1)
+			base64.push(base64map.charAt(overflow));
+
+		// Add padding
+		while (base64.length % 4 != 0) base64.push("=");
+
+		return base64.join("");
+
+	},
+
+	// Convert a base-64 string to a byte array
+	base64ToBytes: function (base64) {
+
+		// Use browser-native function if it exists
+		if (typeof atob == "function") return util.stringToBytes(atob(base64));
+
+		// Remove non-base-64 characters
+		base64 = base64.replace(/[^A-Z0-9+\/]/ig, "");
+
+		var bytes = [];
+
+		for (var i = 0; i < base64.length; i++) {
+			switch (i % 4) {
+				case 1:
+					bytes.push((base64map.indexOf(base64.charAt(i - 1)) << 2) |
+					           (base64map.indexOf(base64.charAt(i)) >>> 4));
+					break;
+				case 2:
+					bytes.push(((base64map.indexOf(base64.charAt(i - 1)) & 0xF) << 4) |
+					           (base64map.indexOf(base64.charAt(i)) >>> 2));
+					break;
+				case 3:
+					bytes.push(((base64map.indexOf(base64.charAt(i - 1)) & 0x3) << 6) |
+					           (base64map.indexOf(base64.charAt(i))));
+					break;
+			}
+		}
+
+		return bytes;
+
+	}
+
+};
+
+// Crypto mode namespace
+Crypto.mode = {};
+
+})();

+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/hmac/hmac-min.js

@@ -0,0 +1,7 @@
+/*
+ * Crypto-JS v1.1.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2009, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){var a=Crypto.util;Crypto.HMAC=function(g,h,f,d){f=f.length>g._blocksize*4?g(f,{asBytes:true}):a.stringToBytes(f);var c=f,j=f.slice(0);for(var e=0;e<g._blocksize*4;e++){c[e]^=92;j[e]^=54}var b=g(a.bytesToString(c)+g(a.bytesToString(j)+h,{asString:true}),{asBytes:true});return d&&d.asBytes?b:d&&d.asString?a.bytesToString(b):a.bytesToHex(b)}})();

+ 36 - 0
src/main/webapp/static/oss/lib/crypto1/hmac/hmac.js

@@ -0,0 +1,36 @@
+/*!
+ * Crypto-JS v1.1.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2009, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcut
+var util = Crypto.util;
+
+Crypto.HMAC = function (hasher, message, key, options) {
+
+	// Allow arbitrary length keys
+	key = key.length > hasher._blocksize * 4 ?
+	      hasher(key, { asBytes: true }) :
+	      util.stringToBytes(key);
+
+	// XOR keys with pad constants
+	var okey = key,
+	    ikey = key.slice(0);
+	for (var i = 0; i < hasher._blocksize * 4; i++) {
+		okey[i] ^= 0x5C;
+		ikey[i] ^= 0x36;
+	}
+
+	var hmacbytes = hasher(util.bytesToString(okey) +
+	                       hasher(util.bytesToString(ikey) + message, { asString: true }),
+	                       { asBytes: true });
+	return options && options.asBytes ? hmacbytes :
+	       options && options.asString ? util.bytesToString(hmacbytes) :
+	       util.bytesToHex(hmacbytes);
+
+};
+
+})();

Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/marc4/marc4-min.js


+ 110 - 0
src/main/webapp/static/oss/lib/crypto1/marc4/marc4.js

@@ -0,0 +1,110 @@
+/*!
+ * Crypto-JS v1.1.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2009, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcut
+var util = Crypto.util;
+
+var MARC4 = Crypto.MARC4 = {
+
+	/**
+	 * Public API
+	 */
+
+	encrypt: function (message, password) {
+
+		var
+
+		    // Convert to bytes
+		    m = util.stringToBytes(message),
+
+		    // Generate random IV
+		    iv = util.randomBytes(16),
+
+		    // Generate key
+		    k = Crypto.PBKDF2(password, util.bytesToString(iv), 32, { asBytes: true });
+
+		// Encrypt
+		MARC4._marc4(m, k, 1536);
+
+		// Return ciphertext
+		return util.bytesToBase64(iv.concat(m));
+
+	},
+
+	decrypt: function (ciphertext, password) {
+
+		var
+
+		    // Convert to bytes
+		    c = util.base64ToBytes(ciphertext),
+
+		    // Separate IV and message
+		    iv = c.splice(0, 16),
+
+		    // Generate key
+		    k = Crypto.PBKDF2(password, util.bytesToString(iv), 32, { asBytes: true });
+
+		// Decrypt
+		MARC4._marc4(c, k, 1536);
+
+		// Return plaintext
+		return util.bytesToString(c);
+
+	},
+
+
+	/**
+	 * Internal methods
+	 */
+
+	// The core
+	_marc4: function (m, k, drop) {
+
+		// State variables
+		var i, j, s, temp;
+
+		// Key setup
+		for (i = 0, s = []; i < 256; i++) s[i] = i;
+		for (i = 0, j = 0;  i < 256; i++) {
+
+			j = (j + s[i] + k[i % k.length]) % 256;
+
+			// Swap
+			temp = s[i];
+			s[i] = s[j];
+			s[j] = temp;
+
+		}
+
+		// Clear counters
+		i = j = 0;
+
+		// Encryption
+		for (var k = 0 - drop; k < m.length; k++) {
+
+			i = (i + 1) % 256;
+			j = (j + s[i]) % 256;
+
+			// Swap
+			temp = s[i];
+			s[i] = s[j];
+			s[j] = temp;
+
+			// Stop here if we're still dropping keystream
+			if (k < 0) continue;
+
+			// Encrypt
+			m[k] ^= s[(s[i] + s[j]) % 256];
+
+		}
+
+	}
+
+};
+
+})();

Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/md5/md5-min.js


+ 147 - 0
src/main/webapp/static/oss/lib/crypto1/md5/md5.js

@@ -0,0 +1,147 @@
+/*!
+ * Crypto-JS v1.1.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2009, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcut
+var util = Crypto.util;
+
+// Public API
+var MD5 = Crypto.MD5 = function (message, options) {
+	var digestbytes = util.wordsToBytes(MD5._md5(message));
+	return options && options.asBytes ? digestbytes :
+	       options && options.asString ? util.bytesToString(digestbytes) :
+	       util.bytesToHex(digestbytes);
+};
+
+// The core
+MD5._md5 = function (message) {
+
+	var m = util.stringToWords(message),
+	    l = message.length * 8,
+	    a =  1732584193,
+	    b = -271733879,
+	    c = -1732584194,
+	    d =  271733878;
+
+	// Swap endian
+	for (var i = 0; i < m.length; i++) {
+		m[i] = ((m[i] <<  8) | (m[i] >>> 24)) & 0x00FF00FF |
+		       ((m[i] << 24) | (m[i] >>>  8)) & 0xFF00FF00;
+	}
+
+	// Padding
+	m[l >>> 5] |= 0x80 << (l % 32);
+	m[(((l + 64) >>> 9) << 4) + 14] = l;
+
+	for (var i = 0; i < m.length; i += 16) {
+
+		var aa = a,
+		    bb = b,
+		    cc = c,
+		    dd = d;
+
+		a = MD5._ff(a, b, c, d, m[i+ 0],  7, -680876936);
+		d = MD5._ff(d, a, b, c, m[i+ 1], 12, -389564586);
+		c = MD5._ff(c, d, a, b, m[i+ 2], 17,  606105819);
+		b = MD5._ff(b, c, d, a, m[i+ 3], 22, -1044525330);
+		a = MD5._ff(a, b, c, d, m[i+ 4],  7, -176418897);
+		d = MD5._ff(d, a, b, c, m[i+ 5], 12,  1200080426);
+		c = MD5._ff(c, d, a, b, m[i+ 6], 17, -1473231341);
+		b = MD5._ff(b, c, d, a, m[i+ 7], 22, -45705983);
+		a = MD5._ff(a, b, c, d, m[i+ 8],  7,  1770035416);
+		d = MD5._ff(d, a, b, c, m[i+ 9], 12, -1958414417);
+		c = MD5._ff(c, d, a, b, m[i+10], 17, -42063);
+		b = MD5._ff(b, c, d, a, m[i+11], 22, -1990404162);
+		a = MD5._ff(a, b, c, d, m[i+12],  7,  1804603682);
+		d = MD5._ff(d, a, b, c, m[i+13], 12, -40341101);
+		c = MD5._ff(c, d, a, b, m[i+14], 17, -1502002290);
+		b = MD5._ff(b, c, d, a, m[i+15], 22,  1236535329);
+
+		a = MD5._gg(a, b, c, d, m[i+ 1],  5, -165796510);
+		d = MD5._gg(d, a, b, c, m[i+ 6],  9, -1069501632);
+		c = MD5._gg(c, d, a, b, m[i+11], 14,  643717713);
+		b = MD5._gg(b, c, d, a, m[i+ 0], 20, -373897302);
+		a = MD5._gg(a, b, c, d, m[i+ 5],  5, -701558691);
+		d = MD5._gg(d, a, b, c, m[i+10],  9,  38016083);
+		c = MD5._gg(c, d, a, b, m[i+15], 14, -660478335);
+		b = MD5._gg(b, c, d, a, m[i+ 4], 20, -405537848);
+		a = MD5._gg(a, b, c, d, m[i+ 9],  5,  568446438);
+		d = MD5._gg(d, a, b, c, m[i+14],  9, -1019803690);
+		c = MD5._gg(c, d, a, b, m[i+ 3], 14, -187363961);
+		b = MD5._gg(b, c, d, a, m[i+ 8], 20,  1163531501);
+		a = MD5._gg(a, b, c, d, m[i+13],  5, -1444681467);
+		d = MD5._gg(d, a, b, c, m[i+ 2],  9, -51403784);
+		c = MD5._gg(c, d, a, b, m[i+ 7], 14,  1735328473);
+		b = MD5._gg(b, c, d, a, m[i+12], 20, -1926607734);
+
+		a = MD5._hh(a, b, c, d, m[i+ 5],  4, -378558);
+		d = MD5._hh(d, a, b, c, m[i+ 8], 11, -2022574463);
+		c = MD5._hh(c, d, a, b, m[i+11], 16,  1839030562);
+		b = MD5._hh(b, c, d, a, m[i+14], 23, -35309556);
+		a = MD5._hh(a, b, c, d, m[i+ 1],  4, -1530992060);
+		d = MD5._hh(d, a, b, c, m[i+ 4], 11,  1272893353);
+		c = MD5._hh(c, d, a, b, m[i+ 7], 16, -155497632);
+		b = MD5._hh(b, c, d, a, m[i+10], 23, -1094730640);
+		a = MD5._hh(a, b, c, d, m[i+13],  4,  681279174);
+		d = MD5._hh(d, a, b, c, m[i+ 0], 11, -358537222);
+		c = MD5._hh(c, d, a, b, m[i+ 3], 16, -722521979);
+		b = MD5._hh(b, c, d, a, m[i+ 6], 23,  76029189);
+		a = MD5._hh(a, b, c, d, m[i+ 9],  4, -640364487);
+		d = MD5._hh(d, a, b, c, m[i+12], 11, -421815835);
+		c = MD5._hh(c, d, a, b, m[i+15], 16,  530742520);
+		b = MD5._hh(b, c, d, a, m[i+ 2], 23, -995338651);
+
+		a = MD5._ii(a, b, c, d, m[i+ 0],  6, -198630844);
+		d = MD5._ii(d, a, b, c, m[i+ 7], 10,  1126891415);
+		c = MD5._ii(c, d, a, b, m[i+14], 15, -1416354905);
+		b = MD5._ii(b, c, d, a, m[i+ 5], 21, -57434055);
+		a = MD5._ii(a, b, c, d, m[i+12],  6,  1700485571);
+		d = MD5._ii(d, a, b, c, m[i+ 3], 10, -1894986606);
+		c = MD5._ii(c, d, a, b, m[i+10], 15, -1051523);
+		b = MD5._ii(b, c, d, a, m[i+ 1], 21, -2054922799);
+		a = MD5._ii(a, b, c, d, m[i+ 8],  6,  1873313359);
+		d = MD5._ii(d, a, b, c, m[i+15], 10, -30611744);
+		c = MD5._ii(c, d, a, b, m[i+ 6], 15, -1560198380);
+		b = MD5._ii(b, c, d, a, m[i+13], 21,  1309151649);
+		a = MD5._ii(a, b, c, d, m[i+ 4],  6, -145523070);
+		d = MD5._ii(d, a, b, c, m[i+11], 10, -1120210379);
+		c = MD5._ii(c, d, a, b, m[i+ 2], 15,  718787259);
+		b = MD5._ii(b, c, d, a, m[i+ 9], 21, -343485551);
+
+		a += aa;
+		b += bb;
+		c += cc;
+		d += dd;
+
+	}
+
+	return util.endian([a, b, c, d]);
+
+};
+
+// Auxiliary functions
+MD5._ff  = function (a, b, c, d, x, s, t) {
+	var n = a + (b & c | ~b & d) + (x >>> 0) + t;
+	return ((n << s) | (n >>> (32 - s))) + b;
+};
+MD5._gg  = function (a, b, c, d, x, s, t) {
+	var n = a + (b & d | c & ~d) + (x >>> 0) + t;
+	return ((n << s) | (n >>> (32 - s))) + b;
+};
+MD5._hh  = function (a, b, c, d, x, s, t) {
+	var n = a + (b ^ c ^ d) + (x >>> 0) + t;
+	return ((n << s) | (n >>> (32 - s))) + b;
+};
+MD5._ii  = function (a, b, c, d, x, s, t) {
+	var n = a + (c ^ (b | ~d)) + (x >>> 0) + t;
+	return ((n << s) | (n >>> (32 - s))) + b;
+};
+
+// Package private blocksize
+MD5._blocksize = 16;
+
+})();

+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/ofb/ofb-min.js

@@ -0,0 +1,7 @@
+/*
+ * Crypto-JS v1.1.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2009, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){Crypto.mode.OFB={encrypt:a,decrypt:a};function a(c,b,d){var g=c._blocksize*4,f=d.slice(0);for(var e=0;e<b.length;e++){if(e%g==0){c._encryptblock(f,0)}b[e]^=f[e%g]}}})();

+ 35 - 0
src/main/webapp/static/oss/lib/crypto1/ofb/ofb.js

@@ -0,0 +1,35 @@
+/*!
+ * Crypto-JS v1.1.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2009, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Public API
+Crypto.mode.OFB = {
+	encrypt: OFB,
+	decrypt: OFB
+};
+
+// The mode function
+function OFB(cipher, m, iv) {
+
+	var blockSizeInBytes = cipher._blocksize * 4,
+	    keystream = iv.slice(0);
+
+	// Encrypt each byte
+	for (var i = 0; i < m.length; i++) {
+
+		// Generate keystream
+		if (i % blockSizeInBytes == 0)
+			cipher._encryptblock(keystream, 0);
+
+		// Encrypt byte
+		m[i] ^= keystream[i % blockSizeInBytes];
+
+	}
+
+}
+
+})();

+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/pbkdf2/pbkdf2-min.js

@@ -0,0 +1,7 @@
+/*
+ * Crypto-JS v1.1.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2009, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){var a=Crypto.util;Crypto.PBKDF2=function(m,k,b,p){var o=p&&p.hasher||Crypto.SHA1,e=p&&p.iterations||1;function l(i,j){return Crypto.HMAC(o,j,i,{asBytes:true})}var d=[],c=1;while(d.length<b){var f=l(m,k+a.bytesToString(a.wordsToBytes([c])));for(var n=f,h=1;h<e;h++){n=l(m,a.bytesToString(n));for(var g=0;g<f.length;g++){f[g]^=n[g]}}d=d.concat(f);c++}d.length=b;return p&&p.asBytes?d:p&&p.asString?a.bytesToString(d):a.bytesToHex(d)}})();

+ 50 - 0
src/main/webapp/static/oss/lib/crypto1/pbkdf2/pbkdf2.js

@@ -0,0 +1,50 @@
+/*!
+ * Crypto-JS v1.1.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2009, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcut
+var util = Crypto.util;
+
+Crypto.PBKDF2 = function (password, salt, keylen, options) {
+
+	// Defaults
+	var hasher = options && options.hasher || Crypto.SHA1,
+	    iterations = options && options.iterations || 1;
+
+	// Pseudo-random function
+	function PRF(password, salt) {
+		return Crypto.HMAC(hasher, salt, password, { asBytes: true });
+	}
+
+	// Generate key
+	var derivedKeyBytes = [],
+	    blockindex = 1;
+	while (derivedKeyBytes.length < keylen) {
+
+		var block = PRF(password, salt + util.bytesToString(
+		                                 util.wordsToBytes([blockindex])));
+
+		for (var u = block, i = 1; i < iterations; i++) {
+			u = PRF(password, util.bytesToString(u));
+			for (var j = 0; j < block.length; j++) block[j] ^= u[j];
+		}
+
+		derivedKeyBytes = derivedKeyBytes.concat(block);
+		blockindex++;
+
+	}
+
+	// Truncate excess bytes
+	derivedKeyBytes.length = keylen;
+
+	return options && options.asBytes ? derivedKeyBytes :
+	       options && options.asString ? util.bytesToString(derivedKeyBytes) :
+	       util.bytesToHex(derivedKeyBytes);
+
+};
+
+})();

Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/rabbit/rabbit-min.js


+ 214 - 0
src/main/webapp/static/oss/lib/crypto1/rabbit/rabbit.js

@@ -0,0 +1,214 @@
+/*!
+ * Crypto-JS v1.1.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2009, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcut
+var util = Crypto.util;
+
+// Inner state
+var x = [],
+    c = [],
+    b;
+
+var Rabbit = Crypto.Rabbit = {
+
+	/**
+	 * Public API
+	 */
+
+	encrypt: function (message, password) {
+
+		var
+
+		    // Convert to bytes
+		    m = util.stringToBytes(message),
+
+		    // Generate random IV
+		    iv = util.randomBytes(8),
+
+		    // Generate key
+		    k = Crypto.PBKDF2(password, util.bytesToString(iv), 16, { asBytes: true });
+
+		// Encrypt
+		Rabbit._rabbit(m, k, util.bytesToWords(iv));
+
+		// Return ciphertext
+		return util.bytesToBase64(iv.concat(m));
+
+	},
+
+	decrypt: function (ciphertext, password) {
+
+		var
+
+		    // Convert to bytes
+		    c = util.base64ToBytes(ciphertext),
+
+		    // Separate IV and message
+		    iv = c.splice(0, 8),
+
+		    // Generate key
+		    k = Crypto.PBKDF2(password, util.bytesToString(iv), 16, { asBytes: true });
+
+		// Decrypt
+		Rabbit._rabbit(c, k, util.bytesToWords(iv));
+
+		// Return plaintext
+		return util.bytesToString(c);
+
+	},
+
+
+	/**
+	 * Internal methods
+	 */
+
+	// Encryption/decryption scheme
+	_rabbit: function (m, k, iv) {
+
+		Rabbit._keysetup(k);
+		if (iv) Rabbit._ivsetup(iv);
+
+		for (var s = [], i = 0; i < m.length; i++) {
+
+			if (i % 16 == 0) {
+
+				// Iterate the system
+				Rabbit._nextstate();
+
+				// Generate 16 bytes of pseudo-random data
+				s[0] = x[0] ^ (x[5] >>> 16) ^ (x[3] << 16);
+				s[1] = x[2] ^ (x[7] >>> 16) ^ (x[5] << 16);
+				s[2] = x[4] ^ (x[1] >>> 16) ^ (x[7] << 16);
+				s[3] = x[6] ^ (x[3] >>> 16) ^ (x[1] << 16);
+
+				// Swap endian
+				for (var j = 0; j < 4; j++) {
+					s[j] = ((s[j] <<  8) | (s[j] >>> 24)) & 0x00FF00FF |
+					       ((s[j] << 24) | (s[j] >>>  8)) & 0xFF00FF00;
+				}
+
+				// Convert words to bytes
+				for (var b = 120; b >= 0; b -= 8)
+					s[b / 8] = (s[b >>> 5] >>> (24 - b % 32)) & 0xFF;
+
+			}
+
+			m[i] ^= s[i % 16];
+
+		}
+
+	},
+
+	// Key setup scheme
+	_keysetup: function (k) {
+
+		// Generate initial state values
+		x[0] = k[0];
+		x[2] = k[1];
+		x[4] = k[2];
+		x[6] = k[3];
+		x[1] = (k[3] << 16) | (k[2] >>> 16);
+		x[3] = (k[0] << 16) | (k[3] >>> 16);
+		x[5] = (k[1] << 16) | (k[0] >>> 16);
+		x[7] = (k[2] << 16) | (k[1] >>> 16);
+
+		// Generate initial counter values
+		c[0] = util.rotl(k[2], 16);
+		c[2] = util.rotl(k[3], 16);
+		c[4] = util.rotl(k[0], 16);
+		c[6] = util.rotl(k[1], 16);
+		c[1] = (k[0] & 0xFFFF0000) | (k[1] & 0xFFFF);
+		c[3] = (k[1] & 0xFFFF0000) | (k[2] & 0xFFFF);
+		c[5] = (k[2] & 0xFFFF0000) | (k[3] & 0xFFFF);
+		c[7] = (k[3] & 0xFFFF0000) | (k[0] & 0xFFFF);
+
+		// Clear carry bit
+		b = 0;
+
+		// Iterate the system four times
+		for (var i = 0; i < 4; i++) Rabbit._nextstate();
+
+		// Modify the counters
+		for (var i = 0; i < 8; i++) c[i] ^= x[(i + 4) & 7];
+
+	},
+
+	// IV setup scheme
+	_ivsetup: function (iv) {
+
+		// Generate four subvectors
+		var i0 = util.endian(iv[0]),
+		    i2 = util.endian(iv[1]),
+		    i1 = (i0 >>> 16) | (i2 & 0xFFFF0000),
+		    i3 = (i2 <<  16) | (i0 & 0x0000FFFF);
+
+		// Modify counter values
+		c[0] ^= i0;
+		c[1] ^= i1;
+		c[2] ^= i2;
+		c[3] ^= i3;
+		c[4] ^= i0;
+		c[5] ^= i1;
+		c[6] ^= i2;
+		c[7] ^= i3;
+
+		// Iterate the system four times
+		for (var i = 0; i < 4; i++) Rabbit._nextstate();
+
+	},
+
+	// Next-state function
+	_nextstate: function () {
+
+		// Save old counter values
+		for (var c_old = [], i = 0; i < 8; i++) c_old[i] = c[i];
+
+		// Calculate new counter values
+		c[0] = (c[0] + 0x4D34D34D + b) >>> 0;
+		c[1] = (c[1] + 0xD34D34D3 + ((c[0] >>> 0) < (c_old[0] >>> 0) ? 1 : 0)) >>> 0;
+		c[2] = (c[2] + 0x34D34D34 + ((c[1] >>> 0) < (c_old[1] >>> 0) ? 1 : 0)) >>> 0;
+		c[3] = (c[3] + 0x4D34D34D + ((c[2] >>> 0) < (c_old[2] >>> 0) ? 1 : 0)) >>> 0;
+		c[4] = (c[4] + 0xD34D34D3 + ((c[3] >>> 0) < (c_old[3] >>> 0) ? 1 : 0)) >>> 0;
+		c[5] = (c[5] + 0x34D34D34 + ((c[4] >>> 0) < (c_old[4] >>> 0) ? 1 : 0)) >>> 0;
+		c[6] = (c[6] + 0x4D34D34D + ((c[5] >>> 0) < (c_old[5] >>> 0) ? 1 : 0)) >>> 0;
+		c[7] = (c[7] + 0xD34D34D3 + ((c[6] >>> 0) < (c_old[6] >>> 0) ? 1 : 0)) >>> 0;
+		b = (c[7] >>> 0) < (c_old[7] >>> 0) ? 1 : 0;
+
+		// Calculate the g-values
+		for (var g = [], i = 0; i < 8; i++) {
+
+			var gx = (x[i] + c[i]) >>> 0;
+
+			// Construct high and low argument for squaring
+			var ga = gx & 0xFFFF,
+			    gb = gx >>> 16;
+
+			// Calculate high and low result of squaring
+			var gh = ((((ga * ga) >>> 17) + ga * gb) >>> 15) + gb * gb,
+			    gl = (((gx & 0xFFFF0000) * gx) >>> 0) + (((gx & 0x0000FFFF) * gx) >>> 0) >>> 0;
+
+			// High XOR low
+			g[i] = gh ^ gl;
+
+		}
+
+		// Calculate new state values
+		x[0] = g[0] + ((g[7] << 16) | (g[7] >>> 16)) + ((g[6] << 16) | (g[6] >>> 16));
+		x[1] = g[1] + ((g[0] <<  8) | (g[0] >>> 24)) + g[7];
+		x[2] = g[2] + ((g[1] << 16) | (g[1] >>> 16)) + ((g[0] << 16) | (g[0] >>> 16));
+		x[3] = g[3] + ((g[2] <<  8) | (g[2] >>> 24)) + g[1];
+		x[4] = g[4] + ((g[3] << 16) | (g[3] >>> 16)) + ((g[2] << 16) | (g[2] >>> 16));
+		x[5] = g[5] + ((g[4] <<  8) | (g[4] >>> 24)) + g[3];
+		x[6] = g[6] + ((g[5] << 16) | (g[5] >>> 16)) + ((g[4] << 16) | (g[4] >>> 16));
+		x[7] = g[7] + ((g[6] <<  8) | (g[6] >>> 24)) + g[5];
+
+	}
+
+};
+
+})();

Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/sha1/sha1-min.js


+ 81 - 0
src/main/webapp/static/oss/lib/crypto1/sha1/sha1.js

@@ -0,0 +1,81 @@
+/*!
+ * Crypto-JS v1.1.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2009, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcut
+var util = Crypto.util;
+
+// Public API
+var SHA1 = Crypto.SHA1 = function (message, options) {
+	var digestbytes = util.wordsToBytes(SHA1._sha1(message));
+	return options && options.asBytes ? digestbytes :
+	       options && options.asString ? util.bytesToString(digestbytes) :
+	       util.bytesToHex(digestbytes);
+};
+
+// The core
+SHA1._sha1 = function (message) {
+
+	var m  = util.stringToWords(message),
+	    l  = message.length * 8,
+	    w  =  [],
+	    H0 =  1732584193,
+	    H1 = -271733879,
+	    H2 = -1732584194,
+	    H3 =  271733878,
+	    H4 = -1009589776;
+
+	// Padding
+	m[l >> 5] |= 0x80 << (24 - l % 32);
+	m[((l + 64 >>> 9) << 4) + 15] = l;
+
+	for (var i = 0; i < m.length; i += 16) {
+
+		var a = H0,
+		    b = H1,
+		    c = H2,
+		    d = H3,
+		    e = H4;
+
+		for (var j = 0; j < 80; j++) {
+
+			if (j < 16) w[j] = m[i + j];
+			else {
+				var n = w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16];
+				w[j] = (n << 1) | (n >>> 31);
+			}
+
+			var t = ((H0 << 5) | (H0 >>> 27)) + H4 + (w[j] >>> 0) + (
+			         j < 20 ? (H1 & H2 | ~H1 & H3) + 1518500249 :
+			         j < 40 ? (H1 ^ H2 ^ H3) + 1859775393 :
+			         j < 60 ? (H1 & H2 | H1 & H3 | H2 & H3) - 1894007588 :
+			                  (H1 ^ H2 ^ H3) - 899497514);
+
+			H4 =  H3;
+			H3 =  H2;
+			H2 = (H1 << 30) | (H1 >>> 2);
+			H1 =  H0;
+			H0 =  t;
+
+		}
+
+		H0 += a;
+		H1 += b;
+		H2 += c;
+		H3 += d;
+		H4 += e;
+
+	}
+
+	return [H0, H1, H2, H3, H4];
+
+};
+
+// Package private blocksize
+SHA1._blocksize = 16;
+
+})();

Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 7 - 0
src/main/webapp/static/oss/lib/crypto1/sha256/sha256-min.js


+ 125 - 0
src/main/webapp/static/oss/lib/crypto1/sha256/sha256.js

@@ -0,0 +1,125 @@
+/*!
+ * Crypto-JS v1.1.0
+ * http://code.google.com/p/crypto-js/
+ * Copyright (c) 2009, Jeff Mott. All rights reserved.
+ * http://code.google.com/p/crypto-js/wiki/License
+ */
+(function(){
+
+// Shortcut
+var util = Crypto.util;
+
+// Constants
+var K = [ 0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,
+          0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,
+          0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,
+          0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,
+          0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,
+          0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,
+          0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,
+          0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,
+          0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,
+          0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,
+          0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,
+          0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,
+          0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,
+          0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,
+          0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,
+          0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2 ];
+
+// Public API
+var SHA256 = Crypto.SHA256 = function (message, options) {
+	var digestbytes = util.wordsToBytes(SHA256._sha256(message));
+	return options && options.asBytes ? digestbytes :
+	       options && options.asString ? util.bytesToString(digestbytes) :
+	       util.bytesToHex(digestbytes);
+};
+
+// The core
+SHA256._sha256 = function (message) {
+
+	var m  = util.stringToWords(message),
+	    l  = message.length * 8,
+	    H = [ 0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A,
+	          0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19 ],
+	    w  = [],
+	    a, b, c, d, e, f, g, h, i, j,
+	    t1, t2;
+
+	// Padding
+	m[l >> 5] |= 0x80 << (24 - l % 32);
+	m[((l + 64 >> 9) << 4) + 15] = l;
+
+	for (var i = 0; i < m.length; i += 16) {
+
+		a = H[0];
+		b = H[1];
+		c = H[2];
+		d = H[3];
+		e = H[4];
+		f = H[5];
+		g = H[6];
+		h = H[7];
+
+		for (var j = 0; j < 64; j++) {
+
+			if (j < 16) w[j] = m[j + i];
+			else {
+
+				var gamma0x = w[j - 15],
+				    gamma1x = w[j - 2],
+				    gamma0  = ((gamma0x << 25) | (gamma0x >>>  7)) ^
+				              ((gamma0x << 14) | (gamma0x >>> 18)) ^
+				               (gamma0x >>> 3),
+				    gamma1  = ((gamma1x <<  15) | (gamma1x >>> 17)) ^
+				              ((gamma1x <<  13) | (gamma1x >>> 19)) ^
+				               (gamma1x >>> 10);
+
+				w[j] = gamma0 + (w[j - 7] >>> 0) +
+				       gamma1 + (w[j - 16] >>> 0);
+
+			}
+
+			var ch  = e & f ^ ~e & g,
+			    maj = a & b ^ a & c ^ b & c,
+			    sigma0 = ((a << 30) | (a >>>  2)) ^
+			             ((a << 19) | (a >>> 13)) ^
+			             ((a << 10) | (a >>> 22)),
+			    sigma1 = ((e << 26) | (e >>>  6)) ^
+			             ((e << 21) | (e >>> 11)) ^
+			             ((e <<  7) | (e >>> 25));
+
+
+			t1 = (h >>> 0) + sigma1 + ch + (K[j]) + (w[j] >>> 0);
+			t2 = sigma0 + maj;
+
+			h = g;
+			g = f;
+			f = e;
+			e = d + t1;
+			d = c;
+			c = b;
+			b = a;
+			a = t1 + t2;
+
+		}
+
+		H[0] += a;
+		H[1] += b;
+		H[2] += c;
+		H[3] += d;
+		H[4] += e;
+		H[5] += f;
+		H[6] += g;
+		H[7] += h;
+
+	}
+
+	return H;
+
+};
+
+// Package private blocksize
+SHA256._blocksize = 16;
+
+})();

binární
src/main/webapp/static/oss/lib/plupload-2.1.2/js/Moxie.swf


binární
src/main/webapp/static/oss/lib/plupload-2.1.2/js/Moxie.xap


+ 185 - 0
src/main/webapp/static/oss/lib/plupload-2.1.2/js/jquery.plupload.queue.css

@@ -0,0 +1,185 @@
+/* 
+   Plupload
+------------------------------------------------------------------- */
+
+.plupload_wrapper * {
+	box-sizing: content-box;
+}
+
+.plupload_button {
+	display: -moz-inline-box; /* FF < 3*/
+	display: inline-block;
+	font: normal 12px sans-serif;
+	text-decoration: none;
+    color: #42454a;
+    border: 1px solid #bababa;
+    padding: 2px 8px 3px 20px;
+	margin-right: 4px;
+    background: #f3f3f3 url('../img/buttons.png') no-repeat 0 center;
+	outline: 0;
+
+    /* Optional rounded corners for browsers that support it */
+    -moz-border-radius: 3px;
+    -khtml-border-radius: 3px;
+    -webkit-border-radius: 3px;
+    border-radius: 3px;
+}
+
+.plupload_button:hover {
+	color: #000;
+	text-decoration: none;
+}
+
+.plupload_disabled, a.plupload_disabled:hover {
+    color: #737373;
+    border-color: #c5c5c5;
+    background: #ededed url('../img/buttons-disabled.png') no-repeat 0 center;
+	cursor: default;
+}
+
+.plupload_add {
+	background-position: -181px center;
+}
+
+.plupload_wrapper {
+	font: normal 11px Verdana,sans-serif;
+	width: 100%;
+}
+
+.plupload_container {
+	padding: 8px;
+	background: url('../img/transp50.png');
+	/*-moz-border-radius: 5px;*/
+}
+
+.plupload_container input {
+	border: 1px solid #DDD;
+	font: normal 11px Verdana,sans-serif;
+	width: 98%;
+}
+
+.plupload_header {background: #2A2C2E url('../img/backgrounds.gif') repeat-x;}
+.plupload_header_content {
+	background: url('../img/backgrounds.gif') no-repeat 0 -317px;
+	min-height: 56px;
+	padding-left: 60px;
+	color: #FFF;
+}
+.plupload_header_title {
+	font: normal 18px sans-serif;
+	padding: 6px 0 3px;
+}
+.plupload_header_text {
+	font: normal 12px sans-serif;
+}
+
+.plupload_filelist {
+	margin: 0;
+	padding: 0;
+	list-style: none;
+}
+
+.plupload_scroll .plupload_filelist {
+	height: 185px;
+	background: #F5F5F5;
+	overflow-y: scroll;
+}
+
+.plupload_filelist li {
+	padding: 10px 8px;
+	background: #F5F5F5 url('../img/backgrounds.gif') repeat-x 0 -156px;
+	border-bottom: 1px solid #DDD;
+}
+
+.plupload_filelist_header, .plupload_filelist_footer {
+	background: #DFDFDF;
+	padding: 8px 8px;
+	color: #42454A;
+}
+.plupload_filelist_header {	
+	border-top: 1px solid #EEE;
+	border-bottom: 1px solid #CDCDCD;
+}
+
+.plupload_filelist_footer {border-top: 1px solid #FFF; height: 22px; line-height: 20px; vertical-align: middle;}
+.plupload_file_name {float: left; overflow: hidden}
+.plupload_file_status {color: #777;}
+.plupload_file_status span {color: #42454A;}
+.plupload_file_size, .plupload_file_status, .plupload_progress {
+	float: right;
+	width: 80px;
+}
+.plupload_file_size, .plupload_file_status, .plupload_file_action {text-align: right;}
+
+.plupload_filelist .plupload_file_name {
+	width: 205px;
+	white-space: nowrap;
+	text-overflow: ellipsis;
+}
+
+.plupload_file_action {
+	float: right;
+	width: 16px;
+	height: 16px;
+	margin-left: 15px;
+}
+
+.plupload_file_action * {
+	display: none;
+	width: 16px;
+	height: 16px;
+}
+
+li.plupload_uploading {background: #ECF3DC url('../img/backgrounds.gif') repeat-x 0 -238px;}
+li.plupload_done {color:#AAA}
+
+li.plupload_delete a {
+	background: url('../img/delete.gif');
+}
+
+li.plupload_failed a {
+	background: url('../img/error.gif');
+	cursor: default;
+}
+
+li.plupload_done a {
+	background: url('../img/done.gif');
+	cursor: default;
+}
+
+.plupload_progress, .plupload_upload_status {
+	display: none;
+}
+
+.plupload_progress_container {
+	margin-top: 3px;
+	border: 1px solid #CCC;
+	background: #FFF;
+	padding: 1px;
+}
+.plupload_progress_bar {
+	width: 0px;
+	height: 7px;
+	background: #CDEB8B;
+}
+
+.plupload_scroll .plupload_filelist_header .plupload_file_action, .plupload_scroll .plupload_filelist_footer .plupload_file_action {
+	margin-right: 17px;
+}
+
+/* Floats */
+
+.plupload_clear,.plupload_clearer {clear: both;}
+.plupload_clearer, .plupload_progress_bar {
+	display: block;
+	font-size: 0;
+	line-height: 0;	
+}
+
+li.plupload_droptext {
+	background: transparent;
+	text-align: center;
+	vertical-align: middle;
+	border: 0;
+	line-height: 165px;
+}

Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 1 - 0
src/main/webapp/static/oss/lib/plupload-2.1.2/js/jquery.plupload.queue.min.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 10726 - 0
src/main/webapp/static/oss/lib/plupload-2.1.2/js/moxie.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 15 - 0
src/main/webapp/static/oss/lib/plupload-2.1.2/js/moxie.min.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2332 - 0
src/main/webapp/static/oss/lib/plupload-2.1.2/js/plupload.dev.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 28 - 0
src/main/webapp/static/oss/lib/plupload-2.1.2/js/plupload.full.min.js


+ 339 - 0
src/main/webapp/static/oss/lib/plupload-2.1.2/license.txt

@@ -0,0 +1,339 @@
+		    GNU GENERAL PUBLIC LICENSE
+		       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+			    Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Lesser General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+		    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+			    NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+		     END OF TERMS AND CONDITIONS
+
+	    How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License along
+    with this program; if not, write to the Free Software Foundation, Inc.,
+    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.

+ 147 - 0
src/main/webapp/static/oss/lib/plupload-2.1.2/readme.md

@@ -0,0 +1,147 @@
+# Plupload
+
+Plupload is a cross-browser multi-runtime file uploading API. Basically, a set of tools that will help you to 
+build a reliable and visually appealing file uploader in minutes.
+
+Historically, Plupload comes from a dark and hostile age of no HTML5, hence all the alternative fallbacks, 
+like Flash, Silverlight and Java (still in development). It is meant to provide an API, that 
+will work anywhere and in any case, in one way or another. While having very solid fallbacks, Plupload 
+is built with the future of HTML5 in mind.
+
+### Table of Contents
+* [Backstory](https://github.com/moxiecode/plupload/blob/master/readme.md#backstory)
+* [Structure](https://github.com/moxiecode/plupload/blob/master/readme.md#structure)
+  * [File API and XHR L2 pollyfills](https://github.com/moxiecode/moxie/blob/master/README.md)
+  * [Plupload API](https://github.com/moxiecode/plupload/wiki/API)
+  * [UI Widget](https://github.com/moxiecode/plupload/wiki/UI.Plupload)
+  * [Queue Widget](https://github.com/moxiecode/plupload/wiki/pluploadQueue)
+* [Demos](https://github.com/jayarjo/plupload-demos/blob/master/README.md)
+* [Building Instructions](https://github.com/moxiecode/plupload/blob/master/readme.md#build)
+* [Getting Started](https://github.com/moxiecode/plupload/wiki/Getting-Started)
+  * [Options](https://github.com/moxiecode/plupload/wiki/Options)
+  * [Events](https://github.com/moxiecode/plupload/wiki/Uploader#wiki-events)
+  * [Methods](https://github.com/moxiecode/plupload/wiki/Uploader#wiki-methods)
+  * [Plupload in Your Language](https://github.com/moxiecode/plupload/wiki/Plupload-in-Your-Language)
+  * [File Filters](https://github.com/moxiecode/plupload/wiki/File-Filters) 
+  * [Image Resizing on Client-Side](https://github.com/moxiecode/plupload/wiki/Image-Resizing-on-Client-Side) 
+  * [Chunking](https://github.com/moxiecode/plupload/wiki/Chunking) 
+  * [Upload to Amazon S3](https://github.com/moxiecode/plupload/wiki/Upload-to-Amazon-S3) 
+* [FAQ](https://github.com/moxiecode/plupload/wiki/Frequently-Asked-Questions)
+* [Support](https://github.com/moxiecode/plupload/blob/master/readme.md##support)
+  * [Create a Fiddle](https://github.com/moxiecode/plupload/wiki/Create-a-Fiddle)
+* [Contributing](https://github.com/moxiecode/plupload/blob/master/readme.md#contribute)
+* [License](https://github.com/moxiecode/plupload/blob/master/readme.md#license)
+* [Contact Us](http://www.moxiecode.com/contact.php)
+
+<a name="backstory" />
+### Backstory
+
+Plupload started in a time when uploading a file in a responsive and customizable manner was a real pain. 
+Internally, browsers only had the `input[type="file"]` element. It was ugly and clunky at the same time. 
+One couldn't even change it's visuals, without hiding it and coding another one on top of it from scratch. 
+And then there was no progress indication for the upload process... Sounds pretty crazy today.
+
+It was very logical for developers to look for alternatives and writing their own implementations, using 
+Flash and Java, in order to somehow extend limited browser capabilities. And so did we, in our search for 
+a reliable and flexible file uploader for 
+our [TinyMCE](http://www.tinymce.com/index.php)'s
+[MCImageManager](http://www.tinymce.com/enterprise/mcimagemanager.php). 
+
+Quickly enough though, Plupload grew big.  It easily split into a standalone project. 
+With major *version 2.0* it underwent another huge reconstruction, basically 
+[from the ground up](http://blog.moxiecode.com/2012/11/28/first-public-beta-plupload-2/), 
+as all the low-level runtime logic has been extracted into separate [File API](http://www.w3.org/TR/FileAPI/) 
+and [XHR L2](http://www.w3.org/TR/XMLHttpRequest/) pollyfills (currently known under combined name of [mOxie](https://github.com/moxiecode/moxie)), 
+giving Plupload a chance to evolve further.
+
+<a name="structure" />
+### Structure
+
+Currently, Plupload may be considered as consisting of three parts: low-level pollyfills, 
+Plupload API and Widgets (UI and Queue). Initially, Widgets were meant only to serve as examples 
+of the API, but quickly formed into fully-functional API implementations that now come bundled with 
+the Plupload API. This has been a source for multiple misconceptions about the API as Widgets were 
+easily mistaken for the Plupload itself. They are only implementations, such as any of you can 
+build by yourself out of the API.
+
+* [Low-level pollyfills (mOxie)](https://github.com/moxiecode/moxie) - have their own [code base](https://github.com/moxiecode/moxie) and [documentation](https://github.com/moxiecode/moxie/wiki) on GitHub.
+* [Plupload API](https://github.com/moxiecode/plupload/wiki/API)
+* [UI Widget](https://github.com/moxiecode/plupload/wiki/UI.Plupload)
+* [Queue Widget](https://github.com/moxiecode/plupload/wiki/pluploadQueue)
+
+<a name="build" />
+### Building instructions
+
+Plupload depends on File API and XHR2 L2 pollyfills that currently have their 
+[own repository](https://github.com/moxiecode/moxie) on GitHub. However, in most cases you shouldn't 
+care as we bundle the latest build of mOxie, including full and minified JavaScript source and 
+pre-compiled `SWF` and `XAP` components, with [every release](https://github.com/moxiecode/plupload/releases). You can find everything you may need under `js/` folder.
+
+There are cases where you might need a custom build, for example free of unnecessary runtimes, half the 
+original size, etc. The difficult part of this task comes from mOxie and its set of additional runtimes 
+that require special tools on your workstation in order to compile. 
+Consider [build instructions for mOxie](https://github.com/moxiecode/moxie#build-instructions) - 
+everything applies to Plupload as well.
+
+First of all, if you want to build custom Plupload packages you will require [Node.js](http://nodejs.org/), 
+as this is our build environment of choice. Node.js binaries (as well as Source)
+[are available](http://nodejs.org/download/) for all major operating systems.
+
+Plupload includes _mOxie_ as a submodule, it also depends on some other repositories for building up it's dev
+environment - to avoid necessity of downloading them one by one, we recommended you to simply clone Plupload 
+with [git](http://git-scm.com/) recursively (you will require git installed on your system for this operation 
+to succeed):
+
+```
+git clone --recursive https://github.com/moxiecode/plupload.git
+```
+
+And finalize the preparation stage with: `npm install` - this will install all additional modules, including those
+required by dev and test environments. In case you would rather keep it minimal, add a `--production` flag.
+
+*Note:* Currently, for an unknown reason, locally installed Node.js modules on Windows, may not be automatically 
+added to the system PATH. So, if `jake` commands below are not recognized you will need to add them manually:
+
+```
+set PATH=%PATH%;%CD%\node_modules\.bin\
+``` 
+
+<a name="support" />
+### Support
+
+We are actively standing behind the Plupload and now that we are done with major rewrites and refactoring,
+the only real goal that we have ahead is making it as reliable and bulletproof as possible. We are open to 
+all the suggestions and feature requests. We ask you to file bug reports if you encounter any. We may not 
+react to them instantly, but we constantly bear them in my mind as we extend the code base.
+
+In addition to dedicated support for those who dare to buy our OEM licenses, we got 
+[discussion boards](http://www.plupload.com/punbb/index.php), which is like an enormous FAQ, 
+covering every possible application case. Of course, you are welcome to file a bug report or feature request, 
+here on [GitHub](https://github.com/moxiecode/plupload/issues).
+
+Sometimes it is easier to notice the problem when bug report is accompained by the actual code. Consider providing 
+[a Plupload fiddle](https://github.com/moxiecode/plupload/wiki/Create-a-Fiddle) for the troublesome code.
+
+<a name="contribute" />
+### Contributing
+
+We are open to suggestions and code revisions, however there are some rules and limitations that you might 
+want to consider first.
+
+* Code that you contribute will automatically be licensed under the LGPL, but will not be limited to LGPL.
+* Although all contributors will get the credit for their work, copyright notices will be changed to [Moxiecode Systems AB](http://www.moxiecode.com/).
+* Third party code will be reviewed, tested and possibly modified before being released.
+
+These basic rules help us earn a living and ensure that code remains Open Source and compatible with LGPL license. All contributions will be added to the changelog and appear in every release and on the site. 
+
+An easy place to start is to [translate Plupload to your language](https://github.com/moxiecode/plupload/wiki/Plupload-in-Your-Language#contribute).
+
+You can read more about how to contribute at: [http://www.plupload.com/contributing](http://www.plupload.com/contributing)
+
+<a name="license" />
+### License
+
+Copyright 2013, [Moxiecode Systems AB](http://www.moxiecode.com/)  
+Released under [GPLv2 License](https://github.com/moxiecode/plupload/blob/master/license.txt).
+
+We also provide [commercial license](http://www.plupload.com/commercial.php).

+ 27 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/bower.json

@@ -0,0 +1,27 @@
+{
+	"name": "plupload",
+	"license": "AGPLv3",
+	"authors": [
+		"Davit Barbakadze <davit.barbakadze@ephox.com>"
+	],
+	"homepage": "http://plupload.com",
+	"repository": {
+		"type": "git",
+		"url": "https://github.com/moxiecode/plupload.git"
+	},
+	"main": [
+		"./js/plupload.full.min.js"
+	],
+	"ignore": [
+		"tests/",
+		"src/",
+		"build/",
+		"examples/",
+		"Jakefile.js",
+		"package.json",
+		"bower.json",
+		"composer.json",
+		"README.md",
+		".*"
+	]
+}

+ 85 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/examples/custom.html

@@ -0,0 +1,85 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml" dir="ltr">
+<head>
+<meta http-equiv="content-type" content="text/html; charset=UTF-8"/>
+
+<title>Plupload - Custom example</title>
+
+<!-- production -->
+<script type="text/javascript" src="../js/plupload.full.min.js"></script>
+
+
+<!-- debug 
+<script type="text/javascript" src="../js/moxie.js"></script>
+<script type="text/javascript" src="../js/plupload.dev.js"></script>
+-->
+
+</head>
+<body style="font: 13px Verdana; background: #eee; color: #333">
+
+<h1>Custom example</h1>
+
+<p>Shows you how to use the core plupload API.</p>
+
+<div id="filelist">Your browser doesn't have Flash, Silverlight or HTML5 support.</div>
+<br />
+
+<div id="container">
+    <a id="pickfiles" href="javascript:;">[Select files]</a> 
+    <a id="uploadfiles" href="javascript:;">[Upload files]</a>
+</div>
+
+<br />
+<pre id="console"></pre>
+
+
+<script type="text/javascript">
+// Custom example logic
+
+var uploader = new plupload.Uploader({
+	runtimes : 'html5,flash,silverlight,html4',
+	browse_button : 'pickfiles', // you can pass an id...
+	container: document.getElementById('container'), // ... or DOM Element itself
+	url : 'upload.php',
+	flash_swf_url : '../js/Moxie.swf',
+	silverlight_xap_url : '../js/Moxie.xap',
+	
+	filters : {
+		max_file_size : '10mb',
+		mime_types: [
+			{title : "Image files", extensions : "jpg,gif,png"},
+			{title : "Zip files", extensions : "zip"}
+		]
+	},
+
+	init: {
+		PostInit: function() {
+			document.getElementById('filelist').innerHTML = '';
+
+			document.getElementById('uploadfiles').onclick = function() {
+				uploader.start();
+				return false;
+			};
+		},
+
+		FilesAdded: function(up, files) {
+			plupload.each(files, function(file) {
+				document.getElementById('filelist').innerHTML += '<div id="' + file.id + '">' + file.name + ' (' + plupload.formatSize(file.size) + ') <b></b></div>';
+			});
+		},
+
+		UploadProgress: function(up, file) {
+			document.getElementById(file.id).getElementsByTagName('b')[0].innerHTML = '<span>' + file.percent + "%</span>";
+		},
+
+		Error: function(up, err) {
+			document.getElementById('console').appendChild(document.createTextNode("\nError #" + err.code + ": " + err.message));
+		}
+	}
+});
+
+uploader.init();
+
+</script>
+</body>
+</html>

+ 27 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/examples/dump.php

@@ -0,0 +1,27 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml" dir="ltr">
+<head>
+<meta http-equiv="content-type" content="text/html; charset=UTF-8"/>
+<title>Plupload - Form dump</title>
+</head>
+<body style="font: 13px Verdana; background: #eee; color: #333">
+	
+<h1>Post dump</h1>
+
+<p>Shows the form items posted.</p>
+
+<table>
+	<tr>
+		<th>Name</th>
+		<th>Value</th>
+	</tr>
+	<?php $count = 0; foreach ($_POST as $name => $value) { ?>
+	<tr class="<?php echo $count % 2 == 0 ? 'alt' : ''; ?>">
+		<td><?php echo htmlentities(stripslashes($name)) ?></td>
+		<td><?php echo nl2br(htmlentities(stripslashes($value))) ?></td>
+	</tr>
+	<?php } ?>
+</table>
+
+</body>
+</html>

+ 217 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/examples/events.html

@@ -0,0 +1,217 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml" dir="ltr">
+<head>
+<meta http-equiv="content-type" content="text/html; charset=UTF-8"/>
+
+<title>Plupload - Events example</title>
+
+<!-- production -->
+<script type="text/javascript" src="../js/plupload.full.min.js"></script>
+
+
+<!-- debug 
+<script type="text/javascript" src="../js/moxie.js"></script>
+<script type="text/javascript" src="../js/plupload.dev.js"></script>
+-->
+
+</head>
+<body style="font: 13px Verdana; background: #eee; color: #333">
+
+<h1>Events example</h1>
+
+<div id="container">
+    <a id="pickfiles" href="javascript:;">[Select files]</a> 
+    <a id="uploadfiles" href="javascript:;">[Upload files]</a>
+</div>
+
+<br />
+<pre id="console"></pre>
+<script type="text/javascript">
+	var uploader = new plupload.Uploader({
+        // General settings
+        runtimes : 'silverlight,html4',
+		browse_button : 'pickfiles', // you can pass in id...
+        url : 'upload.php',
+        chunk_size : '1mb',
+        unique_names : true,
+        // Resize images on client-side if we can
+        resize : { width : 320, height : 240, quality : 90 },
+        
+        filters : {
+            max_file_size : '10mb',
+
+			// Specify what files to browse for
+            mime_types: [
+                {title : "Image files", extensions : "jpg,gif,png"},
+                {title : "Zip files", extensions : "zip"}
+            ]
+        },
+		flash_swf_url : '../js/Moxie.swf',
+		silverlight_xap_url : '../js/Moxie.xap',
+         
+        // PreInit events, bound before the internal events
+        preinit : {
+            Init: function(up, info) {
+                log('[Init]', 'Info:', info, 'Features:', up.features);
+            },
+            UploadFile: function(up, file) {
+                log('[UploadFile]', file);
+                // You can override settings before the file is uploaded
+                // up.setOption('url', 'upload.php?id=' + file.id);
+                // up.setOption('multipart_params', {param1 : 'value1', param2 : 'value2'});
+            }
+        },
+        // Post init events, bound after the internal events
+        init : {
+			PostInit: function() {
+				// Called after initialization is finished and internal event handlers bound
+				log('[PostInit]');
+				
+				document.getElementById('uploadfiles').onclick = function() {
+					uploader.start();
+					return false;
+				};
+			},
+
+			Browse: function(up) {
+                // Called when file picker is clicked
+                log('[Browse]');
+            },
+
+            Refresh: function(up) {
+                // Called when the position or dimensions of the picker change
+                log('[Refresh]');
+            },
+            StateChanged: function(up) {
+                // Called when the state of the queue is changed
+                log('[StateChanged]', up.state == plupload.STARTED ? "STARTED" : "STOPPED");
+            },
+            QueueChanged: function(up) {
+                // Called when queue is changed by adding or removing files
+                log('[QueueChanged]');
+            },
+
+			OptionChanged: function(up, name, value, oldValue) {
+				// Called when one of the configuration options is changed
+				log('[OptionChanged]', 'Option Name: ', name, 'Value: ', value, 'Old Value: ', oldValue);
+			},
+
+			BeforeUpload: function(up, file) {
+				// Called right before the upload for a given file starts, can be used to cancel it if required
+				log('[BeforeUpload]', 'File: ', file);
+			},
+            UploadProgress: function(up, file) {
+                // Called while file is being uploaded
+                log('[UploadProgress]', 'File:', file, "Total:", up.total);
+            },
+
+			FileFiltered: function(up, file) {
+				// Called when file successfully files all the filters
+                log('[FileFiltered]', 'File:', file);
+			},
+            FilesAdded: function(up, files) {
+                // Called when files are added to queue
+                log('[FilesAdded]');
+                plupload.each(files, function(file) {
+                    log('  File:', file);
+                });
+            },
+            FilesRemoved: function(up, files) {
+                // Called when files are removed from queue
+                log('[FilesRemoved]');
+                plupload.each(files, function(file) {
+                    log('  File:', file);
+                });
+            },
+            FileUploaded: function(up, file, info) {
+                // Called when file has finished uploading
+                log('[FileUploaded] File:', file, "Info:", info);
+            },
+            ChunkUploaded: function(up, file, info) {
+                // Called when file chunk has finished uploading
+                log('[ChunkUploaded] File:', file, "Info:", info);
+            },
+
+			UploadComplete: function(up, files) {
+				// Called when all files are either uploaded or failed
+                log('[UploadComplete]');
+			},
+
+			Destroy: function(up) {
+				// Called when uploader is destroyed
+                log('[Destroy] ');
+			},
+            Error: function(up, args) {
+                // Called when error occurs
+                log('[Error] ', args);
+            }
+        }
+    });
+    function log() {
+        var str = "";
+        plupload.each(arguments, function(arg) {
+            var row = "";
+            if (typeof(arg) != "string") {
+                plupload.each(arg, function(value, key) {
+                    // Convert items in File objects to human readable form
+                    if (arg instanceof plupload.File) {
+                        // Convert status to human readable
+                        switch (value) {
+                            case plupload.QUEUED:
+                                value = 'QUEUED';
+                                break;
+                            case plupload.UPLOADING:
+                                value = 'UPLOADING';
+                                break;
+                            case plupload.FAILED:
+                                value = 'FAILED';
+                                break;
+                            case plupload.DONE:
+                                value = 'DONE';
+                                break;
+                        }
+                    }
+                    if (typeof(value) != "function") {
+                        row += (row ? ', ' : '') + key + '=' + value;
+                    }
+                });
+                str += row + " ";
+            } else {
+                str += arg + " ";
+            }
+        });
+        var log = document.getElementById('console');
+        log.innerHTML += str + "\n";
+    }
+
+	uploader.init();
+
+</script>
+</body>
+</html>

+ 139 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/examples/jquery/all_runtimes.html

@@ -0,0 +1,139 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml" dir="ltr">
+<head>
+<meta http-equiv="content-type" content="text/html; charset=UTF-8"/>
+
+<title>Plupload - Queue widget example</title>
+
+<link rel="stylesheet" href="../../js/jquery.plupload.queue/css/jquery.plupload.queue.css" type="text/css" media="screen" />
+
+<script src="//ajax.googleapis.com/ajax/libs/jquery/1.9.0/jquery.min.js"></script>
+
+<!-- production -->
+<script type="text/javascript" src="../../js/plupload.full.min.js"></script>
+<script type="text/javascript" src="../../js/jquery.plupload.queue/jquery.plupload.queue.js"></script>
+
+<!-- debug 
+<script type="text/javascript" src="../../js/moxie.js"></script>
+<script type="text/javascript" src="../../js/plupload.dev.js"></script>
+<script type="text/javascript" src="../../js/jquery.plupload.queue/jquery.plupload.queue.js"></script>
+-->
+
+</head>
+<body style="font: 13px Verdana; background: #eee; color: #333">
+
+<form method="post" action="dump.php">
+	<h1>Queue widget example</h1>
+
+	<p>Shows the jQuery Plupload Queue widget and under different runtimes.</p>
+
+	<div style="float: left; margin-right: 20px">
+		<h3>Flash runtime</h3>
+		<div id="flash_uploader" style="width: 500px; height: 330px;">Your browser doesn't have Flash installed.</div>
+
+		<h3>Silverlight runtime</h3>
+		<div id="silverlight_uploader" style="width: 500px; height: 330px;">Your browser doesn't have Silverlight installed.</div>
+	</div>
+
+	<div style="float: left; margin-right: 20px">
+		<h3>HTML 4 runtime</h3>
+		<div id="html4_uploader" style="width: 500px; height: 330px;">Your browser doesn't have HTML 4 support.</div>
+		
+		<h3>HTML 5 runtime</h3>
+		<div id="html5_uploader" style="width: 500px; height: 330px;">Your browser doesn't support native upload.</div>
+	</div>
+
+	<br style="clear: both" />
+
+	<input type="submit" value="Send" />
+</form>
+
+<script type="text/javascript">
+$(function() {
+	// Setup flash version
+	$("#flash_uploader").pluploadQueue({
+		// General settings
+		runtimes : 'flash',
+		url : '../upload.php',
+		chunk_size : '1mb',
+		unique_names : true,
+		
+		filters : {
+			max_file_size : '10mb',
+			mime_types: [
+				{title : "Image files", extensions : "jpg,gif,png"},
+				{title : "Zip files", extensions : "zip"}
+			]
+		},
+
+		// Resize images on clientside if we can
+		resize : {width : 320, height : 240, quality : 90},
+
+		// Flash settings
+		flash_swf_url : '../../js/Moxie.swf'
+	});
+
+
+	// Setup silverlight version
+	$("#silverlight_uploader").pluploadQueue({
+		// General settings
+		runtimes : 'silverlight',
+		url : '../upload.php',
+		chunk_size : '1mb',
+		unique_names : true,
+		
+		filters : {
+			max_file_size : '10mb',
+			mime_types: [
+				{title : "Image files", extensions : "jpg,gif,png"},
+				{title : "Zip files", extensions : "zip"}
+			]
+		},
+
+		// Resize images on clientside if we can
+		resize : {width : 320, height : 240, quality : 90},
+
+		// Silverlight settings
+		silverlight_xap_url : '../../js/Moxie.xap'
+	});
+
+	// Setup html5 version
+	$("#html5_uploader").pluploadQueue({
+		// General settings
+		runtimes : 'html5',
+		url : '../upload.php',
+		chunk_size : '1mb',
+		unique_names : true,
+		
+		filters : {
+			max_file_size : '10mb',
+			mime_types: [
+				{title : "Image files", extensions : "jpg,gif,png"},
+				{title : "Zip files", extensions : "zip"}
+			]
+		},
+
+		// Resize images on clientside if we can
+		resize : {width : 320, height : 240, quality : 90}
+	});
+
+
+	// Setup html4 version
+	$("#html4_uploader").pluploadQueue({
+		// General settings
+		runtimes : 'html4',
+		url : '../upload.php',
+		unique_names : true,
+		
+		filters : {
+			mime_types: [
+				{title : "Image files", extensions : "jpg,gif,png"},
+				{title : "Zip files", extensions : "zip"}
+			]
+		}
+	});
+});
+</script>
+
+</body>
+</html>

+ 113 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/examples/jquery/jquery_ui_widget.html

@@ -0,0 +1,113 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml" dir="ltr">
+<head>
+<meta http-equiv="content-type" content="text/html; charset=UTF-8"/>
+
+<title>Plupload - jQuery UI Widget</title>
+
+<link rel="stylesheet" href="//ajax.googleapis.com/ajax/libs/jqueryui/1.8.9/themes/base/jquery-ui.css" type="text/css" />
+<link rel="stylesheet" href="../../js/jquery.ui.plupload/css/jquery.ui.plupload.css" type="text/css" />
+
+<script src="//ajax.googleapis.com/ajax/libs/jquery/1.9.0/jquery.min.js"></script>
+<script type="text/javascript" src="//ajax.googleapis.com/ajax/libs/jqueryui/1.10.2/jquery-ui.min.js"></script>
+
+<!-- production -->
+<script type="text/javascript" src="../../js/plupload.full.min.js"></script>
+<script type="text/javascript" src="../../js/jquery.ui.plupload/jquery.ui.plupload.js"></script>
+
+<!-- debug 
+<script type="text/javascript" src="../../js/moxie.js"></script>
+<script type="text/javascript" src="../../js/plupload.dev.js"></script>
+<script type="text/javascript" src="../../js/jquery.ui.plupload/jquery.ui.plupload.js"></script>
+-->
+
+</head>
+<body style="font: 13px Verdana; background: #eee; color: #333">
+
+<h1>jQuery UI Widget</h1>
+
+<p>You can see this example with different themes on the <a href="http://plupload.com/example_jquery_ui.php">www.plupload.com</a> website.</p>
+
+<form id="form" method="post" action="../dump.php">
+	<div id="uploader">
+		<p>Your browser doesn't have Flash, Silverlight or HTML5 support.</p>
+	</div>
+	<br />
+	<input type="submit" value="Submit" />
+</form>
+
+<script type="text/javascript">
+// Initialize the widget when the DOM is ready
+$(function() {
+	$("#uploader").plupload({
+		// General settings
+		runtimes : 'html5,flash,silverlight,html4',
+		url : '../upload.php',
+
+		// User can upload no more then 20 files in one go (sets multiple_queues to false)
+		max_file_count: 20,
+		
+		chunk_size: '1mb',
+
+		// Resize images on clientside if we can
+		resize : {
+			width : 200, 
+			height : 200, 
+			quality : 90,
+			crop: true // crop to exact dimensions
+		},
+		
+		filters : {
+			// Maximum file size
+			max_file_size : '1000mb',
+			// Specify what files to browse for
+			mime_types: [
+				{title : "Image files", extensions : "jpg,gif,png"},
+				{title : "Zip files", extensions : "zip"}
+			]
+		},
+
+		// Rename files by clicking on their titles
+		rename: true,
+		
+		// Sort files
+		sortable: true,
+
+		// Enable ability to drag'n'drop files onto the widget (currently only HTML5 supports that)
+		dragdrop: true,
+
+		// Views to activate
+		views: {
+			list: true,
+			thumbs: true, // Show thumbs
+			active: 'thumbs'
+		},
+
+		// Flash settings
+		flash_swf_url : '../../js/Moxie.swf',
+
+		// Silverlight settings
+		silverlight_xap_url : '../../js/Moxie.xap'
+	});
+
+
+	// Handle the case when form was submitted before uploading has finished
+	$('#form').submit(function(e) {
+		// Files in queue upload them first
+		if ($('#uploader').plupload('getFiles').length > 0) {
+
+			// When all files are uploaded submit form
+			$('#uploader').on('complete', function() {
+				$('#form')[0].submit();
+			});
+
+			$('#uploader').plupload('start');
+		} else {
+			alert("You must have at least one file in the queue.");
+		}
+		return false; // Keep the form from submitting
+	});
+});
+</script>
+</body>
+</html>

+ 66 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/examples/jquery/queue_widget.html

@@ -0,0 +1,66 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml" dir="ltr">
+<head>
+<meta http-equiv="content-type" content="text/html; charset=UTF-8"/>
+
+<title>Plupload - Queue widget example</title>
+
+<link rel="stylesheet" href="../../js/jquery.plupload.queue/css/jquery.plupload.queue.css" type="text/css" media="screen" />
+
+<script src="//ajax.googleapis.com/ajax/libs/jquery/1.9.0/jquery.min.js"></script>
+
+<!-- production -->
+<script type="text/javascript" src="../../js/plupload.full.min.js"></script>
+<script type="text/javascript" src="../../js/jquery.plupload.queue/jquery.plupload.queue.js"></script>
+
+<!-- debug 
+<script type="text/javascript" src="../../js/moxie.js"></script>
+<script type="text/javascript" src="../../js/plupload.dev.js"></script>
+<script type="text/javascript" src="../../js/jquery.plupload.queue/jquery.plupload.queue.js"></script>
+-->
+
+
+</head>
+<body style="font: 13px Verdana; background: #eee; color: #333">
+
+<form method="post" action="dump.php">	
+	<div id="uploader">
+		<p>Your browser doesn't have Flash, Silverlight or HTML5 support.</p>
+	</div>
+	<input type="submit" value="Send" />
+</form>
+
+<script type="text/javascript">
+$(function() {
+	
+	// Setup html5 version
+	$("#uploader").pluploadQueue({
+		// General settings
+		runtimes : 'html5,flash,silverlight,html4',
+		url : '../upload.php',
+		chunk_size: '1mb',
+		rename : true,
+		dragdrop: true,
+		
+		filters : {
+			// Maximum file size
+			max_file_size : '10mb',
+			// Specify what files to browse for
+			mime_types: [
+				{title : "Image files", extensions : "jpg,gif,png"},
+				{title : "Zip files", extensions : "zip"}
+			]
+		},
+
+		// Resize images on clientside if we can
+		resize : {width : 320, height : 240, quality : 90},
+
+		flash_swf_url : '../../js/Moxie.swf',
+		silverlight_xap_url : '../../js/Moxie.xap'
+	});
+
+});
+</script>
+
+</body>
+</html>

+ 125 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/examples/jquery/s3.php

@@ -0,0 +1,125 @@
+<?php 
+/* 
+In order to upload files to S3 using Flash runtime, one should start by placing crossdomain.xml into the bucket.
+crossdomain.xml can be as simple as this:
+
+<?xml version="1.0"?>
+<!DOCTYPE cross-domain-policy SYSTEM "http://www.macromedia.com/xml/dtds/cross-domain-policy.dtd">
+<cross-domain-policy>
+<allow-access-from domain="*" secure="false" />
+</cross-domain-policy>
+
+In our tests SilverLight didn't require anything special and worked with this configuration just fine. It may fail back
+to the same crossdomain.xml as last resort.
+
+!!!Important!!! Plupload UI Widget here, is used only for demo purposes and is not required for uploading to S3.
+*/
+
+// important variables that will be used throughout this example
+$bucket = 'BUCKET';
+
+// these can be found on your Account page, under Security Credentials > Access Keys
+$accessKeyId = 'ACCESS_KEY_ID';
+$secret = 'SECRET_ACCESS_KEY';
+
+// prepare policy
+$policy = base64_encode(json_encode(array(
+	// ISO 8601 - date('c'); generates uncompatible date, so better do it manually
+	'expiration' => date('Y-m-d\TH:i:s.000\Z', strtotime('+1 day')),  
+	'conditions' => array(
+		array('bucket' => $bucket),
+		array('acl' => 'public-read'),
+		array('starts-with', '$key', ''),
+		// for demo purposes we are accepting only images
+		array('starts-with', '$Content-Type', 'image/'),
+		// Plupload internally adds name field, so we need to mention it here
+		array('starts-with', '$name', ''), 	
+		// One more field to take into account: Filename - gets silently sent by FileReference.upload() in Flash
+		// http://docs.amazonwebservices.com/AmazonS3/latest/dev/HTTPPOSTFlash.html
+		array('starts-with', '$Filename', ''), 
+	)
+)));
+
+// sign policy
+$signature = base64_encode(hash_hmac('sha1', $policy, $secret, true));
+
+?>
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml" dir="ltr">
+<head>
+<meta http-equiv="content-type" content="text/html; charset=UTF-8"/>
+
+<title>Plupload to Amazon S3 Example</title>
+
+<link rel="stylesheet" href="//ajax.googleapis.com/ajax/libs/jqueryui/1.8.9/themes/base/jquery-ui.css" type="text/css" />
+<script src="//ajax.googleapis.com/ajax/libs/jquery/1.9.0/jquery.min.js"></script>
+<script src="//ajax.googleapis.com/ajax/libs/jqueryui/1.10.2/jquery-ui.min.js"></script>
+
+<!-- Load plupload and all it's runtimes and finally the UI widget -->
+<link rel="stylesheet" href="../../js/jquery.ui.plupload/css/jquery.ui.plupload.css" type="text/css" />
+
+
+<!-- production -->
+<script type="text/javascript" src="../../js/plupload.full.min.js"></script>
+<script type="text/javascript" src="../../js/jquery.ui.plupload/jquery.ui.plupload.js"></script>
+
+<!-- debug 
+<script type="text/javascript" src="../../js/moxie.js"></script>
+<script type="text/javascript" src="../../js/plupload.dev.js"></script>
+<script type="text/javascript" src="../../js/jquery.ui.plupload/jquery.ui.plupload.js"></script>
+-->
+
+</head>
+<body style="font: 13px Verdana; background: #eee; color: #333">
+
+<h1>Plupload to Amazon S3 Example</h1>
+
+<div id="uploader">
+    <p>Your browser doesn't have Flash, Silverlight or HTML5 support.</p>
+</div>
+
+<script type="text/javascript">
+// Convert divs to queue widgets when the DOM is ready
+$(function() {
+	$("#uploader").plupload({
+		runtimes : 'html5,flash,silverlight',
+		url : 'http://<?php echo $bucket; ?>.s3.amazonaws.com/',
+		
+		multipart: true,
+		multipart_params: {
+			'key': '${filename}', // use filename as a key
+			'Filename': '${filename}', // adding this to keep consistency across the runtimes
+			'acl': 'public-read',
+			'Content-Type': 'image/jpeg',
+			'AWSAccessKeyId' : '<?php echo $accessKeyId; ?>',		
+			'policy': '<?php echo $policy; ?>',
+			'signature': '<?php echo $signature; ?>'
+		},
+		
+		// !!!Important!!! 
+		// this is not recommended with S3, since it will force Flash runtime into the mode, with no progress indication
+		//resize : {width : 800, height : 600, quality : 60},  // Resize images on clientside, if possible 
+		
+		// optional, but better be specified directly
+		file_data_name: 'file',
+
+		filters : {
+			// Maximum file size
+			max_file_size : '10mb',
+			// Specify what files to browse for
+			mime_types: [
+				{title : "Image files", extensions : "jpg,jpeg"}
+			]
+		},
+
+		// Flash settings
+		flash_swf_url : '../../js/Moxie.swf',
+
+		// Silverlight settings
+		silverlight_xap_url : '../../js/Moxie.xap'
+	});
+});
+</script>
+
+</body>
+</html>

+ 125 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/examples/upload.php

@@ -0,0 +1,125 @@
+<?php
+/**
+ * upload.php
+ *
+ * Copyright 2013, Moxiecode Systems AB
+ * Released under GPL License.
+ *
+ * License: http://www.plupload.com/license
+ * Contributing: http://www.plupload.com/contributing
+ */
+
+#!! IMPORTANT: 
+#!! this file is just an example, it doesn't incorporate any security checks and 
+#!! is not recommended to be used in production environment as it is. Be sure to 
+#!! revise it and customize to your needs.
+
+
+// Make sure file is not cached (as it happens for example on iOS devices)
+header("Expires: Mon, 26 Jul 1997 05:00:00 GMT");
+header("Last-Modified: " . gmdate("D, d M Y H:i:s") . " GMT");
+header("Cache-Control: no-store, no-cache, must-revalidate");
+header("Cache-Control: post-check=0, pre-check=0", false);
+header("Pragma: no-cache");
+
+/* 
+// Support CORS
+header("Access-Control-Allow-Origin: *");
+// other CORS headers if any...
+if ($_SERVER['REQUEST_METHOD'] == 'OPTIONS') {
+	exit; // finish preflight CORS requests here
+}
+*/
+
+// 5 minutes execution time
+@set_time_limit(5 * 60);
+
+// Uncomment this one to fake upload time
+// usleep(5000);
+
+// Settings
+$targetDir = ini_get("upload_tmp_dir") . DIRECTORY_SEPARATOR . "plupload";
+//$targetDir = 'uploads';
+$cleanupTargetDir = true; // Remove old files
+$maxFileAge = 5 * 3600; // Temp file age in seconds
+
+
+// Create target dir
+if (!file_exists($targetDir)) {
+	@mkdir($targetDir);
+}
+
+// Get a file name
+if (isset($_REQUEST["name"])) {
+	$fileName = $_REQUEST["name"];
+} elseif (!empty($_FILES)) {
+	$fileName = $_FILES["file"]["name"];
+} else {
+	$fileName = uniqid("file_");
+}
+
+$filePath = $targetDir . DIRECTORY_SEPARATOR . $fileName;
+
+// Chunking might be enabled
+$chunk = isset($_REQUEST["chunk"]) ? intval($_REQUEST["chunk"]) : 0;
+$chunks = isset($_REQUEST["chunks"]) ? intval($_REQUEST["chunks"]) : 0;
+
+
+// Remove old temp files	
+if ($cleanupTargetDir) {
+	if (!is_dir($targetDir) || !$dir = opendir($targetDir)) {
+		die('{"jsonrpc" : "2.0", "error" : {"code": 100, "message": "Failed to open temp directory."}, "id" : "id"}');
+	}
+
+	while (($file = readdir($dir)) !== false) {
+		$tmpfilePath = $targetDir . DIRECTORY_SEPARATOR . $file;
+
+		// If temp file is current file proceed to the next
+		if ($tmpfilePath == "{$filePath}.part") {
+			continue;
+		}
+
+		// Remove temp file if it is older than the max age and is not the current file
+		if (preg_match('/\.part$/', $file) && (filemtime($tmpfilePath) < time() - $maxFileAge)) {
+			@unlink($tmpfilePath);
+		}
+	}
+	closedir($dir);
+}	
+
+
+// Open temp file
+if (!$out = @fopen("{$filePath}.part", $chunks ? "ab" : "wb")) {
+	die('{"jsonrpc" : "2.0", "error" : {"code": 102, "message": "Failed to open output stream."}, "id" : "id"}');
+}
+
+if (!empty($_FILES)) {
+	if ($_FILES["file"]["error"] || !is_uploaded_file($_FILES["file"]["tmp_name"])) {
+		die('{"jsonrpc" : "2.0", "error" : {"code": 103, "message": "Failed to move uploaded file."}, "id" : "id"}');
+	}
+
+	// Read binary input stream and append it to temp file
+	if (!$in = @fopen($_FILES["file"]["tmp_name"], "rb")) {
+		die('{"jsonrpc" : "2.0", "error" : {"code": 101, "message": "Failed to open input stream."}, "id" : "id"}');
+	}
+} else {	
+	if (!$in = @fopen("php://input", "rb")) {
+		die('{"jsonrpc" : "2.0", "error" : {"code": 101, "message": "Failed to open input stream."}, "id" : "id"}');
+	}
+}
+
+while ($buff = fread($in, 4096)) {
+	fwrite($out, $buff);
+}
+
+@fclose($out);
+@fclose($in);
+
+// Check if file has been uploaded
+if (!$chunks || $chunk == $chunks - 1) {
+	// Strip the temp .part suffix off 
+	rename("{$filePath}.part", $filePath);
+}
+
+// Return Success JSON-RPC response
+die('{"jsonrpc" : "2.0", "result" : null, "id" : "id"}');

binární
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/Moxie.swf


binární
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/Moxie.xap


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ar.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/az.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/bg.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/bs.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ca.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/cs.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/cy.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/da.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/de.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/el.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/en.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/es.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/et.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/fa.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/fi.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/fr.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/he.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/hr.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/hu.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/hy.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/id.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/it.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ja.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ka.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/kk.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/km.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ko.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ku_IQ.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/lt.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/lv.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ms.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/nl.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/pl.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/pt.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/pt_BR.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ro.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/ru.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/sk.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/sl.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/sq.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/sr.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/sv.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/th_TH.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/tr.js


Rozdílová data souboru nebyla zobrazena, protože soubor je příliš velký
+ 2 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/uk_UA.js


+ 0 - 0
src/main/webapp/static/oss/lib/plupload-2.3.6/plupload-2.3.6/js/i18n/vi.js


Některé soubory nejsou zobrazeny, neboť je v těchto rozdílových datech změněno mnoho souborů