00:00 < bridge> in contrast to rust which already has it and you just use it 00:00 < bridge> programming vs coding 00:01 < bridge> ah 00:01 < bridge> i disagree 00:01 < bridge> plz disagree in greater detail :) 00:02 < bridge> ```c 00:02 < bridge> // Compare function for qsort 00:02 < bridge> int cmpfunc(const void* a, const void* b) 00:02 < bridge> { 00:02 < bridge> return (*(int*)a - *(int*)b); 00:02 < bridge> } 00:02 < bridge> 00:02 < bridge> // Function to return K'th smallest 00:02 < bridge> // element in a given array 00:02 < bridge> int kthSmallest(int arr[], int N, int K) 00:02 < bridge> { 00:02 < bridge> // Sort the given array 00:02 < bridge> qsort(arr, N, sizeof(int), cmpfunc); 00:02 < bridge> 00:02 < bridge> // Return k'th element in the sorted array 00:02 < bridge> return arr[K - 1]; 00:02 < bridge> } 00:02 < bridge> ``` 00:02 < bridge> see 00:02 < bridge> is this programming 00:02 < bridge> a quick google and copy 00:02 < bridge> its no different 00:02 < bridge> u just complain about having more functions available in std 00:02 < bridge> but u can do the same with C 00:02 < bridge> its why i find this argument pointless 00:04 < bridge> but its because u focus "programming" or "engineeriing" to simple algorithm exercises 00:04 < bridge> engineering is how you architect applications in whole 00:04 < bridge> etc 00:04 < bridge> was this (that `k_smallest` is using) true btw? 00:04 < bridge> no 00:04 < bridge> well 00:04 < bridge> idk 00:04 < bridge> > Note: This is functionally-equivalent to self.sorted().take(k) but much more efficient. 00:04 < bridge> xD 00:04 < bridge> its just that 00:04 < bridge> sort and take the k element 00:05 < bridge> doesnt sound related 00:05 < bridge> hmm 00:05 < bridge> [4,3,6,1] -> k = 3 -> [1,3,4] 00:06 < bridge> I mean how the sorting works 00:06 < bridge> the algorithm 00:07 < bridge> ```rust 00:07 < bridge> pub(crate) fn k_smallest>(mut iter: I, k: usize) -> BinaryHeap { 00:07 < bridge> if k == 0 { 00:07 < bridge> return BinaryHeap::new(); 00:07 < bridge> } 00:07 < bridge> 00:07 < bridge> let mut heap = iter.by_ref().take(k).collect::>(); 00:07 < bridge> 00:07 < bridge> iter.for_each(|i| { 00:07 < bridge> debug_assert_eq!(heap.len(), k); 00:07 < bridge> // Equivalent to heap.push(min(i, heap.pop())) but more efficient. 00:07 < bridge> // This should be done with a single `.peek_mut().unwrap()` but 00:07 < bridge> // `PeekMut` sifts-down unconditionally on Rust 1.46.0 and prior. 00:07 < bridge> if *heap.peek().unwrap() > i { 00:07 < bridge> *heap.peek_mut().unwrap() = i; 00:07 < bridge> } 00:07 < bridge> }); 00:07 < bridge> 00:07 < bridge> heap 00:07 < bridge> } 00:07 < bridge> ``` 00:07 < bridge> this is itertools version 00:07 < bridge> idk if its same as std 00:07 < bridge> ah std returns a iterator 00:07 < bridge> not a binary heap 00:08 < bridge> btw how did you find it? (asking bcs I was also looking for `crate::k_smallest::k_smallest(self, k)`) 00:08 < bridge> ah wait 00:08 < bridge> u linked to itertools 00:08 < bridge> u are using a library in the first place! 00:08 < bridge> ikr! 00:08 < bridge> I am not against using libs 00:08 < bridge> so ur comparision is already completly wrong 00:09 < bridge> u also have libs in C 00:09 < bridge> for common algos 00:09 < bridge> biased 00:09 < bridge> xD 00:09 < bridge> https://github.com/rust-itertools/itertools/blob/c116c200f97b39d521285e93e06f00ce9093bf40/src/k_smallest.rs#L4 00:10 < bridge> i go sleep 00:10 < bridge> gn 00:10 < bridge> gn and ty 00:18 < bridge> the ABI requires you to AFAIK 00:20 < bridge> IMO it's nice that you can use good algorithms without implementing everything yourselves 00:20 < bridge> even C has qsort 😉 00:21 < bridge> yeah but I went researching about sorting an array of fixed length and I found about this 00:34 < bridge> I did some leetcode today, I'm soooo out of practice 😦 00:35 < bridge> :O leetcode sounds fun 00:36 < bridge> btw Learath have you heard about this before? 00:38 < bridge> I've heard about it before, however I'm not sure how relevant they are in practice 00:47 < bridge> Wot you doing? 00:47 < bridge> What even are you scanning? 00:54 < bridge> hmm it appears that `qsort` uses `quicksort` which in worst-case performance is `O(n^2)` while `Bitonic sort` worst-case is `O(log^2(n))`. 00:57 < bridge> xD I completely missed these two last msgs from chiller I read `BOT` and thought it was github :kek: 01:02 < bridge> :c 01:17 < bridge> bitonic sort cannot be implemented on (current) CPUs though 01:17 < bridge> so it's not really useful for C ^^ 01:17 < bridge> :O true 01:27 < bridge> not always 01:30 < bridge> glibc qsort will try mergesort first, musl uses heapsort, msvc uses quicksort 01:31 < bridge> ah ty I was looking for this info 😉 01:31 < bridge> glibc also might be falling back to insertion sort when it gets small enough, though I don't remember 01:32 < bridge> ic, well then this is nullified xD 01:32 < bridge> https://elixir.bootlin.com/glibc/latest/source/stdlib/qsort.c yeah if it resorts to quicksort, it'll only partially quicksort and finish it off with insertion sort 01:33 < bridge> Only in context of hardware 01:33 < bridge> ok ty :) 01:36 < bridge> Funnily enough as far as the standard is concerned qsort doesn't even have any requirements, it could be quantum bogo sort 01:39 < bridge> I guess that this makes standard-compliance practically easier than having to prove performance requirements for compliance -- zogtib 01:41 < bridge> Sometimes requirements can become an issue, like the requirements on `unordered_map` in C++ permanently crippling it. So maybe the C approach of leaving it up to the implementers was the better choice 01:51 < bridge> I guess that performace behaviour is something important but it can make standard-compliance maybe harder than necessary because programmers don't care only for things required by the standards anyways. 01:52 < bridge> *because programmers depend on implementations also for things the standards doesn't include etc 01:57 < bridge> Thus, including things like that in standards would make doings things correctly harder because of the compliance overhead, even if those are practically necessary in implementations anyways. (I think this is want I mean) 01:57 < bridge> Thus, including things like that in standards would make doings things correctly harder because of the compliance overhead, even if those are practically necessary in implementations anyways. (I think this is what I mean) 02:11 < bridge> what's this 02:46 < bridge> I just found out that desmos has `tone()` funcion 😮 08:31 < bridge> The server automatically does that bcs of spoofed atks 08:33 < bridge> This. You can reinvent the wheel million times. But for stuff that doesn't exist anyway you are forced to engineer, no way around it 08:46 < bridge> morning :poggers2: 08:47 < bridge> Good morning 08:53 < bridge> gm :) 08:54 < bridge> xD it's been 6 hours since this 09:37 < bridge> Still don’t get it. Is someone spoofing a ip and pinging you with master traffic which your server then responds to? The reflection attack? What’s the target of the attack? Did your Hoster Complain? 09:49 < bridge> Well that's the question. If the hoster also complains for master servers, then rip 09:50 < bridge> Let's wait until the attacker reads this chat and tries out😬 10:20 < bridge> lot of places say the abi in linux is parameters in `rdi, rsi, rdx, rcx, r8, and r9.` but i found for syscalls rcx is replaced by r10 10:21 < bridge> why are all cheat sheets using at&t omg 10:29 < bridge> > Functions preserve the registers rbx, rsp, rbp, r12, r13, r14, and r15; while rax, rdi, rsi, rdx, rcx, r8, r9, r10, r11 are scratch registers. The return value is stored in the rax register, or if it is a 128-bit value, then the higher 64-bits go in rdx. Optionally, functions push rbp such that the caller-return-rip is 8 bytes above it, and set rbp to the address of the saved rbp. This allows iterating through the existing stack frames. This can 10:29 < bridge> @heinrich5991 this is from the osdev wiki 10:45 < bridge> gn 12:55 < ws-client> @Jupstar ✪ do you think it is a targeted attack to you? Or are all servers abused for one bundled reflection attack? 13:00 < bridge> The target is teeworlds ofc 13:00 < bridge> Not me 13:01 < bridge> If it would be me personally. I'd demand a wild Western like fight to settle this once and for all 13:48 < ws-client> lmao 13:49 < ws-client> Ah you assume the target is the master server it self 13:49 < ws-client> Which servers do you even host? Some alive fng 0.7 servers? 13:59 < bridge> Why arent there more emotes 13:59 < bridge> Like a hammer or hook emote 13:59 < bridge> Hf emote 14:00 < bridge> because teeworlds didnt have hammerflying intended 14:01 < bridge> Who cares about that 14:16 < bridge> Not the target, but kind of the source 14:16 < bridge> The fake source 14:16 < bridge> For the reflection 14:48 < bridge> do u guys knows how much players a vps can handle per core/ghz 14:59 < bridge> i broke hammer welp 14:59 < bridge> https://cdn.discordapp.com/attachments/293493549758939136/1176522307611676743/Base_Profile_2023.11.12_-_02.43.58.04.DVR_3.mp4?ex=656f2cc8&is=655cb7c8&hm=5cd7d1adbffa47ee3336ae175f5a0ce36fb584bf739637b441b61e47023978ec& 14:59 < bridge> but really, where can i fix it? 15:07 < bridge> 128p per shittiest vps u can buy 15:46 < bridge> 😂:brownbear: 15:51 < bridge> and after i updated my client 15:51 < bridge> https://i.imgur.com/D49GEZn.png 15:51 < bridge> gg 15:52 < bridge> Provide src and we can help you :troll: 15:52 < bridge> faie 15:52 < bridge> fair 15:52 < bridge> https://github.com/StormAxs/StA 15:53 < bridge> oh lol didn't actually think it was open source 15:53 < bridge> https://media.discordapp.net/attachments/1091796670951456809/1116992248970747945/62.gif 15:54 < bridge> XDD how long did you not merge master? 15:56 < bridge> i just synced fork 15:56 < bridge> i just synced the fork 15:56 < bridge> do u use vulkan? 15:56 < bridge> i tryed all render metods 15:56 < bridge> even open gl 106 15:57 < bridge> rip 15:57 < bridge> U see far into the future 15:57 < bridge> I'd say you have a missing data directory entry 15:57 < bridge> Do a clean rebuild 16:03 < bridge> @jupeyy_keks helped as always 16:03 < bridge> thanks jupi 16:03 < bridge> :happy_cry_cat: 16:05 < bridge> well 16:06 < bridge> where can i find hammer position while spectating? 16:06 < bridge> still this goofy bug 16:25 < bridge> @jupeyy_keks do u think player count scales log or linear 16:25 < bridge> perf wise 16:28 < bridge> ??? 16:28 < bridge> Uncorrelated 16:28 < bridge> @learath2 ok i had a brain fart 16:28 < bridge> i meant perf per player count 16:29 < bridge> hmm like if u get a beefy vps 16:29 < bridge> Okay that makes more sense 😄 16:30 < bridge> Theoretically it should exhibit polynomial behaviour with all the n^2 algorithms we use 16:31 < bridge> But that's assuming one gameserver with player count going to infinity 😄 16:36 < bridge> xd 16:36 < bridge> at work they doing a backend game server with elixir and i think something in rust 16:36 < bridge> on a 24 core machine they could handle 600 players 16:37 < bridge> which idk if its a lot 16:37 < bridge> but well completly unrelated game 16:37 < bridge> i think its 3d too 16:37 < bridge> Uff that's really bad 16:37 < bridge> i thought so too 16:37 < bridge> xd 16:37 < bridge> Is the game so complex? 16:37 < bridge> i doubt 16:37 < bridge> im not in the team 16:37 < bridge> i dont do elixir 16:38 < bridge> But network can quickly become a limiting factor 16:38 < bridge> i think its mainly cuz elixir ngl 16:38 < bridge> true 16:38 < bridge> i think they use websockets tho 16:38 < bridge> they considering quic 16:38 < bridge> I assume these 600 players are on different lobbies too? 16:39 < bridge> ye 16:39 < bridge> lobbies of 10 players iirc 16:39 < bridge> I c 16:39 < bridge> 2.9ghz 16:39 < bridge> 256gb ram 16:39 < bridge> but itjust uses 2gb iirc 16:39 < bridge> xd 16:39 < bridge> XD 16:40 < bridge> gotta have backup kek 16:44 < bridge> @learath2 when use quad trees or bsp on ddnet 16:46 < bridge> maybe in @Zwelf's rust impl of ddnet physics 😉 16:46 < bridge> it's probably easier there 17:43 < bridge> Oh yea had the same. I think something with the mapres changed. Make sure your user wide storage location matches the source code generated data folders and so on. So just running a make install in your repo should fix it 17:47 < bridge> Or updating ddnet via the package manager 18:47 < bridge> https://paste.pr0.tips/Hnw?c if anyone has a couple minutes, I'm curious how you would do this task 18:48 < bridge> where is the task? 18:48 < bridge> You just merge two sorted linked lists 18:48 < bridge> list.append(list2) 18:48 < bridge> The resulting list must also be sorted 😄 18:49 < bridge> then i'd use a datatype that is called sortedlist xd 18:49 < bridge> ok 18:49 < bridge> is that yours or from someone else? 18:49 < bridge> That's mine 18:51 < bridge> seems trivialish but also interesting, lemme try 🙂 18:51 < bridge> It's absolutely trivial, just curious how other people would go about it, there are lots of ways to do it 18:51 < bridge> ```c 18:51 < bridge> struct ListNode *mergeTwoLists(struct ListNode *list1, struct ListNode *list2) { 18:51 < bridge> struct ListNode dummy; // Dummy head node. 18:51 < bridge> struct ListNode *cur = &dummy; 18:51 < bridge> 18:51 < bridge> // While there are elements in either list. 18:51 < bridge> while (list1 && list2) { 18:51 < bridge> if (list1->val < list2->val) { 18:51 < bridge> cur->next = list1; 18:51 < bridge> list1 = list1->next; 18:52 < bridge> } else { 18:52 < bridge> cur->next = list2; 18:52 < bridge> list2 = list2->next; 18:52 < bridge> } 18:52 < bridge> cur = cur->next; 18:52 < bridge> } 18:52 < bridge> 18:52 < bridge> // Append the remaining elements of `list1` or `list2`. 18:52 < bridge> cur->next = list1 ? list1 : list2; 18:52 < bridge> 18:52 < bridge> return dummy.next; 18:52 < bridge> } 18:52 < bridge> ``` 18:52 < bridge> hello chatgpt 18:52 < bridge> hi 18:52 < bridge> nice one 18:52 < bridge> ChatGPT definitely ruined the world 18:53 < bridge> yea, I think I like that one better 18:53 < bridge> It's the same as my first one 😄 18:53 < bridge> Well same idea 18:53 < bridge> I was going to complain that yours does unnecessary writes 18:53 < bridge> inner cycle got removed 18:54 < bridge> also I find your first solution/chatgpt's solution easier to understand 18:54 < bridge> +1 18:54 < bridge> Yeah, I think I like that one better too 18:54 < bridge> ```c 18:54 < bridge> struct ListNode *mergeTwoLists(struct ListNode *list1, struct ListNode *list2) { 18:54 < bridge> if (!list1) return list2; 18:54 < bridge> if (!list2) return list1; 18:54 < bridge> 18:54 < bridge> if (list1->val < list2->val) { 18:54 < bridge> list1->next = mergeTwoLists(list1->next, list2); 18:54 < bridge> return list1; 18:54 < bridge> } else { 18:54 < bridge> list2->next = mergeTwoLists(list1, list2->next); 18:54 < bridge> return list2; 18:55 < bridge> } 18:55 < bridge> } 18:55 < bridge> ``` 18:55 < bridge> xd 18:55 < bridge> no 18:55 < bridge> https://tenor.com/view/discordmemes-gif-25118502 18:55 < bridge> noo 18:55 < bridge> NOOO 18:55 < bridge> Meh, chatgpt definitely ruined the fun of these kinds of challanges 18:56 < bridge> I got zogpt 18:56 < bridge> aka I just ask zogtib 18:56 < bridge> I was curious how you'd solve it, not how a machine learning model trained on stackoverflow where this question has been asked 10000 times would solve it 18:56 < bridge> the problem is, u didnt ask me if u want the fastest, or the cleanst, or the shortest 18:57 < bridge> fastest: don't use linked lists 18:57 < bridge> hm, are you golfing on so? 18:57 < bridge> I have a feeling you'd just ask chatgpt either way 18:57 < bridge> i think there's no gpt answers 18:57 < bridge> i mean i've done such coding challenges so often already 18:58 < bridge> I'm just doing some leetcode to warm back up to coding 18:58 < bridge> Which solution you'd pick on your own volition given nothing but the challange is what's curious to me 18:58 < bridge> @learath2 ok, here's is one i 100% did myself 18:58 < bridge> 18:58 < bridge> https://www.codewars.com/kata/52774a314c2333f0a7000688 18:59 < bridge> || 18:59 < bridge> ```c 18:59 < bridge> #include 18:59 < bridge> 18:59 < bridge> bool validParentheses(const char *s) { 18:59 < bridge> int CurP = 1; 18:59 < bridge> while(*s) { 18:59 < bridge> switch(*s++) { 18:59 < bridge> case '(': CurP *= 2; break; 18:59 < bridge> case ')': CurP /= 2; break; 18:59 < bridge> } 18:59 < bridge> } 18:59 < bridge> return CurP == 1; 18:59 < bridge> } 18:59 < bridge> ``` 18:59 < bridge> || 18:59 < bridge> my solution: 18:59 < bridge> || 18:59 < bridge> ```c 18:59 < bridge> #include 18:59 < bridge> 18:59 < bridge> bool validParentheses(const char *s) { 18:59 < bridge> int CurP = 1; 18:59 < bridge> while(*s) { 18:59 < bridge> switch(*s++) { 18:59 < bridge> case '(': CurP *= 2; break; 18:59 < bridge> case ')': CurP /= 2; break; 19:00 < bridge> } 19:00 < bridge> } 19:00 < bridge> return CurP == 1; 19:00 < bridge> } 19:00 < bridge> ``` 19:00 < bridge> || 19:00 < bridge> Ah I did this one yesterday too 19:00 < bridge> Oh, actually a different one nvm 19:00 < bridge> See now that's cute 19:00 < bridge> give me the codewars next time, then it's more fun, bcs it can compile etc. 19:01 < bridge> Hm, never tried codewars, let me give that a go too 19:02 < bridge> 🤓 `CurP <<= 1;` `CurP >>= 1;` 19:02 < bridge> Oh actually I did try codewars a bit apparently 19:02 < bridge> ```c 19:02 < bridge> struct list { 19:02 < bridge> int val; 19:02 < bridge> struct list *next; 19:02 < bridge> }; 19:02 < bridge> 19:02 < bridge> struct list *merge_inplace(struct list *a, struct list *b) { 19:02 < bridge> struct list *result; 19:02 < bridge> struct list **cur = &result; 19:02 < bridge> 19:02 < bridge> while(a && b) { 19:02 < bridge> if(a->val < b->val) { 19:02 < bridge> *cur = a; 19:02 < bridge> cur = &cur->next; 19:02 < bridge> a = a->next; 19:03 < bridge> } else { 19:03 < bridge> *cur = b; 19:03 < bridge> cur = &cur->next; 19:03 < bridge> b = b->next; 19:03 < bridge> } 19:03 < bridge> } 19:03 < bridge> 19:03 < bridge> if(a) { 19:03 < bridge> *cur = a; 19:03 < bridge> } else { 19:03 < bridge> *cur = b; 19:03 < bridge> } 19:03 < bridge> return result; 19:03 < bridge> } 19:03 < bridge> ``` 19:03 < bridge> here's mine, untested 19:03 < bridge> it has also never seen a compiler 19:04 < bridge> As a fan of the double pointer trick I approve, the dummy head in gpts answer was ugly 19:04 < bridge> yea, I also didn't like it so much 19:05 < bridge> it's essentially a hidden double pointer with a useless value field 19:06 < bridge> You are missing some *s I think 19:06 < bridge> yes 19:06 < bridge> Atleast my mental compiler isn't liking the amount of -> and & there per datatype 😄 19:06 < bridge> compiler says I should use `&(*cur)->next` instead of `&cur->next` 19:06 < bridge> not necessary in rust :p 19:07 < bridge> Yeah I think I would change the very last if block to a ternary and have this as my final answer 19:24 < bridge> ```rs 19:24 < bridge> use std::mem; 19:24 < bridge> 19:24 < bridge> struct List { 19:24 < bridge> val: i32, 19:24 < bridge> next: Option>, 19:24 < bridge> } 19:24 < bridge> 19:24 < bridge> fn merge_inplace(mut a: Option