| #!/usr/bin/env python | |
| ### Import required python libraries | |
| import os | |
| import time | |
| import shutil | |
| from boto.s3.connection import S3Connection | |
| from boto.s3.key import Key |
| import ldap | |
| def check_credentials(username, password): | |
| """Verifies credentials for username and password. | |
| Returns None on success or a string describing the error on failure | |
| # Adapt to your needs | |
| """ | |
| LDAP_SERVER = 'ldap://xxx' | |
| # fully qualified AD user name | |
| LDAP_USERNAME = '%s@xxx.xx' % username |
A collection of anything from basics to advanced recommended methods and usages with Django REST Framework for creating browsable and awesome web API's. This could also serve as a quick reference guide.
Here is DRF's official documentation in case you need everything in detail.
Summarized from the official docs:
| import numpy as np | |
| import cv2 | |
| def sp_noise(image, prob): | |
| ''' | |
| Add salt and pepper noise to image | |
| prob: Probability of the noise | |
| ''' | |
| output = image.copy() |
| Task 1: Create a project jumphost instance | |
| Navigation menu > Compute engine > VM Instance | |
| Task 2: Create a Kubernetes service cluster | |
| gcloud config set compute/zone us-east1-b | |
| gcloud container clusters create nucleus-webserver1 |
| // We can use stl container list as a double | |
| // ended queue to store the cache keys, with | |
| // the descending time of reference from front | |
| // to back and a set container to check presence | |
| // of a key. But to fetch the address of the key | |
| // in the list using find(), it takes O(N) time. | |
| // This can be optimized by storing a reference | |
| // (iterator) to each key in a hash map. | |
| #include <bits/stdc++.h> | |
| using namespace std; |
| // http://www.geeksforgeeks.org/inorder-predecessor-successor-given-key-bst/ | |
| // http://code.geeksforgeeks.org/NvtCcP | |
| Input: root node, key | |
| output: predecessor node, successor node | |
| /* | |
| 1. If root is NULL | |
| then return | |
| 2. if key is found then | |
| a. If its left subtree is not null | |
| Then predecessor will be the right most |
| // create file: | |
| sudo vim /usr/share/applications/intellij.desktop | |
| // add the following | |
| [Desktop Entry] | |
| Version=13.0 | |
| Type=Application | |
| Terminal=false | |
| Icon[en_US]=/home/rob/.intellij-13/bin/idea.png | |
| Name[en_US]=IntelliJ |
