kaminski-tomasz

function buttonListener(event) {
    console.log(this + ' clicked!');
    console.log('this === currentTarget:', this === event.currentTarget);
    console.log('this === target:', this === event.currentTarget);
}

const button = document.querySelector('#btn');
button.addEventListener('click', buttonListener);

kaminski-tomasz

const superagent = require("superagent");
const ExcelJS = require('exceljs');

const CORONA_API = 'https://coronavirus-tracker-api.herokuapp.com';

/**
 * @typedef {{
 *      id: number,
 *      name: string,
 *  }} Country

kaminski-tomasz

Rozdział 0 - Wprowadzenie

Połączenie z MongoDB (z kursu):

mongo "mongodb://cluster0-shard-00-00-jxeqq.mongodb.net:27017,cluster0-shard-00-01-jxeqq.mongodb.net:27017,cluster0-shard-00-02-jxeqq.mongodb.net:27017/aggregations?replicaSet=Cluster0-shard-0" \
    --authenticationDatabase admin \
    --ssl -u m121 -p aggregations --norc

kaminski-tomasz

import { maxBy, minBy, sumBy } from "lodash-es";

export const Random = {
  /** @returns {number} */
  getRandom() {
    return Math.random();
  },
  /**
   * The maximum is exclusive and the minimum is inclusive
   *

kaminski-tomasz

/* Random utilities */
export class Random {
  static getRandom() {
    return Math.random();
  }

  static getRandomInt(min: number, max: number) {
    min = Math.ceil(min);
    max = Math.floor(max);
    return Math.floor(Math.random() * (max - min) + min);

kaminski-tomasz

import {differenceWith, isEqual} from "lodash";

export type BitArray = (0 | 1)[];

/**
 * Your task is to implement iterative version of recursive algorithm 
 * that generates all binary numbers (called "variations" here)
 * in the form (0 | 1)[] for given length, but which aren't starting 
 * with given `ignoredPattern` (see FIXME below).
 *

kaminski-tomasz

#define SEG_C 4
#define SEG_E 21
#define SEG_D 20
#define SEG_B 0
#define SEG_G 3
#define SEG_A 2
#define SEG_F 1
 
#define DISP_4 19
#define DISP_3 18