Update README

Different layout and a link to the webpage
Merge pull request #1 from kaptoxic/feat/metadata

Update README
Add scalastyle checking

Standard scalastyle official config (from its website)
Add project metadata

Organization info
Fix sbt build

Allowed reporting of warnings in the build
Chain combinator operands swap

It seems more natural to have higher-order enumerator on the right
(similar to monadic bind, as pointed out by the reviewers for the
Scala'14 paper)
Benchmarks for measuring memoization effects

Benchmarks for Binary Search Trees without memoization
Benchmark run command 'bench slow' (note: for larger sizes the run may
take long time to finish)
Tests for measuring enumeration times for without memoization are
deprecated
Merge branch 'feat/showcase' into develop

Conflicts:
	src/bench/test/scala/insynth/enumeration/benchmarks/BenchmarkSuite.scala
Major code refactoring

Removed unecessary packages (leftovers from InSynth)
Changed all packages names from insynth to scife
Improve ScalaStyle checking

Update ScalaStyle version
ScalaStyle configuration modified
Added ScalaStyle nature to the Eclipse project
Fixed sources according to some style rules
Update to Scala 2.10.4
Merge branch 'develop' into feat/metadata

Conflicts:
	project/Build.scala
	src/bench/test/scala/scife/enumeration/benchmarks/BenchmarkSuite.scala
	src/main/scala/scife/enumeration/Enum.scala
	src/main/scala/scife/enumeration/Finite.scala
	src/main/scala/scife/enumeration/dependent/Depend.scala
	src/test/scala/insynth/enumeration/dependent/DependentTest.scala
	src/test/scala/scife/enumeration/benchmarks/DependentBenchmark.scala
	src/test/scala/scife/enumeration/showcase/BinarySearchTree.scala
Add (and refactored) inverse of enumeration

Changed Reverse interface (now invariant in type)
Added implementation of basic combinators
Added tests for product and maps
Add inverse of dependent enumerators

Fixed ReverseDependent interface
Added implementation and tests of some dependent finite combinators
Add testcases for inversion

Reverse enumeration for sorted lists and binary search trees
Add enumerators with membership query

Subtly different (and weaker) than reverse/fforward
Add membership for dependent enumerators
Add more tests and testcases for membership

Analogous tests and examples to thhose for reverse
Refactoring of tests

Make tests faster
Additional testcase for membership
Memoization and refactoring

Modified memoization code and made it testable
Small refactorings