kind of new to .NET and I'm trying to figure out if there's a better way for me to create my tests.
I'm writing an API that returns an object and I need to test that the return values match the expected results. Looks like this essentially:
Test files using partial to spread each input/result...
I'm doing the MOOC Java course, this is the problem:
This is a link to the problem in detail if you'd prefer that, CTRL+F "distribution"
The input of the program is a set of exam scores of a course. Each score is an integer. When -1 is entered, the program stops asking for further input.
...
Just of the code is, you give it a date, it will start counting down how many days, hours, minutes and seconds left by emitting an event 'countDown' and once 0 is reached 'expired' event is emitted.
How can this code be improved?
class CountDownValues {
days: number;
hours: number;
...
I am trying to find a best match for a name within a list of names.
I came up with the below code, which works, but I feel that the creation of the intermediate ratios list is not the best solution performance-wise.
Could it be somehow replaced? Would reduce be a good fit here (I have tried it,...
My code get data from database using AJAX the problem is i want to filter data by month year and quarter and the code that does that is
->where(\DB::raw('MONTH(created_at)'), Carbon::today()->month);
but i can't put it in a variable for example and call it so i did this it works but l...
I am doing a code challenge of codesignal.com which ask for following things:
Given an array of integers, sort its elements by the difference of their largest and smallest digits. In the case of a tie, that with the larger index in the array should come first.
Example
For a = [152, 23, 7, 887, ...
I'm trying to get familiar with unit testing. I never implement TDD previously, but I believe it's the best way to write software.
So, here I'm trying to test my isLastTwoDates(position) method of my model class:
@Test
public void isLastTwoDatesReturnsTrue() {
case1.generateReport();
a...
I'm writing some code which loads a dataset and then performs some transformations on this (relatively large, ~5 GB) dataset. I need different sub-sets of this data for use with analysis code I have wrote in a Jupyter notebook. I'm approaching the problem as follows, but have been learning abou...
I'm building a comparison table basis the selection from a multiple-select. The multiple-select is itself dependent on a previous selection. The data array resides within the JQuery. While the comparison table and the dependent multiple-select are working fine independently, when I combine the bo...
I ran across a code snippet which is swapping the two HTML elements in a DOM. For some reason I cannot see how is this code working:
Fiddle
The statement elem.before(this) in this code looks the same to me as compared to $(document.createTextNode('')).insertBefore(this).before(elem.before(this)...This is a simple tool that parses CSS and checks every property for browser support based on a browserscope. The thing is, there is a huge amount of data, we are talking about CSS files with more than 20.000 lines of code. The parser I am using is 'csstree' and the object it returns is even bigge...
There's a lot in your question, so let's look at it in parts:
My vehicle's cigarette lighter outlet is limited to 10 amps output. If charging were limited to less than 10 amps, would solar panel -> charge controller -> cigarette lighter outlet work for charging a car battery.
Technically, y...
I have a class which contains a large dictionary. The number of keys is actually quite small (~100) but the values are lists of tuples which are quite long. e.g.
bonds_dict = {'ace': [(0, 1), (1, 2), ...],
'ala': [(0, 1), (0, 2), ...],
...
}
The class...
The following Go program parses a gzipped xml file (available here) which contains bibliographic information on computer science publications and has the following indicative structure:
<?xml version="1.0" encoding="ISO-8859-1"?>
<!DOCTYPE dblp SYSTEM "dblp.dtd">
<dblp>
<article mdate="2017-...
I read time complexity of radix sort is O(wn) or O(n log n), if all n numbers are distinct. After implementation it look to me as if I have implemented radix sort which has time complexity of O(n ^2). Please take a look at my implementation and suggest, if there is some implementation problem or ...
Building upon my previous question, I have come up with a method that'll search through a buffer and return a pointer to the end of the line. The primary purpose of the function to extract rows from a csv file using the logic specified in RFC4180; the third parameter isQuotedSequence can be used ...
A whiteboarding challenge: Given a 2D array (matrix) inputMatrix of integers, create a function spiralCopy that copies inputMatrix’s values into a 1D array in a clockwise spiral order. Your function then should return that array.
inputMatrix = [
[1, 2, 3, 4, 5, 6],
[7, 8, 9, 10, 11, 12],
[...
Could I ask you for suggestion or a code review, please? What I'm trying to create is a generic tooltip component that I can use anywhere. I decided on a stateless component and the use of hooks and ref.
Explanation 💡
Hook, because I wanted to have a flag for hover and ref to get element width...
If I compile and run program, there are no errors, but it does not work, nothing is printed after insert() and program ends. Debugger says it is segmentation fault. It seems like insert() method does not work.
avl.h
#ifndef AVL_H
#define AVL_H
#include <iostream>
using namespace std;
class AV...
Can some of you check what's wrong in my implementation of Hopcroft Karp algorithm to find maximum matching in a bipartite graph?
I implemented it as a method of my Graph() class, the method input consists in two lists or set of nodes (representing the two sets of nodes of a bipartite graph).
It...
