| # MIT License | |
| # | |
| # Permission is hereby granted, free of charge, to any person obtaining a copy | |
| # of this software and associated documentation files (the "Software"), to deal | |
| # in the Software without restriction, including without limitation the rights | |
| # to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | |
| # copies of the Software, and to permit persons to whom the Software is | |
| # furnished to do so, subject to the following conditions: | |
| # | |
| # The above copyright notice and this permission notice shall be included in all |
| [package] | |
| name = "unimportant_if_subsumed_by_setuptools" | |
| version = "0.1.0" | |
| authors = ["Your Name Here <your@email.com>"] | |
| [lib] | |
| name = "unimportant_if_subsumed_by_setuptools" | |
| crate-type = ["cdylib"] | |
| [dependencies.cpython] |
| """ | |
| Utilities for building concurrent PyQt5 applications. | |
| """ | |
| from __future__ import absolute_import | |
| import threading | |
| import weakref | |
| import logging | |
| import warnings |
What is the simplest Go scoring system? It's this:
At the end of the game, both players will want to fill in as much of their own territory as they can, while allowing two eyes per group (so they aren't captured). Then the winner is just the player with more stones on the board. Note that prisoners are not counted.
But nobody wants to play all these extra stones at the end. So we can instead use:
| # Stick the following in the bottom of your __init__.py, then simply import the base package. Use submodules as you need them and they'll be imported as you go. | |
| import sys as _sys | |
| class Package(object): | |
| def __init__(s, local): | |
| import os.path | |
| s.cache = {} | |
| s.local = dict((k, local[k]) for k in local) | |
| s.root = os.path.realpath(os.path.dirname(s.local["__file__"])) | |
| def __getattr__(s, k): | |
| if k in s.local: return s.local[k] |
| if (`window -q -ex graphEditor1Window`) | |
| deleteUI graphEditor1Window; | |
| else | |
| tearOffPanel "Graph Editor" "graphEditor" true; |
| class Vector(object): | |
| def __init__(self, components): | |
| self.components = components | |
| self.dims = len(components) | |
| def __add__(self, other): | |
| self._check_dims(other) | |
| return self.__class__([comp1 + comp2 for comp1, comp2 in zip(self.components, other.components)]) | |
| def __sub__(self, other): |
| #![feature(macro_rules)] | |
| /// MIT license etc. etc. | |
| /// | |
| /// Experimenting with Python-like list comprehensions. | |
| /// | |
| /// An attempt to explore the possibility space for ergonomic improvements | |
| /// in Rust that can come post v1.0. Notice that there are not type declerations. | |
| /// Aside from the "c!" macro invocation, Rust allows for an exact copy of the | |
| /// Python comprehension syntax. |
| def download(url, dest): | |
| with urllib.request.urlopen(url) as response, open(dest, 'wb') as out_file: | |
| shutil.copyfileobj(response, out_file) |
| #!/bin/sh | |
| BRANCH=$1 | |
| FILE=$2 | |
| if [ -z "$BRANCH" ]; then | |
| echo "Usage: $0 <branch> <file>" | |
| exit 1 | |
| fi |
