39 |
40 |
41 |
42 | * This is only a rough estimation that can be very inaccurate and does not replace actual blood testing. The formula used is taken from: Nathan, David M., et al. "Translating the A1C assay into estimated average glucose values." Diabetes care 31.8 (2008): 1473-1478.
43 |
44 |
45 |
46 |
--------------------------------------------------------------------------------
/app/datasource/remotecgm.js:
--------------------------------------------------------------------------------
1 | define(["/app/config.js!", "../feature/mongolab"], function(config, mongolab) {
2 | var ml;
3 | var mongolabUrl = "https://api.mongolab.com/api/1/databases/";
4 | return {
5 | connect: function() {
6 | return new Promise(function(good, bad) {
7 | ml = config.mongolab;
8 | var doit = function() {
9 | if (config.mongolab.apikey && config.mongolab.database && config.mongolab.collection) // don't attempt to test without a config
10 | mongolab.testConnection(config.mongolab.apikey, config.mongolab.database, config.mongolab.collection).then(good, bad);
11 | };
12 | if ("mongolab" in config) doit();
13 | else config.on("mongolab", doit);
14 | });
15 | },
16 | // connect: function() {
17 | // return new Promise(function(good, bad) {
18 | // var ml = config.mongolab;
19 | // if (ml.apikey && ml.database && ml.collection) // don't attempt to test without a config
20 | // mongolab.testConnection(ml.apikey, ml.database, ml.collection).then(good, bad);
21 | // });
22 | // },
23 | disconnect: function() {
24 | // no op
25 | },
26 | readFromReceiver: function(pageoffset) {
27 | return new Promise(function(good, bad) {
28 | $.getJSON(
29 | mongolabUrl + ml.database + "/collections/" + ml.collection + "?apiKey=" + ml.apikey + "&l=300&sk=" + (300 * (pageoffset - 1)) + "&s={\"date\":-1}"
30 | ).then(function(docs) {
31 | good(docs.filter(function(record) {
32 | if (Object.keys(record).indexOf("type") > -1) {
33 | return record.type == "sgv";
34 | } else {
35 | return true;
36 | }
37 | }));
38 | }, bad)
39 | });
40 | },
41 |
42 | getAllRecords: function() {
43 | return new Promise(function(done) {
44 | done([]);
45 | });
46 | }
47 | }
48 | });
--------------------------------------------------------------------------------
/app/store/egv_records.js:
--------------------------------------------------------------------------------
1 | define(function() {
2 | var table = []; // representation of chrome.storage.local.get("egvrecords")
3 | var listeners = [];
4 | var readyToWrite = false;
5 | var loaded = false;
6 | var loadPromise = new Promise(function(done) {
7 | loaded = done;
8 | });
9 |
10 | var callback = function(newRecords) {
11 | listeners.forEach(function(fn) {
12 | try {
13 | fn(newRecords, table);
14 | } catch (e) {
15 | console.log(e);
16 | }
17 | });
18 | };
19 |
20 | var write = function(new_r, all) {
21 | if (!readyToWrite) return;
22 |
23 | chrome.storage.local.set({
24 | egvrecords: table.slice()
25 | }, function(local) {
26 | console.debug("[egv_records.js write] Wrote %i new records to local storage.", new_r.length)
27 | })
28 | };
29 |
30 | chrome.storage.local.get("egvrecords", function(local) {
31 | // replace table with egvrecords from localstorage without loosing methods that've been tacked on here
32 | var localRecords = [(local.egvrecords || []).slice()];
33 | while (localRecords[0].length > 0xfff0) {
34 | localRecords.push(localRecords[0].splice(0, 0xfff0))
35 | }
36 |
37 | localRecords.forEach(function(page) {
38 | Array.prototype.splice.apply(table, [table.length, 0].concat(page));
39 | });
40 |
41 | table.sort(function(a,b) {
42 | return a.displayTime - b.displayTime;
43 | });
44 |
45 | callback([]); // run callback with no new records
46 | readyToWrite = true;
47 | loaded();
48 | });
49 |
50 | table.add = function(record) {
51 | table.push(record);
52 | callback([record]);
53 | };
54 |
55 | table.addAll = function(records) {
56 | var localRecords = [records.slice()];
57 | while (localRecords[0].length > 0xfff0) {
58 | localRecords.push(localRecords[0].splice(0, 0xfff0))
59 | }
60 |
61 | localRecords.forEach(function(page) {
62 | Array.prototype.splice.apply(table, [table.length, 0].concat(page));
63 | })
64 | table.sort(function(a,b) {
65 | return a.displayTime - b.displayTime;
66 | });
67 | records.sort(function(a,b) {
68 | return a.displayTime - b.displayTime;
69 | });
70 | callback(records);
71 | };
72 |
73 | table.removeAll = function() {
74 | table.splice(0, table.length);
75 | callback([]);
76 | };
77 |
78 | table.onChange = function(callback) {
79 | listeners.push(callback);
80 | };
81 |
82 | table.onChange(write); // every time it changes re-save
83 | table.onLoad = loadPromise;
84 |
85 | return table;
86 | });
--------------------------------------------------------------------------------
/app/config.js:
--------------------------------------------------------------------------------
1 | define(function() {
2 | var issaving = false;
3 | var listeners = {};
4 | var fire = function(key, old) {
5 | if (key in listeners)
6 | listeners[key].forEach(function(fn) {
7 | fn(config[key], old);
8 | });
9 | };
10 |
11 | var isWindows = !!~window.navigator.appVersion.indexOf("Win");
12 |
13 | var config = {
14 | unit: "mgdl",
15 | targetrange: {
16 | low: 70,
17 | high: 180
18 | },
19 | notifications: "important",
20 | trenddisplaytime: 12
21 | };
22 |
23 | chrome.storage.onChanged.addListener(function(changes, namespace) {
24 | if (issaving) return;
25 |
26 | if ("config" in changes) {
27 | for (var property in changes[config].newValue) {
28 | config.set(property, changes[config].newValue);
29 | }
30 | }
31 | });
32 |
33 | return {
34 | defined: function() {
35 | },
36 | load: function(name, require, loaded) {
37 | chrome.storage.local.get("config", function(local) {
38 | for (var prop in (local.config || {})) {
39 | if (prop == "on" || prop == "set") {
40 | // special case
41 | } else {
42 | config[prop] = local.config[prop];
43 | }
44 | }
45 | config.on = function(key, fn) {
46 | if (key == "loaded" && config.loaded) {
47 | fn(true,true);
48 | } else {
49 | listeners[key] = listeners[key] || [];
50 | listeners[key].push(fn);
51 | }
52 | };
53 | config.set = function(key, val) {
54 | var working = config;
55 | var old;
56 | while (key.indexOf(".") > -1) {
57 | working = working[key.substr(0, key.indexOf("."))];
58 | key = key.substr(key.indexOf(".") + 1);
59 | }
60 | var old = working[key];
61 | if (val != old) {
62 | working[key] = val;
63 | fire(key, old);
64 | issaving = true;
65 | chrome.storage.local.set({
66 | config: (function(state) {
67 | // rip "set" and "on" out of config object before saving it
68 | var out = {};
69 | for (var key in state) {
70 | if (["baseUrl", "bundles", "config", "on", "paths", "pkgs", "set", "shim", "waitSeconds"].indexOf(key) == -1) {
71 | out[key] = state[key];
72 | }
73 | }
74 | return out;
75 | })(config)
76 | }, function(local) {
77 | console.log("[config.js set] saved config");
78 | setTimeout(function() {
79 | issaving = false;
80 | }, 100);
81 | })
82 | }
83 | };
84 |
85 | loaded(config);
86 | });
87 | }
88 | };
89 | });
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | ##NightScout.info CGM Utility
2 | Download Dexcom data on almost any platform Chrome runs on.
3 |
4 | * OSX 10.7+.
5 | * Ubuntu 12.04+
6 | * Windows 7-8.1 if [Dexcom Studio](http://dexcom.com/dexcom-studio) is installed.
7 | * Windows 10 out of the box.
8 |
9 | There's a nodejs branch. It's only been tested on nodejs 0.10 on OSX Yosemite.
10 |
11 | Has not been tested on Windows XP.
12 | ##Don't use this for treatment. Don't. Seriously, don't. This is reverse engineered. Dexcom Studio can be aware of lots of gotchas that this simply isn't. Data might stop updating. Data can be entirely wrong. I've seen it make 300 point swings out of the blue, not because BG changed but simply because of how this thing works.
13 |
14 | BE AWARE. If something seems strange double check. Tripple check. And then check again.
15 |
16 | Just like how a CGM is just an alert to check your sugar, this is just an alert to check your Dexcom.
17 |
18 | ###Install
19 | 1. Get code in folder
20 | 2. Open a terminal and CD to that folder
21 | 3. Install dependencies (npm install)
22 | 4. You're done with your terminal. Give yourself a pat on the back.
23 | 5. Go to chrome://extensions
24 | 6. Check developer mode
25 | 7. Load unpacked extension
26 | 8. Pick your folder
27 |
28 | ###Use
29 | 1. Plug in your Dexcom
30 | 2. open chrome://extensions
31 | 3. Click **NightScout.info CGM Utility** icon to launch
32 |
33 | Lots of steps and right now. Some times you get no data back, usually preceded by completely inaccurate graphs- if that happens, press the Reset button. This'll wipe out all the data it's accumulated. Doesn't seem like you really need to unplug/replug anymore.
34 |
35 |
36 | ###Linux
37 | On linux systems the programme doesn't have permission to access the dexcom device. In order to grant this permission, a udev rule has to be supplied.
38 |
39 | 1. Create a file like /etc/udev/rules.d/99-dexcom.rules with admin rights.
40 | 2. Add the following text to this file. Replace YOURGROUP with either a group you are member of or just your username.
41 | SUBSYSTEM=="usb",ATTR{idVendor}=="22a3",ATTR{idProduct}=="0047",MODE="0660",GROUP="YOURGROUP"
42 | 3. trigger udev to load the new rules or simply restart.
43 |
44 | How to to this on Ubuntu (tested on 12.4):
45 | 1. open a terminal
46 | 2. run the following command, replacing YOURUSERNAME with your username:
47 | echo "SUBSYSTEM==\"usb\",ATTR{idVendor}==\"22a3\",ATTR{idProduct}==\"0047\",MODE=\"0660\",GROUP=\"YOURUSERNAME\"" | sudo tee /etc/udev/rules.d/99-dexcom.rules
48 | 3. restart
49 |
50 |
--------------------------------------------------------------------------------
/lib/builder.js:
--------------------------------------------------------------------------------
1 | var pickFiles = require('broccoli-static-compiler');
2 | var mergeTrees = require('broccoli-merge-trees');
3 | var moveFile = require('broccoli-file-mover');
4 | var compileES6 = require('broccoli-es6-concatenator');
5 |
6 | module.exports = Builder;
7 |
8 | function Builder() {
9 | this.name = 'chromadex';
10 |
11 | this.trees = {
12 | app: 'app',
13 | lib: 'lib',
14 | tests: 'tests',
15 | vendor: 'vendor'
16 | };
17 | }
18 |
19 | Builder.prototype.publicFolder = function() {
20 | return 'public';
21 | }
22 |
23 | Builder.prototype.testIndex = function() {
24 | return pickFiles(this.trees.tests, {
25 | files: ['index.html'],
26 | srcDir: '/',
27 | destDir: '/tests'
28 | });
29 | }
30 |
31 | Builder.prototype._processedAppTree = function() {
32 | return pickFiles(this.trees.app, {
33 | srcDir: '/',
34 | destDir: this.name
35 | });
36 | }
37 |
38 | Builder.prototype._processedTestsTree = function() {
39 | return pickFiles(this.trees.tests, {
40 | srcDir: '/',
41 | destDir: this.name
42 | });
43 | }
44 |
45 | Builder.prototype._processedVendorTree = function() {
46 | return pickFiles(this.trees.vendor, {
47 | files: ['**/*.js'],
48 | srcDir: '/',
49 | destDir: 'vendor/'
50 | });
51 | }
52 |
53 | Builder.prototype.appAndDependencies = function() {
54 | var app = this._processedAppTree();
55 | var tests = this._processedTestsTree();
56 | var vendor = this._processedVendorTree();
57 |
58 | var sourceTrees = [app, vendor, tests]
59 |
60 | return mergeTrees(sourceTrees, {
61 | overwrite: true,
62 | description: 'TreeMerger (appAndDependencies)'
63 | });
64 | }
65 |
66 | Builder.prototype.testDependencies = function() {
67 | return pickFiles(this.trees.vendor, {
68 | srcDir: '/qunit/qunit',
69 | files: [
70 | 'qunit.css', 'qunit.js'
71 | ],
72 | destDir: '/assets/'
73 | });
74 | }
75 |
76 | Builder.prototype.javascript = function() {
77 | var appAndDependencies = this.appAndDependencies();
78 |
79 | return compileES6(appAndDependencies, {
80 | loaderFile: 'vendor/loader/loader.js',
81 | ignoredModules: [],
82 | legacyFilesToAppend: [
83 | 'vendor/jquery/dist/jquery.min.js',
84 | 'vendor/flot/jquery.flot.js'
85 | ],
86 | inputFiles: [
87 | this.name + '/**/*.js'
88 | ],
89 | wrapInEval: false,
90 | outputFile: '/' + this.name + '.js'
91 | });
92 | }
93 |
94 | Builder.prototype.toArray = function() {
95 | var sourceTrees = [
96 | this.javascript(),
97 | this.publicFolder(),
98 | this.testIndex(),
99 | this.testDependencies()
100 | ];
101 |
102 | return sourceTrees;
103 | }
104 |
105 | Builder.prototype.toTree = function() {
106 | return mergeTrees(this.toArray(), {
107 | overwrite: true,
108 | description: 'TreeMerger (allTrees)'
109 | });
110 | }
111 |
--------------------------------------------------------------------------------
/app/flotcandle.js:
--------------------------------------------------------------------------------
1 | (function ($) {
2 | var options = {
3 | series: { candle: null } // or number/string
4 | };
5 | var offset, x, y;
6 |
7 | function init(plot) {
8 | plot.hooks.processOptions.push(processOptions);
9 | function processOptions(plot,options){
10 | if(options.series.candle){
11 | //plot.hooks.processRawData.push(processRawData);
12 | plot.hooks.drawSeries.push(drawSeries);
13 | }
14 | }
15 | /*function processRawData(plot,s,data,datapoints){
16 | if(s.candle){
17 | }
18 | }*/
19 | function drawSeries(plot, ctx, serie){
20 | if (serie.candle) {
21 | offset = plot.getPlotOffset();
22 | offset.left = offset.left;
23 | var x1 = serie.xaxis.p2c(serie.data[0][0]);
24 | var x2 = serie.xaxis.p2c(serie.data[1][0]);
25 | var width = (x2 - x1) * 4 / 5;
26 | for (var j = 0; j < serie.data.length; j++) { getAndDrawCandle(ctx, serie, width, serie.data[j]);}
27 | }
28 | }
29 | function getAndDrawCandle(ctx, serie, width, data){
30 | var dt = data[0];
31 | var open = data[1];
32 | var close = data[2];
33 | var low = data[3];
34 | var high = data[4];
35 | drawCandle(ctx, serie, width, dt, open, low, close, high);
36 | }
37 | function drawCandle(ctx, serie, width, dt, open, low, close, high){
38 | if (open < close){ //Rising
39 | y = offset.top + serie.yaxis.p2c(open)
40 | height = serie.yaxis.p2c(close) - serie.yaxis.p2c(open);
41 | ctx.fillStyle = "#51FF21";
42 | } else { //Decending
43 | y = offset.top + serie.yaxis.p2c(close)
44 | height = serie.yaxis.p2c(open) - serie.yaxis.p2c(close);
45 | ctx.fillStyle = "#FF0000";
46 | }
47 | ctx.strokeStyle = "#000000";
48 | ctx.lineWidth = 0;
49 | x = offset.left + serie.xaxis.p2c(dt);
50 |
51 | //body
52 | ctx.fillRect (x, y, width, height);
53 | ctx.strokeRect(x, y, width, height);
54 |
55 | var highY = serie.yaxis.p2c(high);
56 | var lowY = serie.yaxis.p2c(low);
57 |
58 | //top
59 | if (highY < y + height){
60 | ctx.beginPath();
61 | var lineX = x + (width /2);
62 | ctx.moveTo(lineX,y + height);
63 | ctx.lineTo(lineX,highY);
64 | ctx.closePath();
65 | ctx.stroke();
66 | }
67 |
68 | //bottom
69 | if (lowY > y){
70 | ctx.beginPath();
71 | ctx.moveTo(lineX,y);
72 | ctx.lineTo(lineX,lowY);
73 | ctx.closePath();
74 | ctx.stroke();
75 | }
76 | }
77 | }
78 |
79 | $.plot.plugins.push({
80 | init: init,
81 | options: options,
82 | name: 'candle',
83 | version: '1.0'
84 | });
85 | })(jQuery);
--------------------------------------------------------------------------------
/app/console.js:
--------------------------------------------------------------------------------
1 | define([], function() {
2 | var myLog = [], consoleFunctions = {};
3 | var flattenSimple = function(d) {
4 | var recursions = 0;
5 | var pad = function(times) {
6 | var s = "";
7 | for (var i = times; i > 0; i--) {
8 | s += " ";
9 | }
10 | return s;
11 | }
12 | var toString = function(val) {
13 | var out = "";
14 | if (++recursions > 5) return "/* MAX DESCENTS REACHED */";
15 |
16 | if (typeof val == "string") { // string
17 | out = val;
18 | } else if (typeof val == "number") { // number
19 | out = val.toString();
20 | } else if (typeof val == "object" && val.length) { // array
21 | out = "[\n" + Array.prototype.map.call(val, toString).join(",\n") + "\n]\n";
22 | } else if (typeof val == "object") { // object
23 | if (val.toString == Object.toString) // JS Object
24 | out = val.toString();
25 | else // Native Object
26 | out = "{\n" + Object.keys(val).filter(function(k) {
27 | return k != "apikey" && (typeof val[k] != "function");
28 | }).map(function(k) {
29 | return pad(recursions) + k + ": " + toString(val[k]);
30 | }).join(",\n") + "\n" + pad(recursions - 1) + "}";
31 | } else if (typeof val == "boolean") { // boolean
32 | out = val.toString();
33 | } else { // null or undefined
34 | out = "";
35 | }
36 | --recursions;
37 | return pad(recursions) + out;
38 | }
39 | var result = d.map(toString);
40 | if (typeof d[0] == "string") {
41 | var template = result.shift();
42 | template = template.replace(/%\w/g, function(match) {
43 | return result.shift();
44 | });
45 | return template + " " + result.join(" ");
46 | } else {
47 | return result.join(" ");
48 | }
49 | };
50 | var console = "console" in window? window.console: {};
51 | ["log", "warn", "info", "error", "debug"].forEach(function(fn) { consoleFunctions[fn] = console[fn] || function() { }; });
52 | ["log", "warn", "info", "error", "debug"].forEach(function(fn) {
53 | console[fn] = function() {
54 | var stack = {};
55 | try {
56 | throw new Error();
57 | } catch (e) {
58 | stack = e.stack;
59 | }
60 | try {
61 | stack = stack
62 | .split("\n") // big string
63 | .slice(2) // throw away intro and this fn's invocation
64 | .filter(function(line) {
65 | return line.indexOf("blinken_lights.js") == -1;
66 | })
67 | .map(function(line) {
68 | return line.trim();
69 | })
70 | .filter(function(line) {
71 | return line.indexOf("jquery") == -1 && line.indexOf("(native)") == -1;
72 | }).map(function(line) {
73 | var parts = line.split(":");
74 | return {
75 | file: parts[1]
76 | .split("/")
77 | .slice(3) // throw away chrome-extension part
78 | .join("/"),
79 | line: parseInt(parts[2],10)
80 | };
81 | });
82 | var args = Array.prototype.slice.call(arguments);
83 | myLog.push(fn.toUpperCase() + ": " + stack[0].file + ":" + stack[0].line + ": " + flattenSimple(args));
84 | consoleFunctions[fn].apply(console, arguments);
85 | }
86 | catch (e) {
87 | myLog.push("Error occured during console operation. " + JSON.stringify(e));
88 | }
89 | }
90 | });
91 |
92 | console.info = function(info) {
93 | var args = Array.prototype.slice.call(arguments);
94 | myLog.push("INFO: REDACTED");
95 | consoleFunctions["info"].apply(console, arguments);
96 | };
97 | console.fixMyStuff = function() {
98 | return myLog.join("\n");
99 | };
100 | return console;
101 | });
--------------------------------------------------------------------------------
/app/report/glucosedistribution.js:
--------------------------------------------------------------------------------
1 | function generate_report(data, high, low) {
2 | require(["../bloodsugar"], function(convertBg) {
3 | var Statician = ss;
4 | var days = 3 * 30; // months
5 | var config = { low: convertBg(low), high: convertBg(high) };
6 | var report = $("#report");
7 | report.empty();
8 | var minForDay, maxForDay;
9 | var stats = [];
10 | var table = $("
Nightscout setups usually have you buy a phone, plug Dexcom into it, and the phone uploads your CGM data to the cloud. Instead of buying a phone, you can plug Dexcom into your existing computer and get data to Nightscout without spending anything.
34 |
Start by reading Nightscout's Getting Started Guide. Skip the step about the Android App. Open Options in Nightscout CGM Utility, choose the Mongolab tab, and enter the Database and Collection you picked while preforming "Configuring the data Backend." You'll also need to enter an API Key which is different from the normal directions. Press the Test Connection button, and it'll tell you the Mongolab configuration checks out OK or come back with something that needs changed. Once it's OK, press Save Settings.
Now plug in your Dexcom. Press the "Download All" button. It takes about a minute, perhaps two, for all your data to download. Your most recent CGM reading will upload to Mongolab, and Nightscout will magically start coming to life.
Nightscout CGM Utility checks for updated readings every minute. You don't need to press Download All again, unless you're disconnected from computer for more than 18 hours.
35 |
36 |
I already use Nightscout with the Android uploader.
37 |
This meanas your data is already out in Mongolab. Fantastic! Open Nightscout CGM Utility, click Options, choose the Mongolab tab, and enter the Database, Collection and API key from your existing Nightscout setup. You probably have a username/password pair already, but you'll need an API key for this tool to work. Click the "Documentation" link under the API Key textbox to track it down. Press the Test Connection button and it will hopefully tell you the connection is OK or come up with a suggestion about what to fix.
38 |
Once it's OK, press Save Settings. Click the down arror to the right of Download All, and choose From Mongolab. It'll take about 1 second to download every 3 days of data you've collected. It'll tell you when it's done, and now you can run reports on your data.
39 |
40 |
I want to run reports
41 |
Your primary use is probably to treat this like it's Dexcom Studio, like our Windows-using friends can do. Be aware that Studio has more reports, and is generally better. But this has the advantage that it actually works on computers that don't rhyme with Cindows.
42 |
43 |
Plug in your Dexcom.
44 |
Start Nightscout CGM Utility
45 |
Press Download All
46 |
When it's done, press the Reports menu and choose what you'd like to see.
47 |
48 |
Nightscout CGM Utility only accesses roughly 45 days of readings from your receiver. Try to plug in once a month so you don't miss any data.
49 |
There is a Print button on each report screen. You can print to a printer, or save it as a PDF and then do whatever you like with it.
50 |
51 |
I want to play with Dexcom as a programmer
52 |
Check out the source code for this on Github. Most of the magic is in app/datasource/dexcom.js.
53 |
54 |
Reports as a PDF File
55 |
There is a Print button on each report screen. You can print to a printer, or save it as a PDF and then do whatever you like with it.
56 |
57 |
58 |
--------------------------------------------------------------------------------
/app/report/stats_controls.js:
--------------------------------------------------------------------------------
1 | /* Adrian:
2 |
3 | This script will add two DatePicker (from, to), two arrow buttons to jump to the neighbouring timeframe and a "Print" button to a
with id "stats_controls".
4 | "Generate Report" will pre-filter the data according to the dates given by the DatePickers and then call a function "generate_report(data, high, low);" that has to be provided by the programmer.
5 |
6 | data - array of datapoints in the timerange.
7 | high - the value of the option targetrange.high.
8 | low- the value of the option targetrange.low.
9 |
10 | To use this script in an html-file:
11 |
12 | 1st: Import it:
13 | 2nd: Add a div with id "stats_controls" in your html-file where you want the controls placed. This could look like:
14 | 3rd: Provide the function "generate_report(data, high, low);", that will actually generate the report.
15 | 4th: Import css for a more beautiful DatePicker:
16 |
17 | */
18 |
19 | var fromold = "";
20 | var toold = "";
21 |
22 | var general_generate_report = function() {
23 | require(["../bloodsugar"], function(convertBg) {
24 | var low, high;
25 | Promise.all([
26 | new Promise(function(ready) {
27 | chrome.storage.local.get(["egvrecords", "config"], function(values) {
28 | if ("config" in values && "targetrange" in values.config) {
29 | low = values.config.targetrange.low || 70;
30 | high = values.config.targetrange.high || 130;
31 | } else {
32 | low = 70;
33 | high = 130;
34 | }
35 | ready(values.egvrecords.map(function(r) {
36 | r.localBg = parseFloat(convertBg(r.bgValue));
37 | return r;
38 | }));
39 | });
40 | })
41 | ]).then(function(o) {
42 | var data = o[0];
43 | var config = {
44 | low: convertBg(low),
45 | high: convertBg(high)
46 | };
47 | var one = 1;
48 | var startdate = Date.parse($("#fromdate").val());
49 | var enddate = Date.parse($("#todate").val()) + one.days();
50 |
51 | $("#dateselectionerrormessage").empty();
52 | if(startdate>=enddate){
53 | $("#fromdate").val(fromold);
54 | $("#todate").val(toold);
55 | $("#dateselectionerrormessage").append("reset to previous date (To was after From)!");
56 | return;
57 | }
58 | fromold = $("#fromdate").val();
59 | toold = $("#todate").val();
60 | var datestring = $("#fromdate").val() + " - " + $("#todate").val();
61 | $("#dateoutput").empty();
62 | $("#dateoutput").append(datestring);
63 | data = data.filter(function(record) {
64 | return (record.displayTime >= startdate) && (record.displayTime < enddate);
65 | });
66 |
67 | generate_report(data, high, low);
68 | });
69 | });
70 | }
71 |
72 |
73 | $(function() {
74 | Promise.all([
75 | new Promise(function(ready) {
76 | var controlshtml = "
From Date: To Date:
";
77 | ready($("#stats_controls").append($(controlshtml)));
78 | })
79 | ]).then(function(o) {
80 | //register datepicker
81 | require(["jquery", "/vendor/jquery-ui/jquery-ui.min.js"], function($) {
82 | $("#fromdate").datepicker({onClose: general_generate_report});
83 | $("#todate").datepicker({onClose: general_generate_report});
84 | });
85 |
86 | //add presets for dates
87 | var now = new Date();
88 | $("#todate").val((now.getMonth() + 1) + "/" + now.getDate() + "/" + now.getFullYear());
89 | toold = $("#todate").val();
90 | var one = 1;
91 | var then = new Date(Date.now() - one.months());
92 | $("#fromdate").val((then.getMonth() + 1) + "/" + then.getDate() + "/" + then.getFullYear());
93 | fromold = $("#fromdate").val();
94 |
95 | //add handler
96 | $(".print").click(function(e) {
97 | e.preventDefault();
98 | window.print();
99 | });
100 |
101 | $("#dateleft").click(function() {
102 | var from = Date.parse($("#fromdate").val());
103 | var to = Date.parse($("#todate").val());
104 | //daylight saving time may make diffs just very close to full days:
105 | var diff = Math.round((to - from)/(1000 * 60 * 60 * 24))*(1000 * 60 * 60 * 24);
106 | var one = 1;
107 | to = from - one.days();
108 | from = to - diff;
109 | to = new Date(to);
110 | from = new Date(from);
111 | $("#todate").val("" + (to.getMonth()+1) + "/" + to.getDate() + "/" + to.getFullYear());
112 | $("#fromdate").val("" + (from.getMonth()+1) + "/" + from.getDate() + "/" + from.getFullYear());
113 | general_generate_report();
114 | });
115 |
116 | $("#dateright").click(function() {
117 | var from = Date.parse($("#fromdate").val());
118 | var to = Date.parse($("#todate").val());
119 | //daylight saving time may make diffs just very close to full days:
120 | var diff = Math.round((to - from)/(1000 * 60 * 60 * 24))*(1000 * 60 * 60 * 24);
121 | var one = 1;
122 | from = to + one.days();
123 | to = from + diff;
124 | to = new Date(to);
125 | from = new Date(from);
126 | $("#todate").val("" + (to.getMonth()+1) + "/" + to.getDate() + "/" + to.getFullYear());
127 | $("#fromdate").val("" + (from.getMonth()+1) + "/" + from.getDate() + "/" + from.getFullYear());
128 | general_generate_report();
129 | });
130 |
131 |
132 |
133 |
134 | }).then(function(x){general_generate_report();});
135 |
136 | });
137 |
--------------------------------------------------------------------------------
/app/feature/cgm_download.js:
--------------------------------------------------------------------------------
1 | define(["../datasource/dexcom", "../datasource/remotecgm", "../store/egv_records", "/app/config.js!"], function(dexcom, remotecgm, egvrecords, config) {
2 | var cgm = dexcom,
3 | isdownloading = false;
4 | var isWindows = !!~window.navigator.appVersion.indexOf("Win");
5 | var isMac = !!~window.navigator.appVersion.indexOf("Mac OS X");
6 |
7 | var pickDatasource = function(datasource) {
8 | if (datasource == "dexcom") {
9 | cgm = dexcom;
10 | } else {
11 | cgm = remotecgm;
12 | }
13 | };
14 |
15 | config.on("datasource", pickDatasource);
16 | pickDatasource(config.datasource);
17 | var max_allowed;
18 |
19 | // emit events that UI can react to
20 | var connect = function() {
21 | var chrome_notification_id = 0;
22 | var connectionErrorCB = function(notification_id, button) {
23 | chrome.notifications.onButtonClicked.removeListener(connectionErrorCB);
24 | if (notification_id != chrome_notification_id) return;
25 |
26 | if (button === 0) {
27 | attempts = 0;
28 | connect().then(onConnected,onConnectError); // chain to start everything
29 | }
30 | };
31 | return new Promise(function(resolve, reject) {
32 | if (isdownloading) reject();
33 | isdownloading = true;
34 | var timer = new Date();
35 | var max_existing = (egvrecords.length > 0?
36 | (egvrecords[egvrecords.length - 1].displayTime || egvrecords[egvrecords.length - 1].date ):
37 | 0);
38 | max_allowed = new Date(Date.now() + (1).days());
39 |
40 | console.debug("[cgm_download.js connect] loading");
41 | cgm.connect().then(function() { // success
42 | console.debug("[cgm_download.js connect] successfully connected to %s", config.datasource);
43 |
44 | chrome.notifications.onButtonClicked.removeListener(connectionErrorCB);
45 | try {
46 | var page = 1;
47 | var d = []; // data
48 | var process = function(d_page) {
49 | console.debug("[cgm_download.js process] read page %i", page);
50 | d = d.concat(d_page);
51 | if(d_page.filter(function(egv) {
52 | return ((+egv.displayTime || +egv.date) > max_existing)
53 | && ((+egv.displayTime || +egv.date) < max_allowed);
54 | }).length == 0) {
55 | console.debug("[cgm_download.js process] stopped reading at page %i", page);
56 | cgm.disconnect();
57 | isdownloading = false;
58 | console.debug("[cgm_download.js process] spent %i ms downloading", (new Date() - timer));
59 | resolve(d);
60 | } else {
61 | cgm.readFromReceiver(++page).then(process);
62 | }
63 | }
64 | return cgm.readFromReceiver(page).then(process);
65 | } catch (e) {
66 | console.debug("[cgm_download.js process] %o", e);
67 | reject(e);
68 | }
69 | }, function(e) { // failed to connect
70 | console.debug("[cgm_download connect] failed to connect");
71 | chrome.notifications.create("", {
72 | type: "basic",
73 | title: "NightScout.info CGM Utility",
74 | message: "Could not connect to Dexcom receiver. Unplug it and plug it back in. Be gentle, Dexcom's USB port is fragile. I like to unplug from the computer's side.",
75 | iconUrl: "/public/assets/error.png",
76 | buttons: [{
77 | title: "Try again"
78 | }, {
79 | title: "Cancel"
80 | }]
81 | }, function(notification_id) {
82 | console.log(arguments);
83 | chrome_notification_id = notification_id;
84 | attempts = 0; // reset
85 | chrome.notifications.onButtonClicked.addListener(connectionErrorCB);
86 | });
87 | reject(e);
88 | });
89 | });
90 | },
91 | onConnected = function(data) { // to download from dexcom
92 | var lastNewRecord = Date.now();
93 |
94 | // update my db
95 | var existing = egvrecords || [];
96 | var max_existing = existing.length > 0?
97 | (existing[existing.length - 1].displayTime || existing[existing.length].date) :
98 | 0;
99 | var new_records = data.filter(function(egv) {
100 | return( +egv.displayTime > max_existing )|| (+egv.date > max_existing);
101 | }).map(function(egv) {
102 | return {
103 | displayTime: +egv.displayTime || +egv.date,
104 | bgValue: egv.bgValue || egv.sgv,
105 | trend: egv.trend || egv.direction,
106 | recordSource: config.datasource
107 | };
108 | });
109 | if (new_records.length === 0) {
110 | if (lastNewRecord + (5).minutes() < Date.now()) {
111 | console.warn("[cgm_download.js updateLocalDb] Something's wrong. We should have new data by now.");
112 | }
113 | } else {
114 | lastNewRecord = Date.now();
115 | }
116 | new_records = new_records.filter(function(row) {
117 | return row.bgValue > 30 && row.displayTime < max_allowed;
118 | });
119 | egvrecords.addAll(new_records);
120 |
121 | var nextRun = function() {
122 | console.log("[cgmdownload.js nextRun] Attempting to refresh data");
123 | if (isdownloading) {
124 | setTimeout(nextRun, (60).seconds());
125 | } else {
126 | connect().then(onConnected, onConnectError);
127 | }
128 | };
129 |
130 | // again and again
131 | setTimeout(nextRun, (60).seconds());
132 | },
133 | onConnectError = function(){
134 | console.log(arguments);
135 | };
136 | egvrecords.onLoad.then(function() {
137 | connect().then(onConnected, onConnectError); // chain to start everything
138 | });
139 |
140 | return {
141 | getAllRecords: function() {
142 | var oldCgm = cgm;
143 | cgm = dexcom;
144 | var p = cgm.getAllRecords();
145 | p.then(function() {
146 | cgm = oldCgm;
147 | });
148 | return p;
149 | }
150 | }
151 | });
--------------------------------------------------------------------------------
/app/report/dailystats.js:
--------------------------------------------------------------------------------
1 | require(["../bloodsugar"], function(convertBg) {
2 | var low, high;
3 | Promise.all([
4 | new Promise(function(ready) {
5 | chrome.storage.local.get(["egvrecords", "config"], function(values) {
6 | if ("config" in values && "targetrange" in values.config) {
7 | low = values.config.targetrange.low || 70;
8 | high = values.config.targetrange.high || 180;
9 | } else {
10 | low = 70;
11 | high = 180;
12 | }
13 |
14 | ready(values.egvrecords.map(function(r) {
15 | r.localBg = convertBg(r.bgValue);
16 | return r;
17 | }));
18 | });
19 | })
20 | ]).then(function(o) {
21 | var todo = [];
22 | var data = o[0];
23 | var days = 7;
24 | var config = { low: convertBg(low), high: convertBg(high) };
25 | var sevendaysago = Date.now() - days.days();
26 | var report = $("#report");
27 | var minForDay, maxForDay;
28 | var months = ["Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sept", "Oct", "Nov", "Dec"];
29 |
30 | data = data.filter(function(record) {
31 | return "bgValue" in record && /\d+/.test(record.bgValue.toString());
32 | }).filter(function(record) {
33 | return record.displayTime > sevendaysago;
34 | });
35 | var table = $("
230 |
231 |
232 |
233 |
--------------------------------------------------------------------------------
/app/time.js:
--------------------------------------------------------------------------------
1 | if (!("milliseconds" in Number.prototype))
2 | Number.prototype.milliseconds = function() { return this; };
3 | if (!("seconds" in Number.prototype))
4 | Number.prototype.seconds = function() { return this.milliseconds() * 1000; };
5 | if (!("minutes" in Number.prototype))
6 | Number.prototype.minutes = function() { return this.seconds() * 60; };
7 | if (!("hours" in Number.prototype))
8 | Number.prototype.hours = function() { return this.minutes() * 60; };
9 | if (!("days" in Number.prototype))
10 | Number.prototype.days = function() { return this.hours() * 24; };
11 | if (!("weeks" in Number.prototype))
12 | Number.prototype.weeks = function() { return this.days() * 7; };
13 | if (!("months" in Number.prototype))
14 | Number.prototype.months = function() { return this.days() * 30; };
15 |
16 | if (!("toDays" in Number.prototype))
17 | Number.prototype.toDays = function() { return this.toHours() / 24; };
18 | if (!("toHours" in Number.prototype))
19 | Number.prototype.toHours = function() { return this.toMinutes() / 60; };
20 | if (!("toMinutes" in Number.prototype))
21 | Number.prototype.toMinutes = function() { return this.toSeconds() / 60; };
22 | if (!("toSeconds" in Number.prototype))
23 | Number.prototype.toSeconds = function() { return this.toMilliseconds() / 1000; };
24 | if (!("toMilliseconds" in Number.prototype))
25 | Number.prototype.toMilliseconds = function() { return this; };
26 |
27 | Date.prototype.format = function(format) {
28 | // discuss at: http://phpjs.org/functions/date/
29 | // original by: Carlos R. L. Rodrigues (http://www.jsfromhell.com)
30 | // original by: gettimeofday
31 | // parts by: Peter-Paul Koch (http://www.quirksmode.org/js/beat.html)
32 | // improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
33 | // improved by: MeEtc (http://yass.meetcweb.com)
34 | // improved by: Brad Touesnard
35 | // improved by: Tim Wiel
36 | // improved by: Bryan Elliott
37 | // improved by: David Randall
38 | // improved by: Theriault
39 | // improved by: Theriault
40 | // improved by: Brett Zamir (http://brett-zamir.me)
41 | // improved by: Theriault
42 | // improved by: Thomas Beaucourt (http://www.webapp.fr)
43 | // improved by: JT
44 | // improved by: Theriault
45 | // improved by: Rafał Kukawski (http://blog.kukawski.pl)
46 | // improved by: Theriault
47 | // input by: Brett Zamir (http://brett-zamir.me)
48 | // input by: majak
49 | // input by: Alex
50 | // input by: Martin
51 | // input by: Alex Wilson
52 | // input by: Haravikk
53 | // bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
54 | // bugfixed by: majak
55 | // bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
56 | // bugfixed by: Brett Zamir (http://brett-zamir.me)
57 | // bugfixed by: omid (http://phpjs.org/functions/380:380#comment_137122)
58 | // bugfixed by: Chris (http://www.devotis.nl/)
59 | // note: Uses global: php_js to store the default timezone
60 | // note: Although the function potentially allows timezone info (see notes), it currently does not set
61 | // note: per a timezone specified by date_default_timezone_set(). Implementers might use
62 | // note: this.php_js.currentTimezoneOffset and this.php_js.currentTimezoneDST set by that function
63 | // note: in order to adjust the dates in this function (or our other date functions!) accordingly
64 | // example 1: date('H:m:s \\m \\i\\s \\m\\o\\n\\t\\h', 1062402400);
65 | // returns 1: '09:09:40 m is month'
66 | // example 2: date('F j, Y, g:i a', 1062462400);
67 | // returns 2: 'September 2, 2003, 2:26 am'
68 | // example 3: date('Y W o', 1062462400);
69 | // returns 3: '2003 36 2003'
70 | // example 4: x = date('Y m d', (new Date()).getTime()/1000);
71 | // example 4: (x+'').length == 10 // 2009 01 09
72 | // returns 4: true
73 | // example 5: date('W', 1104534000);
74 | // returns 5: '53'
75 | // example 6: date('B t', 1104534000);
76 | // returns 6: '999 31'
77 | // example 7: date('W U', 1293750000.82); // 2010-12-31
78 | // returns 7: '52 1293750000'
79 | // example 8: date('W', 1293836400); // 2011-01-01
80 | // returns 8: '52'
81 | // example 9: date('W Y-m-d', 1293974054); // 2011-01-02
82 | // returns 9: '52 2011-01-02'
83 |
84 | var that = this, timestamp = this;
85 | var jsdate, f;
86 | // Keep this here (works, but for code commented-out below for file size reasons)
87 | // var tal= [];
88 | var txt_words = [
89 | 'Sun', 'Mon', 'Tues', 'Wednes', 'Thurs', 'Fri', 'Satur',
90 | 'January', 'February', 'March', 'April', 'May', 'June',
91 | 'July', 'August', 'September', 'October', 'November', 'December'
92 | ];
93 | // trailing backslash -> (dropped)
94 | // a backslash followed by any character (including backslash) -> the character
95 | // empty string -> empty string
96 | var formatChr = /\\?(.?)/gi;
97 | var formatChrCb = function(t, s) {
98 | return f[t] ? f[t]() : s;
99 | };
100 | var _pad = function(n, c) {
101 | n = String(n);
102 | while (n.length < c) {
103 | n = '0' + n;
104 | }
105 | return n;
106 | };
107 | f = {
108 | // Day
109 | d: function() { // Day of month w/leading 0; 01..31
110 | return _pad(f.j(), 2);
111 | },
112 | D: function() { // Shorthand day name; Mon...Sun
113 | return f.l()
114 | .slice(0, 3);
115 | },
116 | j: function() { // Day of month; 1..31
117 | return jsdate.getDate();
118 | },
119 | l: function() { // Full day name; Monday...Sunday
120 | return txt_words[f.w()] + 'day';
121 | },
122 | N: function() { // ISO-8601 day of week; 1[Mon]..7[Sun]
123 | return f.w() || 7;
124 | },
125 | S: function() { // Ordinal suffix for day of month; st, nd, rd, th
126 | var j = f.j();
127 | var i = j % 10;
128 | if (i <= 3 && parseInt((j % 100) / 10, 10) == 1) {
129 | i = 0;
130 | }
131 | return ['st', 'nd', 'rd'][i - 1] || 'th';
132 | },
133 | w: function() { // Day of week; 0[Sun]..6[Sat]
134 | return jsdate.getDay();
135 | },
136 | z: function() { // Day of year; 0..365
137 | var a = new Date(f.Y(), f.n() - 1, f.j());
138 | var b = new Date(f.Y(), 0, 1);
139 | return Math.round((a - b) / 864e5);
140 | },
141 |
142 | // Week
143 | W: function() { // ISO-8601 week number
144 | var a = new Date(f.Y(), f.n() - 1, f.j() - f.N() + 3);
145 | var b = new Date(a.getFullYear(), 0, 4);
146 | return _pad(1 + Math.round((a - b) / 864e5 / 7), 2);
147 | },
148 |
149 | // Month
150 | F: function() { // Full month name; January...December
151 | return txt_words[6 + f.n()];
152 | },
153 | m: function() { // Month w/leading 0; 01...12
154 | return _pad(f.n(), 2);
155 | },
156 | M: function() { // Shorthand month name; Jan...Dec
157 | return f.F()
158 | .slice(0, 3);
159 | },
160 | n: function() { // Month; 1...12
161 | return jsdate.getMonth() + 1;
162 | },
163 | t: function() { // Days in month; 28...31
164 | return (new Date(f.Y(), f.n(), 0))
165 | .getDate();
166 | },
167 |
168 | // Year
169 | L: function() { // Is leap year?; 0 or 1
170 | var j = f.Y();
171 | return j % 4 === 0 & j % 100 !== 0 | j % 400 === 0;
172 | },
173 | o: function() { // ISO-8601 year
174 | var n = f.n();
175 | var W = f.W();
176 | var Y = f.Y();
177 | return Y + (n === 12 && W < 9 ? 1 : n === 1 && W > 9 ? -1 : 0);
178 | },
179 | Y: function() { // Full year; e.g. 1980...2010
180 | return jsdate.getFullYear();
181 | },
182 | y: function() { // Last two digits of year; 00...99
183 | return f.Y()
184 | .toString()
185 | .slice(-2);
186 | },
187 |
188 | // Time
189 | a: function() { // am or pm
190 | return jsdate.getHours() > 11 ? 'pm' : 'am';
191 | },
192 | A: function() { // AM or PM
193 | return f.a()
194 | .toUpperCase();
195 | },
196 | B: function() { // Swatch Internet time; 000..999
197 | var H = jsdate.getUTCHours() * 36e2;
198 | // Hours
199 | var i = jsdate.getUTCMinutes() * 60;
200 | // Minutes
201 | var s = jsdate.getUTCSeconds(); // Seconds
202 | return _pad(Math.floor((H + i + s + 36e2) / 86.4) % 1e3, 3);
203 | },
204 | g: function() { // 12-Hours; 1..12
205 | return f.G() % 12 || 12;
206 | },
207 | G: function() { // 24-Hours; 0..23
208 | return jsdate.getHours();
209 | },
210 | h: function() { // 12-Hours w/leading 0; 01..12
211 | return _pad(f.g(), 2);
212 | },
213 | H: function() { // 24-Hours w/leading 0; 00..23
214 | return _pad(f.G(), 2);
215 | },
216 | i: function() { // Minutes w/leading 0; 00..59
217 | return _pad(jsdate.getMinutes(), 2);
218 | },
219 | s: function() { // Seconds w/leading 0; 00..59
220 | return _pad(jsdate.getSeconds(), 2);
221 | },
222 | u: function() { // Microseconds; 000000-999000
223 | return _pad(jsdate.getMilliseconds() * 1000, 6);
224 | },
225 |
226 | // Timezone
227 | e: function() { // Timezone identifier; e.g. Atlantic/Azores, ...
228 | // The following works, but requires inclusion of the very large
229 | // timezone_abbreviations_list() function.
230 | /* return that.date_default_timezone_get();
231 | */
232 | throw 'Not supported (see source code of date() for timezone on how to add support)';
233 | },
234 | I: function() { // DST observed?; 0 or 1
235 | // Compares Jan 1 minus Jan 1 UTC to Jul 1 minus Jul 1 UTC.
236 | // If they are not equal, then DST is observed.
237 | var a = new Date(f.Y(), 0);
238 | // Jan 1
239 | var c = Date.UTC(f.Y(), 0);
240 | // Jan 1 UTC
241 | var b = new Date(f.Y(), 6);
242 | // Jul 1
243 | var d = Date.UTC(f.Y(), 6); // Jul 1 UTC
244 | return ((a - c) !== (b - d)) ? 1 : 0;
245 | },
246 | O: function() { // Difference to GMT in hour format; e.g. +0200
247 | var tzo = jsdate.getTimezoneOffset();
248 | var a = Math.abs(tzo);
249 | return (tzo > 0 ? '-' : '+') + _pad(Math.floor(a / 60) * 100 + a % 60, 4);
250 | },
251 | P: function() { // Difference to GMT w/colon; e.g. +02:00
252 | var O = f.O();
253 | return (O.substr(0, 3) + ':' + O.substr(3, 2));
254 | },
255 | T: function() { // Timezone abbreviation; e.g. EST, MDT, ...
256 | // The following works, but requires inclusion of the very
257 | // large timezone_abbreviations_list() function.
258 | /* var abbr, i, os, _default;
259 | if (!tal.length) {
260 | tal = that.timezone_abbreviations_list();
261 | }
262 | if (that.php_js && that.php_js.default_timezone) {
263 | _default = that.php_js.default_timezone;
264 | for (abbr in tal) {
265 | for (i = 0; i < tal[abbr].length; i++) {
266 | if (tal[abbr][i].timezone_id === _default) {
267 | return abbr.toUpperCase();
268 | }
269 | }
270 | }
271 | }
272 | for (abbr in tal) {
273 | for (i = 0; i < tal[abbr].length; i++) {
274 | os = -jsdate.getTimezoneOffset() * 60;
275 | if (tal[abbr][i].offset === os) {
276 | return abbr.toUpperCase();
277 | }
278 | }
279 | }
280 | */
281 | return 'UTC';
282 | },
283 | Z: function() { // Timezone offset in seconds (-43200...50400)
284 | return -jsdate.getTimezoneOffset() * 60;
285 | },
286 |
287 | // Full Date/Time
288 | c: function() { // ISO-8601 date.
289 | return 'Y-m-d\\TH:i:sP'.replace(formatChr, formatChrCb);
290 | },
291 | r: function() { // RFC 2822
292 | return 'D, d M Y H:i:s O'.replace(formatChr, formatChrCb);
293 | },
294 | U: function() { // Seconds since UNIX epoch
295 | return jsdate / 1000 | 0;
296 | }
297 | };
298 | this.date = function(format, timestamp) {
299 | that = this;
300 | jsdate = (timestamp === undefined ? new Date() : // Not provided
301 | (timestamp instanceof Date) ? new Date(timestamp) : // JS Date()
302 | new Date(timestamp * 1000) // UNIX timestamp (auto-convert to int)
303 | );
304 | return format.replace(formatChr, formatChrCb);
305 | };
306 | return this.date(format, timestamp);
307 | }
308 |
309 | // http://stackoverflow.com/questions/11887934/check-if-daylight-saving-time-is-in-effect-and-if-it-is-for-how-many-hours
310 | Date.prototype.stdTimezoneOffset = function() {
311 | var jan = new Date(this.getFullYear(), 0, 1);
312 | var jul = new Date(this.getFullYear(), 6, 1);
313 | return Math.max(jan.getTimezoneOffset(), jul.getTimezoneOffset());
314 | };
315 |
316 | Date.prototype.dst = function() {
317 | return this.getTimezoneOffset() < this.stdTimezoneOffset();
318 | };
--------------------------------------------------------------------------------
/app/datasource/dexcom.js:
--------------------------------------------------------------------------------
1 | define(function () {
2 | // http://stackoverflow.com/questions/8482309/converting-javascript-integer-to-byte-array-and-back
3 | var lastSerialPort = false;
4 | function intFromBytes(x) {
5 | var val = 0;
6 | for (var i = 0; i < x.length; ++i) {
7 | val += x[i];
8 | if (i < x.length-1) {
9 | val = val << 8;
10 | }
11 | }
12 | return val;
13 | }
14 | function getInt64Bytes(x) {
15 | var bytes = [];
16 | var i = 8;
17 | do {
18 | bytes[--i] = x & (255);
19 | x = x>>8;
20 | } while ( i );
21 | return bytes;
22 | }
23 |
24 | function calculateCRC16(buff, start, end) {
25 | var crc = new Uint16Array(1);
26 | var buffer = new Uint8Array(buff);
27 | crc[0] = 0;
28 | for (var i = start; i < end; i++) {
29 | crc[0] = (crc[0] >>> 8) | (crc[0] << 8) & 0xffff;
30 | crc[0] ^= (buffer[i] & 0xff);
31 | crc[0] ^= ((crc[0] & 0xff) >> 4);
32 | crc[0] ^= (crc[0] << 12) & 0xffff;
33 | crc[0] ^= ((crc[0] & 0xff) << 5) & 0xffff;
34 | }
35 | crc[0] &= 0xffff;
36 | return crc[0];
37 | }
38 |
39 | function int32at(jsBytes, ixStart, byteLength) {
40 | var u8 = new Uint8Array(jsBytes);
41 | var slice = u8.buffer.slice(ixStart, ixStart + byteLength);
42 | return (new Int32Array(slice))[0];
43 | }
44 |
45 | function bytesOfInt(int32) {
46 | var a = new Int32Array(1);
47 | a[0] = int32;
48 | var bytes = new Uint8Array(a.buffer);
49 | return bytes;
50 | }
51 |
52 | var dexcom = {
53 | connected: false,
54 | connection: null,
55 | port: null,
56 | buffer: [],
57 | connect: function(serialport) {
58 | if (lastSerialPort) {
59 | return new Promise(function(resolve, reject) {
60 | dexcom.oldConnect(lastSerialPort, true).then(resolve, function() {
61 | dexcom.scanForDexcom.then(resolve, reject);
62 | })
63 | });
64 | } else if (serialport) {
65 | return new Promise(function(resolve, reject) {
66 | chrome.serial.getDevices(function(ports) {
67 | for (var i=0; i ports.length) {
88 | return reject();
89 | }
90 | var port = ports[i];
91 | setTimeout(function() {
92 | dexcom.oldConnect(port, true).then(function() {
93 | dexcom.ping().then(function(d) {
94 | if (d.length) {
95 | lastSerialPort = port;
96 | resolve(port);
97 | } else {
98 | dexcom.disconnect();
99 | tryPort(++i);
100 | }
101 | }, function() {
102 | dexcom.disconnect();
103 | tryPort(++i);
104 | });
105 | }, function() {
106 | tryPort(++i);
107 | });
108 | }, 250);
109 | }
110 | tryPort(0);
111 | });
112 | });
113 | },
114 | oldConnect: function(serialport, foundActualDevice) {
115 | console.debug("[dexcom.oldConnect] getDevices with device: %o", serialport);
116 | return new Promise(function(resolve, reject) {
117 | if (dexcom.connected) {
118 | return reject(new Error("Wait for existing process to finish"));
119 | }
120 | var connected = function(conn) {
121 | if (conn && "connectionId" in conn) {
122 | dexcom.connection = conn;
123 | dexcom.connected = true;
124 | console.debug("[dexcom.oldConnect.connected] successfully connected to port %o", conn);
125 | setTimeout(resolve, 100);
126 | lastSerialPort = serialport;
127 | chrome.serial.onReceive.addListener(dexcom.serialOnReceiveListener);
128 | } else {
129 | if (conn) console.error("[dexcom.oldConnect.connected] Couldn't open USB connection to port %o", conn);
130 | reject(new Error(
131 | "Couldn't open USB connection. Unplug your Dexcom, plug it back in, and try again."
132 | ));
133 | }
134 | };
135 | var tryPort = function(port) {
136 | console.debug("[dexcom.oldConnect.tryPort] Trying port: %o", port);
137 | if (!foundActualDevice &&
138 | (port.path.substr(0,serialport.length).toLowerCase() != serialport.toLowerCase())) {
139 | return;
140 | }
141 | dexcom.port = port;
142 | chrome.serial.connect(dexcom.port.path, { bitrate: 115200 }, connected);
143 | };
144 | if (foundActualDevice) {
145 | tryPort(serialport);
146 | } else {
147 | chrome.serial.getDevices(function(ports) {
148 | console.debug("[dexcom.oldConnect.getDevices] returned ports: %o", ports);
149 | ports.forEach(tryPort);
150 | if (dexcom.port === null) {
151 | lastSerialPort = false;
152 | reject(new Error(
153 | "Didn't find a Dexcom receiver plugged in"
154 | ));
155 | }
156 | });
157 | }
158 | });
159 | },
160 | serialOnReceiveListener: function(info) {
161 | if (dexcom.connected && info.connectionId == dexcom.connection.connectionId && info.data) {
162 | var bufView=new Uint8Array(info.data);
163 | console.debug("[dexcom.serialOnReceiverListener] connection (low-level)] incoming data; %i bytes", bufView.byteLength);
164 | for (var i=0; i= bytes) {
172 | packet = dexcom.buffer.slice(0,bytes);
173 | console.info("0x" + packet.map(function(byte) { return ("0" + byte.toString(16)).substr(-2); }).join("") );
174 | dexcom.buffer = dexcom.buffer.slice(0 - bytes);
175 | callback(packet);
176 | } else if (to === 0) {
177 | packet = dexcom.buffer;
178 | dexcom.buffer = [];
179 | console.info("0x" + packet.map(function(byte) { return ("0" + byte.toString(16)).substr(-2); }).join("") );
180 | callback(packet);
181 | } else {
182 | var delta = Math.max(0, to - 50);
183 | setTimeout(function() {
184 | dexcom.readSerial(bytes, delta, callback);
185 | }, 50);
186 | }
187 | },
188 | disconnect: function() {
189 | if (!dexcom.connected) {
190 | throw new Error("Not connected");
191 | }
192 | chrome.serial.disconnect(dexcom.connection.connectionId, function() {
193 | console.debug("[dexcom.disconnect] completed");
194 | });
195 | dexcom.connected = false;
196 | dexcom.connection = null;
197 | dexcom.port = null;
198 | dexcom.buffer = [];
199 | chrome.serial.onReceive.removeListener(dexcom.serialOnReceiveListener);
200 | console.debug("[dexcom.disconnect] attempted");
201 | },
202 | writeSerial: function(bytes, callback) {
203 | dexcom.buffer = [];
204 | chrome.serial.send(dexcom.connection.connectionId, bytes, callback);
205 | console.debug("[dexcom.writeSerial (low level)] wrote command to serial");
206 | },
207 | readFromReceiver: function(pageOffset, callback) {
208 | return new Promise(function(resolve,reject) {
209 | try {
210 | console.debug("[dexcom.readFromReceiver] read page %i from serial", pageOffset);
211 | dexcom.getEGVDataPageRange(function(dexcomPageRange) {
212 | dexcom.getLastFourPages(dexcomPageRange, pageOffset, function(databasePages) {
213 | databasePages = databasePages.slice(4); // why? i dunno
214 | var data = dexcom.parseDatabasePages(databasePages);
215 | if (typeof callback == "function")
216 | callback(data);
217 | resolve(data);
218 | });
219 | });
220 | } catch (e) {
221 | reject(e);
222 | }
223 | });
224 | //locate the EGV data pages
225 | },
226 | ping: function() {
227 | // ping is command 10
228 | return new Promise(function(done, reject) {
229 | if (!dexcom.connected) {
230 | return reject(new Error("Not connected"));
231 | }
232 | var buf = new ArrayBuffer(7);
233 | readEGVDataPageRange =new Uint8Array(buf);
234 | readEGVDataPageRange[0] = 0x01; // sof
235 | readEGVDataPageRange[1] = 0x07; // length
236 | readEGVDataPageRange[3] = 0x00; // null because why?
237 | readEGVDataPageRange[4] = 0x0a; // command
238 | var crc = bytesOfInt(calculateCRC16(readEGVDataPageRange, 0, 5));
239 | readEGVDataPageRange[5] = crc[0];
240 | readEGVDataPageRange[6] = crc[1];
241 | dexcom.writeSerial(buf, function() {
242 | dexcom.readSerial(6, 200, done);
243 | });
244 | console.debug("[dexcom.ping] dispatched");
245 | });
246 | },
247 | getDexcomSystemTime: function() {
248 | return new Promise(function(done, reject) {
249 | return done(new Date()); // I just don't need it. YOU make it work! :)
250 | });
251 | },
252 | getEGVDataPageRange: function(callback) {
253 | if (!dexcom.connected) {
254 | throw new Error("Not connected");
255 | }
256 | var buf = new ArrayBuffer(7);
257 | readEGVDataPageRange =new Uint8Array(buf);
258 | readEGVDataPageRange[0] = 0x01;
259 | readEGVDataPageRange[1] = 0x07;
260 | readEGVDataPageRange[3] = 0x10;
261 | readEGVDataPageRange[4] = 0x04;
262 | var crc = bytesOfInt(calculateCRC16(readEGVDataPageRange, 0, 5));
263 | readEGVDataPageRange[5] = crc[0];
264 | readEGVDataPageRange[6] = crc[1];
265 | dexcom.writeSerial(buf, function() {
266 | dexcom.readSerial(256, 200, callback);
267 | });
268 | console.debug("[dexcom.getEGVDataPageRange]");
269 | },
270 | getLastFourPages: function(dexcomPageRangeJS, pageOffset,callback) {
271 | if (dexcomPageRangeJS.length === 0) {
272 | throw new Error(
273 | "Didn't receive response from Dexcom. Unplug, plug it back in, and try again."
274 | );
275 | }
276 | var endPage = int32at(dexcomPageRangeJS, 8, 4);
277 | var getLastFour = endPage - 4 * pageOffset + 1;
278 | var b = bytesOfInt(getLastFour);
279 |
280 | var buf = new ArrayBuffer(12);
281 | getLastEGVPage =new Uint8Array(buf);
282 |
283 | getLastEGVPage[0] = 0x01;
284 | getLastEGVPage[1] = 0x0c;
285 | getLastEGVPage[2] = 0x00;
286 | getLastEGVPage[3] = 0x11;
287 | getLastEGVPage[4] = 0x04;
288 | getLastEGVPage[5] = b[0]; // reverse these 4?
289 | getLastEGVPage[6] = b[1];
290 | getLastEGVPage[7] = b[2];
291 | getLastEGVPage[8] = b[3];
292 | getLastEGVPage[9] = 0x04;
293 |
294 | var checksum = bytesOfInt(calculateCRC16(getLastEGVPage, 0, 10));
295 |
296 | getLastEGVPage[10] = checksum[0];
297 | getLastEGVPage[11] = checksum[1];
298 |
299 | dexcom.writeSerial(buf, function() {
300 | dexcom.readSerial(2118, 10000, callback);
301 | });
302 | console.debug("[dexcom.getLastFourPages] called");
303 | },
304 | parseDatabasePages: function(databasePages) {
305 | var fourPages = [];
306 | var recordCounts = [];
307 | var totalRecordCount = 0;
308 | var i = 0;
309 | var dexcomTime = -800; //PST
310 | var localTime = (new Date().toString().match(/([-\+][0-9]+)\s/)[1]);
311 | delta = dexcomTime - localTime;
312 | var delta = {
313 | h: Math.floor(delta/100),
314 | m: delta % 100
315 | };
316 |
317 | // God, I hope this doesn't bite me when DST starts again
318 | // delta.h++ was running already but... Ugh.
319 | // if ((new Date()).dst()) {
320 | delta.h++;
321 | // }
322 | delta.ms = (delta.h < 0? -1: 1) * (Math.abs(delta.h).hours() + delta.m.minutes());
323 |
324 | console.debug("[dexcom.parseDatabasePages] parsing raw results to eGV records");
325 |
326 | //we parse 4 pages at a time, calculate total record count while we do this
327 | for (i = 0; i < 4; i++) {
328 | fourPages[i] = databasePages.slice(528 * i, 528 * (i + 1));
329 | recordCounts[i] = fourPages[i][4];
330 | totalRecordCount += recordCounts[i];
331 | }
332 | var recordsToReturn = [];
333 | var k = 0, j = 0;
334 |
335 | //parse each record, plenty of room for improvement
336 | var tempRecord = [];
337 | for (i = 0; i < 4; i++) {
338 | for (j = 0; j < recordCounts[i]; j++) {
339 | tempRecord = fourPages[i].slice(28 + j * 13, 28 + (j + 1) * 13);
340 | var eGValue = [tempRecord[8], tempRecord[9]];
341 | var bGValue = ((eGValue[1]<<8) + (eGValue[0] & 0xff)) & 0x3ff;
342 |
343 | var dt = intFromBytes([tempRecord[7], tempRecord[6], tempRecord[5], tempRecord[4]]);
344 | var d = 1230793200000 + dt * 1000 + delta.ms; // Jan 1 2009 12:00:00a
345 | var display = new Date(d);
346 |
347 | var trendArrow = getInt64Bytes(tempRecord[10] & 15)[7];
348 | var trend = "Not Calculated";
349 | var trendA = "--X";
350 | switch (trendArrow) {
351 | case 0:
352 | trend = "None";
353 | trendA = String.fromCharCode(0x2194);
354 | break;
355 | case 1:
356 | trend = "DoubleUp";
357 | trendA = String.fromCharCode(0x21C8);
358 | break;
359 | case (2):
360 | trendA = String.fromCharCode(0x2191);
361 | trend = "SingleUp";
362 | break;
363 | case (3):
364 | trendA = String.fromCharCode(0x2197);
365 | trend = "FortyFiveUp";
366 | break;
367 | case (4):
368 | trendA = String.fromCharCode(0x2192);
369 | trend = "Flat";
370 | break;
371 | case (5):
372 | trendA = String.fromCharCode(0x2198);
373 | trend = "FortyFiveDown";
374 | break;
375 | case (6):
376 | trendA = String.fromCharCode(0x2193);
377 | trend = "SingleDown";
378 | break;
379 | case (7):
380 | trendA = String.fromCharCode(0x21ca);
381 | trend = "DoubleDown";
382 | break;
383 | case (8):
384 | trendA = String.fromCharCode(0x2194);
385 | trend = "NOT COMPUTABLE";
386 | break;
387 | case (9):
388 | trendA = String.fromCharCode(0x2194);
389 | trend = "OUT OF RANGE";
390 | bGValue = undefined;
391 | break;
392 | }
393 |
394 | recordsToReturn.push({
395 | bgValue: bGValue,
396 | displayTime: display,
397 | trend: trend,
398 | trendArrow: trendA
399 | });
400 | }
401 | }
402 | console.debug("[dexcom.parseDatabasePages] done");
403 | return recordsToReturn;
404 | },
405 |
406 | getAllRecords: function() {
407 | var i = 1;
408 | var data = [];
409 | var callback = function() { };
410 |
411 | var compile = function(i) {
412 | return new Promise(function(resolve,reject) {
413 | try {
414 | dexcom.readFromReceiver(i).then(function(d) {
415 | data.push(d);
416 |
417 | if (d.length) {
418 | resolve(d);
419 | } else {
420 | reject();
421 | }
422 | });
423 | } catch (e) {
424 | reject(e);
425 | }
426 | });
427 | },
428 | reader = function() {
429 | compile(i).then(function() {
430 | waiting.setProgress(i);
431 | i++;
432 | reader();
433 | }, function() { // no more data
434 | var existing = egvrecords;
435 | var existing_ts = existing.map(function(row) {
436 | return row.displayTime;
437 | });
438 | var new_records = Array.prototype.concat.apply([], data).map(function(egv) {
439 | return {
440 | displayTime: +egv.displayTime,
441 | bgValue: egv.bgValue,
442 | trend: egv.trend
443 | };
444 | }).filter(function(row) {
445 | return existing_ts.filter(function(ts) {
446 | return ts == row.displayTime;
447 | }).length === 0;
448 | }).filter(function(row) {
449 | return row.bgValue > 30;
450 | });
451 | egvrecords.addAll(new_records);
452 | console.debug("[dexcom.getAllRecords.reader] %i new records", new_records.length);
453 | dexcom.disconnect();
454 | callback(new_records);
455 | });
456 | };
457 | return new Promise(function(done) {
458 | callback = done;
459 | dexcom.connect().then(reader)
460 | });
461 | }
462 | };
463 | return dexcom;
464 | });
465 |
--------------------------------------------------------------------------------
/app/window.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | NightScout.info CGM Utility
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
14 |
15 |
16 |
17 |
263 |
264 |
265 |
266 |
267 |
268 |
269 |
270 |
Disclaimer
271 |
272 |
273 |
This is pre-release software. It's reverse engineered. Don't rely on it. Don't make decisions around it. Don't blame the author for anything. You're choosing to use this, and accept any responsibility stemming from that.
366 |
367 |
368 |
--------------------------------------------------------------------------------
/LICENSE.md:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 2, June 1991
3 |
4 | Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
5 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
6 | Everyone is permitted to copy and distribute verbatim copies
7 | of this license document, but changing it is not allowed.
8 |
9 | Preamble
10 |
11 | The licenses for most software are designed to take away your
12 | freedom to share and change it. By contrast, the GNU General Public
13 | License is intended to guarantee your freedom to share and change free
14 | software--to make sure the software is free for all its users. This
15 | General Public License applies to most of the Free Software
16 | Foundation's software and to any other program whose authors commit to
17 | using it. (Some other Free Software Foundation software is covered by
18 | the GNU Lesser General Public License instead.) You can apply it to
19 | your programs, too.
20 |
21 | When we speak of free software, we are referring to freedom, not
22 | price. Our General Public Licenses are designed to make sure that you
23 | have the freedom to distribute copies of free software (and charge for
24 | this service if you wish), that you receive source code or can get it
25 | if you want it, that you can change the software or use pieces of it
26 | in new free programs; and that you know you can do these things.
27 |
28 | To protect your rights, we need to make restrictions that forbid
29 | anyone to deny you these rights or to ask you to surrender the rights.
30 | These restrictions translate to certain responsibilities for you if you
31 | distribute copies of the software, or if you modify it.
32 |
33 | For example, if you distribute copies of such a program, whether
34 | gratis or for a fee, you must give the recipients all the rights that
35 | you have. You must make sure that they, too, receive or can get the
36 | source code. And you must show them these terms so they know their
37 | rights.
38 |
39 | We protect your rights with two steps: (1) copyright the software, and
40 | (2) offer you this license which gives you legal permission to copy,
41 | distribute and/or modify the software.
42 |
43 | Also, for each author's protection and ours, we want to make certain
44 | that everyone understands that there is no warranty for this free
45 | software. If the software is modified by someone else and passed on, we
46 | want its recipients to know that what they have is not the original, so
47 | that any problems introduced by others will not reflect on the original
48 | authors' reputations.
49 |
50 | Finally, any free program is threatened constantly by software
51 | patents. We wish to avoid the danger that redistributors of a free
52 | program will individually obtain patent licenses, in effect making the
53 | program proprietary. To prevent this, we have made it clear that any
54 | patent must be licensed for everyone's free use or not licensed at all.
55 |
56 | The precise terms and conditions for copying, distribution and
57 | modification follow.
58 |
59 | GNU GENERAL PUBLIC LICENSE
60 | TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
61 |
62 | 0. This License applies to any program or other work which contains
63 | a notice placed by the copyright holder saying it may be distributed
64 | under the terms of this General Public License. The "Program", below,
65 | refers to any such program or work, and a "work based on the Program"
66 | means either the Program or any derivative work under copyright law:
67 | that is to say, a work containing the Program or a portion of it,
68 | either verbatim or with modifications and/or translated into another
69 | language. (Hereinafter, translation is included without limitation in
70 | the term "modification".) Each licensee is addressed as "you".
71 |
72 | Activities other than copying, distribution and modification are not
73 | covered by this License; they are outside its scope. The act of
74 | running the Program is not restricted, and the output from the Program
75 | is covered only if its contents constitute a work based on the
76 | Program (independent of having been made by running the Program).
77 | Whether that is true depends on what the Program does.
78 |
79 | 1. You may copy and distribute verbatim copies of the Program's
80 | source code as you receive it, in any medium, provided that you
81 | conspicuously and appropriately publish on each copy an appropriate
82 | copyright notice and disclaimer of warranty; keep intact all the
83 | notices that refer to this License and to the absence of any warranty;
84 | and give any other recipients of the Program a copy of this License
85 | along with the Program.
86 |
87 | You may charge a fee for the physical act of transferring a copy, and
88 | you may at your option offer warranty protection in exchange for a fee.
89 |
90 | 2. You may modify your copy or copies of the Program or any portion
91 | of it, thus forming a work based on the Program, and copy and
92 | distribute such modifications or work under the terms of Section 1
93 | above, provided that you also meet all of these conditions:
94 |
95 | a) You must cause the modified files to carry prominent notices
96 | stating that you changed the files and the date of any change.
97 |
98 | b) You must cause any work that you distribute or publish, that in
99 | whole or in part contains or is derived from the Program or any
100 | part thereof, to be licensed as a whole at no charge to all third
101 | parties under the terms of this License.
102 |
103 | c) If the modified program normally reads commands interactively
104 | when run, you must cause it, when started running for such
105 | interactive use in the most ordinary way, to print or display an
106 | announcement including an appropriate copyright notice and a
107 | notice that there is no warranty (or else, saying that you provide
108 | a warranty) and that users may redistribute the program under
109 | these conditions, and telling the user how to view a copy of this
110 | License. (Exception: if the Program itself is interactive but
111 | does not normally print such an announcement, your work based on
112 | the Program is not required to print an announcement.)
113 |
114 | These requirements apply to the modified work as a whole. If
115 | identifiable sections of that work are not derived from the Program,
116 | and can be reasonably considered independent and separate works in
117 | themselves, then this License, and its terms, do not apply to those
118 | sections when you distribute them as separate works. But when you
119 | distribute the same sections as part of a whole which is a work based
120 | on the Program, the distribution of the whole must be on the terms of
121 | this License, whose permissions for other licensees extend to the
122 | entire whole, and thus to each and every part regardless of who wrote it.
123 |
124 | Thus, it is not the intent of this section to claim rights or contest
125 | your rights to work written entirely by you; rather, the intent is to
126 | exercise the right to control the distribution of derivative or
127 | collective works based on the Program.
128 |
129 | In addition, mere aggregation of another work not based on the Program
130 | with the Program (or with a work based on the Program) on a volume of
131 | a storage or distribution medium does not bring the other work under
132 | the scope of this License.
133 |
134 | 3. You may copy and distribute the Program (or a work based on it,
135 | under Section 2) in object code or executable form under the terms of
136 | Sections 1 and 2 above provided that you also do one of the following:
137 |
138 | a) Accompany it with the complete corresponding machine-readable
139 | source code, which must be distributed under the terms of Sections
140 | 1 and 2 above on a medium customarily used for software interchange; or,
141 |
142 | b) Accompany it with a written offer, valid for at least three
143 | years, to give any third party, for a charge no more than your
144 | cost of physically performing source distribution, a complete
145 | machine-readable copy of the corresponding source code, to be
146 | distributed under the terms of Sections 1 and 2 above on a medium
147 | customarily used for software interchange; or,
148 |
149 | c) Accompany it with the information you received as to the offer
150 | to distribute corresponding source code. (This alternative is
151 | allowed only for noncommercial distribution and only if you
152 | received the program in object code or executable form with such
153 | an offer, in accord with Subsection b above.)
154 |
155 | The source code for a work means the preferred form of the work for
156 | making modifications to it. For an executable work, complete source
157 | code means all the source code for all modules it contains, plus any
158 | associated interface definition files, plus the scripts used to
159 | control compilation and installation of the executable. However, as a
160 | special exception, the source code distributed need not include
161 | anything that is normally distributed (in either source or binary
162 | form) with the major components (compiler, kernel, and so on) of the
163 | operating system on which the executable runs, unless that component
164 | itself accompanies the executable.
165 |
166 | If distribution of executable or object code is made by offering
167 | access to copy from a designated place, then offering equivalent
168 | access to copy the source code from the same place counts as
169 | distribution of the source code, even though third parties are not
170 | compelled to copy the source along with the object code.
171 |
172 | 4. You may not copy, modify, sublicense, or distribute the Program
173 | except as expressly provided under this License. Any attempt
174 | otherwise to copy, modify, sublicense or distribute the Program is
175 | void, and will automatically terminate your rights under this License.
176 | However, parties who have received copies, or rights, from you under
177 | this License will not have their licenses terminated so long as such
178 | parties remain in full compliance.
179 |
180 | 5. You are not required to accept this License, since you have not
181 | signed it. However, nothing else grants you permission to modify or
182 | distribute the Program or its derivative works. These actions are
183 | prohibited by law if you do not accept this License. Therefore, by
184 | modifying or distributing the Program (or any work based on the
185 | Program), you indicate your acceptance of this License to do so, and
186 | all its terms and conditions for copying, distributing or modifying
187 | the Program or works based on it.
188 |
189 | 6. Each time you redistribute the Program (or any work based on the
190 | Program), the recipient automatically receives a license from the
191 | original licensor to copy, distribute or modify the Program subject to
192 | these terms and conditions. You may not impose any further
193 | restrictions on the recipients' exercise of the rights granted herein.
194 | You are not responsible for enforcing compliance by third parties to
195 | this License.
196 |
197 | 7. If, as a consequence of a court judgment or allegation of patent
198 | infringement or for any other reason (not limited to patent issues),
199 | conditions are imposed on you (whether by court order, agreement or
200 | otherwise) that contradict the conditions of this License, they do not
201 | excuse you from the conditions of this License. If you cannot
202 | distribute so as to satisfy simultaneously your obligations under this
203 | License and any other pertinent obligations, then as a consequence you
204 | may not distribute the Program at all. For example, if a patent
205 | license would not permit royalty-free redistribution of the Program by
206 | all those who receive copies directly or indirectly through you, then
207 | the only way you could satisfy both it and this License would be to
208 | refrain entirely from distribution of the Program.
209 |
210 | If any portion of this section is held invalid or unenforceable under
211 | any particular circumstance, the balance of the section is intended to
212 | apply and the section as a whole is intended to apply in other
213 | circumstances.
214 |
215 | It is not the purpose of this section to induce you to infringe any
216 | patents or other property right claims or to contest validity of any
217 | such claims; this section has the sole purpose of protecting the
218 | integrity of the free software distribution system, which is
219 | implemented by public license practices. Many people have made
220 | generous contributions to the wide range of software distributed
221 | through that system in reliance on consistent application of that
222 | system; it is up to the author/donor to decide if he or she is willing
223 | to distribute software through any other system and a licensee cannot
224 | impose that choice.
225 |
226 | This section is intended to make thoroughly clear what is believed to
227 | be a consequence of the rest of this License.
228 |
229 | 8. If the distribution and/or use of the Program is restricted in
230 | certain countries either by patents or by copyrighted interfaces, the
231 | original copyright holder who places the Program under this License
232 | may add an explicit geographical distribution limitation excluding
233 | those countries, so that distribution is permitted only in or among
234 | countries not thus excluded. In such case, this License incorporates
235 | the limitation as if written in the body of this License.
236 |
237 | 9. The Free Software Foundation may publish revised and/or new versions
238 | of the General Public License from time to time. Such new versions will
239 | be similar in spirit to the present version, but may differ in detail to
240 | address new problems or concerns.
241 |
242 | Each version is given a distinguishing version number. If the Program
243 | specifies a version number of this License which applies to it and "any
244 | later version", you have the option of following the terms and conditions
245 | either of that version or of any later version published by the Free
246 | Software Foundation. If the Program does not specify a version number of
247 | this License, you may choose any version ever published by the Free Software
248 | Foundation.
249 |
250 | 10. If you wish to incorporate parts of the Program into other free
251 | programs whose distribution conditions are different, write to the author
252 | to ask for permission. For software which is copyrighted by the Free
253 | Software Foundation, write to the Free Software Foundation; we sometimes
254 | make exceptions for this. Our decision will be guided by the two goals
255 | of preserving the free status of all derivatives of our free software and
256 | of promoting the sharing and reuse of software generally.
257 |
258 | NO WARRANTY
259 |
260 | 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
261 | FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
262 | OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
263 | PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
264 | OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
265 | MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
266 | TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
267 | PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
268 | REPAIR OR CORRECTION.
269 |
270 | 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
271 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
272 | REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
273 | INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
274 | OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
275 | TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
276 | YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
277 | PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
278 | POSSIBILITY OF SUCH DAMAGES.
279 |
280 | END OF TERMS AND CONDITIONS
281 |
282 | How to Apply These Terms to Your New Programs
283 |
284 | If you develop a new program, and you want it to be of the greatest
285 | possible use to the public, the best way to achieve this is to make it
286 | free software which everyone can redistribute and change under these terms.
287 |
288 | To do so, attach the following notices to the program. It is safest
289 | to attach them to the start of each source file to most effectively
290 | convey the exclusion of warranty; and each file should have at least
291 | the "copyright" line and a pointer to where the full notice is found.
292 |
293 | {description}
294 | Copyright (C) {year} {fullname}
295 |
296 | This program is free software; you can redistribute it and/or modify
297 | it under the terms of the GNU General Public License as published by
298 | the Free Software Foundation; either version 2 of the License, or
299 | (at your option) any later version.
300 |
301 | This program is distributed in the hope that it will be useful,
302 | but WITHOUT ANY WARRANTY; without even the implied warranty of
303 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
304 | GNU General Public License for more details.
305 |
306 | You should have received a copy of the GNU General Public License along
307 | with this program; if not, write to the Free Software Foundation, Inc.,
308 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
309 |
310 | Also add information on how to contact you by electronic and paper mail.
311 |
312 | If the program is interactive, make it output a short notice like this
313 | when it starts in an interactive mode:
314 |
315 | Gnomovision version 69, Copyright (C) year name of author
316 | Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
317 | This is free software, and you are welcome to redistribute it
318 | under certain conditions; type `show c' for details.
319 |
320 | The hypothetical commands `show w' and `show c' should show the appropriate
321 | parts of the General Public License. Of course, the commands you use may
322 | be called something other than `show w' and `show c'; they could even be
323 | mouse-clicks or menu items--whatever suits your program.
324 |
325 | You should also get your employer (if you work as a programmer) or your
326 | school, if any, to sign a "copyright disclaimer" for the program, if
327 | necessary. Here is a sample; alter the names:
328 |
329 | Yoyodyne, Inc., hereby disclaims all copyright interest in the program
330 | `Gnomovision' (which makes passes at compilers) written by James Hacker.
331 |
332 | {signature of Ty Coon}, 1 April 1989
333 | Ty Coon, President of Vice
334 |
335 | This General Public License does not permit incorporating your program into
336 | proprietary programs. If your program is a subroutine library, you may
337 | consider it more useful to permit linking proprietary applications with the
338 | library. If this is what you want to do, use the GNU Lesser General
339 | Public License instead of this License.
340 |
--------------------------------------------------------------------------------