mike-anderson

{
  "title": "Leopold FC660 Capslock to FN w/ function keys and escape",
  "rules": [
    {
      "description": "Map capslock to fn",
      "manipulators": [
        {
          "conditions": [{ "type": "device_if", "identifiers": [{
            "product_id": 257, "vendor_id": 1204
          }]}],

eatonphil

# After spending too much time away from Python on Javascript, I gave this a shot. To my surprise, it worked!
# Since Python doesn't bind "self" implicitly in classes, this looks pretty similar to Python classes.
# You want inheritance? Pass in the Parent "class" and copy the key/vals a la Javascript.
# Even adding dot syntax is not too tough.

def Cat(legs, colorId, name):
    def sayHi():
        print 'Hi, my name is %s. I have %s legs and am %s.' % (this['name'], this['legs'], this['color'])

    this = {

staltz

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

---

This tutorial as a series of videos

If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.

---

rstacruz

Get started with Ansible in 2 minutes

• http://ansibleworks.com
• https://github.com/ansible/ansible

Install Ansible

$ brew install ansible            # OSX
$ [sudo] pip install ansible # elsewhere

utek

Add this in your ini file:

[alembic:exclude]
tables = spatial_ref_sys

In env.py:

    import re 
    

paulmillr

Most active GitHub users (git.io/top)

The count of contributions (summary of Pull Requests, opened issues and commits) to public repos at GitHub.com from Wed, 21 Sep 2022 till Thu, 21 Sep 2023.

Only first 1000 GitHub users according to the count of followers are taken. This is because of limitations of GitHub search. Sorting algo in pseudocode:

githubUsers
 .filter(user => user.followers > 1000)

hrldcpr

One-line Tree in Python

Using Python's built-in defaultdict we can easily define a tree data structure:

def tree(): return defaultdict(tree)

That's it!