]> git.scottworley.com Git - reliable-chat/blobdiff - webclient/rc.html
Remove 'or any later version' license choice
[reliable-chat] / webclient / rc.html
index e4bdb2de89ae70ef7e8e981dd2aed01c709dcf31..41c1e54e3164a01f684e507b45a07fecbfef8d31 100644 (file)
@@ -8,8 +8,7 @@
 
  This program is free software: you can redistribute it and/or modify
  it under the terms of the GNU Affero General Public License as
 
  This program is free software: you can redistribute it and/or modify
  it under the terms of the GNU Affero General Public License as
- published by the Free Software Foundation, either version 3 of the
- License, or (at your option) any later version.
+ published by the Free Software Foundation, version 3.
 
  This program is distributed in the hope that it will be useful,
  but WITHOUT ANY WARRANTY; without even the implied warranty of
 
  This program is distributed in the hope that it will be useful,
  but WITHOUT ANY WARRANTY; without even the implied warranty of
        var session = Math.random();  // For outgoing message IDs
        var since = {};    // server -> time: For fetch?since=
        var seen = {};     // seen_key -> message
        var session = Math.random();  // For outgoing message IDs
        var since = {};    // server -> time: For fetch?since=
        var seen = {};     // seen_key -> message
-       var history = [];  // List of messages sorted by Time
+       var hist = [];  // List of messages sorted by Time
        // Messages have these fields:
        //   Time: The timestamp.  Median of ServerTimes
        //   ID: Some unique string for deduping
        // Messages have these fields:
        //   Time: The timestamp.  Median of ServerTimes
        //   ID: Some unique string for deduping
        function rcaddmessagetohistory(message) {
                var message_i;
                if (message.Time) {
        function rcaddmessagetohistory(message) {
                var message_i;
                if (message.Time) {
-                       for (var i = history.length - 1; ; i--) {
-                               if (i < 0 || (history[i].Time && message.Time >= history[i].Time)) {
+                       for (var i = hist.length - 1; ; i--) {
+                               if (i < 0 || (hist[i].Time && message.Time >= hist[i].Time)) {
                                        message_i = i+1;
                                        message_i = i+1;
-                                       history.splice(message_i, 0, message);
+                                       hist.splice(message_i, 0, message);
                                        break;
                                }
                        }
                } else {
                                        break;
                                }
                        }
                } else {
-                       history.push(message);
-                       message_i = history.length-1;
+                       hist.push(message);
+                       message_i = hist.length-1;
                }
                }
-               if (message_i + 1 < history.length) {
-                       rcaddmessagetoUI(message, history[message_i + 1].UI);
+               if (message_i + 1 < hist.length) {
+                       rcaddmessagetoUI(message, hist[message_i + 1].UI);
                } else {
                        rcaddmessagetoUI(message, null);
                }
                } else {
                        rcaddmessagetoUI(message, null);
                }
                        message.Time = new Date(times[middle-1].getTime() + difference/2);
                }
 
                        message.Time = new Date(times[middle-1].getTime() + difference/2);
                }
 
-               // This may have broken history's in-sorted-order invariant
-               var hi = history.indexOf(message);
-               if ((history[hi-1] && history[hi-1].Time > message.Time) ||
-                   (history[hi+1] && history[hi+1].Time < message.Time)) {
-                       history.splice(hi,1);
+               // This may have broken hist's in-sorted-order invariant
+               var hi = hist.indexOf(message);
+               if ((hist[hi-1] && hist[hi-1].Time > message.Time) ||
+                   (hist[hi+1] && hist[hi+1].Time < message.Time)) {
+                       hist.splice(hi,1);
                        rcaddmessagetohistory(message);
                }
 
                        rcaddmessagetohistory(message);
                }