Being that I needed a min-heap implementation for a project, I implemented one. Now that it's finished I though about having a review for it. I'm interested in all aspects: readability, performance, naming, comments, everything.
I'm planning on extending it afterwards with other features like t...
Many good answers are already present but I would like to point out the enumerables are appropriate for this kind of problem, Main is just:
StreamOfInputNumbers()
.TakeWhile(x => ! isPrime(x))
.ToList()
.ForEach(Console.WriteLine);
This reads like
Given a StreamOfInputNumbers, take...
I am making a connect four type of game in java. I want to make sure that all the code seems nice before I decide to add more stuff...
This is what the applet game looks like...
Player input:
Victory screen:
I have three classes:
Make4:
import java.util.Arrays;
import java.awt.*;
im...
This is a simplified excerpt from a larger program. It's my first attempt at parallelism, and I'm hoping you could point me at better or more idiomatic ways of handling this problem.
The obvious suggestion will be that I should use Pool.map(). However, in the real code I run into this bug, so I...
I have a class which inserts a list of tweets to a database table and also inserts the tweet's key with the associated filter's key to a many-to-many table. I am testing the sole public method of this class:
class TweetByFilterDatabaseRepository {
private final DatabaseFacade database;
...
This is meant to be a bidirectional flow BidiFlow that works exactly as BidiFlow.identity, except that it completes the stage as soon as one of the Flows (in1 -> out1 or in2 -> out2) is completed.
This can be useful to automatically close a connection fully when one of the two sides is closed.
...
Hear this problem: Write a C/C++ program that reads all the values from the "BAC.TXT" file and determines which are the largest two numbers that are missing from the file using a time-efficient algorithm. This is the code that I wrote and it returned good values for all the input sets I tried:
...
I have never work with floats and i need your opinion on my function... (sorry for my english, i'm french)
https://github.com/Ostefanini/get_float.git
About
I'm trying to implement a simple virtual machine. Now it supports only three operations:
ADD(reg0, reg1, reg2) -> reg0 = reg1 + reg2
LOAD(reg, value) -> reg = value
EXIT -> finish process
It has 8 registers and no memory (for now).
Source code
main.rs:
use std::process;
mod opcodes...
I have the following javascript code that I'm trying to modularize using ES6:
import $ from 'jquery';
$('.select-element').change(function() {
const $this = $(this);
const $nextElements = $this.nextall();
const $nextElement = $this.next();
$this.val() === 0 ?
$nextElements.addClass...
I wrote the following code for a coding challenge I was given and it received the following criticism: it was quite a beginner attempt using Angular.
<body>
<div id="view" ng-view ></div>
<script >
angular.module('myapp', ['ngRoute']).
config(function ($routeProvider){
$routeProvider...
I have the case of repeated very similar logic that is used to check if a boolean value was changed from the initial value and prevent it from changing back, or to summarize multiple boolean return values like:
bool SomeMethod()
{
bool endResult = true;
foreach(var obj in objs)
{
...
How can I consolidate this code? I run a before_action :find_company to get the @company variable.
def find_company
@domain = current_user.email.split('@').last
@company = Company.find_by_domain(@domain)
if @company.blank?
@newCompany = Company.new(name: "New Company - #{@d...
I'm currently having a go at some past Google Code Jam problems to help me practice my programming skills.
One of these problems is Problem A ("Googol String") from Round A APAC Test 2016. Here is the problem for reference (you can find the details via the link):
Problem
A "0/1 string" ...
Here is my personal implementation of the clustering k-means algorithm.
from scipy.spatial import distance
import numpy as np
import random
# (x,y) coordinates of a point
X = 0
Y = 1
def get_first(k, points):
return points[0:k]
def cost(cetroids, clusters):
cost = 0
for i in rang...
My code works perfectly, however, I know my approach isn't best practice practice. I would appreciate the effort of anyone who tries to explain in details on how I could refactor this code using either(presenters, decorators or poros) - I have no deep understanding of either yet.
Here is the cod...
import java.io.IOException;
import org.jsoup.Jsoup;
import org.jsoup.nodes.Document;
public class Program {
public static void main(String[] args) {
String[] words = { "amulet", "annihilate", "clamored", "cumbersome", "gesticulate", "impregnable",
"incongruous"...
How I do a loop for when he finds GAMEOF in memory of the process
it takes 200 characters before and puts on a string.
#include <iostream>
#include <iomanip>
#include <windows.h>
#include <tlhelp32.h>
#include <shlwapi.h>
#include <shlobj.h>
#include <fstream>
#define ReadLimit 100*4096 //6 zer...
