Since your post is a little unclear to me, I'm just going to point out a few small things that could be improved quiet a bit.
The program logic could be separated out into different functions. This allows for easy re-usability.
You should flesh out this program with comments for clarity. There ...
I have a third party system that submits I am assuming a byte array data from OBDII port on our fleet vehicles.
I was getting values like:
AA== (bool)
AQ== (bool)
AAAaMA== (int)
AAA0IQ== (int)
Mjow (string)
UzozLTIwNA== (string)
I know what the type is for each field but the regular base64_...
Sometimes, questions with authoring comments surface, and whilst changes can greatly affect the difference in code, is an author comment really warranted in answer?
StackExchange's attribution required link on the bottom of all SE sites, lists four things required to be done when republishing co...
I have a project I am working on, and I would like some, or all of it
reviewed, how can I ask for this review on Code Review in a way that
produces the best possible value?
This is not about a question being on-topic, or off topic. Rather, this is about making on-topic questions great qu...
Wrote a couple of blog articles about smart pointers.
Unique Pointer
Shared Pointer
Constructors for Smart Pointers
So I suppose it time to get the result reviewed.
This is not supposed to be a replacement for the standard smart pointers. It is more a simple place to start for people trying t...
Code Review is becoming well-known on Stack Overflow.
The folks over on Code Review are happy about that.
The only problem is that there are a lot of questions redirected to CR which don't belong there.
So I want to ask that the users who direct askers to CR (or request migration of questions...
Array of size (n-m) with numbers from 1..n with m of them missing.
Find all of the missing numbers. Array is sorted.
Example: If arr = [1,2,4,5,6,8], result should be 3 & 7.
Here is my code which I would like to get reviewed. Sorry for the quality... I'm learning.
import java.util.*;
class Fi...
"Need at least two file arguments: Destination Source {Source {Source {...}}}"
I think an easier way of documenting that, at least for *nix, is:
"Need at least two file arguments: DESTINATION [SOURCE]..."
You can also turn the Paths in your main() method into a Stream too:
public class L...
Is this producer is thread safe?
Is it exception safe?
public class AsynchSimpleProducer<T> : IDisposable
{
private readonly Action<Exception> error;
private readonly BlockingCollection<T> blockingCollection = new BlockingCollection<T>(50);
public event Func<T, Task> NewItem;
p...
How can this code be improved?
class Fruit{
//...
}
class Apple extends Fruit { public void shape() {
System.out.println("round!");
}
//...
}
class Orange extends Fruit { public void colour() {
System.out.println("Meow!");
}
//...
}
class FruitMain {
public static void main(String[] arg...
template<class T>
long binary_search(const std::vector<T>& v, const T& key){
if(v.empty()) { return -1; }
long lo = 0;
long hi = v.size() - 1;
long mid = (long) floor((lo + hi ) / 2);
long pmid = -1; // prev mid
while(lo < hi && pmid != mid){
if(v[mid] < ke...
The problem I attempted to solve is described as:
What is the largest subset of mutually non-overlapping intervals which
can be selected from I? Where I is a set of N intervals where each
interval has the same weight per item within the interval.
I claim the algorithm runs at \$O(N lg N...
I have a flat data that represent the hierarchical relationship as below:
ID Name PID
0 A NULL
1 B 0
2 C 0
4 D 1
5 E 1
6 F 4
3 G 0
This table represents the 'data table', where PID indicates the parent element.
For example, in the fi...
I did some work in R and I need feedback. I repost since this section is more suited.
Generate a sample of size 1000 consisting of realizations of independent
N(4, 1) distributed random variables.
n <- 1000
x <- rnorm(n, mean = 4, sd = 1)
Write a code for a function which gives the density f...
Is this the right way to call WCF? (I am more interested in how I assign null - and handle exception etc. Parameters I have passed correctly).
// Client proxy
BasicHttpBinding binding = null;
EndpointAddress epa = null;
FreeSpaceDatabaseClient pro...
I'm working on a code where the programs allow user to prompt for a folder location and read multiple csv files.
Does anybody know how? PLEASE HELP.
Right now, I only know how to read just one file and print the output out:
import java.awt.FileDialog;
import java.awt.Frame;
import java.io.Buf...
You are being watched
Code Review has an open system
A machine that spies on you on every hour of every day
I know because I built it.
I designed the machine to detect suggestions to post on Code Review but it sees everything
Horrible comments involving ordinary users
Users like yo...
Trying to solve this combinatorics problem, I wrote some functions to count the number of unordered distinct factorizations of an integer n into k distinct parts.
The following function builds up a list of unordered distinct factorizations of n with largest part at most m.
duf' :: Integer -> In...
We have main application from few separate parts - Unity and Clc.
I'm writing new tool, which will be used to manage them - deploy Unity, or run some checks and lot of other stuffs.
As there will be a lot of options - I want split them in to separate namespaces.
Here is how I realized it, but ...
I am using the following method to validate if user has given any input or left an EditText empty, I am concerned about the return statement in particular, because my IDE keeps complaining about it
Enviornment:
Android Studio 1.0
Code:
public void clientsideauth() {
if (TextUtils.is...
I tried MergeSort but it is not working correctly.Please help.Code in C++ is as follows:
#include<bits/stdc++.h>
using namespace std;
int k=0;
void Merge(int *a,int left,int mid,int right, int *temp)
{
int i,j;
i=0;j=mid+1;
while(i<=mid && j<=right){
if(a[i]<a[j]){
te...
I was trying to solve Project Euler Problem 78: Coin Partitions.
Let p(n) represent the number of different ways in which n coins can be separated into piles. For example, five coins can be separated into piles in exactly seven different ways, so p(5)=7. Find the least value of n for which p...
how can i put style my selected value in if case, please checkk my code and let me know if any correction please..
$.ajax({
type: "GET",
url : "letsdoit",
...
