TimeSeries object.
39 | # This causes the graph to scale itself in the y-axis.
40 | def resetBounds(self):
41 |
42 | if len(self.data) > 0:
43 | self.minValue = self.data[0][1]
44 | self.maxValue = self.data[0][1]
45 | for p in self.data:
46 | pv = p[1]
47 | if pv < self.minValue:
48 | self.minValue = pv
49 | elif pv > self.maxValue:
50 | self.maxValue = pv
51 | else:
52 | self.maxValue = None
53 | self.minValue = None
54 |
55 | # Adds a new data point to the TimeSeries, preserving chronological order.
56 | def append(self, timestamp, value, sumRepeatedTimeStampValues=False):
57 |
58 | i = len(self.data) - 1
59 |
60 | while i>=0 and self.data[i][0] > timestamp:
61 | i-=1
62 |
63 | if i == -1:
64 | # This new item is the oldest data
65 | self.data.insert(0, [timestamp, value])
66 | elif len(self.data)>0 and self.data[i][0] == timestamp:
67 | # Update existing values in the array
68 | if sumRepeatedTimeStampValues is True:
69 | # Sum this value into the existing 'bucket'
70 | self.data[i][1] += value
71 | else:
72 | # Replace the previous value
73 | self.data[i][1] = value
74 | elif i < len(self.data) - 1:
75 | # Splice into the correct position to keep timestamps in order
76 | self.data.insert(i+1, [timestamp, value])
77 | else:
78 | # Add to the end of the array
79 | self.data.push([timestamp, value])
80 |
81 | self.maxValue = value if self.maxValue is None else max(self.maxValue, value)
82 | self.minValue = value if self.minValue is None else min(self.minValue, value)
83 |
84 | def dropOldData(self, oldestValidTime, maxDataSetLength):
85 | # We must always keep one expired data point as we need this to draw the
86 | # line that comes into the chart from the left, but any points prior to that can be removed.
87 | removeCount = 0
88 | lsd = len(self.data)
89 |
90 | while lsd - removeCount >= maxDataSetLength and self.data[removeCount + 1][0] < oldestValidTime:
91 | removeCount += 1
92 | if removeCount != 0:
93 | self.data.splice(0, removeCount)
94 |
95 | window.TimeSeries = TimeSeries
--------------------------------------------------------------------------------
/cc/lib/RapydSmoothie/util.pyj:
--------------------------------------------------------------------------------
1 | #####
2 | #
3 | # Part of RapydSmoothie
4 | # A RapydScript-NG clone of SmoothieChart
5 | #
6 | # SmoothieChart Copyright (c) 2010-2013, Joe Walnes
7 | # 2013-2018, Drew Noakes
8 | # Details: www.smoothiechart.org / https://github.com/joewalnes/smoothie
9 | # License: MIT @ https://github.com/joewalnes/smoothie/blob/master/LICENSE.txt
10 | #
11 | # RapydSmoothie Copyright (c) 2018, Ralph Wetzel
12 | # License: MIT
13 | # Language: RapydScript-NG Transpiler
14 | # https://github.com/kovidgoyal/rapydscript-ng
15 | # Coverage: SmoothieChart 1.36 ("Add title option, by @mesca")
16 | #
17 | #####
18 |
19 | class DefaultOptionsBase:
20 |
21 | def hasOwnProperty(self, key):
22 | rv = key not in ['constructor', '__init__', '__repr__', '__str__', 'hasOwnProperty']
23 | # console.log('hOP: ' + key + " => " + rv)
24 | return rv
25 |
26 |
27 | def extend(*args):
28 |
29 | def all_property_keys(o):
30 | v"""var keys = [];
31 | for (var k in o) {
32 | keys.push(k);
33 | }
34 | return keys"""
35 |
36 | args[0] = args[0] or {};
37 |
38 | al = len(args)
39 | i = 1
40 |
41 | while i < al:
42 | keys = all_property_keys(args[i])
43 | for key in keys:
44 | if args[i].hasOwnProperty(key):
45 | # second test necessary as typeof(null) == 'object'
46 | if v"typeof(args[i][key]) === 'object'" and args[i][key]?:
47 | if Array.isArray(args[i][key]) is True:
48 | args[0][key] = args[i][key]
49 | else:
50 | args[0][key] = extend(args[0][key], args[i][key])
51 | else:
52 | args[0][key] = args[i][key]
53 |
54 | i += 1
55 |
56 | return args[0]
57 |
58 | def binarySearch(data, value):
59 |
60 | low = 0
61 | high = len(data)
62 |
63 | while low < high:
64 | mid = (low + high) >> 1
65 | if value < data[mid][0]:
66 | high = mid
67 | else:
68 | low = mid + 1
69 |
70 | return low
--------------------------------------------------------------------------------
/docs/description.rst:
--------------------------------------------------------------------------------
1 |
2 | The Onion Box
3 | =============
4 |
5 | *The Onion Box* provides a web interface to monitor the operation of a
6 | `Tor