Add license and publish version 0.1.0

Author: stanch

LICENSE

@@ -0,0 +1,8 @@
+The MIT License (MIT)
+Copyright (c) 2016 Nick Stanchenko
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

README.md

@@ -108,6 +108,14 @@ the [tutorial](TUTORIAL.md).
 
 ### Usage
 
+Include these lines in your `build.sbt`:
+
+```scala
+resolvers += Resolver.bintrayRepo("stanch", "maven")
+
+libraryDependencies += "org.stanch" %% "zipper" % "0.1.0"
+```
+
 #### Unzip
 
 In order for the Zipper to work on your data structure `Tree`, you need an implicit instance of `Unzip[Tree]`.
@@ -129,7 +137,7 @@ scala> case class Tree(x: Int, c: Vector[Tree] = Vector.empty)
 defined class Tree
 
 scala> implicit val unzip = Unzip.For[Tree, Vector].derive
-unzip: zipper.Unzip[Tree] = zipper.GenericUnzipInstances$For$$anon$2@249f9a91
+unzip: zipper.Unzip[Tree] = zipper.GenericUnzipInstances$For$$anon$2@200d382
 ```
 
 The automatic derivation is powered by [shapeless](https://github.com/milessabin/shapeless).

TUTORIAL.md

@@ -81,7 +81,7 @@ assert(tree2b == tree2)
 
 The power of Zipper becomes apparent when we go one or more levels deep.
 To move down the tree, we “unzip” it, separating the child nodes into
-the focused node and left and right siblings:
+the focused node and its left and right siblings:
 
 ```scala
 val zipper2 = zipper1.moveDownLeft

build.sbt

@@ -1,5 +1,11 @@
+organization := "org.stanch"
+
 name := "zipper"
 
+version := "0.1.0"
+
+licenses += ("MIT", url("http://opensource.org/licenses/MIT"))
+
 scalaVersion := "2.11.7"
 
 resolvers += Resolver.bintrayRepo("stanch", "maven")

project/plugins.sbt

@@ -1,3 +1,5 @@
 addSbtPlugin("org.scoverage" % "sbt-scoverage" % "1.3.5")
 
 addSbtPlugin("org.tpolecat" % "tut-plugin" % "0.4.2")
+
+addSbtPlugin("me.lessis" % "bintray-sbt" % "0.3.0")

src/main/tut/README.md

@@ -108,6 +108,14 @@ the [tutorial](TUTORIAL.md).
 
 ### Usage
 
+Include these lines in your `build.sbt`:
+
+```scala
+resolvers += Resolver.bintrayRepo("stanch", "maven")
+
+libraryDependencies += "org.stanch" %% "zipper" % "0.1.0"
+```
+
 #### Unzip
 
 In order for the Zipper to work on your data structure `Tree`, you need an implicit instance of `Unzip[Tree]`.

src/main/tut/TUTORIAL.md

@@ -89,7 +89,7 @@ assert(tree2b == tree2)
 
 The power of Zipper becomes apparent when we go one or more levels deep.
 To move down the tree, we “unzip” it, separating the child nodes into
-the focused node and left and right siblings:
+the focused node and its left and right siblings:
 
 ```tut:silent
 val zipper2 = zipper1.moveDownLeft