“Sleeping” You can use numerous constructs that block forever without “eating” up your CPU. For example a select without any case (and no default): select{} Or receiving from a channel where nobody sends anything: <-make(chan int) Or receiving from a nil channel also blocks forever: <-(chan int)(nil) Or sending on a nil channel also blocks … Read more
Another option, if you have nodejs installed on your machine install nodemon with -g npm i -g nodemon go to your code dir and run: nodemon –watch ‘./**/*.go’ –signal SIGTERM –exec ‘go’ run cmd/MyProgram/main.go This will send SIGTERM every time any .go files changes and will run go run cmd/Myprogram/main.go Fully cross platform.
You can read more about slices here. But I think this passage answers your question: Slicing does not copy the slice’s data. It creates a new slice value that points to the original array. This makes slice operations as efficient as manipulating array indices. Therefore, modifying the elements (not the slice itself) of a re-slice … Read more
Assuming that your numbers will fit into an int64, you can compare the float value with a converted integer value to see if they’re the same: if a == float64(int64(a)) { … } Alternatively, if you need the entire float64 domain, you can use the math.Trunc function, with something like: if a == math.Trunc(a) { … Read more
Operators Operators combine operands into expressions. Comparisons are discussed elsewhere. For other binary operators, the operand types must be identical unless the operation involves shifts or untyped constants. For operations involving constants only, see the section on constant expressions. Except for shift operations, if one operand is an untyped constant and the other operand is … Read more
When using modules you may be able to get what you need from go mod graph. usage: go mod graph Graph prints the module requirement graph (with replacements applied) in text form. Each line in the output has two space-separated fields: a module and one of its requirements. Each module is identified as a string … Read more
strings.LastIndex makes this quite neat: s := “Hello,Stack,Overflow” last := s[strings.LastIndex(s, “,”)+1:] fmt.Println(last) returns “Overflow”. If the search string isn’t found it returns the whole string, which is logical. Playground here
The ‘transparency’ you expected is just syntactic sugar and has nothing to do with the data representation. If you want to have a function that flattens your data structure, you would have to write it by yourself. For example (On play): func DeepFields(iface interface{}) []reflect.Value { fields := make([]reflect.Value, 0) ifv := reflect.ValueOf(iface) ift := … Read more
There is no runtime or reflect method or function that provides the functionality that you are looking for. The closest thing I could find is: package main import ( “azul3d.org/lmath.v1” “fmt” “reflect” ) type Empty struct{} func main() { fmt.Println(reflect.TypeOf(Empty{}).PkgPath()) fmt.Println(reflect.TypeOf(lmath.Vec3{0, 0, 0}).PkgPath()) } This would output: main azul3d.org/lmath.v1 You could also read the first … Read more
You can use arrays to represent a single int32 as two int16s and then assemble them with shifts as Rob Pike recommends: func test3() (total int64) { type A struct { t int32 u [2]int16 } a := […]A{ {1, [2]int16{100, 0}}, {2, [2]int16{3, 0}}, } for i := 0; i < N; i++ { … Read more