DiffGenerator.coffee 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218
  1. ConsistencyError = (message) ->
  2. error = new Error(message)
  3. error.name = "ConsistencyError"
  4. error.__proto__ = ConsistencyError.prototype
  5. return error
  6. ConsistencyError.prototype.__proto__ = Error.prototype
  7. logger = require "logger-sharelatex"
  8. module.exports = DiffGenerator =
  9. ConsistencyError: ConsistencyError
  10. rewindUpdate: (content, update) ->
  11. for op in update.op by -1
  12. try
  13. content = DiffGenerator.rewindOp content, op
  14. catch e
  15. if e instanceof ConsistencyError
  16. logger.error {update, op: JSON.stringify(op)}, "marking op as broken"
  17. op.broken = true
  18. else
  19. throw e # rethrow the execption
  20. return content
  21. rewindOp: (content, op) ->
  22. if op.i?
  23. # ShareJS will accept an op where p > content.length when applied,
  24. # and it applies as though p == content.length. However, the op is
  25. # passed to us with the original p > content.length. Detect if that
  26. # is the case with this op, and shift p back appropriately to match
  27. # ShareJS if so.
  28. p = op.p
  29. max_p = content.length - op.i.length
  30. if p > max_p
  31. logger.warn {max_p, p}, "truncating position to content length"
  32. p = max_p
  33. textToBeRemoved = content.slice(p, p + op.i.length)
  34. if op.i != textToBeRemoved
  35. throw new ConsistencyError(
  36. "Inserted content, '#{op.i}', does not match text to be removed, '#{textToBeRemoved}'"
  37. )
  38. return content.slice(0, p) + content.slice(p + op.i.length)
  39. else if op.d?
  40. return content.slice(0, op.p) + op.d + content.slice(op.p)
  41. rewindUpdates: (content, updates) ->
  42. for update in updates.reverse()
  43. content = DiffGenerator.rewindUpdate(content, update)
  44. return content
  45. buildDiff: (initialContent, updates) ->
  46. diff = [ u: initialContent ]
  47. for update in updates
  48. diff = DiffGenerator.applyUpdateToDiff diff, update
  49. diff = DiffGenerator.compressDiff diff
  50. return diff
  51. compressDiff: (diff) ->
  52. newDiff = []
  53. for part in diff
  54. lastPart = newDiff[newDiff.length - 1]
  55. if lastPart? and lastPart.meta?.user? and part.meta?.user?
  56. if lastPart.i? and part.i? and lastPart.meta.user.id == part.meta.user.id
  57. lastPart.i += part.i
  58. lastPart.meta.start_ts = Math.min(lastPart.meta.start_ts, part.meta.start_ts)
  59. lastPart.meta.end_ts = Math.max(lastPart.meta.end_ts, part.meta.end_ts)
  60. else if lastPart.d? and part.d? and lastPart.meta.user.id == part.meta.user.id
  61. lastPart.d += part.d
  62. lastPart.meta.start_ts = Math.min(lastPart.meta.start_ts, part.meta.start_ts)
  63. lastPart.meta.end_ts = Math.max(lastPart.meta.end_ts, part.meta.end_ts)
  64. else
  65. newDiff.push part
  66. else
  67. newDiff.push part
  68. return newDiff
  69. applyOpToDiff: (diff, op, meta) ->
  70. position = 0
  71. remainingDiff = diff.slice()
  72. {consumedDiff, remainingDiff} = DiffGenerator._consumeToOffset(remainingDiff, op.p)
  73. newDiff = consumedDiff
  74. if op.i?
  75. newDiff.push
  76. i: op.i
  77. meta: meta
  78. else if op.d?
  79. {consumedDiff, remainingDiff} = DiffGenerator._consumeDiffAffectedByDeleteOp remainingDiff, op, meta
  80. newDiff.push(consumedDiff...)
  81. newDiff.push(remainingDiff...)
  82. return newDiff
  83. applyUpdateToDiff: (diff, update) ->
  84. for op in update.op when op.broken isnt true
  85. diff = DiffGenerator.applyOpToDiff diff, op, update.meta
  86. return diff
  87. _consumeToOffset: (remainingDiff, totalOffset) ->
  88. consumedDiff = []
  89. position = 0
  90. while part = remainingDiff.shift()
  91. length = DiffGenerator._getLengthOfDiffPart part
  92. if part.d?
  93. consumedDiff.push part
  94. else if position + length >= totalOffset
  95. partOffset = totalOffset - position
  96. if partOffset > 0
  97. consumedDiff.push DiffGenerator._slicePart part, 0, partOffset
  98. if partOffset < length
  99. remainingDiff.unshift DiffGenerator._slicePart part, partOffset
  100. break
  101. else
  102. position += length
  103. consumedDiff.push part
  104. return {
  105. consumedDiff: consumedDiff
  106. remainingDiff: remainingDiff
  107. }
  108. _consumeDiffAffectedByDeleteOp: (remainingDiff, deleteOp, meta) ->
  109. consumedDiff = []
  110. remainingOp = deleteOp
  111. while remainingOp and remainingDiff.length > 0
  112. {newPart, remainingDiff, remainingOp} = DiffGenerator._consumeDeletedPart remainingDiff, remainingOp, meta
  113. consumedDiff.push newPart if newPart?
  114. return {
  115. consumedDiff: consumedDiff
  116. remainingDiff: remainingDiff
  117. }
  118. _consumeDeletedPart: (remainingDiff, op, meta) ->
  119. part = remainingDiff.shift()
  120. partLength = DiffGenerator._getLengthOfDiffPart part
  121. if part.d?
  122. # Skip existing deletes
  123. remainingOp = op
  124. newPart = part
  125. else if partLength > op.d.length
  126. # Only the first bit of the part has been deleted
  127. remainingPart = DiffGenerator._slicePart part, op.d.length
  128. remainingDiff.unshift remainingPart
  129. deletedContent = DiffGenerator._getContentOfPart(part).slice(0, op.d.length)
  130. if deletedContent != op.d
  131. throw new ConsistencyError("deleted content, '#{deletedContent}', does not match delete op, '#{op.d}'")
  132. if part.u?
  133. newPart =
  134. d: op.d
  135. meta: meta
  136. else if part.i?
  137. newPart = null
  138. remainingOp = null
  139. else if partLength == op.d.length
  140. # The entire part has been deleted, but it is the last part
  141. deletedContent = DiffGenerator._getContentOfPart(part)
  142. if deletedContent != op.d
  143. throw new ConsistencyError("deleted content, '#{deletedContent}', does not match delete op, '#{op.d}'")
  144. if part.u?
  145. newPart =
  146. d: op.d
  147. meta: meta
  148. else if part.i?
  149. newPart = null
  150. remainingOp = null
  151. else if partLength < op.d.length
  152. # The entire part has been deleted and there is more
  153. deletedContent = DiffGenerator._getContentOfPart(part)
  154. opContent = op.d.slice(0, deletedContent.length)
  155. if deletedContent != opContent
  156. throw new ConsistencyError("deleted content, '#{deletedContent}', does not match delete op, '#{opContent}'")
  157. if part.u
  158. newPart =
  159. d: part.u
  160. meta: meta
  161. else if part.i?
  162. newPart = null
  163. remainingOp =
  164. p: op.p, d: op.d.slice(DiffGenerator._getLengthOfDiffPart(part))
  165. return {
  166. newPart: newPart
  167. remainingDiff: remainingDiff
  168. remainingOp: remainingOp
  169. }
  170. _slicePart: (basePart, from, to) ->
  171. if basePart.u?
  172. part = { u: basePart.u.slice(from, to) }
  173. else if basePart.i?
  174. part = { i: basePart.i.slice(from, to) }
  175. if basePart.meta?
  176. part.meta = basePart.meta
  177. return part
  178. _getLengthOfDiffPart: (part) ->
  179. (part.u or part.d or part.i or '').length
  180. _getContentOfPart: (part) ->
  181. part.u or part.d or part.i or ''