Pat White byelipk

Random access to a given element in a collection is always O(1), or constant tine.

The notion of constant time means that the operation will always complete in one compute cycle no matter how large the data structure grows to be.

const array = [1,2,3,4,5]
const theLastElemenet = array[array.length - 1] // O(1)

const hashMap = {hello: "world"}

It is a function call with the new keyword in front of it.

	<!doctype html>
	<html>

	<head>
	<meta charset="utf-8">
	<meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1">
	<meta name="author" content="" />
	<meta name="viewport" content="width=device-width">
	<title>Box Style Change</title>

	# Flip Cards
	cards = Container.children.filter (child) ->
	child.name == "Card1" \|\|
	child.name == "Card2" \|\|
	child.name == "Card3" \|\|
	child.name == "Card4"


	for card in cards

	import React from "react";

	const callAll = (...fns) => (...args) => fns.forEach(fn => fn && fn(...args));

	class Chat extends React.Component {
	static defaultProps = {
	handleClick: () => console.log("Let's Chat"),
	stateReducer: (state, changes) => changes
	};
	initialMood = "Curious";