I will review the tests because they definitely need some work!
GetDataTableTest()
The Test suffix is redundant, they're all tests. What I want to know is what scenario is being tested when the test fails. For this reason I prefer to following the [UnitUnderTest]_[Scenario]_[ExpectedResult] ...
I'm just starting to write unit tests.
I have a library on Github which I'm trying to write tests for.
I downloaded the JSON and stored it into a local file that looks like this:
{
"response": {
"version":"0.1",
"termsofService":"http://www.wunderground.com/weather/api/d/t...
Inspired by this question on StackOverflow, I wrote a function that returns the length of a list made of numbers that are divisible by their own sum of digits inside a range:
-- Returns the digits of a positive integer as a list, in reverse order.
-- This is slightly more efficient than in forwa...
Given an array of ints, return a string identifying the range of numbers
Example
Input arr - [0 1 2 7 21 22 1098 1099]
Output - "0-2,7,21-22,1098-1099" .
Is there any improvement possible in this implementation?
#include<iostream>
#include<vector>
#include<algorithm>
#include<sstream>
std::...
There's a much easier approach to this problem.
We can use NSCalendar's nextDateAfterDate:matchingComponents:options: method to find both our next 7am and 7pm. Then it's simply a matter of comparing these values and returning the lesser of the two.
NSDate * nextSevenOClock() {
NSCalendar *...
I have been writing a Simple Port scanner in C, once I got it to work I decided I wanted to make it faster because it takes a very long time for it to get done with scanning all of the ports.Is there anything I can improve on in my code to make it faster? Here is my Code :
#include <string.h>
#...
// Find the **highest** stat and click the button next to it.
var i = stats.indexOf(Math.max.apply(Math, stats));
To win people need majority.
Best voting decision should be made just before the 20s timer ends to count most of the votes.
Too much jQuery, go back to VanillaJS and for loops
in...
I'm trying to solve this problem. My solution uses binary search and persistent segment tree. The algorithm should be correct because I've implemented it in C++ and it's accepted. Anyway, this is my code (1827.hs):
import Control.Monad
import Data.Array
data Node =
Leaf Int --...
1.How to write an interface for a list, including the methods:
add(Object)
remove(Object)
get(int): Object
set(int,Object)
size: int
clearAll
2. Also I have to Implement a linked list using the interface from above question
Please help me with it
I got bored and decided to make a merge sort from scratch. I like everything, except for my "merging" of the two arrays into a sorted array inside the for loop. I had several bugs that I had to iron out, which were along the lines of if subArray1 or subArray2 ran out of elements, checking them ...
Greeting for day !
I want to change task edit form of the workflow when approver want to approve/reject task. I have created some code to change task edit form. Please review and suggest me improvement. Or it will be better if you have any other possible solution.
public void createTask1_Method...
ok this is my first post. Im trying to make a simple app to help me store data about food, to use this database in future diet application. what can i do to improve the code? what part of code should i make a class etc.?
#include <iostream>
#include <vector>
#include <string>
#in...
I am writing a Perl application where it would be nice to have a subroutine that could clean up a given pathname such that it does not contain any empty directories.
I have written this subroutine clean_path, and a wrapper test script:
#! /usr/bin/env perl
use strict;
use warnings;
use Carp;
...
The following is a program to shred files securely - :
#include <iostream>
#include <sstream>
#include <string>
#include <fstream>
#include <vector>
#include <cstdio>
#include <cstdlib>
#define BOOST_FILESYSTEM_NO_DEPRECATED
#include "boost/filesystem.hpp"
using namespace std;
using namespace...
