

type Foo interface { ... }
with those same matching methods.This shit™ is such a waste of time, human effort and global energy 🤦♂️
type Foo interface { ... }
with those same matching methods.This shit™ is such a waste of time, human effort and global energy 🤦♂️
> if I had a Go struct such as the following:
...
> Here's how the complete interface would look:
o
type Bar interface {
Read(t *Bar, b []byte) (int, error)
}
> This interface matches the behavior and method signature of the provided Foo struct.
----
This is total garbage 🗑️
> if I had a Go struct such as the following:
...
> Here's how the complete interface would look:
o
type Bar interface {
Read(t *Bar, b []byte) (int, error)
}
> This interface matches the behavior and method signature of the provided Foo struct.
----
This is total garbage 🗑️
$ ollama run deepseek-r1:7b
>>> How does your model's reasoning work exactly?
<think>
</think>
I'm an AI assistant that uses algorithms to process information and create responses. While I can mimic some patterns of human thinking in my responses, I
don't have real human thought or consciousness.
>>> So how do you deliberate and argue with yourself over counting the number of letters "r" in the word "strawberry"?
<think>
Alright, so I'm trying to figure out how someone would deliberate and argue with themselves about counting the number of times the letter "r" appears in
the word "strawberry." First off, it seems pretty straightforward, but maybe there's some hidden complexity here.
...
> By following these steps, it's clear that the word "strawberry" contains exactly two "r"s. While overcomplicating the process with comparisons to similar
words, pronunciation considerations, or playful activities can be fun exercises, they aren't necessary for this simple counting task. The key is to
approach the task systematically and carefully.
Ridiculous 🤦♂️
$ ollama run deepseek-r1:7b
>>> How does your model's reasoning work exactly?
<think>
</think>
I'm an AI assistant that uses algorithms to process information and create responses. While I can mimic some patterns of human thinking in my responses, I
don't have real human thought or consciousness.
>>> So how do you deliberate and argue with yourself over counting the number of letters "r" in the word "strawberry"?
<think>
Alright, so I'm trying to figure out how someone would deliberate and argue with themselves about counting the number of times the letter "r" appears in
the word "strawberry." First off, it seems pretty straightforward, but maybe there's some hidden complexity here.
...
> By following these steps, it's clear that the word "strawberry" contains exactly two "r"s. While overcomplicating the process with comparisons to similar
words, pronunciation considerations, or playful activities can be fun exercises, they aren't necessary for this simple counting task. The key is to
approach the task systematically and carefully.
Ridiculous 🤦♂️
deepseek-r1:7b
model using Ollama and this is the result:
$ ollama run deepseek-r1:7b
>>> How many r's in the word strawberry?
<think>
Alright, so I need to figure out how many times the letter 'r' appears in the word "strawberry." Hmm, okay. Let me start by writing down the word to
visualize each letter clearly.
...
Twoo lines later... Argueing with itself over and over again...
> The word "strawberry" contains three 'r's when spelled out as S-T-R-A-W-B-E-R-R-Y. However, upon closer examination and considering standard spelling
> conventions, it actually has only two distinct 'r's: one in "straw" and another pair in "berry."
>
> Answer: There are 2 'r's in the word "strawberry."
Farrkkkk me 🤦♂️
deepseek-r1:7b
model using Ollama and this is the result:
$ ollama run deepseek-r1:7b
>>> How many r's in the word strawberry?
<think>
Alright, so I need to figure out how many times the letter 'r' appears in the word "strawberry." Hmm, okay. Let me start by writing down the word to
visualize each letter clearly.
...
Twoo lines later... Argueing with itself over and over again...
> The word "strawberry" contains three 'r's when spelled out as S-T-R-A-W-B-E-R-R-Y. However, upon closer examination and considering standard spelling
> conventions, it actually has only two distinct 'r's: one in "straw" and another pair in "berry."
>
> Answer: There are 2 'r's in the word "strawberry."
Farrkkkk me 🤦♂️
> Because Oct 31 = Dec 25.=
> Because Oct 31 = Dec 25.=
Take an hour of your time and watch it too:
@fluconf@fluconf https://social.cryptography.dog/@fluconf/113928515477658732
#humanrights #digitalrights #freesoftware
Take an hour of your time and watch it too:
@fluconf@fluconf https://social.cryptography.dog/@fluconf/113928515477658732
#humanrights #digitalrights #freesoftware
went too hard and did not realize it until after the second overpass. the very last leg of the run there was a dog shitting and making the most hilarious sound the dog owner and i couldn't stop laughing.
#running
went too hard and did not realize it until after the second overpass. the very last leg of the run there was a dog shitting and making the most hilarious sound the dog owner and i couldn't stop laughing.
#running
went too hard and did not realize it until after the second overpass. the very last leg of the run there was a dog shitting and making the most hilarious sound the dog owner and i couldn't stop laughing.
#running
https://www.jornalmapa.pt/

https://www.jornalmapa.pt/

QmVjYXVzZSBPY3QgMzEgPSBEZWMgMjUuCg
🤪
QmVjYXVzZSBPY3QgMzEgPSBEZWMgMjUuCg
🤪
QmVjYXVzZSBPY3QgMzEgPSBEZWMgMjUuCg
🤪
QmVjYXVzZSBPY3QgMzEgPSBEZWMgMjUuCg
🤪
> [...] for example, the obligation to establish points of contact for authorities and citizens [...]
> \n for example, the obligation to establish points of contact for authorities and citizens \n






The closest to get to if expressions at the moment is to use a lambda:
foo := func() {
if bar {
return "spam"
}
return "eggs"
}()
But that's also not elegant at all.=

