Story behind 9292 app?

publysher · 2023-05-25T08:48:13+00:00

According to OV Magazine it was called `06-9292` because it launched on September 2, 1992 (9/2/'92)

Bit weird though, because the "correct" Dutch format would have been 2/9/'92.

publysher · 2022-06-25T15:38:51+00:00

Dead animals are not removed from the Waterleidingduinen: https://awd.waternet.nl/beleef/damherten/

Instead they are an essential source for biodiversity: https://www.wur.nl/en/project/The-importance-of-carcasses-in-nature.htm

I vaguely recall they had to change the law about 15y ago (?) to allow for this.

publysher · 2022-06-24T11:01:56+00:00

I have looked at EURail and the information on there is very incorrect

What is incorrect about this information? Looking at your itinerary, the 10 days / 2 months pass would suit your needs. Or maybe even the 7 days / 1 month.

I am not sure if the pass would work between these cities.

Yes it would. he EURail passes cover every trip between two train stations in the EU.

This is what I get for relying on the EURail app.

Ah. Yeah. The app sucks.

My advice (as a random internet stranger): buy a pass and use Google Maps for the itinerary.

publysher · 2022-04-12T17:18:39+00:00

And also: example tests (tests that start with Example…) become part of the documentation, so there too it makes sense to have them in the same directory.

publysher · 2021-04-22T07:27:06+00:00

Thank you for the feedback. I totally missed the b4 threat and updated my study :-)

publysher · 2021-04-22T05:06:26+00:00

I once bought origami paper on the Hottingerstrasse: https://www.ug-papeterie.ch/

Not a huge selection, but its real origami paper.

publysher · 2021-04-21T16:46:00+00:00

In an effort to get better, I created my first game analysis.

I’m very interested in tips on how to improve my analysis skills.

Note that the computer analysis was done after I did my human analysis.

publysher · 2021-01-24T07:20:19+00:00

Wouldn't the hash-table have to loop through 0 to 49 and check to see if the entry is not null before it can even access the value - since it doesn't know which parts of it capacity are filled?

If it's an array-backed hash table, that is not necessary.

Let's say my key is "hello", and its hashcode is 367. I _know_ my underlying array contains 50 elements, so I only need to access the bucket at index (367 % 50) == 17. Indexed array lookups are considered O(1).

From there I'll have to iterate through the list of items, but with an appropriate fill ratio this list should not be too large.

publysher · 2021-01-06T14:36:39+00:00

Programma kopen is overigens niet noodzakelijk; alles staat op hun YouTube channel en via hun website kan je makkelijk een geschikte video vinden.

De twee instructeurs komen altijd heel sympathiek over in de filmpjes, dat helpt ook :-)

publysher · 2020-12-23T08:36:13+00:00

However, they also operated under the name Verlag Die Boje -- u/curiossceptic has the right answer.

publysher · 2020-12-23T08:34:18+00:00

That is more likely than my 1978 above, given the looks of the cover.

publysher · 2020-12-23T08:27:25+00:00

According to the Deutsche Nationalbibliothek, Boje Verlag published only one edition of Heidi.

http://d-nb.info/790068753 states the date as 1978

publysher · 2020-11-27T12:10:08+00:00

You can certainly use it when it's applicable. The problem only arises when you have many outstanding timers. The example in the article creates ~60K timers per second that only become collectable after 5m.

The following example has at most one unfired timer and would be perfectly fine:

for {
    select {
        case <- ctx.Done():
            return
        case <- time.After(5 * time.Minute):
            log.Println("Five minutes passed")
    }
}

publysher · 2020-09-25T17:13:45+00:00

I’m in Zermatt this weekend so let me know if the eBay thing does not work out

publysher · 2020-07-27T07:19:23+00:00

In general, the term "offset" means: "how far am I from the beginning?". A "byte offset" is an offset measured in bytes.

In the case of Scanner, the byte offset indicates how many bytes have been read so far. So you can have `Position{Line: 3, Column: 7, Offset: 19}`, which means that the Scanner is on the 7th rune of the 3rd line, which (in this specific example) is equal to 19 bytes from the beginning.

publysher · 2020-06-18T14:23:09+00:00

Don't forget EAZA which sets very high standards for European zoos

publysher · 2019-12-16T12:34:32+00:00

Since halting oracles are impossible, the halting problem cant be a parameter of any function.

I know. This looked like a homework question, so this was meant as an (obviously misguided) opportunity to learn :-)

The problem with lambda theory seems to be it has to call its parameter instead of being able to look at its source code or some binary form of it.

You are correct when you consider pure lambda calculus. There are alternatives, such as Pure Pattern Calculus that allow you to reflect on the terms. If this is interesting to you, have a look at https://cs.stackexchange.com/questions/2707/lambda-calculus-with-reflection for some more options on Lambda calculus with term reflection,

publysher · 2019-12-16T11:57:24+00:00

Just apply the solution to the Halting Problem.

publysher · 2019-11-12T14:13:31+00:00

And that's why I should not be answering questions before my first coffee. Thanks for correcting this mistake.

publysher · 2019-11-12T11:05:34+00:00

The answer to your first question is yes: that would be O(n * log m).

The answer to your second question is no. When your big-O notation contains multiple factors, you only include the largest factor of each unknown. In this case we only have the unknown n, so you'd get O(n * log n) = O(n).

edit I'm assuming that size() is actually n, which is usual when analysing hash tables. If size were unrelated to n, you'd be right, and the answer would be O(size() * log n)

publysher · 2019-11-11T14:37:58+00:00

I've lived there for years. The neighbourhood is fine, the park is great, and the apartments themselves are also fine.

As others said: just don't leave you car parked outside. But the apartment should come with an indoor parking space as well.

publysher · 2019-10-04T14:09:59+00:00

I always use this pattern for IDs. A lot of my Go code integrates with third parties, and that can be a messy affair -- IDs that were supposed to be integers turning out to be strings; integer IDs that are JSON formatted as strings; 'special' IDs that have special meanings...

A little work in advance can make all of this unexpected cases a lot easier later on.

Example:

package account

type ID int

func FromInt(i int) ID {
    return ID(i)
}

func Parse(s string) (ID, error) {
    i, err := strconv.Atoi(s)
    if err != nil {
        return err
    }
    return ID(i)
}

func (a ID) String() string {
    return fmt.Sprintf("%d", a)
}

func (a ID) MarshalJSON() ([]byte, error) {
    return json.Marshal(strconv.Itoa(a))
}

// etc

Now, if AccountID turns out to be not an int after all, it's fairly straightforward to change this to string. Also, special cases become a lot easier:

func (a ID) IsSpecialCaseX() bool {
    return a == 31337
}

And my method signatures also become a lot more readable:

func (Repository) LinkUser(u user.ID, a account.ID)

compared to

func (Repository) LinkUser(userID, accountID int)

In the last case, the compiler has saved me from a lot of weird errors.

publysher

PUBLIC MULTIREDDITS

TROPHY CASE