Welcome to Code Forum!

Join a community that supports you and your coding journey from day one. We strive to be a friendly, supportive community that empowers everyone to be better developers. By registering with us, you'll be able to discuss, share and private message with other members of our community.

SignUp Now!

Search results

  1. JosiahMaybe

    JavaScript I want to create a Tweet counter per day- how would I do it?

    Yes, you may have to talk this over with X, I think you may have to sign up for an X dev account and make or find an app for X for this, you get documentation access once you sign up for X developer. X E.
  2. JosiahMaybe

    JavaScript What's wrong with my code- think JS related

    I do not see that JS and uppercase anything in URLs is generally bad, if it is the URL then rename the file please. Also, feel free to use defer on JS so it is in head but not loaded until the end. X E.
  3. JosiahMaybe

    Snayk 3+d game demo rendered 6 million shapes today at once and at reasonable speeds, awesome. X E.

    Snayk 3+d game demo rendered 6 million shapes today at once and at reasonable speeds, awesome. X E.
  4. JosiahMaybe

    Why is this not sorting equals correctly?

    With the help of someone on Rust users forum, ChatGPT, and Grok 3, I officially have something that works. X E.
  5. JosiahMaybe

    Why is this not sorting equals correctly?

    Looks like that merge sort method does not work for equals. I tried it. X E.
  6. JosiahMaybe

    Why is this not sorting equals correctly?

    cuda-sorting-benchmark/bitonic_sort.cu at main · hithuv/cuda-sorting-benchmark, Something I found, maybe it helps?
  7. JosiahMaybe

    Why is this not sorting equals correctly?

    //Equal numbers found, set before or after based on half. Only stuff in {} brackets with that is faulty. There are two. In fact, that is the bulk of the code, feel free to start from scratch only in that. X E.
  8. JosiahMaybe

    Why is this not sorting equals correctly?

    Why is this merge sort not sorting equals correctly?, just to be sure I got latest code here. X E.
  9. JosiahMaybe

    Why is this not sorting equals correctly?

    Updated version, it still has the same problem but is closer to correct. //8/7/2025, 5:47PM, better version. X E. //8/19/2025, 4:16PM, begin work on double buffered thread per element version. X E. //8:26PM, break, broken same number stuff. X E. //8/20/2025, 12:53PM, return. X E. //2:05PM...
  10. JosiahMaybe

    Why is this not sorting equals correctly?

    What is wrong is it does not handle exact equals correctly. Here is my merge sort, you can try it in Rust playground. just the thing called mergeSortMain and it is clearly marked what parts are for equals. It is Rust. I have no warn things so I can see results easily. It does all else correctly...
  11. JosiahMaybe

    It is official, RinomXE 3+ dimensional Slang shaders work and are tested now. Now just speeding...

    It is official, RinomXE 3+ dimensional Slang shaders work and are tested now. Now just speeding them up. X E.
  12. JosiahMaybe

    Parallel merge sort remainder X E.

    Everything solved. X E.
  13. JosiahMaybe

    Parallel merge sort remainder X E.

    I know exactly what it is now, "step" is not getting from CPU to GPU, I am dumb. No longer the shader so I consider this solved. X E.
  14. JosiahMaybe

    Parallel merge sort remainder X E.

    /* 7/22/2025, 6:03PM, start. X E. 7:32PM, like done untested. X E. 7:50PM, like done, untested. X E. 8:41PM, like done, untested. X E. 7/25/2025, 1:25PM, done better. X E. 7/29/2025, 1:46PM, start fixes for speed. X E. 2:08PM, break, broken. X E. 3:34PM, back. 7/30/2025, 11:56AM, ended 8:30PM...
  15. JosiahMaybe

    Parallel merge sort remainder X E.

    Rust Playground, This officially works, I translated from this to Slang shaders but it still is not working. I am using wgpu, eframe, and egui, this seems like I got the shader right but what do I do? X E.
  16. JosiahMaybe

    Parallel merge sort remainder X E.

    I think I can find fault with that thing, may not handle equal numbers correct, so I am implementing my own. Also no license so no derivative works. I think I will do like a thread per element to sort and last remainders always increase size so I may do like first thread in an incomplete group...
  17. JosiahMaybe

    Parallel merge sort remainder X E.

    coda-sorting-benchmark/bitonic_sort.cu at main · hithuv/coda-sorting-benchmark, This works maybe but I will still need a swap for odd and not power of 2, I know my algorithm with 2 buffers is one copy in per element with two sorted things of any size. I think what I will do is benchmark them...
  18. JosiahMaybe

    Parallel merge sort remainder X E.

    Well, Bitonic sort won't because it needs power of 2, quick sort is notoriously slow parallelized, Radix sort I do not know how to do, what else do you suggest? Maybe a Bitonic sort for next power of 2 down then merge in the rest? Bitonic handled a lot more, I think next is that. X E.
  19. JosiahMaybe

    Parallel merge sort remainder X E.

    /* 7/22/2025, 6:03PM, start. X E. 7:32PM, like done untested. X E. 7:50PM, like done, untested. X E. 8:41PM, like done, untested. X E. 7/25/2025, 1:25PM, done better. X E. 7/29/2025, 1:46PM, start fixes for speed. X E. 2:08PM, break, broken. X E. 3:34PM, back. 7/30/2025, 11:56AM, ended 8:30PM...
  20. JosiahMaybe

    Parallel merge sort remainder X E.

    Well without order 1 million, with order, 10000, what would you suggest to be better without having shared memory or other things Slang does not support everywhere? As far as I can tell, merge sort was supposed to be somehow sort smaller chunks into bigger chunks until all sorted. Also, no...
Back
Top Bottom