MergeSorted merges sorted lists.
(lists []*pb.List)
| 434 | |
| 435 | // MergeSorted merges sorted lists. |
| 436 | func internalMergeSort(lists []*pb.List) *pb.List { |
| 437 | sz := 0 |
| 438 | for _, l := range lists { |
| 439 | if l == nil || len(l.Uids) == 0 { |
| 440 | continue |
| 441 | } |
| 442 | sz += len(l.Uids) |
| 443 | } |
| 444 | buffer := make([]uint64, 0, sz) |
| 445 | return internalMergeSortWithBuffer(lists, buffer) |
| 446 | } |
| 447 | |
| 448 | func MergeSorted(lists []*pb.List) *pb.List { |
| 449 | // Calculate total capacity needed |