Jeffrey Phillips Freeman freemo

I hereby claim:

To claim this, I am signing this object:

	/**
	* A Hyperassociative Map is a new type of algorithm that organizes an arbitrary
	* graph of interconnected nodes according to its associations to other nodes.
	* Once a new Hyperassociative Map has been associated and aligned, nodes that
	* are most closely associated will be closest to each other.
	* For more info, please see the
	* <a href ="http://wiki.syncleus.com/index.php/dANN:Hyperassociative_Map">
	* Hyperassociative-Map dANN Wiki page</a>.
	* @author Jeffrey Phillips Freeman
	* @param <G> The graph type

	let dividends y = tail [ quot x z \| z <- [1..(floor (sqrt (fromIntegral y)))], x <- [y, z^2], (mod y z) == 0]
	let perfect y = sum (dividends y) == y
	let perfectlist z = [y \| y <-[1..z], perfect y]

	perfectlist 4
	[1,6,28,496,8128]

	import java.util.*;

	public class AstarSearch {
	private final Map<Integer, Set<Neighbor>> adjacency;
	private final int destination;

	private final NavigableSet<Step> pending = new TreeSet<>();

	public AstarSearch(Map<Integer, Set<Neighbor>> adjacency, int source, int destination) {
	this.adjacency = adjacency;

	aws ecs register-task-definition --family load-balancer --network-mode bridge --container-definitions "$(cat container-def.json)" --volumes "$(cat volumes-def.json)"

	# Launch ECS task, when above command ran once X == 1, for every update X increases by one.
	# will have too double check docs how to get latest
	aws ecs run-task --cluster default --task-definition load-balancer:X --count 1

	if [[ "$SHLVL" -eq 1 && ! -o LOGIN && -s "${ZDOTDIR:-$HOME}/.zprofile" ]]; then
	source "${ZDOTDIR:-$HOME}/.zprofile"
	fi

	git clean -ndX #list files that would be removed
	git clean -fdX #Actually remove them