« first day (3432 days earlier)      last day (589 days later) » 

12:05 AM
REFRESH! There are 8053 unanswered questions (89.4629 answered)
 
12:37 AM
This is a better question for codereview.stackexchange.comdisinfor 47 secs ago
 
 
2 hours later…
3:05 AM
Did you forget to add your code to the question? If you have working code and are looking for a review then codereview.stackexchange.com may be a better fit for your question. Be sure to review their help pages before asking to be sure your question is on-topic there. — Retired Ninja 43 secs ago
 
3:46 AM
But overall, this is probably too opinion-based for Stack Overflow--I'd suggest posting at codereview.stackexchange instead. — Gregor Thomas 9 secs ago
 
4:26 AM
0
Q: Tips For Improving This R Code?

antonoyaro8I am writing a loop (in R) to webscrape Reddit posts - using Reddit's API ("Pushshift"). Essentially, I would like to get every comment that contains the word "Trump" between now and until 20,000 hours ago at an hourly basis. The API stores the comments in a JSON frame - I wrote the following cod...

 
 
1 hour later…
5:43 AM
0
Q: Improving algorithm's implementation. Perhaps, putting everything within the loop

nopI implemented the algorithm explained here. I don't like the fact that not everything is within the loop. Perhaps, there is a way to put everything in the loop. I would like to add a switch and select between Arithmetic mode and Geometric mode. Algorithm Arithmetic mode: Each grid has an equal pr...

 
 
3 hours later…
8:27 AM
If there is no obvious problem with your code and you just want a review or general tips, the question might be more suitable for codereview.stackexchange.com. Questions here require a clear problem statement with minimal reproducible example. — Jason Liam 12 secs ago
This is not on-topic for SO. It might be on-topic at codereview.stackexchange.com; before posting, check their help both to see if it's on-topic, not something to avoid, and to see how to post. — T.J. Crowder 10 secs ago
 
8:45 AM
Good question, shallow answers. Hope Code Review was a better fit. — oligofren 33 secs ago
 
 
2 hours later…
10:16 AM
If there is no obvious problem with your code and you just want a review or general tips, the question might be more suitable for codereview.stackexchange.com. Questions here require a clear problem statement with minimal reproducible example. — Jason Liam 28 secs ago
 
10:54 AM
Not sure code review questions about third party code are a good fit for a SO question. — Brian 23 secs ago
 
11:53 AM
possible answer invalidation by Luca on question by Luca: codereview.stackexchange.com/posts/279926/revisions
possible answer invalidation by Luca on question by Luca: codereview.stackexchange.com/posts/279926/revisions
 
12:33 PM
possible answer invalidation by sarema on question by sarema: codereview.stackexchange.com/posts/279877/revisions
possible answer invalidation by sarema on question by sarema: codereview.stackexchange.com/posts/279877/revisions
How can I improve this? - codereview.stackexchange.comburan 18 secs ago
 
12:59 PM
0
Q: Is this the right way to write 'add contact' view

Mike D HovhannisyanI'm using DRF. I have a User model and contacts field in it and contacts are also User instances. class User(AbstractBaseUser, PermissionsMixin): first_name = models.CharField( _("first name"), max_length=30, blank=True, ) last_name = models.CharField( _("

0
Q: Fluent VBA: One Year Later

Brian GonzalezA little over a year ago, I asked for feedback on Code Review for a unit testing framework I created in VBA. Development of this project has been off and on for the past year. Sometimes I wouldn't touch the project for months. Other times, I'd be working very intensely on pushing updates. The pro...

 
1:50 PM
0
Q: Rust language solution to old "Perl Quiz of the Week" #21

Daniel MartinI'm particularly concerned here that I'm copying more often than I need to, and that's slowing things down; obviously, given the algorithm/approach, I need to do some copying, but I don't want to be doing more than necessary. Code also available at https://gist.github.com/fizbin/905a219af86adb95a...

 
2:01 PM
Monking
 
2:16 PM
0
Q: listening on a socket in the background

senya247I have a Server class, which has a function to listen on a socket in the background, and add clients to a vector of clients. The function is int Server::accept_clients(int *res) { auto accept_clients_thread = [this](int *running) { std::cout << "started accepting clients" << std::endl...

0
Q: List view html/js interface

EricTalvI created this list view component and am pretty happy with how it came out. Im looking for critique on what I could improve regarding code readability, best practices and perhaps performance, it seems pretty fast to me, granted the picsum url takes a bit time to load, in production I´d likely ha...

 
3:07 PM
0
Q: Can I use PDO transaction in this way?

kviktor1230So I want to use PDO transaction in PHP OOP where in the class are multiple insert/update queries. If I create a new methods in Class like beginTransaction(), commit(), rollback() and I use them afterwards in my code is it okay? Here is one example: class TestClass { private $pdo; public ...

 
3:24 PM
 
3:51 PM
Monking
@Mast I was reminded of some Microsoft progress bars from the 90s - like for Win 95/98 updates, etc.
 
4:12 PM
Monking
Our application has linear progression bars for quadratic operations
Start at 4 minutes done, 11 minutes remaining - come back to 8 minutes done, 12 minutes remaining
 
4:26 PM
well, that would be a task for proper code review process — buran 36 secs ago
 
5:15 PM
0
Q: Attributes Parsing in C++ Challenge

Grzegorz KrugHey I was doing challenge named "Attribute Pares". Task description is to parse tree with attributes. Then return values for queries. Input trees have valid nesting. Link to task Question How is my code? It passed all cases. Is it not to complex? I think that keeping separate functions is easier ...

 
maybe codereview is a better place, but how do quantify better faster? — nbk 50 secs ago
 
6:22 PM
@brian it's not really code review that I ask, it's mostly is it good to use 1MB buffer. what the difference between 8Kb buffer? — zeus 21 secs ago
 
 
2 hours later…
8:41 PM
0
Q: How to solve a function so that it does not erase the blue spaces beyond the confines of two green spaces?

LilyThis is my code: from byubit import Bit @Bit.run('remove-rocks', 'remove-more-rocks') def run(bit): while not bit.is_green(): bit.move() while bit.front_clear(): bit.move() if bit.is_blue(): bit.erase() pass My issue is that I cannot make it so that the bit...

 
8:56 PM
It seems to me this question is more suited to be asked in the Code Review Forum. Code Review is a question and answer site for peer programmer code reviews. Please read the relevant guidance related to how to properly ask questions on this site before posting your question. — itprorh66 34 secs ago
Welcome to Stack Overflow. "Is there a more efficient way to do this?" is not a valid question for this site. This site is about specific questions that don't involve either reviewing code or giving opinions about the best way to do something non-trivial. I would suggest that you check out the Code Review site. — CryptoFool 8 secs ago
 
9:32 PM
0
Q: OOP Calculate sum from list of objects

AbdulRahmanI think, that I have to somehow incorporate calculating total rent function in the classes given. But the class only know only the rent associated with one object. Or should I do something else, like bringing all these classes under Vehicle class using inheritance, to save lines, but the function...

 
9:58 PM
1
Q: how to optimize this sand collision

susthebusI am making a module that allows you to create sand and simulate it. I have successfully done this, but it runs very slowly. I need this to be able to simulate at least 1000 particles, at a fps higher than 5. How do I optimize this code? My code: import pygame, random, sys pygame.init() FPS = 60 ...

 
10:27 PM
I’m voting to close this question because it is better served by codereview.stackexchange.comBill Lynch 22 secs ago
 

« first day (3432 days earlier)      last day (589 days later) »