devgru

{
  "title": "Run apps",
  "rules": [
    {
      "description": "Run Safari",
      "manipulators": [
        {
          "from": {
            "key_code": "left_command",
            "modifiers": {

devgru

license: gpl-3.0

devgru

license: gpl-3.0

devgru

license: gpl-3.0

devgru

license: mit

devgru

Keybase proof

I hereby claim:

• I am devgru on github.
• I am devgru (https://keybase.io/devgru) on keybase.
• I have a public key whose fingerprint is CAAA 4087 855D AB51 327E 9372 9804 3402 64BA EDD9

To claim this, I am signing this object:

devgru

Forked from https://gist.github.com/veltman/403f95aee728d4a043b142c52c113f82

Implementing a variation of Joachim Ungar's curved label placement method described here. The basic process is:

1. Turn the shape into a polygon of evenly-spaced points.
2. Generate a Voronoi diagram of those points.
3. Clip the edges.
4. Turn the edges into a graph.
5. Find the "longest shortest path" between any pair of perimeter nodes.
6. Smooth/simplify that path a bit.

devgru

license: gpl-3.0
height: 960

devgru

border: no
license: gpl-3.0

devgru

license: mit