Thank you for responses. Indeed, such things don't hamper using of package, but are confusing to me and I have already too much confusing thing in my work. So, I need no more of them. ;)
Another topic. I needed to check package "math/bits" (learning about Go can lead us in such places quite fast) and I'm confused about function "Len(x uint) int". In its description we have (https://pkg.go.dev/math/bits@go1.17) BEGINNING Len returns the minimum number of bits required to represent x; the result is 0 for x == 0. END I have no problem with using function that says 0 can be encoded in 0 bits, but it is still odd. Maybe it is connected to something done under the hood, about which I don't know a thing? Does anyone know why this choose was made? Again, I have no problem with this function (and other realeated functions) working in this way. It is just strange thing to me. PS. This is not about documentation, but about implementation, but I think it fit to this topic. Best Kamil czwartek, 26 sierpnia 2021 o 17:04:50 UTC+2 Volker Dobler napisał(a): > On Thursday, 26 August 2021 at 13:27:01 UTC+2 kziem...@gmail.com wrote: > > >> Line "early regular expression implementations used and that POSIX >> specifies" is a bit confusing to me. I guess it can mean "old >> implementations Go regexp package", > > This guess is wrong. Go's regexp package did and does not change (in that > respect). > > >> but also very old implementations of regular expressions in different >> languages and systems (?). > > This is the correct meaning of the sentence. > > V. > -- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/golang-nuts/5557ee9d-7487-47df-9045-e42ba6b0f77en%40googlegroups.com.
