| --- | |
| - name: Redis Installation | |
| hosts: redis | |
| become: true | |
| tasks: | |
| - name: Update package repositories | |
| yum: | |
| update_cache: yes |
| - import_playbook: requirements.yml #you can find the file content in my gist | |
| - name: Provision a GCP VM | |
| hosts: localhost | |
| gather_facts: false | |
| vars: | |
| gcp_cred_file: <your json service account> | |
| gcp_project: <project-id> | |
| machine_type: "e2-medium" |
| --- | |
| - hosts: localhost | |
| connection: local | |
| gather_facts: false | |
| vars: | |
| pip_package_requirements: | |
| - "requests" | |
| - "google-auth" | |
| - "google-auth-httplib2" |
| --- | |
| - name: Redis Installation | |
| hosts: redis | |
| become: true | |
| tasks: | |
| - name: Update package repositories | |
| yum: | |
| update_cache: yes |
| - import_playbook: requirements.yml | |
| - name: Provision a GCP VM | |
| hosts: localhost | |
| gather_facts: false | |
| vars: | |
| gcp_cred_file: <path/to/serviceaccount/json/file> | |
| gcp_project: <project-id> | |
| machine_type: "e2-medium" |
| { | |
| "Log info": { | |
| "prefix": ["loginfo", "logger"], | |
| "body": ["getLogger().info(${1:info})"], | |
| "description": "Log info" | |
| }, | |
| "Log error": { | |
| "prefix": ["logerror"], | |
| "body": ["getLogger().error(${1:error})"], | |
| "description": "Log error" |
| import tensorflow as tf | |
| def get_frozen_graph(graph_file): | |
| """Read Frozen Graph file from disk.""" | |
| with tf.gfile.FastGFile(graph_file, "rb") as f: | |
| graph_def = tf.GraphDef() | |
| graph_def.ParseFromString(f.read()) | |
| return graph_def | |
| # The TensorRT inference graph file downloaded from Colab or your local machine. |
FWIW: I didn't produce the content presented here (the outline from Edmond Lau's book). I've just copy-pasted it from somewhere over the Internet, but I cannot remember what exactly the original source is. I was also not able to find the author's name, so I cannot give him/her the proper credits.
| function minimumSwaps(arr) { | |
| const visited = arr.slice(0).fill(false) | |
| let swaps = 0; | |
| for (let i = 0; i < arr.length; i++) { | |
| const start = i; | |
| let cycleFound = false; | |
| let current = i; | |
| let cycleLength = 0; | |
| if (visited[current] === false) { | |
| visited[i] = true; |
| /* | |
| JavaScript | |
| Write a mySort function which takes in an array integers, and should return an array of the inputed integers sorted such that the odd numbers come first and even numbers come last. | |
| For exampl1e: | |
| mySort( [90, 45, 66, 'bye', 100.5] ) | |
| should return | |
| [45, 66, 90, 100] |