After installing julia (using the standard curl ... | sh approach), this one-liner does all the project dependency installs, given the existence of a Project.toml file at .:
julia --project=. -e "using Pkg; Pkg.instantiate()"Then, this one-liner runs jupyter within a new conda environment, which is completely self-contained within julia (i.e., no need to install conda first and create a new environment for this project):
This is a simple way of using the real time json format feed from the Port Authority Trans-Hudson (PATH) rail system to get a list of when the next trains are arriving per station.
This gist uses both curl and jq, which are typically pre-installed on most computers.
curl -s https://www.panynj.gov/bin/portauthority/ridepath.json | \
jq -r \
--arg STATION "HOB" \
'.results[] | select (.consideredStation == $STATION) | .destinations[] | .messages[] | (.arrivalTimeMessage | (" " * (8 - length)) +.) + " => " + .headSign'
| ''' | |
| A simple python script to reduce or reformat a csv file, producing a | |
| csv with a specific sub-set of columns, stripping out any undesired | |
| characters from the individual row values. | |
| ''' | |
| import csv |
| #!/usr/bin/env python3 | |
| """ | |
| simple_kv_service.py | |
| A simple example of a key-value (kv) storage and lookup service, | |
| accessible over http/rest: | |
| http://[host]:[port]/set?somekey=somevalue => assigns "somevalue" to "somekey" | |
| http://[host]:[port]/get?key=somekey => looks up "somekey" and returns its value, if it exists |
| alias pdftk='$HOME/.pdftk.sh' |
| #!/usr/bin/env python | |
| """ | |
| A breadth-first search implementation from: | |
| "MIT Open CourseWare: Introduction to Algorithms" | |
| Lecture 13: Breadth-First Search | |
| https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/lecture-videos/lecture-13-breadth-first-search-bfs/ |
| #!/usr/bin/env python | |
| """ | |
| An iterative implementation of depth-first search from: | |
| "Python Algorithms: Mastering Basic Algorithms in the Python Language" | |
| by Magnus Lie Hetland | |
| ISBN: 9781484200551 |
| #!/usr/bin/env python | |
| """ | |
| An implementation of the "sliding window" technique to find shortest matching subarrays, inspired by: | |
| https://leetcode.com/problems/find-all-anagrams-in-a-string/discuss/92007/sliding-window-algorithm-template-to-solve-all-the-leetcode-substring-search-problem | |
| """ | |
| from sys import maxint |
| #!/usr/bin/env python | |
| """ | |
| An implementation of the Bellman-Form algorithm from: | |
| "Python Algorithms: Mastering Basic Algorithms in the Python Language" | |
| by Magnus Lie Hetland | |
| ISBN: 9781484200551 |
| #!/usr/bin/env python | |
| """ | |
| A breadth-first search implementation from: | |
| "Python Algorithms: Mastering Basic Algorithms in the Python Language" | |
| by Magnus Lie Hetland | |
| ISBN: 9781484200551 |