@quartata Like I was thinking I could do it with having a state struct and then jumping to correct part of code but I'm not sure if there is better way
The "state struct" you are looking for is ucontext_t
But there are a few optimizations you can do for generators (semicoroutines)
the simplest being that you can inline them
Additionally if you already know what variables need to be captured at each point in the generator you can potentially get away with not having to have a separate stack, depending on the generator
Nim is very, very good at optimizing generators from what I've seen of it. Give it a look, it compiles to C so you should be able to read its emitted code
def f():
return iterator:
doSomething()
yield 1
yield 2
f() # Good; we see that an iterator is returned. The first time we call it doSomething will run and yield
def f():
doSomething()
return iterator:
yield 1
yield 2
f() # We can call things before the iterator is created and returned. Both behaviors are possible and unambiguous, unlike having yields in the function body proper
The closure iterators in Nim are exactly like this, just with different syntax
The inline iterators are more like templates or macros: the body of your for loop is substituted where the yields are
Two variations, with different performance consequences
But also different usages. You can't use an inline iterator like a coroutine:
The problem is that a. It's a semicoroutine, which means it only yields control back to the caller b. the only state is the program counter, there are no other variables
For example if you look at the new mangling: iFggTCTestNinit, we specify which module. In this case it's in a global class Test in the (generic) entry module
@quartata take a more complex case:
class GeneratorState {
let state: Int
let value: Int
init(state: Int, value: Int) {
self.state = state
self.value = value
}
}
func sideEffect(int: Int) external(sideEffect);
class Test {
let value: Int = 0
func generator(state: Int) -> GeneratorState {
if state == 0 {
self.value += 1
return GeneratorState(state: 1, value: self.value)
} else if state == 1 {
self.value += 2
return GeneratorState(state: 2, value: self.value)
LLVM normally doesn't optimize this but if you ask it to it can:
So basically, if I really want it to be smooth/continuous, I'll need to ignore hue (aka grayscale) or ignore brightness (aka color wheel with no black/white)
Do other programming languages allow post-assignment, like R?
Can you force it?
In many programming languages assignment works like this, where a value such as 5 is assigned to x.
int x = 5; // C++
x = 5 # etc ... // Python
But in R, you can do this (and this is the first I've ever heard ...
@Anush It should be said that NARS and K and J are all APL dialects, and indexing is very important in APL. You often have a Boolean mask and need the indices where the mask has Trues. In APLs, Booleans are simply the numbers 0 and 1. Basically each index is replicated 0 or 1 times, and so it is natural to extend it to higher integers.
@Anush It isn't unreadable at all. It is just that on PPCG, most languages are used in the densest possible way, and some languages can become hard to read when you do that. Production quality APL is usually quite readable, especially if you take the time to learn the meaning of the most common symbols. They are very easy to memorise once someone explains them to you.
@Anush ⍴a gives the shape (i.e. length) of the list. ⍳ is the index generator, so ⍳⍴a just gives the indices of an array of a's shape (e.g. a). / is called replicate as it takes a list of desired number of copies as left argument and the actual data on the right, so a/⍳⍴a uses the data itself to replicate its own indices, which is what you wanted.
@Anush ⊆ cuts its right argument into pieces with a new piece beginning each time the corresponding left argument element is higher than its neighbour on the left. ⍨ is a selfie, which makes the function use its single argument as both left and right argument. ≢ is "tally" (i.e. length), and ¨ is each so we count the length of each segment.
@ngn In such a case, you should post your initial pinging message and then a new msg with fixed width. That preserves indentation, and will still look like a single message.
it's annoying python doesn't have a product function
Anonymous
@Adám X = "mention a challenge idea in TNB", Y = "getting criticized for possibly running afoul of Do X Without Y before anyone even knows what the challenge is about"
@Anush I'm not even sure what idea Mego meant, but I was jokingly assuming he meant a challenge where one has to avoid indentation. However, "Do X without Y" challenges often fail to anticipate the nature of various programming languages, in this case whether a language uses indentation at all. Obviously, Mego realises that, so the whole thing is just a joke.
Anonymous
@Anush A lot of the time, it's used to make a boring challenge less boring, but actually makes it unnecessarily complicated
I like the decision-problemrestricted-source challenges where you have to decide if the input meets some criteria, with a solution that must meet that same criteria. Those are usually pretty good
Detect Rectangular Text code-golf restricted-source decision-problem
Given a string of printable ASCII text (including newlines and spaces), output a truthy value if the string is rectangular, and a falsey value otherwise. Additionally, the source code for your solution must be rectangular.
A s...
Challenge
This time you will create a function which takes a matrix filled with letters from the alphabet and determine if a 2x2 square composed of vowels exists.
If a 2x2 square of vowels is found your function should return the top-left position (row-column) of the square.
If no 2x2 square ...
--[----->+<]>-----.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.
abcdefghijklmnopqrstuvwxyz
Do other programming languages allow post-assignment, like R?
Can you force it?
In many programming languages assignment works like this, where a value such as 5 is assigned to x.
int x = 5; // C++
x = 5 # etc ... // Python
But in R, you can do this (and this is the first I've ever heard ...
Detect Rectangular Text code-golf restricted-source decision-problem
Given a string of printable ASCII text (including newlines and spaces), output a truthy value if the string is rectangular, and a falsey value otherwise. Additionally, the source code for your solution must be rectangular.
A s...
Challenge
This time you will create a function which takes a matrix filled with letters from the alphabet and determine if a 2x2 square composed of vowels exists.
If a 2x2 square of vowels is found your function should return the top-left position (row-column) of the square.
If no 2x2 square ...
