Joshua Harlow fd4772ca84 Specialize checking for overlaps ...

When merging a child graph into it's parents graph we
can specialize checking for overlaps to avoid some of
overhead of the default subgraph algorithm (which builds
a full graph, with edges) since we only care about the
number of duplicate nodes (not needing a full subgraph
with retained edges).

Change-Id: Ib211460c58efca3ddb5a254da11aafe44716a639

2015-03-05 16:54:46 -08:00

..

actions

Map optional arguments as well as required arguments

2015-02-10 22:32:38 -08:00

__init__.py

Removed copyright from empty files

2014-02-22 17:16:29 +08:00

analyzer.py

Upgrade hacking version and fix some of the issues

2014-06-13 19:27:17 -07:00

compiler.py

Specialize checking for overlaps

2015-03-05 16:54:46 -08:00

completer.py

Remove duplicate code

2015-02-04 15:57:10 +00:00

engine.py

Default to using a thread-safe storage unit

2015-02-05 23:19:08 -08:00

executor.py

Stopwatch usage cleanup/tweak

2015-01-28 16:14:54 -08:00

runner.py

Add comments to runner state machine reaction functions

2015-01-23 14:45:24 -08:00

runtime.py

Remove 'SaveOrderTask' and test state in class variables

2015-01-15 16:04:49 -08:00

scheduler.py

Make all/most usage of type errors follow a similar pattern

2015-01-23 18:25:01 -08:00

scopes.py

Add specific scoping documentation

2015-03-02 18:22:14 -08:00