dijonkitchen

Decision Record YYYY-MM-DD: Title

Status timeline

YYYY-MM-DD: Proposed by stakeholder(s)...

YYYY-MM-DD: Rejected by stakeholder(s)...

YYYY-MM-DD: Accepted by stakeholder(s)...

dijonkitchen

graph TB
    HE[Hip escape] --> OG
    EE[Elbow escape] --> OG
    SC --> EE
    SC --> HE
    BG[Butterfly guard] --> S
    BG --> CSB
    S[Standing] --> OG[Open guard]
    S --> RP[Russian]

dijonkitchen

flowchart TD
    Investors(Investor LPs, LLC) --> |Capital| Fund1
    Investors --> Fund2

    Fund1(Fund I, LP) --> |Buys| Co1(C Corp 1)
    Co1 --> |FCF| Fund1
    
    Fund1 --> Co2(C Corp 2)
 Co2 --> Fund1

dijonkitchen

/**
 * @param {number} capacity
 */
var LRUCache = function(capacity) {
  this.capacity = capacity
  this.cache = []
  this.dictionary = {}
};

/** 

dijonkitchen

// Inputs: List of names
// Outputs: Groups of size 3-5, randomized

// Pseudocode:
// Take array of names
// Shuffle this array
// Split into groups
// Check if length is less than 3
    // Return randomized list
// Split shuffled array into groups of 3-5

dijonkitchen

const distance = (point1, point2) => {
  return Math.sqrt(Math.pow(point2[0] - point1[0], 2) + Math.pow(point2[1] - point1[1],2))
}

const nearestPoints = (basePoint, pointList, numberOfNearestWanted) => {
  const pointDistances = pointList.map(point => {
    return {
      point,
      distance: distance(basePoint, point)
    }

dijonkitchen

# User story:
# Use a built-in ruby structure for pets (name, type)
# Harry is a dog,
# Rufus is a cat,
# Jane is a chimp,
# Sally is a snake,
# Ernie is a chimp,
# Melvin is a hamster

pets = {"Harry"=>"dog",