improving incremental compilation

support lazy arguments in data type generator
SafeLazy implementation that explicitly clears the reference to the thunk
in API representation, drop synthetic modifier and merge deferred into abstract
handle cyclic structures in API generation, display, comparison, persistence
gzip compile cache file
bump to 2.8.1.RC3, project definition cleanup
fix main method detection to check for the right name
properly view inherited definitions
exclude constructors of ancestors

interface/definition

@@ -14,8 +14,8 @@ Definition
 			returnType: Type
 		ClassLike
 			definitionType: DefinitionType
-			selfType: Type
+			selfType: ~Type
-			structure: Structure
+			structure: ~Structure
 		TypeMember
 			TypeAlias
 				tpe: Type

interface/other

@@ -20,13 +20,11 @@ Qualifier
 
 Modifiers
 	isAbstract: Boolean
-	isDeferred: Boolean
 	isOverride: Boolean
 	isFinal: Boolean
 	isSealed: Boolean
 	isImplicit: Boolean
 	isLazy: Boolean
-	isSynthetic: Boolean
 
 ParameterList
 	parameters: MethodParameter*

interface/src/main/java/xsbti/api/Lazy.java

@@ -0,0 +1,9 @@
+/* sbt -- Simple Build Tool
+ * Copyright 2008, 2009  Mark Harrah
+ */
+package xsbti.api;
+
+public interface Lazy<T>
+{
+	T get();
+}

interface/type

@@ -3,7 +3,7 @@ Type
 	SimpleType
 		Projection
 			prefix : SimpleType
-			id : String
+			id: String
 		ParameterRef
 			id: Int
 		Singleton
@@ -16,9 +16,9 @@ Type
 		baseType : SimpleType
 		annotations : Annotation*
 	Structure
-		parents : Type*
+		parents : ~Type*
-		declared: Definition*
+		declared: ~Definition*
-		inherited: Definition*
+		inherited: ~Definition*
 	Existential
 		baseType : Type
 		clause: TypeParameter*

util/collection/Relation.scala

@@ -38,7 +38,9 @@ trait Relation[A,B]
 	def _1s: collection.Set[A]
 	/** Returns the set of all _2s such that (_1, _2) is in this relation. */
 	def _2s: collection.Set[B]
-	
+	/** Returns the number of pairs in this relation */
+	def size: Int
+
 	/** Returns all pairs in this relation.*/
 	def all: Traversable[(A,B)]
 	
@@ -57,6 +59,8 @@ private final class MRelation[A,B](fwd: Map[A, Set[B]], rev: Map[B, Set[A]]) ext
 
 	def _1s = fwd.keySet
 	def _2s = rev.keySet
+
+	def size = fwd.size
 	
 	def all: Traversable[(A,B)] = fwd.iterator.flatMap { case (a, bs) => bs.iterator.map( b => (a,b) ) }.toTraversable