RCHowell

[Schema]

val schema = Frameworks.createRootSchema(false)
val playersType = RelDataTypeFactory.Builder(typeFactory)
  .add("id", SqlTypeName.INTEGER)
  .add("fname", SqlTypeName.VARCHAR)
  .add("lname", SqlTypeName.VARCHAR)
  .add("age", SqlTypeName.DOUBLE)
  .add("weight", SqlTypeName.DOUBLE)
 .add("height", SqlTypeName.DOUBLE)

RCHowell

package main

import (
	"image"
	"image/color"
	"image/color/palette"
	"image/gif"
	"math"
	"math/cmplx"
	"os"

RCHowell

package main

import (
	"bufio"
	"fmt"
	"os"

	"golang.org/x/net/html"
)

RCHowell

import numpy as np
import functools as func
import itertools as itertools

# spcx::Set<Tuple> --> int
def vertex_count(spcx):
  # Reduce Set to max value amongst Tuples in the set
  return func.reduce(lambda acc, e: max(acc, max(e)), spcx, 0) + 1

# spcx::Set<Tuple>, n::int --> Dict<Tuple, int>

RCHowell

// Test Information Source from
// 'Introduction to Coding & Information Theory'
// By Steven Roman 1997

// This is a method I came up with while solving exercise 2.2.7
// All bets are off on optimization, but it's not too shabby

// Example Information Source
const infoSourceNodes = [
  {symb: 'a', prob: 0.35},

RCHowell

// Usage
// node birthday.js <TRIALS> <PEOPLE>

const TRIALS = process.argv[2];
const PEOPLE = process.argv[3];

// Using a Map to count uniqueness in linear time
let counts = {};
let uniqueTotal = 0;

RCHowell

// sending to sender-client only
socket.emit('message', "this is a test");

// sending to all clients, include sender
io.emit('message', "this is a test");

// sending to all clients except sender
socket.broadcast.emit('message', "this is a test");

// sending to all clients in 'game' room(channel) except sender