IT PhD Computer Journal

It turns out, Go (specifically gopls aka the local language server) collects telemetry, the scoundrel. Gathering some kind of anonymous data on how we code. How to disable it:

1. C:\Users<user>\AppData\Roaming\go\telemetry
2. create a file there named mode (without an extension!)
3. inside the file, write just one word: off

Although, in terms of Windows telemetry, I gave up a long time ago – got tired of cleaning it up. But if there is some sort of tele-perversion that can simply be turned off once and for all – it must be done. Just so PC won’t slow down in vein.

If you are making a Go network application that works with databases and/or javascript, you need to be careful when using the rune data type.

For example, PostgreSQL does not have a data type that matches rune; There are options for storing rune:

1. store in CHAR(1) – then you will need to convert every time you unload from the database like this: []rune(symbolStr)[0]
2. store in BYTEA; unload via w…. make([]byte, 4)
3. or a slightly less obvious variant – store in the database as INT; which is the most relevant.

Plus… Javascript can’t handle runes either. I have to render the output like this: String.fromCharCode(.Icon);

By the way… It’s funny, not all emoji (unicode characters like ) can be stored in rune. Because some of them exceed the size of rune, because they use an extra Unicode selector:

• “🏘️” houses (U+1F3D8 U+FE0F)
• “⛰️” mountain (U+26F0 U+FE0F)
• “🏔️” mountain with snow (U+1F3D4 U+FE0F)

And it’s not just emoji, but just some basic Unicode characters.

So you have to be careful with rune.

The problem is to find in an array of integers a sequence of consecutive numbers whose sum is equal to n.

Our program will read a list of integers (e.g., 5 2 3 4 6 1 4 10 1), followed by one integer n (e.g., 7). Example output:

5 2 3 4 6 1 4 10 1
7
5 + 2 = 7
3 + 4 = 7
6 + 1 = 7

Continue reading →

Based on the list of dungeon raids, find the top player in the guild 🙂 

Example of input:

Continue reading →

Let’s look at some examples of slice programs in Go.

First one… The user enters two rows of numbers. Our task is to collect them in one slice, removing duplicates. As an exercise, we will not use cards, but ordinary slices.

Code:

Continue reading →

Selection sort is a simple sorting algorithm that repeatedly selects the minimum item from the unsorted part of the list and swaps it with the first unsorted item.

Example code in Go:

Continue reading →

О… how much is in this “Chink”-sound!.. We learned to sort by “bubble” back in school (hello, Mr.Obama!). Why not make a code for this sorting in Go? 😀 Even if it is seldom useful, it’s a good exercise for beginners.

Our program will take a string of integers separated by spaces, convert them to a slice of integers and sort the slice in ascending order… Code:

Continue reading →