would this be a dupe? [this challenge](https://codegolf.stackexchange.com/questions/92168/slowly-turn-a-string-into-another) but 1. you cant remove any characters from the first string that will end up being in the second string 2. you dont have to do the like, removing from the end of the string always thing
@Adám That only matters as far as other peoples' opinions on my languages, which I don't particularly care about. I'm more concerned with the fact that I have cool ideas but not the skill to realize them.
@PyGamer0 Because the font formats have a cap on how many glyphs they can have. Also, it is a massive amount of work to design all the 140-something thousand glyphs.
"Why would you even want that?" questions aside, from a programming perspective there's a very simple reason: the OpenType spec only affords an addressable glyph index space of one USHORT, so one font can only support 16 bits worth of glyphs identifiers, or 65,536 glyphs max. (And note the termin...
@RedwolfPrograms I don't care if RedwolfIsSuperAwesomeMonoProPlus has every character in Unicode, if Consolas and Roboto Mono and Cousine are what people actually use, those are what matter
@pxeger wait, that's not actually what I thought it was
@RedwolfPrograms but would the client-side renderers support a font with that many glyphs, even if the library reading the font file supports it? (e.g. libxft)
When I was experimenting with making an APL font, I tried merging missing glyphs from Noto Sans into Noto Sans Mono, but I didn't have the skills to do it right.
@Anush you didn't specify in the question that you wanted it grouped by both user id and by day. It looked like you were going to assume the day was always the same for each user id
@Anush that would probably just be a duplicate of "how to get day from datetime object" and/or "how to group items in a list by value"
A ZISC is a hypothetical computer where the only instruction in that language has no parameters. Therefore, the output is entirely dependent on the input since there are no "programs" in a ZISC. Therefore, your goal is to design a Turing-complete ZISC and code an interpreter for said language wit...
@Anush I have a very dirty solution, but I kind of expanded so that i have a TextRecord class for object oriented programming. I have to adapt it for your needs, but there's a lot of loops in this, so it's not nice in terms of O-notation
The event scheduler is a recurrent theme in event-driven architectures: something triggers an event that needs to be checked in the future one or more times. I has particular use in trading where you want to correlate one market event with price movements in the future at several time deltas (1ms...
@cairdcoinheringaahing ... Is it bad that I don't know what the better solution is to most of these problems? Evidently my JavaScript knowledge hasn't progressed much past 2008 either. :P
I think it might be a duplicate of this--they're not exactly the same, but the ZISC challenge is a proper subset of the general TC language challenge, and I think the shortest answers to the TC challenge can be seen as ZISCs. Thoughts?
Like how 1 / 2 + 1 / 4 + 1 / 8 + ... is the same as 1 / 2 + (1 / 2) * (1 / 2 + (1 / 2) * (1 / 2 + (1 / 2) * ..., so you can change that to x = 1 / 2 + (1 / 2) * x, and then solve it
I don't know about all the mankind, but I know enough people, who becomes sleepy after their meals. Also, I'm not sure, what kind of food do they consume, but I personally get sleepy almost from any food: sweet, fat, spicy, salty, liquid, tasty, not tasty, etc.
Is this phenomenon well known? And...
oh also, i checked out op's github and they have their website linked & all of that lmao. including their work history at places like JP morgan for low-latency code