Method handleHasWithOrderFunction

worker/task.go:2597–2677

(ctx context.Context, q *pb.Query, out *pb.Result,
	rev bool, offset, first int, srcFn *functionContext)

}

func (qs *queryState) handleHasWithOrderFunction(ctx context.Context, q *pb.Query, out *pb.Result,
	rev bool, offset, first int, srcFn *functionContext) error {
	if first == 0 {
		first = math.MaxInt
	}

	initKey := x.ParsedKey{
		Attr: q.Attr,
	}

	startKey := x.IndexKey(q.Attr, "")
	if rev {
		startKey = x.IndexKeyAfterAllTerms(q.Attr)
	}

	prefix := initKey.IndexPrefix()

	result := &pb.List{}

	lang := langForFunc(q.Langs)
	needFiltering := needsStringFiltering(srcFn, q.Langs, q.Attr)

	// This function checks if we should include uid in result or not when has is queried with
	// @lang(eg: has(name@en)). We need to do this inside this function to return correct result
	// for first.
	checkInclusion := func(uid uint64) error {
		if !needFiltering {
			return nil
		}

		_, err := qs.getValsForUID(q.Attr, lang, uid, q.ReadTs)
		return err
	}

	cnt := int32(0)

	iteratorFunc := &posting.IterateDiskArgs{
		Prefix:      prefix,
		ReadTs:      q.ReadTs,
		AllVersions: false,
		Reverse:     rev,
		CheckInclusion: func(uid uint64) error {
			return nil
		},
		Function: func(l *posting.List, pk x.ParsedKey) error {
			pl, err := l.Uids(posting.ListOptions{ReadTs: q.ReadTs})
			if err != nil {
				return err
			}

			if cnt < q.Offset {
				cnt++
				return nil
			}

			for _, uid := range pl.Uids {
				if err := checkInclusion(uid); err != nil {
					continue