Made structural pattern matching practicable...

[danieldietrich]

...by reducing the amount of generated methods (per unapply method) from 11^n to 1, where n is the number of unapplied fields of an object.

Now, object trees of arbitrary(!) depth can be matched but the decomposition takes place in the first level of the object tree (the given object is level 0).

Before we could select arbitrary nodes of the object tree. That is not possible any more because it requires the patterns to return the actual arity using tuples - and therefore all possible return combinations had to be generated. This is simply not possible resp. practicable in a real-world application and soon exceeds the class file size. However, this is solved with this PR!!!

[codecov-io]

Current coverage is 95.82%

Merging #1167 into master will decrease coverage by -0.17% as of 52b01b9

@@            master   #1167   diff @@
======================================
  Files           78      77     -1
  Stmts         9063    9125    +62
  Branches      1712    1716     +4
  Methods          0       0       
======================================
+ Hit           8700    8744    +44
- Partial         90      93     +3
- Missed         273     288    +15

Review entire Coverage Diff as of 52b01b9

Powered by Codecov. Updated on successful CI builds.

[danieldietrich]

Towards #1087