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

This document is filled with user, usage and revenue charts that go up-and-to-the-right… often supported by spending charts that also go up-and-to-the right. Creators / bettors / consumers are taking AI & Physical World Ramps = Fast + Data-Driven • Global Internet User Ramps Powered by AI from Get-Go = Growth We Have Not Seen Likes of Before • AI & Work Evolution = Real + Rapid 3 1 2 3 4 5 Operating Zone Market Share Source: YipitData (4/25) Global Internet User Ramps Powered by AI from Get-Go = Growth We Have Not Seen Likes of Before 7 Leading USA-Based LLM App Users by Region Note: Region

sure… Did you lay anyone off or reduce operating expenses? No, there is a union… Did your inventories go down? I don’t think so… Jonah ends the conversation with the question: “Alex, you cannot understand fluctuating in speed, but the ability to go faster than average is restricted, it depends on all the others ahead in line. There are limits on how fast I can go. However, there is no limit on my ability constraint (Bringing back old machines) STEP 5 If, in a previous step, a constraint has been broken go back to Step 1Match Game Need: Dice Box of matches Plate or bowl The system is intended to

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

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

Transitioning to Go - Robert Pajak 2. Break / Your announcements (OpenSource, event etc.); Developer, engineer, lead lost & found || Grab coffee/beer/food; 3. Hedged requests in Go - Oleg Kovalov 4

sports-what do we do? We love it perhaps more than we should. And most frequently, we have trouble letting go of it because we can’t stand the idea of its loss. What are we left with then? An ideology- rigid implementing a given feature, if our customer tells us they don’t value the feature, can we really let it go?