Let machine M be the Main machine with the repo, and A the Auxiliary machine which wants to help out.
- Machine M creates bundle with complete repo:
git bundle create repo.bundle HEAD master
- M sends
repo.bundle
to A. - A clones repo from bundle:
""" | |
Note that this constrains the dependent variable from going *any further* past the constraints. | |
The ODE will still treat it as if it were at the value of the constraint, | |
and with a small step size any problems should be minimal, | |
but you may still have slightly out-of-range numbers in your solution. | |
""" | |
import numpy as np | |
from functools import wraps |
Puts on glasses: | |
(•_•) | |
( •_•)>⌐■-■ | |
(⌐■_■) | |
Takes off glasses ("mother of god..."): | |
(⌐■_■) | |
( •_•)>⌐■-■ |
This document is research for the selection of a communication platform for robot-net.
The purpose of this component is to enable rapid, reliable, and elegant communication between the various nodes of the network, including controllers, sensors, and actuators (robot drivers). It will act as the core of robot-net to create a standardized infrastructure for robot control.
Requirements:
# By Jake VanderPlas | |
# License: BSD-style | |
import matplotlib.pyplot as plt | |
import numpy as np | |
def discrete_cmap(N, base_cmap=None): | |
"""Create an N-bin discrete colormap from the specified input map""" |
import music21 | |
import itertools | |
from random import randint | |
MIN_REPETITIONS = 4 | |
MAX_REPETITIONS = 10 | |
NUMBER_OF_PARTS = 10 | |
motives = ['e4 e e', 'e8 f8 e4', 'r8 e f e', 'r8 e f g', 'e8 f g r', |