gr1ffon/quic-go
1
0
Fork 0
forked from quic-go/quic-go
Code Pull Requests Activity

capitalize TODOs

Browse Source
This commit is contained in:
Lucas Clemente
2016-05-17 17:11:13 +02:00
parent d04ee083a7
commit e8b2d9748a
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
ackhandler/received_packet_handler.go
View File

@@ -77,7 +77,7 @@ func (h *receivedPacketHandler) ReceivedStopWaiting(f *frames.StopWaitingFrame)
// getNackRanges gets all the NACK ranges // getNackRanges gets all the NACK ranges
func (h *receivedPacketHandler) getNackRanges() ([]frames.NackRange, EntropyAccumulator) { func (h *receivedPacketHandler) getNackRanges() ([]frames.NackRange, EntropyAccumulator) {
// ToDo: use a better data structure here // TODO: use a better data structure here
var ranges []frames.NackRange var ranges []frames.NackRange
inRange := false inRange := false
entropy := h.highestInOrderObservedEntropy entropy := h.highestInOrderObservedEntropy

2
utils/utils.go
View File

@@ -164,7 +164,7 @@ func WriteUint16(b *bytes.Buffer, i uint16) {
// RandomBit returns a cryptographically secure random bit (encoded as true / false) // RandomBit returns a cryptographically secure random bit (encoded as true / false)
func RandomBit() (bool, error) { func RandomBit() (bool, error) {
// ToDo: it's probably more efficient to read a bigger slice of random numbers at once and to cache them somewhere // TODO: it's probably more efficient to read a bigger slice of random numbers at once and to cache them somewhere
b := make([]byte, 1) b := make([]byte, 1)
_, err := rand.Read(b) _, err := rand.Read(b)
if err != nil { if err != nil {