12:00 AM

12:45 AM
possible answer invalidation by greg b on question by greg b: codereview.stackexchange.com/posts/232532/revisions

12:59 AM
@EthanBierlein FWIW that kind of semi-ignores the legal implications of wilfully ignoring active campaigning against SE on the SE platform
because 'murica you can't be a decent human if you're a platform owner and somebody is sueing you over something that happened on the platform while gaining significant support from the community of the platform
@Duga seems ok, clarification was explicitly requested in the comments.
@Duga rolled back by Mast

2:01 AM
0

Here's my code for a C++ Hill Climbing exercise trying to optimize the Egg Holding function. It works in >1 dimensions, here 2 is used. #include <iostream> #include <cmath> #include <signal.h> #include <unistd.h> #include <pthread.h> #include <array> #include <float.h> #include <sstream> // glo...

3 hours later…
4:48 AM
Monking

5:06 AM
I'm voting to close this question as off-topic because it belongs on codereview.stackexchange.comSelcuk 47 secs ago

5:38 AM
Ben Popper on November 19, 2019

Our guest this week is Kent C Dodds, a developer who makes a terrific impact on the community through his workshops, talks, and newsletter. We chat about why he loves React and how he automated his way from a business analyst to a full fledged software engineer.  Plus, the value of execution versus intelligence, and how version control worked in the days before Git.

The crew chats about how Paul and Sara made the transition from individual contributors to managers overseeing teams of engineers. Sara used to see this transition as a form of selling out, but has a new perspective after having mad …

6:28 AM
0

I quickly wrote this program to transform quadratic expressions in general form into vertex form. \$ax^2 + bx + c \;=\; a(x-h)^2 + k,\quad\text{where}\quad h = -\frac{b}{2a} \quad\text{and}\quad k = c - ah^2 = c - \frac{b^2}{4a}.\$ The actual conversion is easy, but with writing a lexer/parser ...

6:48 AM
0

Current State: I have two CSV files, their sample attached below: FileOutputWithoutBuffer-Metrics.csv File Length , Non-Buffered Time Taken (ns) 1000 , 5499114 2000 , 10971957 3000 , 15736008 4000 , 18970057 5000 , 22173215 6000 , 24612263 7000 , 26118520 8000 , 29934220 9000 , 31919477 10000...

I believe this questions belongs to Code Review once the OP provides a working code. — Baris Yakut 26 secs ago

7:09 AM
1

Problem Definition Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. $$\begin{array}{c|ccccccc|} Symbol & Value \\ \hline I & 1 \\ V & 5 \\ X & 10 \\ L & 50 \\ C & 100 \\ D & 500 \\ M & 1000 \\ \end{array}$$ For example, ...

1 hour later…
8:10 AM
0

Is it possible to improve this code in terms of efficiency / line number ? (avoid nested code ...) It come from a test i failed and i don't know how i could have done it better. from collections import Counter def parse_molecule(molecule): array = [[]] for token in map(str, molecule):...

0

Below is a python script that generates the sequence ['a', 'b' .. 'z', 'aa', 'ab' .. 'az', 'ba', 'bb' .. 'zz', 'aaa', 'aab', ..] This is essentially counting in base 27, replacing every digit with the n-th letter of the alphabet, but skipping any number that would have a '0'. import string de...

8:30 AM
0

I was doing following question on leetcode: String to Integer (atoi) Question: Implement atoi which converts a string to an integer. The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting from this ch...

0

I've written a stack implementation in R using S4 Classes. I would like feedback concerning anything with the application because it's my very first program in R. A main point of concern is how long it takes to create each method. The code is basically the same except for the body. It seems like ...

9:11 AM
0

I've got some working code to compute the Hough transform for circles: int *** allocate3DArray(int y, int x, int r) { int ***array = (int***)malloc(sizeof(int**)*y); for (int i = 0; i < y; i++) { array[i] = (int**)malloc(sizeof(int*)*x); for (int j = 0; j < x; j++) { ...

9:40 AM
possible answer invalidation by Ludisposed on question by Ludisposed: codereview.stackexchange.com/posts/232609/revisions

10:15 AM
I believe there's also "code review" Stack Exchange site for vague requests like this. — IcedLance 18 secs ago

11:13 AM
0

I'm trying to solve P1243E in an efficient manner. The problem in simple words is: Given \$k\$ boxes, \$i\$-th box with \$n_i\$ numbers. All numbers are distinct. We need to select one number from each box and after permuting them in such a way that after putting them back into the boxes will...

11:43 AM
I would just enforce it during a code review — Oliver Cooke 18 secs ago

11:54 AM
0

