stanford-oval / genie-toolkit / 599

pending completion

Build # 599

Build Type

Pull #128

travis-ci-com

Committed by

web-flow

Commit Message

Add more missing npp filters

Pull Request Pull Request #128: Template fixes

Run Details

1679 of 4127 branches covered (40.68%)

Branch coverage included in aggregate %.

5 of 10 new or added lines in 3 files covered. (50.0%)

33 existing lines in 1 file now uncovered.

4251 of 8277 relevant lines covered (51.36%)

569340.95 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

27.62

/tool/lib/progress_bar.js

// -*- mode: js; indent-tabs-mode: nil; js-basic-offset: 4 -*-
//
// This file is part of Genie
//
// Copyright 2017-2019 The Board of Trustees of the Leland Stanford Junior University
//
// Author: The 224N TAs
//         Giovanni Campagna <gcampagn@cs.stanford.edu>
//
// See COPYING for details
"use strict";

/**
 * Progbar class copied from keras (https://github.com/fchollet/keras/)
 * and then translated from Python to Javascript
 *
 * Displays a progress bar.
 */
module.exports = class ProgressBar {
    constructor(target, { width = 30, verbose = 1 } = {}) {
        this.width = width;
        this.target = target;
        this.sum_values = {};
        this.unique_values = [];
        this.start = new Date;
        this.total_width = 0;
        this.seen_so_far = 0;
        this.verbose = verbose;

        this._isatty = process.stderr.isTTY;
        this._previous_pct = 0;
    }

    update(current, values=[], exact=[]) {
        for (let [k, v] of values) {
            if (!(k in this.sum_values)) {
                this.sum_values[k] = [v * (current - this.seen_so_far), current - this.seen_so_far];
                this.unique_values.push(k);
            } else {
                this.sum_values[k][0] += v * (current - this.seen_so_far);
                this.sum_values[k][1] += (current - this.seen_so_far);
            }
        }
        for (let [k, v] of exact) {
            if (!(k in this.sum_values))
                this.unique_values.push(k);
            this.sum_values[k] = [v, 1];
        }
        this.seen_so_far = current;

        if (!this._isatty) {
            const current_pct = Math.floor(current * 100 / this.target);
            if (current_pct > this._previous_pct) {
                console.error(`Progress: ${current_pct}%`);
                this._previous_pct = current_pct;
            }
            return;
        }

        const now = new Date;
        if (this.verbose === 1) {
            const prev_total_width = this.total_width;
            process.stderr.write("\b".repeat(prev_total_width));
            process.stderr.write("\r");

            const current_pct = Math.floor(current * 100 / this.target);
            let bar = `${String(current_pct).padStart(3)}%  [`;
            const prog = current / this.target;
            const prog_width = Math.floor(this.width * prog);
            if (prog_width > 0) {
                bar += '='.repeat(prog_width-1);
                if (current < this.target)
                    bar += '>';
                else
                    bar += '=';
            }
            bar += '.'.repeat(this.width-prog_width);
            bar += ']';
            process.stderr.write(bar);
            this.total_width = bar.length;

            let time_per_unit;
            if (current)
                time_per_unit = (now - this.start) / current;
            else
                time_per_unit = 0;
            const eta = time_per_unit * (this.target - current);
            let info = '';
            if (current < this.target)
                info += ` - ETA: ${Math.round(eta/1000)}s`;
            else
                info += ` - ${Math.round((now - this.start)/1000)}s`;
            for (let k of this.unique_values) {
                if (Array.isArray(this.sum_values[k]))
                    info += ` - ${k}: ${(this.sum_values[k][0] / Math.max(1, this.sum_values[k][1])).toFixed(4)}`;
                else
                    info += ` - ${k}: ${this.sum_values[k]}`;
            }

            this.total_width += info.length;
            if (prev_total_width > this.total_width)
                info += ' '.repeat(prev_total_width - this.total_width);

            process.stderr.write(info);
            if (current >= this.target)
                process.stderr.write("\n");
        }

        if (this.verbose === 2) {
            if (current >= this.target) {
                let info = Math.round((now - this.start)/1000) + 's';
                for (let k of this.unique_values)
                    info += ` - ${k} ${(this.sum_values[k][0] / Math.max(1, this.sum_values[k][1])).toFixed(4)}`;
                process.stderr.write(info + "\n");
            }
        }
    }

    add(n, values=[]) {
        this.update(this.seen_so_far+n, values);
    }
};

