This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from dagster import pipeline, solid, RepositoryDefinition, InputDefinition, execute_pipeline_iterator, DagsterInstance | |
@solid(input_defs=[InputDefinition("number", int)]) | |
def my_solid(context, number): | |
context.log.info("Number: {}".format(number)) | |
# Stop condition to prevent infinite recursion | |
if number == 5: | |
return |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/python | |
from datetime import datetime, timedelta | |
from string import Template | |
going_text = \ | |
"""JFK, Seville, 284, 1 stop, Mon 8/13 11:25 PM, 7h in Lisbon, Tue 8/14 3:35 PM, TAP | |
JFK, Madrid, 284, 1 stop, Mon 8/13 11:25 PM, 7h in Lisbon, Tue 8/14 9:20 PM, TAP | |
JFK, Madrid, 298, 2 stop, Wed 8/15 11:25 PM, 1h 45m in in Lisbon; 6h 15m in Porto, Thu 8/16 10:25 PM, TAP | |
JFK, Madrid, 263, 2 Stop, Sun 8/19 11:25 PM, 1h 45m in in Lisbon; 6h 15m in Porto, Mon 8/20 10:25 PM, TAP |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Length: 9 days :: 08/13 - 08/22 | |
Going: JFK to Seville [$284] on TAP | |
departure: Mon 8/13 11:25 PM | |
stops: 1 stop 7h in Lisbon | |
arrival: Tue 8/14 3:35 PM | |
Return: Madrid to JFK [$344] on Norwegian | |
departure: Wed 8/22 3:00 PM | |
stops: 1 Stop 1h in Copenhagen | |
arrival: Wed 8/22 9:30 PM | |
Total: $628 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
ubuntu@ip-172-31-71-84:~/lapstyle$ th lap_style.lua -style_image images/flowers.png -content_image images/megan.png -output_image output/megan_flowers20_100.png -content_weight 20 -lap_layers 2 -lap_weights 100 | |
[libprotobuf WARNING google/protobuf/io/coded_stream.cc:537] Reading dangerously large protocol message. If the message turns out to be larger than 1073741824 bytes, parsing will be halted for security reasons. To increase the limit (or to disable these warnings), see CodedInputStream::SetTotalBytesLimit() in google/protobuf/io/coded_stream.h. | |
[libprotobuf WARNING google/protobuf/io/coded_stream.cc:78] The total number of bytes read was 574671192 | |
Successfully loaded models/VGG_ILSVRC_19_layers.caffemodel | |
conv1_1: 64 3 3 3 | |
conv1_2: 64 64 3 3 | |
conv2_1: 128 64 3 3 | |
conv2_2: 128 128 3 3 | |
conv3_1: 256 128 3 3 | |
conv3_2: 256 256 3 3 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var surveys = { | |
"mental_wellness": { | |
intro: "Hey. I'm going to ask you a couple questions about your mental health", | |
questions: ["On a scale of 1 - 10, how are you feeling today.", "Has anyone hurt you?", "Answer yes or no to this question?"], | |
exit: "Thanks so much!" | |
} | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
const ProductList = React.createClass({ | |
getInitialState: function() { | |
return { | |
products: [], | |
}; | |
}, | |
componentDidMount: function() { | |
this.updateState(); | |
}, | |
updateState: function() { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#ZSH | |
alias zshconfig="subl ~/.zshrc" | |
alias zconfig="sublime ~/.zsh" | |
alias zsource="source ~/.zshrc" | |
alias zalias="subl ~/.zsh/aliases.zsh" | |
alias ohmyzsh="subl ~/.oh-my-zsh" | |
#aliases | |
alias aliasl="cat ~/.zsh/aliases.zsh" |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
######################## | |
## Sashank Thupukari # | |
## 11/21/2014 # | |
## Pd. 6 # | |
######################## | |
SIZE = 4 | |
class Cell(object): | |
def __init__(self, val, r, c, matrix): |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
0 +1 *2 +2 +2 *3 -1 -1 -3 -2 *3 -1 -3 -1 -2 -3 -3 -1 -3 -2 -1 -3 *2 -2 -3 -1 -2 -2 *2 -3 -1 -3 -2 +3 -1 -3 +1 *3 -1 -1 -1 -3 -3 -2 -2 -2 -3 -1 -1 -1 -2 +3 -3 *2 -2 -3 -1 -3 +1 -2 +3 -3 *2 -2 -1 -1 -1 -3 -1 +2 -3 +1 +1 -2 *2 -2 -3 -2 -2 +3 -3 *1 *3 -2 -2 -2 -3 -1 -2 -2 -3 -1 -3 -2 *2 -2 -1 -3 -2 -3 *3 -15 | |
0 *3 +3 +1 +3 *1 +3 -3 *3 -3 -2 -3 -3 -2 +1 -2 *3 -2 -1 -3 -3 -2 -2 *3 -1 -3 -3 -2 -2 -2 -3 +1 -1 *3 -3 -3 -1 -1 -1 -3 -3 -1 +2 -1 -2 +1 +3 -1 -1 -2 *2 -3 -2 -3 *2 -1 -2 -2 +1 +2 -1 -1 +2 -3 +2 -3 +3 -2 *2 -3 -2 -2 *2 -1 -2 -2 -2 +2 -2 *3 -2 -2 -3 -1 -3 -1 -3 *3 -1 -2 -1 -2 -2 -1 -2 *2 -2 -3 -2 +3 -3 +2 | |
0 *1 *3 +1 +2 *2 -2 +2 -1 *3 -2 -3 -1 -3 -3 *2 -2 +3 -1 -1 *3 -3 -3 -2 -2 +2 -2 *3 -1 -3 -1 -3 -2 +1 -3 +2 *1 *1 +2 -1 -3 *1 +3 -1 *2 -2 -3 *3 -1 -3 -1 -1 -1 -2 -1 *3 -3 -3 -1 -3 *1 +3 -1 -3 *2 -2 -2 *1 *2 -3 +2 -3 *1 +3 -2 +3 -3 *3 -2 -1 -3 -2 -3 *3 -3 -1 -1 -3 +1 +2 -3 *3 -3 -1 -3 +2 -3 *2 -3 *2 -3 -1 | |
0 *1 *3 *3 +3 *1 *2 *3 -3 -2 -1 -1 -3 *2 -1 -1 -2 -1 -2 *2 -3 -1 -2 -2 +1 -1 *3 -3 -2 -3 -2 -3 -1 -1 -2 -1 - |