https://github.com/robatron/loo.js

A restroom protocol library
https://github.com/robatron/loo.js

javascript xkcd xkcd-comics

Last synced: 2 months ago
JSON representation

A restroom protocol library

• Host: GitHub
• URL: https://github.com/robatron/loo.js
• Owner: robatron
• Created: 2012-06-30T05:13:50.000Z (over 12 years ago)
• Default Branch: master
• Last Pushed: 2012-07-04T03:42:04.000Z (over 12 years ago)
• Last Synced: 2024-10-14T10:35:18.781Z (2 months ago)
• Topics: javascript, xkcd, xkcd-comics
• Language: JavaScript
• Homepage:
• Size: 117 KB
• Stars: 13
• Watchers: 3
• Forks: 3
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
loo.js

======

A restroom protocol library.

Features

--------

- Calculate the **maximum number of occupants** that can use a

  set of contiguous stalls without things getting *too* awkward

- **Choose the most socially-acceptable stall** given a set of 

  contiguous stalls and their occupant status

- **Calculate Minespeeper-like distances** away from occupied

  stalls for each empty stall so you can be as informed as 

  possible when making that imporant decision

      

Examples

--------

Let's say you have five contiguous stalls with the 0th, and 4th

stalls occupied. You can represent these stalls with an array of

Booleans, `true` for occupied, and `false` for vacant.

```JavaScript

var stalls = [true, false, false, false, true, false, false]

```

### Calculate theoretical maximum occupants (non-awkward)

Use `loo.max_occupants` to calculate the theoretical maximum

number of people that can use this set of stalls without things

getting too awkward:

```JavaScript

>>> loo.max_occupants(stalls.length)

3

```

Yes ladies, that is a closed-form function.

### Choose a stall

Which stalls are most socially-acceptable to use? 

```JavaScript

>>> loo.choose(stalls)

[2, 6]

```

The most socially-acceptable stalls to use are the 2nd and

6th stall (0-indexed), as they are the greatest distance away

from any occupied stall.

### Create a Minesweeper-like distance map

You're a decisive person. You don't need a computer choosing

things for you! But that doesn't mean you can't be informed

before making your decision.

```JavaScript

>>> loo.minesweeper(stalls)

[0, 1, 2, 1, 0, 1, 2]

```

These are the distances away from the nearest occupied stall,

for each stall, all in O(2n) time complexity.