1	// -- mode: js; indent-tabs-mode: nil; js-basic-offset: 4 --
2	//
3	// This file is part of Genie
4	//
5	// Copyright 2017-2019 The Board of Trustees of the Leland Stanford Junior University
6	//
7	// Author: The 224N TAs
8	// Giovanni Campagna <gcampagn@cs.stanford.edu>
9	//
10	// See COPYING for details
11	"use strict";
12
13	/**
14	* Progbar class copied from keras (https://github.com/fchollet/keras/)
15	* and then translated from Python to Javascript
16	*
17	* Displays a progress bar.
18	*/
19	module.exports = class ProgressBar {	52✔
20	constructor(target, { width = 30, verbose = 1 } = {}) {	6✔
21	this.width = width;	2✔
22	this.target = target;	2✔
23	this.sum_values = {};	2✔
24	this.unique_values = [];	2✔
25	this.start = new Date;	2✔
26	this.total_width = 0;	2✔
27	this.seen_so_far = 0;	2✔
28	this.verbose = verbose;	2✔
29
30	this._isatty = process.stderr.isTTY;	2✔
31	this._previous_pct = 0;	2✔
32	}
33
34	update(current, values=[], exact=[]) {	1,994!
35	for (let [k, v] of values) {	1,994✔
36	if (!(k in this.sum_values)) {	×
37	this.sum_values[k] = [v * (current - this.seen_so_far), current - this.seen_so_far];	×
38	this.unique_values.push(k);	×
39	} else {
40	this.sum_values[k][0] += v * (current - this.seen_so_far);	×
41	this.sum_values[k][1] += (current - this.seen_so_far);	×
42	}
43	}
44	for (let [k, v] of exact) {	1,994✔
45	if (!(k in this.sum_values))	×
46	this.unique_values.push(k);	×
47	this.sum_values[k] = [v, 1];	×
48	}
49	this.seen_so_far = current;	1,994✔
50
51	if (!this._isatty) {	1,994!
52	const current_pct = Math.floor(current * 100 / this.target);	1,994✔
53	if (current_pct > this._previous_pct) {	1,994✔
54	console.error(`Progress: ${current_pct}%`);	200✔
55	this._previous_pct = current_pct;	200✔
56	}
57	return;	1,994✔
58	}
59
UNCOV 60	const now = new Date;	×
UNCOV 61	if (this.verbose === 1) {	×
UNCOV 62	const prev_total_width = this.total_width;	×
UNCOV 63	process.stderr.write("\b".repeat(prev_total_width));	×
UNCOV 64	process.stderr.write("\r");	×
65
UNCOV 66	const current_pct = Math.floor(current * 100 / this.target);	×
UNCOV 67	let bar = `${String(current_pct).padStart(3)}% [`;	×
UNCOV 68	const prog = current / this.target;	×
UNCOV 69	const prog_width = Math.floor(this.width * prog);	×
UNCOV 70	if (prog_width > 0) {	×
UNCOV 71	bar += '='.repeat(prog_width-1);	×
UNCOV 72	if (current < this.target)	×
UNCOV 73	bar += '>';	×
74	else
UNCOV 75	bar += '=';	×
76	}
UNCOV 77	bar += '.'.repeat(this.width-prog_width);	×
UNCOV 78	bar += ']';	×
UNCOV 79	process.stderr.write(bar);	×
UNCOV 80	this.total_width = bar.length;	×
81
82	let time_per_unit;
UNCOV 83	if (current)	×
UNCOV 84	time_per_unit = (now - this.start) / current;	×
85	else
86	time_per_unit = 0;	×
UNCOV 87	const eta = time_per_unit * (this.target - current);	×
UNCOV 88	let info = '';	×
UNCOV 89	if (current < this.target)	×
UNCOV 90	info += ` - ETA: ${Math.round(eta/1000)}s`;	×
91	else
UNCOV 92	info += ` - ${Math.round((now - this.start)/1000)}s`;	×
UNCOV 93	for (let k of this.unique_values) {	×
94	if (Array.isArray(this.sum_values[k]))	×
95	info += ` - ${k}: ${(this.sum_values[k][0] / Math.max(1, this.sum_values[k][1])).toFixed(4)}`;	×
96	else
97	info += ` - ${k}: ${this.sum_values[k]}`;	×
98	}
99
UNCOV 100	this.total_width += info.length;	×
UNCOV 101	if (prev_total_width > this.total_width)	×
UNCOV 102	info += ' '.repeat(prev_total_width - this.total_width);	×
103
UNCOV 104	process.stderr.write(info);	×
UNCOV 105	if (current >= this.target)	×
UNCOV 106	process.stderr.write("\n");	×
107	}
108
UNCOV 109	if (this.verbose === 2) {	×
110	if (current >= this.target) {	×
111	let info = Math.round((now - this.start)/1000) + 's';	×
112	for (let k of this.unique_values)	×
113	info += ` - ${k} ${(this.sum_values[k][0] / Math.max(1, this.sum_values[k][1])).toFixed(4)}`;	×
114	process.stderr.write(info + "\n");	×
115	}
116	}
117	}
118
119	add(n, values=[]) {	1,994✔
120	this.update(this.seen_so_far+n, values);	1,994✔
121	}
122	};

stanford-oval / genie-toolkit / 599

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous