refactor: use the built-in max/min to simplify the code (#6060)

Signed-off-by: grandpig <grandpig@outlook.com>
pull/6065/head
grandpig 1 week ago committed by GitHub
parent 0e1d821fb8
commit 76aee4e177
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194

@ -98,10 +98,7 @@ func WebMOpusToWAV(input []byte) ([]byte, error) {
}
}
skip := preSkip * channels
if skip > len(pcm) {
skip = len(pcm)
}
skip := min(preSkip*channels, len(pcm))
pcm = pcm[skip:]
return encodeWAV(pcm, opusOutputSampleRate, channels), nil

@ -236,10 +236,7 @@ func (s *APIV1Service) ListMemos(ctx context.Context, request *v1pb.ListMemosReq
return nil, status.Errorf(codes.InvalidArgument, "invalid page token: %v", err)
}
limit = normalizePageSize(pageToken.Limit)
offset = int(pageToken.Offset)
if offset < 0 {
offset = 0
}
offset = max(int(pageToken.Offset), 0)
} else {
limit = normalizePageSize(request.PageSize)
}
@ -782,10 +779,7 @@ func (s *APIV1Service) ListMemoComments(ctx context.Context, request *v1pb.ListM
return nil, status.Errorf(codes.InvalidArgument, "invalid page token: %v", err)
}
limit = normalizePageSize(pageToken.Limit)
offset = int(pageToken.Offset)
if offset < 0 {
offset = 0
}
offset = max(int(pageToken.Offset), 0)
} else {
limit = normalizePageSize(request.PageSize)
}

@ -524,10 +524,7 @@ func deleteUserBatches[T any](values []T, size int) [][]T {
batches := make([][]T, 0, (len(values)+size-1)/size)
for start := 0; start < len(values); start += size {
end := start + size
if end > len(values) {
end = len(values)
}
end := min(start+size, len(values))
batches = append(batches, values[start:end])
}
return batches

@ -487,10 +487,7 @@ func deleteUserBatches[T any](values []T, size int) [][]T {
batches := make([][]T, 0, (len(values)+size-1)/size)
for start := 0; start < len(values); start += size {
end := start + size
if end > len(values) {
end = len(values)
}
end := min(start+size, len(values))
batches = append(batches, values[start:end])
}
return batches

@ -487,10 +487,7 @@ func deleteUserBatches[T any](values []T, size int) [][]T {
batches := make([][]T, 0, (len(values)+size-1)/size)
for start := 0; start < len(values); start += size {
end := start + size
if end > len(values) {
end = len(values)
}
end := min(start+size, len(values))
batches = append(batches, values[start:end])
}
return batches

Loading…
Cancel
Save