« first day (4130 days earlier)      last day (182 days later) » 

00:19
REFRESH! There are 6069 unanswered questions (92.2092 answered)
 
1 hour later…
01:35
0
Q: Efficiently tagging first and last of each object matching condition

FromTheStackAndBackHow can I make the code more readable and more efficient? (provided code is O(n^2) time, but intuition says it can be pre-processed and done in O(n) time) Description it tags the first and last of each object matching a condition, and removes all objects without tags the input order must be pre...

 
14 hours later…
15:59
codereview.stackexchange.com might be a better fit for this post if you have working code. — wohlstad 31 secs ago
I’m voting to close this question because this seems more suitable for codereview.stackexchange.comuser12002570 59 secs ago
No @user12002570 , example/hypothetical code is not suitable for review, so don't recommend posting somewhere it's likely to be closed. That's a disservice to the asker. Even if it were better suited somewhere else, that's not a reason to close-vote. You should only do that if it's actually off-topic here, and say why. — Toby Speight 42 secs ago
@Bryan, if you do decide to post at Code Review, be sure to read A guide to Code Review for Stack Overflow users, as some things are done differently over there - in particular, we need real code rather than example code, as the latter leaves us guessing at intentions. Be sure that the code works correctly; include your unit tests if possible. You'll likely get some suggestions on making it more efficient, easier to read, and better tested. — Toby Speight 6 secs ago
16:46
"How can we check that the classes we call our sort on satisfy the rule of (whatever)" By a process known as code review. — n. m. could be an AI 15 secs ago
-1
Q: Simulating a Factory Queue

antonoyaro8This is a problem I have been trying to work on for the last week and I have been struggling a lot. I think I finally got it to work, but I am still not fully sure if my R code is correct. Here is the problem: Suppose there is a factory that on day 1 has 100 boxes New boxes arrive according to s...

17:13
1
Q: Implement service registry servers with load balancing strategies

Jill Have Implemented below service registry class with 2 load balancing strategies.Used Strategy Pattern. Used Stamped lock ( Optimistic write locking) for ensuring thread safety and concurrency. Used Atomic Integer and ThreadLocalRandom in round robin and random load balancers for concurrency. Am...

 
2 hours later…
0
Q: Trying to write a sane alternative to the visitor pattern

AFP_555EDIT: This post has a single question but a lot of context. The single question is if there are downsides with the approach I'm taking over the common Visitor pattern. I've been thinking about the way the Visitor pattern works and how to create a better implementation that is easier to understand...

19:15
@Filburt Yeah, also rejected in Code Review because it doesn't have enough code. The sate of stackoverflow is depressing. Back to reddit where people can actually discuss ideas. — AFP_555 18 secs ago
 
2 hours later…
21:03
possible answer invalidation by Sara J on question by Jill: codereview.stackexchange.com/posts/293460/revisions
Monking
possible answer invalidation by Sara J on question by Jill: codereview.stackexchange.com/posts/293460/revisions
possible answer invalidation by Sara J on question by Jill: codereview.stackexchange.com/posts/293460/revisions
possible answer invalidation by Sara J on question by Jill: codereview.stackexchange.com/posts/293460/revisions
possible answer invalidation by Sara J on question by Jill: codereview.stackexchange.com/posts/293460/revisions
 
2 hours later…
23:46
0
Q: Tutorial mode using PySide6

Max AzatianAs a part of bigger project, I want to add tutorial mode after first user login. That mode is simply a QFrame showing description of highlighted element in parent window + Next/Cancel buttons, moving to the next element or stopping tutorial mode completely. In particular, it works as follows: Ma...


« first day (4130 days earlier)      last day (182 days later) »