Method conflictKeysForNQuad

dgraph/cmd/live/batch.go:247–338

(nq *api.NQuad)

}

func (l *loader) conflictKeysForNQuad(nq *api.NQuad) ([]uint64, error) {
	attr := x.NamespaceAttr(nq.Namespace, nq.Predicate)
	pred, found := l.schema.preds[attr]

	// We don't need to generate conflict keys for predicate with noconflict directive.
	if found && pred.NoConflict {
		return nil, nil
	}

	keys := make([]uint64, 0)

	// Calculates the conflict keys, inspired by the logic in
	// addMutationInteration in posting/list.go.
	sid, err := strconv.ParseUint(nq.Subject, 0, 64)
	if err != nil {
		return nil, err
	}

	var oid uint64
	var de *pb.DirectedEdge

	if nq.ObjectValue == nil {
		oid, _ = strconv.ParseUint(nq.ObjectId, 0, 64)
		de = createUidEdge(nq, sid, oid)
	} else {
		var err error
		de, err = createValueEdge(nq, sid)
		x.Check(err)
	}

	// If the predicate is not found in schema then we don't have to generate any more keys.
	if !found {
		return keys, nil
	}

	if pred.List {
		key := fingerprintEdge(de, pred)
		keys = append(keys, farm.Fingerprint64(x.DataKey(attr, sid))^key)
	} else {
		keys = append(keys, farm.Fingerprint64(x.DataKey(attr, sid)))
	}

	if pred.Reverse {
		oi, err := strconv.ParseUint(nq.ObjectId, 0, 64)
		if err != nil {
			return keys, err
		}
		keys = append(keys, farm.Fingerprint64(x.DataKey(attr, oi)))
	}

	if nq.ObjectValue == nil || !(pred.Count || pred.Index) {
		return keys, nil
	}

	val := sid
	if pred.Upsert {
		val = 0
	}