BigNum.swift 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227
  1. //
  2. // BigNum.swift
  3. // Swifter
  4. //
  5. // Copyright © 2016 Damian Kołakowski. All rights reserved.
  6. //
  7. import Foundation
  8. public struct BigNum: Equatable, Comparable {
  9. //
  10. // Big Integer
  11. //
  12. // TODO/Improvments
  13. // - add init(...) for string literal
  14. // - add powmod operation
  15. // - fix '+' and '-' operators for negative numbers
  16. internal var digits = [UInt8]()
  17. internal var signum = 0
  18. internal init(_ digits: [UInt8], _ signum: Int) {
  19. self.digits.append(contentsOf: digits)
  20. self.signum = signum
  21. }
  22. internal init(_ digits: ArraySlice<UInt8>, _ signum: Int) {
  23. self.digits.append(contentsOf: digits)
  24. self.signum = signum
  25. }
  26. public init(_ text: String) {
  27. self.signum = text.unicodeScalars.isEmpty ? 0 : 1
  28. for c in text.unicodeScalars.reversed() {
  29. switch c.value {
  30. case 48...57:
  31. self.digits.append(UInt8(c.value-48))
  32. case 45:
  33. self.signum = -1
  34. default: break
  35. }
  36. }
  37. }
  38. }
  39. infix operator == { }
  40. public func == (_ left: BigNum, right: BigNum) -> Bool {
  41. return (left.digits == right.digits) && (left.signum == right.signum)
  42. }
  43. infix operator != { }
  44. public func != (_ left: BigNum, right: BigNum) -> Bool {
  45. return !(left.digits == right.digits)
  46. }
  47. infix operator + { }
  48. public func + (_ left: BigNum, _ right: BigNum) -> BigNum {
  49. var result = [UInt8]()
  50. var carry: UInt8 = 0
  51. for i in 0..<max(left.digits.count, right.digits.count) {
  52. let sum = (((i < left.digits.count) ? left.digits[i] : 0) +
  53. ((i < right.digits.count) ? right.digits[i] : 0)) + carry
  54. if sum >= 10 {
  55. carry = sum / 10
  56. result.append(sum - 10)
  57. } else {
  58. carry = 0
  59. result.append(sum)
  60. }
  61. }
  62. if carry != 0 {
  63. result.append(carry)
  64. }
  65. return BigNum(result, 1)
  66. }
  67. infix operator - { }
  68. public func - (_ left: BigNum, _ right: BigNum) -> BigNum {
  69. var result = [UInt8]()
  70. var carry: Int = 0
  71. for i in 0..<max(left.digits.count, right.digits.count) {
  72. let sub = (Int((i < left.digits.count) ? left.digits[i] : 0) -
  73. Int((i < right.digits.count) ? right.digits[i] : 0)) + carry
  74. if sub < 0 {
  75. carry = -1
  76. result.append(UInt8(10+sub))
  77. } else {
  78. carry = 0
  79. result.append(UInt8(sub))
  80. }
  81. }
  82. while let last = result.last, last == 0 { result.removeLast() }
  83. return BigNum(result, 1)
  84. }
  85. infix operator * { }
  86. public func * (_ left: BigNum, _ right: BigNum) -> BigNum {
  87. if (left.signum == 0) || (right.signum == 0) {
  88. return BigNum([], 0)
  89. }
  90. var mulResults = Array<[UInt8]>()
  91. for i in 0..<left.digits.count {
  92. var row = [UInt8](repeating: 0, count: i)
  93. var carry: UInt8 = 0
  94. for j in 0..<right.digits.count {
  95. let mul = (left.digits[i] * right.digits[j]) + carry
  96. if mul > 9 {
  97. carry = mul / 10
  98. row.append(mul % 10)
  99. } else {
  100. carry = 0
  101. row.append(mul)
  102. }
  103. }
  104. if carry != 0 {
  105. row.append(carry % 10)
  106. if carry > 9 { row.append(carry / 10) }
  107. }
  108. mulResults.append(row)
  109. }
  110. var sum = mulResults.reduce(BigNum([0], 1)) { $0.partialResult + BigNum($0.1, 1) }
  111. sum.signum = left.signum * right.signum
  112. return sum
  113. }
  114. infix operator / { }
  115. public func / (_ left: BigNum, _ right: BigNum) -> (quotient: BigNum, reminder: BigNum) {
  116. if left < right {
  117. return (BigNum([0], 0), left)
  118. }
  119. if left.digits == right.digits {
  120. return (BigNum([1], left.signum * right.signum), BigNum([0], 0))
  121. }
  122. var shiftIndex = left.digits.count - right.digits.count
  123. var tmp = BigNum(left.digits[shiftIndex..<left.digits.count], 1)
  124. while tmp < right {
  125. shiftIndex = shiftIndex - 1
  126. tmp = BigNum(left.digits[shiftIndex..<left.digits.count], 1)
  127. }
  128. var quotient = [UInt8]()
  129. var rest = BigNum([0], 0)
  130. while shiftIndex >= 0 {
  131. var i: UInt8 = 1
  132. while (right * BigNum([i], 1)) < tmp {
  133. i = i + 1
  134. }
  135. quotient.append(i-1)
  136. rest = tmp - (right * BigNum([i-1], 1))
  137. shiftIndex = shiftIndex - 1
  138. if shiftIndex < 0 {
  139. break
  140. }
  141. tmp = BigNum([left.digits[shiftIndex]] + rest.digits, 1)
  142. }
  143. return (BigNum(quotient.reversed(), left.signum * right.signum), rest)
  144. }
  145. infix operator % { }
  146. public func % (_ left: BigNum, _ right: BigNum) -> BigNum {
  147. return (left / right).reminder
  148. }
  149. infix operator > { }
  150. public func > (_ left: BigNum, _ right: BigNum) -> Bool {
  151. if left.signum != right.signum {
  152. return left.signum > right.signum
  153. }
  154. if left.digits.count != right.digits.count {
  155. if left.signum < 0 {
  156. return left.digits.count < right.digits.count
  157. } else {
  158. return left.digits.count > right.digits.count
  159. }
  160. }
  161. for i in (0..<left.digits.count).reversed() {
  162. if left.digits[i] != right.digits[i] {
  163. if left.signum < 0 {
  164. return left.digits[i] < right.digits[i]
  165. } else {
  166. return left.digits[i] > right.digits[i]
  167. }
  168. }
  169. }
  170. return false
  171. }
  172. infix operator < { }
  173. public func < (_ left: BigNum, _ right: BigNum) -> Bool {
  174. if left.signum != right.signum {
  175. return left.signum < right.signum
  176. }
  177. if right.digits.count != left.digits.count {
  178. if left.signum < 0 {
  179. return left.digits.count > right.digits.count
  180. } else {
  181. return left.digits.count < right.digits.count
  182. }
  183. }
  184. for i in (0..<left.digits.count).reversed() {
  185. if left.digits[i] != right.digits[i] {
  186. if left.signum < 0 {
  187. return right.digits[i] < left.digits[i]
  188. } else {
  189. return right.digits[i] > left.digits[i]
  190. }
  191. }
  192. }
  193. return false
  194. }
  195. infix operator >= { }
  196. public func >= (_ left: BigNum, _ right: BigNum) -> Bool {
  197. return (left == right) || (left > right)
  198. }
  199. infix operator <= { }
  200. public func <= (_ left: BigNum, _ right: BigNum) -> Bool {
  201. return (left == right) || (left < right)
  202. }