Skip to content

Instantly share code, notes, and snippets.

Maintainers:
ivarwithoutbones: _1password, _1password, _1password
joelburget: _1password, _1password, _1password
marsam: _1password, _1password, _1password
x86_64-darwin python37Packages.osmnx
x86_64-linux python37Packages.osmnx
i686-linux python37Packages.geopandas
x86_64-darwin python37Packages.geopandas
x86_64-darwin python38Packages.geopandas
aarch64-linux python38Packages.osmnx
aarch64-linux python37Packages.geopandas
i686-linux python38Packages.geopandas
x86_64-linux python38Packages.geopandas
x86_64-linux python38Packages.osmnx
@usingdatascience
usingdatascience / partb_svm_v3.py
Created July 6, 2020 09:12
NLP Code Examples
#!/usr/bin/env python
# coding: utf-8
# ## Module 2 :- Assignment (Part B) - Neil Chapman (matriculation number = 40416167 )
# ### (Models Learnt from Course)
# ### Import required libraries
import json
from pprint import pprint
import pandas as pd
U-Boot 1.1.3 (Feb 26 2014 - 12:49:16)
Board: Ralink APSoC DRAM: 32 MB
enable ephy clock...done. rf reg 29 = 5
SSC disabled.
spi_wait_nsec: 29
spi device id: c2 20 16 c2 20 (2016c220)
find flash: MX25L3205D
@ainani
ainani / multiple_if_elif.py
Last active July 7, 2020 08:52
An alternative to multiple if..elif..elif in Python
def map_test_cases_traditional_way(test_case: str):
print("The traditional calling...")
# Traditional if..elif..elif in Python
if test_case == 'Test_001':
test_function_001()
elif test_case == 'Test_002':
test_function_002()
elif test_case == 'Test_003':
test_function_003()
elif test_case == 'Test_004':
diff --git a/applications/ecallmgr/src/ecallmgr_originate.erl b/applications/ecallmgr/src/ecallmgr_originate.erl
index efb9dfd..140fe60 100644
--- a/applications/ecallmgr/src/ecallmgr_originate.erl
+++ b/applications/ecallmgr/src/ecallmgr_originate.erl
@@ -217,6 +217,7 @@ handle_cast({'build_originate_args'}, #state{originate_req=JObj
,action = ?ORIGINATE_PARK
,fetch_id=FetchId
,dialstrings='undefined'
+ ,control_pid = CtrlPid
}=State) ->
@jrebrown70
jrebrown70 / topological_sort.py
Created July 6, 2020 09:00
[Topological Search] General graph topological sort. #topologicalsort #graphtheory
def topological_sort(graph):
queue = Queue()
indegree_map = {}
for i in range(graph.num_vertices):
indegree_map[i] = graph.get_indegree(i)
#Add root node to the queue
if indegree_map[i] == 0:
kotlin {
// ...
sourceSets {
// ...
val jvmTest by getting {
dependencies {
implementation(kotlin("test"))
implementation(kotlin("test-junit"))
}
}
kotlin {
// ...
sourceSets {
// ...
val commonTest by getting {
dependencies {
implementation(kotlin("test-common"))
implementation(kotlin("test-annotations-common"))
}
}
@SaxonDouglass
SaxonDouglass / resume.json
Last active July 6, 2020 08:08
JSON Resume
{
"basics": {
"name": "Saxon Douglass",
"label": "Medical Officer",
"image": "https://secure.gravatar.com/avatar/32a26bc29a5369776b109f416d6f65dd",
"summary": "I am a post graduate year 5 medical officer who was passed the written examination for Basic Physician Training and now aspires to develop further skills in critical care.",
"website": "http://saxondouglass.com",
"email": "saxon@saxondouglass.com",
"location": {
"city": "Adelaide",