 
 	static func fib(_ n:Int) -> BInt
 	{
-		var a: Limbs = [0]
-		var b: Limbs = [1]
-		var t: Limbs
+		var a: Limbs = [0], b: Limbs = [1], t: Limbs
 
 		for _ in 2...n
 		{


	fileprivate static func euclid(_ a: Limbs, _ b: Limbs) -> Limbs
	{
		var a = a
		var b = b
		while !b.equalTo(0)
		{
			(a, b) = (b, a.divMod(b).remainder)
		}

		return a
	}


				}
				else
				{
					if i != j { res.addOneLimb(mulLo, padding: i + j) }
					res.addOneLimb(mulLo, padding: i + j)
				}
			}
		}
