Added TcpClient based on chrome.sockets.tcp.

Improved BytesIO.
Improved HttpClient.

Author: andot

LICENSE.md

@@ -1,6 +1,6 @@
 The MIT License (MIT)
 
-Copyright (c) 2008-2015 http://hprose.com
+Copyright (c) 2008-2016 http://hprose.com
 
 Permission is hereby granted, free of charge, to any person obtaining a copy of
 this software and associated documentation files (the "Software"), to deal in

bower.json

@@ -1,7 +1,7 @@
 {
     "author": "Ma Bingyao <andot@hprose.com>",
     "name": "hprose-html5",
-    "version": "2.0.3",
+    "version": "2.0.4",
     "description": "Hprose is a High Performance Remote Object Service Engine. It is a modern, lightweight, cross-language, cross-platform, object-oriented, high performance, remote dynamic communication middleware.",
     "keywords": [
         "hprose",

dist/hprose-html5.js

@@ -24,6 +24,7 @@ gulp.task('compress', ['clear'], function() {
                      'src/ResultMode.js',
                      'src/Client.js',
                      'src/HttpClient.js',
+                     'src/TcpClient.js',
                      'src/WebSocketClient.js',
                      'src/JSONRPCClientFilter.js',
                      'src/Loader.js'])

gulpfile.js

@@ -1,7 +1,7 @@
 {
   "name": "hprose-html5",
   "filename": "hprose-html5.js",
-  "version": "2.0.3",
+  "version": "2.0.4",
   "description": "Hprose is a High Performance Remote Object Service Engine. It is a modern, lightweight, cross-language, cross-platform, object-oriented, high performance, remote dynamic communication middleware. It is not only easy to use, but powerful. You just need a little time to learn, then you can use it to easily construct cross language cross platform distributed application system.",
   "homepage": "https://github.com/andot/hprose",
   "keywords": [

package.json

@@ -13,7 +13,7 @@
  *                                                        *
  * hprose BytesIO for HTML5.                              *
  *                                                        *
- * LastModified: Aug 21, 2015                             *
+ * LastModified: Feb 5, 2016                              *
  * Author: Ma Bingyao <andot@hprose.com>                  *
  *                                                        *
 \**********************************************************/
@@ -22,6 +22,16 @@
 (function (global, undefined) {
     'use strict';
 
+    var arrayLikeObjectArgumentsEnabled = true;
+
+    try {
+        String.fromCharCode.apply(String, new Uint8Array([1, 2]));
+    }
+    catch (e) {
+        arrayLikeObjectArgumentsEnabled = false;
+        Object.defineProperty(Array.prototype, 'subarray', { value: Array.prototype.slice });
+    }
+
     var Future = global.hprose.Future;
 
     var _EMPTY_BYTES = new Uint8Array(0);
@@ -80,7 +90,7 @@
     }
 
     function readShortString(bytes, n) {
-        var charCodes = new Uint16Array(n);
+        var charCodes = new Array(n);
         var i = 0, off = 0;
         for (var len = bytes.length; i < n && off < len; i++) {
             var unit = bytes[off++];
@@ -138,14 +148,14 @@
             }
         }
         if (i < n) {
-            charCodes = charCodes.subarray(0, i);
+            charCodes.length = i;
         }
         return [String.fromCharCode.apply(String, charCodes), off];
     }
 
     function readLongString(bytes, n) {
         var buf = [];
-        var charCodes = new Uint16Array(0xffff);
+        var charCodes = new Array(0xffff);
         var i = 0, off = 0;
         for (var len = bytes.length; i < n && off < len; i++) {
             var unit = bytes[off++];
@@ -203,13 +213,15 @@
             }
             if (i >= 65534) {
                 var size = i + 1;
-                buf.push(String.fromCharCode.apply(String, charCodes.subarray(0, size)));
+                charCodes.length = size;
+                buf.push(String.fromCharCode.apply(String, charCodes));
                 n -= size;
                 i = -1;
             }
         }
         if (i > 0) {
-            buf.push(String.fromCharCode.apply(String, charCodes.subarray(0, i)));
+            charCodes.length = i;
+            buf.push(String.fromCharCode.apply(String, charCodes));
         }
         return [buf.join(''), off];
     }
@@ -279,6 +291,15 @@
         return [bytes.subarray(0, off), off];
     }
 
+    function toArray(bytes) {
+        var n = bytes.length;
+        var a = new Array(bytes.length);
+        for (var i = 0; i < n; ++i) {
+            a[i] = bytes[i];
+        }
+        return a;
+    }
+
     function pow2roundup(x) {
         --x;
         x |= x >> 1;
@@ -360,6 +381,17 @@
                     _EMPTY_BYTES :
                     this._bytes.subarray(0, this._length);
         } },
+        buffer: { get : function() {
+            if (this._bytes === null) {
+                return _EMPTY_BYTES.buffer;
+            }
+            if (this._bytes.buffer.slice) {
+                return this._bytes.buffer.slice(0, this._length);
+            }
+            var buf = new Uint8Array(this._length);
+            buf.set(this._bytes.subarray(0, this._length));
+            return buf.buffer;
+        } },
         mark: { value: function() {
             this._wmark = this._length;
             this._rmark = this._off;
@@ -555,17 +587,18 @@
             }
             if (n === 0) return '';
             var bytes = this._bytes.subarray(this._off, this._off += n);
+            var charCodes = (arrayLikeObjectArgumentsEnabled ? bytes : toArray(bytes));
             if (n < 100000) {
-                return String.fromCharCode.apply(String, bytes);
+                return String.fromCharCode.apply(String, charCodes);
             }
             var remain = n & 0xffff;
             var count = n >> 16;
             var a = new Array(remain ? count + 1 : count);
             for (var i = 0; i < count; ++i) {
-                a[i] = String.fromCharCode.apply(String, bytes.subarray(i << 16, (i + 1) << 16));
+                a[i] = String.fromCharCode.apply(String, charCodes.subarray(i << 16, (i + 1) << 16));
             }
             if (remain) {
-                a[count] = String.fromCharCode.apply(String, bytes.subarray(count << 16, n));
+                a[count] = String.fromCharCode.apply(String, charCodes.subarray(count << 16, n));
             }
             return a.join('');
         } },

src/BytesIO.js

@@ -1,4 +1,4 @@
-// Hprose for HTML5 v2.0.3
+// Hprose for HTML5 v2.0.4
 // Copyright (c) 2008-2015 http://hprose.com
 // Hprose is freely distributable under the MIT license.
 // For all details and documentation:

src/CopyRight.js

@@ -12,7 +12,7 @@
  *                                                        *
  * hprose http client for HTML5.                          *
  *                                                        *
- * LastModified: Aug 2, 2015                              *
+ * LastModified: Feb 5, 2016                              *
  * Author: Ma Bingyao <andot@hprose.com>                  *
  *                                                        *
 \**********************************************************/
@@ -70,7 +70,9 @@
                 xhr.send(request.buffer.slice(0, request.length));
             }
             else {
-                xhr.send(request.buffer);
+                var buf = new Uint8Array(request.length);
+                buf.set(request);
+                xhr.send(buf.buffer);
             }
             return xhr;
         }