| # sudo nano /lib/systemd/system/nm-resume.service | |
| # sudo systemctl enable nm-resume.service | |
| [Unit] | |
| Description=Restart NetworkManager at resume | |
| After=suspend.target | |
| After=hibernate.target | |
| After=hybrid-sleep.target | |
| [Service] | |
| ExecStart=/bin/systemctl --no-block restart NetworkManager.service |
| # Untested | |
| def merge(dict_a, dict_b, **kwargs): | |
| assert isinstance(dict_a, dict), \ | |
| "A dict was expected in %s" % kwargs.pop('node_name', 'first param') | |
| for k, v in dict_b.items(): | |
| if isinstance(v, dict): | |
| merge(dict_a.setdefault(k, {}), v, node_name=k) | |
| continue |
| import asyncio | |
| @asyncio.coroutine | |
| def read_header(reader): | |
| while True: | |
| try: | |
| data = yield from reader.readline() | |
| except ConnectionResetError: | |
| return |
| def compose(*funcs): | |
| """ | |
| Compose N functions into one.\ | |
| The returned values for a function\ | |
| are the received parameters for the next function | |
| Usage:: | |
| def parse(request_line_raw): | |
| parser = compose( |
| """ | |
| Problem Statement | |
| You are given two s: N and K. Lun the dog is interested in strings that satisfy the following conditions: | |
| The string has exactly N characters, each of which is either 'A' or 'B'. | |
| The string s has exactly K pairs (i, j) (0 <= i < j <= N-1) such that s[i] = 'A' and s[j] = 'B'. | |
| If there exists a string that satisfies the conditions, find and return any such string. Otherwise, return an empty string. | |
| Definition |
| """ | |
| Problem Statement | |
| One day, Jamie noticed that many English words only use the letters A and B. Examples of such words include "AB" (short for abdominal), "BAA" (the noise a sheep makes), "AA" (a type of lava), and "ABBA" (a Swedish pop sensation). | |
| Inspired by this observation, Jamie created a simple game. You are given two s: initial and target. The goal of the game is to find a sequence of valid moves that will change initial into target. There are two types of valid moves: | |
| Add the letter A to the end of the string. | |
| Reverse the string and then add the letter B to the end of the string. |
| # -*- coding: utf-8 -*- | |
| from __future__ import unicode_literals | |
| from django.apps import AppConfig | |
| class ChildAppConfig(AppConfig): | |
| name = 'child_app' |
| SAFE_PROTOCOLS = {'http', 'https'} | |
| def escape(text): | |
| return (text | |
| .replace('&', '&') | |
| .replace('<', '<') | |
| .replace('>', '>') | |
| .replace('"', '"') | |
| .replace("'", ''')) |
Embedders of V8 should generally use the head of the branch corresponding to the minor version of V8 that ships in Chrome.
To find out what version this is,
| # -*- coding: utf-8 -*- | |
| """ | |
| Tested on python 3.5 | |
| Duplicated Files Finder | |
| ----------------------- | |
| This skips files with a unique size, then group by size\ | |
| and does chunk-by-chunk (bytes-by-bytes) comparison to\ |