dist/publisher.ssr.js
// start or end of that node. Returns null when no position was found.
start or end of that node. Returns null when no position was found.
start or end of that node . Returns null when no position was found .
function dropPoint(doc, pos, slice) {
  var $pos = doc.resolve(pos);
  if (!slice.content.size) { return pos }
  var content = slice.content;
  for (var i = 0; i < slice.openStart; i++) { content = content.firstChild.content; }
  for (var pass = 1; pass <= (slice.openStart == 0 && slice.size ? 2 : 1); pass++) {
    for (var d = $pos.depth; d >= 0; d--) {
      var bias = d == $pos.depth ? 0 : $pos.pos <= ($pos.start(d + 1) + $pos.end(d + 1)) / 2 ? -1 : 1;
      var insertPos = $pos.index(d) + (bias > 0 ? 1 : 0);
      if (pass == 1
          ? $pos.node(d).canReplace(insertPos, insertPos, content)
          : $pos.node(d).contentMatchAt(insertPos).findWrapping(content.firstChild.type))
        { return bias == 0 ? $pos.pos : bias < 0 ? $pos.before(d + 1) : $pos.after(d + 1) }
    }
  }
  return null
}
function dropPoint ( doc , pos , slice ) { var $pos = doc . resolve ( pos ) ; if ( ! slice . content . size ) { return pos } var content = slice . content ; for ( var i = 0 ; i < slice . openStart ; i ++ ) { content = content . firstChild . content ; } for ( var pass = 1 ; pass <= ( slice . openStart == 0 && slice . size ? 2 : 1 ) ; pass ++ ) { for ( var d = $pos . depth ; d >= 0 ; d -- ) { var bias = d == $pos . depth ? 0 : $pos . pos <= ( $pos . start ( d + 1 ) + $pos . end ( d + 1 ) ) / 2 ? - 1 : 1 ; var insertPos = $pos . index ( d ) + ( bias > 0 ? 1 : 0 ) ; if ( pass == 1 ? $pos . node ( d ) . canReplace ( insertPos , insertPos , content ) : $pos . node ( d ) . contentMatchAt ( insertPos ) . findWrapping ( content . firstChild . type ) ) { return bias == 0 ? $pos . pos : bias < 0 ? $pos . before ( d + 1 ) : $pos . after ( d + 1 ) } } } return null }
start or end of that node.
start or end of that node .