Looking for something to shoot?
As a 'toy query', I put the above query together....
What badges could be earned if a question, or answer, had just one more vote?
you could make someone happy with a
[badge:Great Question] (never been awarded... yet)
[badge:Reversal]
[badge:Guru]
[badge:Self-...
I've seen a lot of activity about graduation recently. What are the (possible) benefits (and disadvantages) of a graduated site?
I cannot inject the dependency's in the constructor as the OnlinePaymentTransactions are retrieved from using nhibernate.
There's your problem. Your OnlinePaymentTransaction class is/should-be a POCO whose job is to convey data. The Complete() method doesn't belong on that type, it's breakin...
I was wondering if I am in the code below using a feature of Java 8 or misusing it? More explanation as to why it was chosen to be like this is below the code:
public interface Drawable {
public void compileProgram();
public Program getProgram();
default public boolean isTessellate...
I have a Queue that needs to try to process when anything updates in it (add, remove or update).
However, I don't want any of the callers to wait while the processing is happening (either for the processing to happen or while the processing is happening).
This is what I came up with:
private s...
After reading a lot of documents, I wrote this object pooling code. Can anyone help me to
improve this code.?
I am lagging in validating the object, confirming whether I can reuse it or not?
If anything is wrong in the code please point it out.
/*
* To change this template, choose Tools | Tem...
The top bar currently shows, from left to right: the flag indicator (10k only), the suggested edit indicator (2k only), and the “review” and “help” menus.
It's annoying to remember which is which, or which color is which when only one is shown. It would be better if the nature of the indicator...
The task is to create a program that will solve a problem where a matrix (size n * n), which contains integers, is to be divided into four parts, the sums of which are as close to each other as possible. They have to be divided left to right all the way and those parts (top/bottom), can be divide...
So, I have an array [n][n], which contains integers. I want to create a new array of the same size, where every cell contains the sum of all cells "left and above" from the original array.
For example, the cell [5][7], will contain the sum of the block [0][0] to [5][7] out of the original array.
...
I'm using C++ builder XE2. If I create a new VCL Forms application. It creates the following function for main.
WINAPI _tWinMain(HINSTANCE, HINSTANCE, LPTSTR, int)
{
try
{
Application->Initialize();
Application->MainFormOnTaskBar = true;
Application->CreateForm(__...
Things you did well:
Overall the code looks very nice and well organized.
You used comments well.
Things you could improve:
Syntax:
typedef your structs.
struct Stack {
int value;
int is_empty;
struct Stack *next;
};
The typedef means you no longer have to write struct all over ...
I fetch my commments using MYSQL, with the format
comment_id, parent_id, group_id, message
Where the parent_id can be empty if the comment is a 1st level comment.
I store my nested comments, i.e replies in a child array, added within function that I have made.
Here is an output, including 1...