So, this actually works nicely (we have > 2k repos) but I would really like it to start producing results right away as soon as it has any. Mostly so it seems faster than it is (by being more responsive) bbrepos(){ local url=https://api.bitbucket.org/2.0/repositories/twengg lo...

1 hour later…
1:14 PM
Maybe you would be interested in posting your question on site for code review? codereview.stackexchange.comcharlie_pl 22 secs ago

1:44 PM
I think what you're looking for is a Code Review. — Aly El-Haddad 47 secs ago

remonking

1 hour later…
2:53 PM
I guess this should be the right place codereview.stackexchange.comTony 1 min ago
If your code works it's off topic here and should be asked on code review as Tony mentioned earlier. — Roddy of the Frozen Peas 58 secs ago

In 17 hours this question accumulated 4 votes to close but no one commented to the poster. codereview.stackexchange.com/questions/232617/…

3:47 PM
Monking

Since there is no error with the code you're trying to figure out, you should post this in the codereview mentioned by @Reimeus — Shar1er80 12 secs ago
Since your code works but you want improvement, you should probably try Code Review as it specialises in these questions. There is some overlap with SO sometimes but this site tends to be more about code that doesn't work. Also, can you post what the actual requirement is? — VLAZ 42 secs ago
I'm voting to close this question as off-topic because better fit for codereview.stackexchange.comepascarello 49 secs ago

4:25 PM
Monking

5:00 PM
0

Today I found myself in need of programmatically getting a recursive list of the files on a remote FTP server to look for some data archives. Much to my surprise, I could not find this functionality implemented in some kind of Python library. So I decided to write a simple recursive version of ft...

0

I have the following function to save points cloud in PLOT3D format: def write(filename, mesh): """ Write the mesh to filename in PLOT3D format. filename: is the name of the output file. mesh: is a numpy array of size (N,2) or (N, 3) where N is the number of points. mesh[i] is a ...

Monking

5:20 PM
0

basically I'm learning Java Swing by myself and I'm wondering what is the correct way to wrote code for it? I don't want to have a big class with everything in it and I want to do in the most "correct" way. For example, I have a program that paints N rectangles in a random position into a JPanel,...

5:40 PM
Monking

0

I reviewed the code in Resizable split DIVs Vue.js, suggesting that the OP use computed properties and bound styles. Below are two variants I devised. They are very similar, the main difference is that the second uses -1 for the initial values and ternary operators to check if the data values are...

1 hour later…
6:54 PM
How should this question be handled?
3

Is it possible to improve this code in terms of efficiency / line number ? (avoid nested code ...). It comes from a test I failed. I don't know how I could have done it better. from collections import Counter def parse_molecule(molecule): array = [[]] for token in map(str, molecule): ...

The consensus in the comments is fairly clear; the OP's original code is non-functioning. However, it doesn't appear that the OP themselves was (or is) aware of it.

this.emloyee(just) looks like a typo, so it is probably not correct. But in general, it helps to start with what your expectations of the code are. It is difficult for an outsider to judge whether code makes sense unless you know what it should do. If you are asking about code reviews, stackoverflow is not a good place to ask. Those questions tend to be closed quickly. — Philipp Claßen 59 secs ago

7:11 PM
@EthanBierlein That means it's on-topic per our scope.

Got it, thanks. I came across it while going through the close votes review queue, and I wasn't sure how to deal with it (ended up just hitting "skip").

People, can I have your attention please. If the code is improperly tested, that's too bad. But it is tested (badly) and OP was not aware of the code being awfully broken when posting. Per our current scope, that means the code is not off-topic and you lot could've been pointing this out in answers instead. Thank you, have a nice day. — Mast 7 secs ago
Questions about correctness in unanticipated cases are explicitly mentioned as on-topic in the help center.
To the best of my knowledge, does the code work as intended?
Yes? Good.
Next time, test better.

Good to know. Been a while since I've been active around here; seems like some policies have changed. I'll go back and take a gander through the help center.

Don't think that policy was changed, but feel free to ask if anything is unclear.
We're here to help after all @Ethan

Huh, will do. Maybe my memory is just acting up.

7:43 PM
-1

Hy Guys. I have HashSet with same repeated hashCodes. How do I count all number of collisions, not for particular hashCode, but for all set? Can anybody help? Set <Equals_HashCode> set = new HashSet<>(); set.add(new Equals_HashCode(1,"Ann")); //hashCode 1 set.add(new Equals_HashCode(1,"Ben")); ...

8:34 PM
I'm voting to close this question as off-topic because this is more appropriately asked on codereview.SE. We don't typically "help" with code that works. — Sam Axe just now

Still have to write that meta. Oh man time flies.

0

This is the first time I get my hands on Rust and I'd like to have some feedback on this. Thank you for your help. pub type Coordinate = (usize, usize); pub type Dimension = (usize, usize); pub type GridAction<T> = fn(target: &mut T); pub struct Grid<T> { column_count: usize, row_count...

9:04 PM
0

The libretro-backend crate provides a Rust-friendly way to implement the libretro C API. The latter requires one to implement methods bool retro_load_game(const struct retro_game_info *game); void retro_run(void); void retro_unload_game(void); which will be called in that order (on a single th...

@Sam: "this is more appropriately asked on codereview.SE" -- only if they can improve the question. As asked, it would be off-topic there as well, because the code example is not complete. I have the impression that the codereview users are a bit tired of us stackoverflow users sending these kinds of poor questions to them. On any Stack Exchange site, it's important for users to read the tour and help sections before posting their first question. Sadly, most do not, or fail to heed what they have read. :( — Peter Duniho 43 secs ago

9:33 PM

10:05 PM
0

Previous question: Implementing simplified Jaipur board game I've implemented the other features of the board game, and made a simple learning method that stores state values and makes optimal moves based on that. I've used some oops concepts, but I'm not sure if that's the standardised way t...

10:26 PM
0

I am trying to automate this portion of code in python (code shown for two polygons, I am trying to do the same for 10000 polygons). Any ideas on how to implement this using for loop or whichever fastest way you recommend.. ### Polygon 1 def checkPolygon1(row): point = Point((row['X']), (ro...

11:07 PM
0

The 'friendly form' of a number is written as a sum of reciprocals of distinct positive integers. eg. $$\frac{4}{5} = \frac{1}{2} + \frac{1}{4} +\frac{1}{20}$$ I have written a python program that calculates the friendly form of an inputted fraction. import math from fractions import Fraction ...