module.exports = (HB)->
  # @see Engine.parse
  parser = {}
  execution_listener = []

  #
  # @private
  # @abstract
  # @nodoc
  # A generic interface to operations.
  #
  # An operation has the following methods:
  # * _encode: encodes an operation (needed only if instance of this operation is sent).
  # * execute: execute the effects of this operations. Good examples are Insert-type and AddName-type
  # * val: in the case that the operation holds a value
  #
  # Furthermore an encodable operation has a parser. We extend the parser object in order to parse encoded operations.
  #
  class Operation

    #
    # @param {Object} uid A unique identifier.
    # If uid is undefined, a new uid will be created before at the end of the execution sequence
    #
    constructor: (uid)->
      @is_deleted = false
      @garbage_collected = false
      @event_listeners = [] # TODO: rename to observers or sth like that
      if uid?
        @uid = uid

    type: "Operation"

    retrieveSub: ()->
      throw new Error "sub properties are not enable on this operation type!"

    #
    # Add an event listener. It depends on the operation which events are supported.
    # @param {Function} f f is executed in case the event fires.
    #
    observe: (f)->
      @event_listeners.push f

    #
    # Deletes function from the observer list
    # @see Operation.observe
    #
    # @overload unobserve(event, f)
    #   @param f     {Function} The function that you want to delete 
    unobserve: (f)->
      @event_listeners = @event_listeners.filter (g)->
        f isnt g

    #
    # Deletes all subscribed event listeners.
    # This should be called, e.g. after this has been replaced.
    # (Then only one replace event should fire. )
    # This is also called in the cleanup method.
    deleteAllObservers: ()->
      @event_listeners = []

    #
    # Fire an event.
    # TODO: Do something with timeouts. You don't want this to fire for every operation (e.g. insert).
    # TODO: do you need callEvent+forwardEvent? Only one suffices probably
    callEvent: ()->
      @forwardEvent @, arguments...

    #
    # Fire an event and specify in which context the listener is called (set 'this').
    # TODO: do you need this ?
    forwardEvent: (op, args...)->
      for f in @event_listeners
        f.call op, args...

    isDeleted: ()->
      @is_deleted

    applyDelete: (garbagecollect = true)->
      if not @garbage_collected
        #console.log "applyDelete: #{@type}"
        @is_deleted = true
        if garbagecollect
          @garbage_collected = true
          HB.addToGarbageCollector @

    cleanup: ()->
      #console.log "cleanup: #{@type}"
      HB.removeOperation @
      @deleteAllObservers()

    #
    # Set the parent of this operation.
    #
    setParent: (@parent)->

    #
    # Get the parent of this operation.
    #
    getParent: ()->
      @parent

    #
    # Computes a unique identifier (uid) that identifies this operation.
    #
    getUid: ()->
      if not @uid.noOperation?
        @uid
      else
        @uid.alt # could be (safely) undefined

    cloneUid: ()->
      uid = {}
      for n,v of @getUid()
        uid[n] = v
      uid

    dontSync: ()->
      @uid.doSync = false

    #
    # @private
    # If not already done, set the uid
    # Add this to the HB
    # Notify the all the listeners.
    #
    execute: ()->
      @is_executed = true
      if not @uid?
        # When this operation was created without a uid, then set it here.
        # There is only one other place, where this can be done - before an Insertion
        # is executed (because we need the creator_id)
        @uid = HB.getNextOperationIdentifier()
      if not @uid.noOperation?
        HB.addOperation @
        for l in execution_listener
          l @_encode()
      @

    #
    # @private
    # Operations may depend on other operations (linked lists, etc.).
    # The saveOperation and validateSavedOperations methods provide
    # an easy way to refer to these operations via an uid or object reference.
    #
    # For example: We can create a new Delete operation that deletes the operation $o like this
    #     - var d = new Delete(uid, $o);   or
    #     - var d = new Delete(uid, $o.getUid());
    # Either way we want to access $o via d.deletes. In the second case validateSavedOperations must be called first.
    #
    # @overload saveOperation(name, op_uid)
    #   @param {String} name The name of the operation. After validating (with validateSavedOperations) the instantiated operation will be accessible via this[name].
    #   @param {Object} op_uid A uid that refers to an operation
    # @overload saveOperation(name, op)
    #   @param {String} name The name of the operation. After calling this function op is accessible via this[name].
    #   @param {Operation} op An Operation object
    #
    saveOperation: (name, op)->

      #
      # Every instance of $Operation must have an $execute function.
      # We use duck-typing to check if op is instantiated since there
      # could exist multiple classes of $Operation
      #
      if op?.execute?
        # is instantiated
        @[name] = op
      else if op?
        # not initialized. Do it when calling $validateSavedOperations()
        @unchecked ?= {}
        @unchecked[name] = op

    #
    # @private
    # After calling this function all not instantiated operations will be accessible.
    # @see Operation.saveOperation
    #
    # @return [Boolean] Whether it was possible to instantiate all operations.
    #
    validateSavedOperations: ()->
      uninstantiated = {}
      success = @
      for name, op_uid of @unchecked
        op = HB.getOperation op_uid
        if op
          @[name] = op
        else
          uninstantiated[name] = op_uid
          success = false
      delete @unchecked
      if not success
        @unchecked = uninstantiated
      success


  #
  # @nodoc
  # A simple Delete-type operation that deletes an operation.
  #
  class Delete extends Operation

    #
    # @param {Object} uid A unique identifier. If uid is undefined, a new uid will be created.
    # @param {Object} deletes UID or reference of the operation that this to be deleted.
    #
    constructor: (uid, deletes)->
      @saveOperation 'deletes', deletes
      super uid

    type: "Delete"

    #
    # @private
    # Convert all relevant information of this operation to the json-format.
    # This result can be sent to other clients.
    #
    _encode: ()->
      {
        'type': "Delete"
        'uid': @getUid()
        'deletes': @deletes.getUid()
      }

    #
    # @private
    # Apply the deletion.
    #
    execute: ()->
      if @validateSavedOperations()
        res = super
        if res
          @deletes.applyDelete @
        res
      else
        false

  #
  # Define how to parse Delete operations.
  #
  parser['Delete'] = (o)->
    {
      'uid' : uid
      'deletes': deletes_uid
    } = o
    new Delete uid, deletes_uid

  #
  # @nodoc
  # A simple insert-type operation.
  #
  # An insert operation is always positioned between two other insert operations.
  # Internally this is realized as associative lists, whereby each insert operation has a predecessor and a successor.
  # For the sake of efficiency we maintain two lists:
  #   - The short-list (abbrev. sl) maintains only the operations that are not deleted
  #   - The complete-list (abbrev. cl) maintains all operations
  #
  class Insert extends Operation

    #
    # @param {Object} uid A unique identifier. If uid is undefined, a new uid will be created.
    # @param {Operation} prev_cl The predecessor of this operation in the complete-list (cl)
    # @param {Operation} next_cl The successor of this operation in the complete-list (cl)
    #
    constructor: (uid, prev_cl, next_cl, origin, parent)->
      @saveOperation 'parent', parent
      @saveOperation 'prev_cl', prev_cl
      @saveOperation 'next_cl', next_cl
      if origin?
        @saveOperation 'origin', origin
      else
        @saveOperation 'origin', prev_cl
      super uid

    type: "Insert"

    #
    # set content to null and other stuff
    # @private
    #
    applyDelete: (o)->
      @deleted_by ?= []
      callLater = false
      if @parent? and not @isDeleted() and o? # o? : if not o?, then the delimiter deleted this Insertion. Furthermore, it would be wrong to call it. TODO: make this more expressive and save
        # call iff wasn't deleted earlyer
        callLater = true
      if o?
        @deleted_by.push o
      garbagecollect = false
      if @next_cl.isDeleted()
        garbagecollect = true
      super garbagecollect
      if callLater
        @callOperationSpecificDeleteEvents(o)
      if @prev_cl?.isDeleted()
        # garbage collect prev_cl
        @prev_cl.applyDelete()

    cleanup: ()->
      if @next_cl.isDeleted()
        # delete all ops that delete this insertion
        for d in @deleted_by
          d.cleanup()

        # throw new Error "right is not deleted. inconsistency!, wrararar"
        # change origin references to the right
        o = @next_cl
        while o.type isnt "Delimiter"
          if o.origin is @
            o.origin = @prev_cl
          o = o.next_cl
        # reconnect left/right
        @prev_cl.next_cl = @next_cl
        @next_cl.prev_cl = @prev_cl
        super
      # else
      #   Someone inserted something in the meantime.
      #   Remember: this can only be garbage collected when next_cl is deleted

    #
    # @private
    # The amount of positions that $this operation was moved to the right.
    #
    getDistanceToOrigin: ()->
      d = 0
      o = @prev_cl
      while true
        if @origin is o
          break
        d++
        o = o.prev_cl
      d

    #
    # @private
    # Include this operation in the associative lists.
    execute: ()->
      if not @validateSavedOperations()
        return false
      else
        if @parent?
          if not @prev_cl?
            @prev_cl = @parent.beginning
          if not @origin?
            @origin = @parent.beginning
          if not @next_cl?
            @next_cl = @parent.end
        if @prev_cl?
          distance_to_origin = @getDistanceToOrigin() # most cases: 0
          o = @prev_cl.next_cl
          i = distance_to_origin # loop counter

          # $this has to find a unique position between origin and the next known character
          # case 1: $origin equals $o.origin: the $creator parameter decides if left or right
          #         let $OL= [o1,o2,o3,o4], whereby $this is to be inserted between o1 and o4
          #         o2,o3 and o4 origin is 1 (the position of o2)
          #         there is the case that $this.creator < o2.creator, but o3.creator < $this.creator
          #         then o2 knows o3. Since on another client $OL could be [o1,o3,o4] the problem is complex
          #         therefore $this would be always to the right of o3
          # case 2: $origin < $o.origin
          #         if current $this insert_position > $o origin: $this ins
          #         else $insert_position will not change
          #         (maybe we encounter case 1 later, then this will be to the right of $o)
          # case 3: $origin > $o.origin
          #         $this insert_position is to the left of $o (forever!)
          while true
            if o isnt @next_cl
              # $o happened concurrently
              if o.getDistanceToOrigin() is i
                # case 1
                if o.uid.creator < @uid.creator
                  @prev_cl = o
                  distance_to_origin = i + 1
                else
                  # nop
              else if o.getDistanceToOrigin() < i
                # case 2
                if i - distance_to_origin <= o.getDistanceToOrigin()
                  @prev_cl = o
                  distance_to_origin = i + 1
                else
                  #nop
              else
                # case 3
                break
              i++
              o = o.next_cl
            else
              # $this knows that $o exists,
              break
          # now reconnect everything
          @next_cl = @prev_cl.next_cl
          @prev_cl.next_cl = @
          @next_cl.prev_cl = @

        @setParent @prev_cl.getParent() # do Insertions always have a parent?
        super # notify the execution_listeners
        @callOperationSpecificInsertEvents()
        @

    callOperationSpecificInsertEvents: ()->
      @parent?.callEvent [
        type: "insert"
        position: @getPosition()
        object: @parent
        changedBy: @uid.creator
        value: @content
      ]

    callOperationSpecificDeleteEvents: (o)->
      @parent.callEvent [
        type: "delete"
        position: @getPosition()
        object: @parent # TODO: You can combine getPosition + getParent in a more efficient manner! (only left Delimiter will hold @parent)
        length: 1
        changedBy: o.uid.creator
      ]

    #
    # Compute the position of this operation.
    #
    getPosition: ()->
      position = 0
      prev = @prev_cl
      while true
        if prev instanceof Delimiter
          break
        if not prev.isDeleted()
          position++
        prev = prev.prev_cl
      position

  #
  # @nodoc
  # Defines an object that is cannot be changed. You can use this to set an immutable string, or a number.
  #
  class ImmutableObject extends Operation

    #
    # @param {Object} uid A unique identifier. If uid is undefined, a new uid will be created.
    # @param {Object} content
    #
    constructor: (uid, @content)->
      super uid

    type: "ImmutableObject"

    #
    # @return [String] The content of this operation.
    #
    val : ()->
      @content

    #
    # Encode this operation in such a way that it can be parsed by remote peers.
    #
    _encode: ()->
      json = {
        'type': "ImmutableObject"
        'uid' : @getUid()
        'content' : @content
      }
      json

  parser['ImmutableObject'] = (json)->
    {
      'uid' : uid
      'content' : content
    } = json
    new ImmutableObject uid, content

  #
  # @nodoc
  # A delimiter is placed at the end and at the beginning of the associative lists.
  # This is necessary in order to have a beginning and an end even if the content
  # of the Engine is empty.
  #
  class Delimiter extends Operation
    #
    # @param {Object} uid A unique identifier. If uid is undefined, a new uid will be created.
    # @param {Operation} prev_cl The predecessor of this operation in the complete-list (cl)
    # @param {Operation} next_cl The successor of this operation in the complete-list (cl)
    #
    constructor: (prev_cl, next_cl, origin)->
      @saveOperation 'prev_cl', prev_cl
      @saveOperation 'next_cl', next_cl
      @saveOperation 'origin', prev_cl
      super {noOperation: true}

    type: "Delimiter"

    applyDelete: ()->
      super()
      o = @prev_cl
      while o?
        o.applyDelete()
        o = o.prev_cl
      undefined

    cleanup: ()->
      super()

    #
    # @private
    #
    execute: ()->
      if @unchecked?['next_cl']?
        super
      else if @unchecked?['prev_cl']
        if @validateSavedOperations()
          if @prev_cl.next_cl?
            throw new Error "Probably duplicated operations"
          @prev_cl.next_cl = @
          super
        else
          false
      else if @prev_cl? and not @prev_cl.next_cl?
        delete @prev_cl.unchecked.next_cl
        @prev_cl.next_cl = @
        super
      else if @prev_cl? or @next_cl? or true # TODO: are you sure? This can happen right?
        super
      #else
      #  throw new Error "Delimiter is unsufficient defined!"

    #
    # @private
    #
    _encode: ()->
      {
        'type' : "Delimiter"
        'uid' : @getUid()
        'prev' : @prev_cl?.getUid()
        'next' : @next_cl?.getUid()
      }

  parser['Delimiter'] = (json)->
    {
    'uid' : uid
    'prev' : prev
    'next' : next
    } = json
    new Delimiter uid, prev, next

  # This is what this module exports after initializing it with the HistoryBuffer
  {
    'types' :
      'Delete' : Delete
      'Insert' : Insert
      'Delimiter': Delimiter
      'Operation': Operation
      'ImmutableObject' : ImmutableObject
    'parser' : parser
    'execution_listener' : execution_listener
  }