TRANSITIONING TO GO SEP 20 2023 Robert Pająk pellared @ GitHub SplunkHello whoami fundamentals going further more, more q&a 01 02 03 04 05whoamiROBERT PAJĄK Go maintainer Go language committee Tour of Go 2. Read and try: How to Write Go Code 3. Read and follow: Effective Go 4. Read and follow: CodeReviewComments 5. Check: Go by Examplehttps://go.dev/tourhttps://go.dev/doc/codehttps://go.dev com/golang/go/wiki/CodeReviewCommentshttps://gobyexample.comgoing furtherhttps://www.gopl.iohttps://go.dev/ref/memhttps://exercism.orghttps://quii.gitbook.io/learn-go-with-testshttps://go101.orghttps://go.dev/blogmore

a tuple of values is spliced into a varargs call precisely where the variable number of arguments go. This need not be the case, however:CHAPTER 9. FUNCTIONS 85 julia> x = (2, 3, 4) (2, 3, 4) julia> function body into the REPL to debug it—you have to add global annotations and then remove them again to go back; 2. Beginners will write this kind of code without the global and have no idea why their code myfilter(Apadded, kernel, NoPad()) # indicate the new boundary conditions end # other padding methods go here function myfilter(A, kernel, ::NoPad) # Here's the "real" implementation of the core computation

a tuple of values is spliced into a varargs call precisely where the variable number of arguments go. This need not be the case, however:CHAPTER 9. FUNCTIONS 85 julia> x = (2, 3, 4) (2, 3, 4) julia> function body into the REPL to debug it—you have to add global annotations and then remove them again to go back; 2. Beginners will write this kind of code without the global and have no idea why their code myfilter(Apadded, kernel, NoPad()) # indicate the new boundary conditions end # other padding methods go here function myfilter(A, kernel, ::NoPad) # Here's the "real" implementation of the core computation

a tuple of values is spliced into a varargs call precisely where the variable number of arguments go. This need not be the case, however:CHAPTER 9. FUNCTIONS 85 julia> x = (2, 3, 4) (2, 3, 4) julia> function body into the REPL to debug it—you have to add global annotations and then remove them again to go back; 2. Beginners will write this kind of code without the global and have no idea why their code myfilter(Apadded, kernel, NoPad()) # indicate the new boundary conditions end # other padding methods go here function myfilter(A, kernel, ::NoPad) # Here's the "real" implementation of the core computation

a tuple of values is spliced into a varargs call precisely where the variable number of arguments go. This need not be the case, however:CHAPTER 9. FUNCTIONS 85 julia> x = (2, 3, 4) (2, 3, 4) julia> function body into the REPL to debug it—you have to add global annotations and then remove them again to go back; 2. Beginners will write this kind of code without the global and have no idea why their code myfilter(Apadded, kernel, NoPad()) # indicate the new boundary conditions end # other padding methods go here function myfilter(A, kernel, ::NoPad) # Here's the "real" implementation of the core computation

a tuple of values is spliced into a varargs call precisely where the variable number of arguments go. This need not be the case, however:CHAPTER 9. FUNCTIONS 85 julia> x = (2, 3, 4) (2, 3, 4) julia> function body into the REPL to debug it—you have to add global annotations and then remove them again to go back; 2. Beginners will write this kind of code without the global and have no idea why their code myfilter(Apadded, kernel, NoPad()) # indicate the new boundary conditions end # other padding methods go here function myfilter(A, kernel, ::NoPad) # Here's the "real" implementation of the core computation

a tuple of values is spliced into a varargs call precisely where the variable number of arguments go. This need not be the case, however: julia> x = (2, 3, 4) (2, 3, 4) julia> bar(1,x...) (1, 2, (3 function body into the REPL to debug it—you have to add global annotations and then remove them again to go back; 2. Beginners will write this kind of code without the global and have no idea why their code myfilter(Apadded, kernel, NoPad()) # indicate the new boundary conditions end # other padding methods go here function myfilter(A, kernel, ::NoPad) # Here's the "real" implementation of the core computation

a tuple of values is spliced into a varargs call precisely where the variable number of arguments go. This need not be the case, however: julia> x = (2, 3, 4) (2, 3, 4) julia> bar(1,x...) (1, 2, (3 function body into the REPL to debug it—you have to add global annotations and then remove them again to go back; 2. Beginners will write this kind of code without the global and have no idea why their code myfilter(Apadded, kernel, NoPad()) # indicate the new boundary conditions end # other padding methods go here function myfilter(A, kernel, ::NoPad) # Here's the "real" implementation of the core computation

a tuple of values is spliced into a varargs call precisely where the variable number of arguments go. This need not be the case, however:CHAPTER 9. FUNCTIONS 85 julia> x = (2, 3, 4) (2, 3, 4) julia> function body into the REPL to debug it—you have to add global annotations and then remove them again to go back; 2. Beginners will write this kind of code without the global and have no idea why their code myfilter(Apadded, kernel, NoPad()) # indicate the new boundary conditions end # other padding methods go here function myfilter(A, kernel, ::NoPad) # Here's the "real" implementation of the core computation

a tuple of values is spliced into a varargs call precisely where the variable number of arguments go. This need not be the case, however:CHAPTER 9. FUNCTIONS 85 julia> x = (2, 3, 4) (2, 3, 4) julia> function body into the REPL to debug it—you have to add global annotations and then remove them again to go back; 2. Beginners will write this kind of code without the global and have no idea why their code myfilter(Apadded, kernel, NoPad()) # indicate the new boundary conditions end # other padding methods go here function myfilter(A, kernel, ::NoPad) # Here's the "real" implementation of the core computation