https://hackage.haskell.org/package/tree-sitter-javaNew releases of package 'tree-sitter-java' on Hackage.http://www.rssboard.org/rss-specificationen[email protected][email protected]Tue, 12 Apr 2022 16:21:07 UTCTue, 12 Apr 2022 16:21:07 UTCrss-feedhttps://hackage.haskell.org/package/tree-sitter-java-0.7.0.3https://hackage.haskell.org/package/tree-sitter-java-0.7.0.3Tue, 12 Apr 2022 16:21:07 UTC<dl><dt>Homepage</dt><dd><a href="https://github.com/tree-sitter/haskell-tree-sitter/tree/master/tree-sitter-java">https://github.com/tree-sitter/haskell-tree-sitter/tree/master/tree-sitter-java</a></dd><dt>Author</dt><dd>Ayman Nadeem, Max Brunsfeld, Tim Clem, Rob Rix, Josh Vera, Rick Winfrey</dd><dt>Uploaded</dt><dd>by robrix at 2022-04-12T16:21:07Z</dd><dt>Maintainer</dt><dd>[email protected]</dd></dl><hr /><h1 id="v0702">v0.7.0.2</h1> <ul> <li>Support ghc 8.10. </li> </ul> <h1 id="v0700">v0.7.0.0</h1> <ul> <li>remove CodeGen and Template Haskell splice </li> <li>move contents of internal library into library and remove internal library </li> <li>add <code>getNodeTypesPath</code> to provide easier access to <code>node-types.json</code> file </li> </ul> <h1 id="v0400">v0.4.0.0</h1> <ul> <li>AST datatypes use a shared <code>Token</code> datatype for all anonymous leaves. </li> <li>Bumps the lower bound on <code>tree-sitter</code> to 0.5. </li> <li>AST named sum datatypes are represented as <code>newtype</code> wrappers around sums constructed with <code>:+:</code>. </li> <li>AST named &amp; anonymous sum types are represented as balanced binary trees of <code>:+:</code>s instead of right-chained lists. </li> <li>Rename the <code>bytes</code> field of leaves to <code>text</code>. </li> </ul> <h1 id="v0300">v0.3.0.0</h1> <ul> <li>Adds AST datatypes in <code>TreeSitter.Java.AST</code> which you can use with <code>TreeSitter.Unmarshal</code>. </li> </ul> robrixhttps://hackage.haskell.org/package/tree-sitter-java-0.7.0.2https://hackage.haskell.org/package/tree-sitter-java-0.7.0.2Mon, 13 Jul 2020 14:04:15 UTC<dl><dt>Homepage</dt><dd><a href="https://github.com/tree-sitter/haskell-tree-sitter/tree/master/tree-sitter-java">https://github.com/tree-sitter/haskell-tree-sitter/tree/master/tree-sitter-java</a></dd><dt>Author</dt><dd>Ayman Nadeem, Max Brunsfeld, Tim Clem, Rob Rix, Josh Vera, Rick Winfrey</dd><dt>Uploaded</dt><dd>by robrix at 2020-07-13T14:04:15Z</dd><dt>Maintainer</dt><dd>[email protected]</dd></dl><hr /><h1 id="v0702">v0.7.0.2</h1> <ul> <li>Support ghc 8.10. </li> </ul> <h1 id="v0700">v0.7.0.0</h1> <ul> <li>remove CodeGen and Template Haskell splice </li> <li>move contents of internal library into library and remove internal library </li> <li>add <code>getNodeTypesPath</code> to provide easier access to <code>node-types.json</code> file </li> </ul> <h1 id="v0400">v0.4.0.0</h1> <ul> <li>AST datatypes use a shared <code>Token</code> datatype for all anonymous leaves. </li> <li>Bumps the lower bound on <code>tree-sitter</code> to 0.5. </li> <li>AST named sum datatypes are represented as <code>newtype</code> wrappers around sums constructed with <code>:+:</code>. </li> <li>AST named &amp; anonymous sum types are represented as balanced binary trees of <code>:+:</code>s instead of right-chained lists. </li> <li>Rename the <code>bytes</code> field of leaves to <code>text</code>. </li> </ul> <h1 id="v0300">v0.3.0.0</h1> <ul> <li>Adds AST datatypes in <code>TreeSitter.Java.AST</code> which you can use with <code>TreeSitter.Unmarshal</code>. </li> </ul> robrixhttps://hackage.haskell.org/package/tree-sitter-java-0.7.0.1https://hackage.haskell.org/package/tree-sitter-java-0.7.0.1Thu, 20 Feb 2020 22:05:37 UTC<dl><dt>Homepage</dt><dd><a href="https://github.com/tree-sitter/haskell-tree-sitter/tree/master/tree-sitter-java">https://github.com/tree-sitter/haskell-tree-sitter/tree/master/tree-sitter-java</a></dd><dt>Author</dt><dd>Ayman Nadeem, Max Brunsfeld, Tim Clem, Rob Rix, Josh Vera, Rick Winfrey</dd><dt>Uploaded</dt><dd>by tclem at 2020-02-20T22:05:37Z</dd><dt>Maintainer</dt><dd>[email protected]</dd></dl><hr /><h1 id="v0700">v0.7.0.0</h1> <ul> <li>remove CodeGen and Template Haskell splice </li> <li>move contents of internal library into library and remove internal library </li> <li>add <code>getNodeTypesPath</code> to provide easier access to <code>node-types.json</code> file </li> </ul> <h1 id="v0400">v0.4.0.0</h1> <ul> <li>AST datatypes use a shared <code>Token</code> datatype for all anonymous leaves. </li> <li>Bumps the lower bound on <code>tree-sitter</code> to 0.5. </li> <li>AST named sum datatypes are represented as <code>newtype</code> wrappers around sums constructed with <code>:+:</code>. </li> <li>AST named &amp; anonymous sum types are represented as balanced binary trees of <code>:+:</code>s instead of right-chained lists. </li> <li>Rename the <code>bytes</code> field of leaves to <code>text</code>. </li> </ul> <h1 id="v0300">v0.3.0.0</h1> <ul> <li>Adds AST datatypes in <code>TreeSitter.Java.AST</code> which you can use with <code>TreeSitter.Unmarshal</code>. </li> </ul> tclemhttps://hackage.haskell.org/package/tree-sitter-java-0.7.0.0https://hackage.haskell.org/package/tree-sitter-java-0.7.0.0Fri, 7 Feb 2020 21:51:59 UTC<dl><dt>Homepage</dt><dd><a href="https://github.com/tree-sitter/haskell-tree-sitter/tree/master/tree-sitter-java">https://github.com/tree-sitter/haskell-tree-sitter/tree/master/tree-sitter-java</a></dd><dt>Author</dt><dd>Ayman Nadeem, Max Brunsfeld, Tim Clem, Rob Rix, Josh Vera, Rick Winfrey</dd><dt>Uploaded</dt><dd>by aymannadeem at 2020-02-07T21:51:59Z</dd><dt>Maintainer</dt><dd>[email protected]</dd></dl><hr /><h1 id="v0700">v0.7.0.0</h1> <ul> <li>remove CodeGen and Template Haskell splice </li> <li>move contents of internal library into library and remove internal library </li> <li>add <code>getNodeTypesPath</code> to provide easier access to <code>node-types.json</code> file </li> </ul> <h1 id="v0400">v0.4.0.0</h1> <ul> <li>AST datatypes use a shared <code>Token</code> datatype for all anonymous leaves. </li> <li>Bumps the lower bound on <code>tree-sitter</code> to 0.5. </li> <li>AST named sum datatypes are represented as <code>newtype</code> wrappers around sums constructed with <code>:+:</code>. </li> <li>AST named &amp; anonymous sum types are represented as balanced binary trees of <code>:+:</code>s instead of right-chained lists. </li> <li>Rename the <code>bytes</code> field of leaves to <code>text</code>. </li> </ul> <h1 id="v0300">v0.3.0.0</h1> <ul> <li>Adds AST datatypes in <code>TreeSitter.Java.AST</code> which you can use with <code>TreeSitter.Unmarshal</code>. </li> </ul> aymannadeemhttps://hackage.haskell.org/package/tree-sitter-java-0.6.1.0https://hackage.haskell.org/package/tree-sitter-java-0.6.1.0Tue, 14 Jan 2020 19:27:03 UTC<dl><dt>Homepage</dt><dd><a href="https://github.com/tree-sitter/haskell-tree-sitter/tree/master/tree-sitter-java">https://github.com/tree-sitter/haskell-tree-sitter/tree/master/tree-sitter-java</a></dd><dt>Author</dt><dd>Ayman Nadeem, Max Brunsfeld, Tim Clem, Rob Rix, Josh Vera, Rick Winfrey</dd><dt>Uploaded</dt><dd>by tclem at 2020-01-14T19:27:03Z</dd><dt>Maintainer</dt><dd>[email protected]</dd></dl><hr /><h1 id="v0400">v0.4.0.0</h1> <ul> <li>AST datatypes use a shared <code>Token</code> datatype for all anonymous leaves. </li> <li>Bumps the lower bound on <code>tree-sitter</code> to 0.5. </li> <li>AST named sum datatypes are represented as <code>newtype</code> wrappers around sums constructed with <code>:+:</code>. </li> <li>AST named &amp; anonymous sum types are represented as balanced binary trees of <code>:+:</code>s instead of right-chained lists. </li> <li>Rename the <code>bytes</code> field of leaves to <code>text</code>. </li> </ul> <h1 id="v0300">v0.3.0.0</h1> <ul> <li>Adds AST datatypes in <code>TreeSitter.Java.AST</code> which you can use with <code>TreeSitter.Unmarshal</code>. </li> </ul> tclemhttps://hackage.haskell.org/package/tree-sitter-java-0.6.0.0https://hackage.haskell.org/package/tree-sitter-java-0.6.0.0Tue, 10 Dec 2019 18:39:10 UTC<dl><dt>Homepage</dt><dd><a href="https://github.com/tree-sitter/haskell-tree-sitter/tree/master/tree-sitter-java">https://github.com/tree-sitter/haskell-tree-sitter/tree/master/tree-sitter-java</a></dd><dt>Author</dt><dd>Ayman Nadeem, Max Brunsfeld, Tim Clem, Rob Rix, Josh Vera, Rick Winfrey</dd><dt>Uploaded</dt><dd>by tclem at 2019-12-10T18:39:10Z</dd><dt>Maintainer</dt><dd>[email protected]</dd></dl><hr /><h1 id="v0400">v0.4.0.0</h1> <ul> <li>AST datatypes use a shared <code>Token</code> datatype for all anonymous leaves. </li> <li>Bumps the lower bound on <code>tree-sitter</code> to 0.5. </li> <li>AST named sum datatypes are represented as <code>newtype</code> wrappers around sums constructed with <code>:+:</code>. </li> <li>AST named &amp; anonymous sum types are represented as balanced binary trees of <code>:+:</code>s instead of right-chained lists. </li> <li>Rename the <code>bytes</code> field of leaves to <code>text</code>. </li> </ul> <h1 id="v0300">v0.3.0.0</h1> <ul> <li>Adds AST datatypes in <code>TreeSitter.Java.AST</code> which you can use with <code>TreeSitter.Unmarshal</code>. </li> </ul> tclemhttps://hackage.haskell.org/package/tree-sitter-java-0.5.0.0https://hackage.haskell.org/package/tree-sitter-java-0.5.0.0Wed, 20 Nov 2019 22:18:08 UTC<dl><dt>Homepage</dt><dd><a href="https://github.com/tree-sitter/haskell-tree-sitter/tree/master/tree-sitter-java">https://github.com/tree-sitter/haskell-tree-sitter/tree/master/tree-sitter-java</a></dd><dt>Author</dt><dd>Ayman Nadeem, Max Brunsfeld, Tim Clem, Rob Rix, Josh Vera, Rick Winfrey</dd><dt>Uploaded</dt><dd>by tclem at 2019-11-20T22:18:08Z</dd><dt>Maintainer</dt><dd>[email protected]</dd></dl><hr /><h1 id="v0400">v0.4.0.0</h1> <ul> <li>AST datatypes use a shared <code>Token</code> datatype for all anonymous leaves. </li> <li>Bumps the lower bound on <code>tree-sitter</code> to 0.5. </li> <li>AST named sum datatypes are represented as <code>newtype</code> wrappers around sums constructed with <code>:+:</code>. </li> <li>AST named &amp; anonymous sum types are represented as balanced binary trees of <code>:+:</code>s instead of right-chained lists. </li> <li>Rename the <code>bytes</code> field of leaves to <code>text</code>. </li> </ul> <h1 id="v0300">v0.3.0.0</h1> <ul> <li>Adds AST datatypes in <code>TreeSitter.Java.AST</code> which you can use with <code>TreeSitter.Unmarshal</code>. </li> </ul> tclemhttps://hackage.haskell.org/package/tree-sitter-java-0.4.0.0https://hackage.haskell.org/package/tree-sitter-java-0.4.0.0Tue, 8 Oct 2019 18:28:43 UTC<dl><dt>Homepage</dt><dd><a href="https://github.com/tree-sitter/haskell-tree-sitter/tree/master/tree-sitter-java">https://github.com/tree-sitter/haskell-tree-sitter/tree/master/tree-sitter-java</a></dd><dt>Author</dt><dd>Ayman Nadeem, Max Brunsfeld, Tim Clem, Rob Rix, Josh Vera, Rick Winfrey</dd><dt>Uploaded</dt><dd>by robrix at 2019-10-08T18:28:43Z</dd><dt>Maintainer</dt><dd>[email protected]</dd></dl><hr /><h1 id="v0400">v0.4.0.0</h1> <ul> <li>AST datatypes use a shared <code>Token</code> datatype for all anonymous leaves. </li> <li>Bumps the lower bound on <code>tree-sitter</code> to 0.5. </li> <li>AST named sum datatypes are represented as <code>newtype</code> wrappers around sums constructed with <code>:+:</code>. </li> <li>AST named &amp; anonymous sum types are represented as balanced binary trees of <code>:+:</code>s instead of right-chained lists. </li> <li>Rename the <code>bytes</code> field of leaves to <code>text</code>. </li> </ul> <h1 id="v0300">v0.3.0.0</h1> <ul> <li>Adds AST datatypes in <code>TreeSitter.Java.AST</code> which you can use with <code>TreeSitter.Unmarshal</code>. </li> </ul> robrixhttps://hackage.haskell.org/package/tree-sitter-java-0.3.0.0https://hackage.haskell.org/package/tree-sitter-java-0.3.0.0Thu, 3 Oct 2019 00:42:53 UTC<dl><dt>Homepage</dt><dd><a href="https://github.com/tree-sitter/tree-sitter-go#readme">https://github.com/tree-sitter/tree-sitter-go#readme</a></dd><dt>Author</dt><dd>Ayman Nadeem, Max Brunsfeld, Tim Clem, Rob Rix, Josh Vera, Rick Winfrey</dd><dt>Uploaded</dt><dd>by robrix at 2019-10-03T00:42:53Z</dd><dt>Maintainer</dt><dd>[email protected]</dd></dl><hr /><h1 id="v0300">v0.3.0.0</h1> <ul> <li>Adds AST datatypes in <code>TreeSitter.Java.AST</code> which you can use with <code>TreeSitter.Unmarshal</code>. </li> </ul> robrixhttps://hackage.haskell.org/package/tree-sitter-java-0.2.0.1https://hackage.haskell.org/package/tree-sitter-java-0.2.0.1Fri, 27 Sep 2019 17:19:17 UTC<dl><dt>Homepage</dt><dd><a href="https://github.com/tree-sitter/tree-sitter-go#readme">https://github.com/tree-sitter/tree-sitter-go#readme</a></dd><dt>Author</dt><dd>Ayman Nadeem, Max Brunsfeld, Tim Clem, Rob Rix, Josh Vera, Rick Winfrey</dd><dt>Uploaded</dt><dd>by robrix at 2019-09-27T17:19:17Z</dd><dt>Maintainer</dt><dd>[email protected]</dd></dl><hr />(No changelog found.)robrixhttps://hackage.haskell.org/package/tree-sitter-java-0.2.0.0https://hackage.haskell.org/package/tree-sitter-java-0.2.0.0Tue, 17 Sep 2019 14:43:50 UTC<dl><dt>Homepage</dt><dd><a href="https://github.com/tree-sitter/tree-sitter-go#readme">https://github.com/tree-sitter/tree-sitter-go#readme</a></dd><dt>Author</dt><dd>Ayman Nadeem, Max Brunsfeld, Tim Clem, Rob Rix, Josh Vera, Rick Winfrey</dd><dt>Uploaded</dt><dd>by patrick_thomson at 2019-09-17T14:43:50Z</dd><dt>Maintainer</dt><dd>[email protected]</dd></dl><hr />(No changelog found.)patrick_thomsonhttps://hackage.haskell.org/package/tree-sitter-java-0.1.0.0https://hackage.haskell.org/package/tree-sitter-java-0.1.0.0Mon, 10 Jun 2019 16:47:46 UTC<dl><dt>Homepage</dt><dd><a href="https://github.com/tree-sitter/tree-sitter-go#readme">https://github.com/tree-sitter/tree-sitter-go#readme</a></dd><dt>Author</dt><dd>Ayman Nadeem, Max Brunsfeld, Tim Clem, Rob Rix, Josh Vera, Rick Winfrey</dd><dt>Uploaded</dt><dd>by patrick_thomson at 2019-06-10T16:47:46Z</dd><dt>Maintainer</dt><dd>[email protected]</dd></dl><hr />(No changelog found.)patrick_thomson