I am currently in the process of creating a console game (cmd) and having trouble getting the HP system to work. I want to be able to subtract and add HP as needed but when I add and subtract hp it always takes from the original amount (20) and then subtracts or adds to that instead of what the p...
Question/Answer ratio
The answers-per-question ratio was not brought up as being a problem in the Grace Note Review, but it is a persistent 'concern' on Area-51. Currently CodeReview is at 1.8 answers/quesion, which is 'OK'. Area51 claims that 2.5 is a good ratio... So, how to improve?
Well, th...
NO, it shouldn't exist, not even be a synonym!
c# has major differences between versions, too. And yet, the only C# tag we have is c#. How do we address this?
C# 2.0 introduced generics. Enter the generics tag.
C# 3.0 introduced linq. Enter the linq tag.
C# 4.0 introduced the Task Parallel Li...
I have coded up an implementation of Conway's Game of Life and I have a performance bottleneck in it which I wish to be optimized. The main logic is in the Universe class. I have omitted all code which is not applicable here for brewity:
public class Universe {
private static final int FLIP...
Interested in a review of this code, in particular the (hopefully monadic) bind. I actually put this to good use. It was a nice complement to Guava's Optional, and shorter than:
Optional.fromNullable(x).or(y);
And I threw in a bind method, which I think lifts it up into monad space.
One qu...
I'm trying to write a program that will return the number of solutions to the N-Queens problem. The code uses a stack to keep track of the valid queen position, popping and pushing appropriately. But there are certain parts in the code that are never reached. I believe they are the cause of the p...
This is very simple to those who are javascript expert. I need to get the index of the getElementsByClassName. It would trigger undefined.
function session_save2(course_id){
alert(course_id.index);
exit;
}
We want to export some data from our data base as the XML.
For example, an Person have age, name and some other properties.
We have two choice to define the XML format.
Choice #1
<Persons>
<Person>
<Age>16</Age>
<Name>Richard</Name>
</Person>
<Person>
<Age>34</Age>...
Things you did well
You defined i within your for loops, and abided by the C99 standards.
You used an external library instead of writing your (more likely inefficient) own methods, and thus avoided unnecessarily reinventing-the-wheel.
Things you could improve on:
Efficiency:
Copying a who...
for loop:
if all(k in data for k in ('current', 'resistance')):
current = data["current"]
resistance = data['resistance']
MyClass.myfunction(1st_arg, 2nd_arg, current, resistance)
elif all(k in data for k in ('inductance')):
inductance = data['inductance']
MyClass.myfun...
I am not sure why the following code isnt working.
I try to use gcc to compile it gcc -Wall -o test test.c, it gives me warning message: control reaches end of non void function.
But I couldn't find the error so I tried to compile it ignoring the warning messages, and tested the program out usi...
db.customers.mapReduce(
function() {
Array.prototype.getUnique = function() {
var u = {}, a = [];
for (var i = 0, l = this.length; i < l; ++i) {
if (u.hasOwnProperty(this[i])) {
continue;
}
a.p...
I have come up with a Java 8 solution for the following problem:
In the 20×20 grid below, four numbers along a diagonal line have been marked in red (bold here).
08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
81...
See here for source: https://github.com/samkio/Dungeonator
I am writing a ASCII dungeon creator inspired from games such as Angband, Moria etc.
The main goal of the project is to allow a user to come along and implement their own "DungeonLevelGenerator" so they can generate dungeons however the...
Here is the code for the QuickSort class that I created.
public class QuickSort {
public static void sort(Comparable[] a) {
quicksort(a, 0, a.length-1);
}
private static void quicksort(Comparable[] a, int lo, int hi) {
if(lo >= hi) return;
...
// javadoc on every method would be nice
// create a convinience method with signature void quicksort(T[] a)
// change signature to <T extends Comparable<T>> void sort(...)
public static void sort(Comparable[] a) {
// standard method to specify ranges is from inclusive to exclusive
quicksor...
This is a C++11 code , trivial answer and a comedian Wrong Answer from UVA !!!
#include <iostream>
#include <string>
#include <vector>
const short block = 3;
const short BGC = 3;
unsigned int inputSequance[block][BGC];
unsigned int movementCalculation( std::string glassSequance )
{
unsign...
Things you did well
You defined i within your for loops, and abided by the C99 standards.
You used an external library instead of writing your (more likely inefficient) own methods, and thus avoided unnecessarily reinventing-the-wheel.
Things you could improve on:
Efficiency:
Copying a who...
I've done something like this once. The main source of problems was that C++ is more strict about types, as you suspected. You'll have to add casts where void* are mixed with pointers of other types. Like allocating memory:
Foo *foo;
foo = malloc(sizeof(*foo));
The above is typical C code, ...
Below is a function that I've only slightly modified from it's original context, found here.
Before mentioning anything else, it should be noted that I'm desperately trying to optimize this code for speed. It presently takes about 5.25 seconds to execute and it appears as though the bottleneck ...
I've two table (t1 and t2) with 3 identical integer columns : c1, c2 and c3.
I want to count how many value in t1 are in t2
So I start to write :
SELECT count(t1.id) FROM t1 INNER JOIN t2 ON (
t1.c1 = t2.c1 OR t1.c1 = t2.c2 OR t1.c1 = t2.c3 OR
t1.c2 = t2.c1 OR t1.c2 = t2.c2 OR t1.c2 =...
I have some function like:
void foo() { ... }
int main() {
...
try {
...
foo();
...
} catch (const std::exception &e) {
std::cout << "Fatal error: e.what() << std::endl();
return;
}
...
}
If exception thrown from foo I'd like to know it. Also I want to know, rea...
