This Caesar cipher can take any integer and it will wrap around the correct number of times and still perform the encryption/decryption.
Let's say we have a text file named dog.
~$ cat dog
The quick brown fox jumps over the lazy dog...
If the user enters a normal offset (1-26), it will ...

I have written a simple desk accessory in Proccessing called Trip, you can find it here. It is working, but it is very simple, and needs more features.
I would appreciate any new ideas for features, particularly Easter egg-style secret features.

Is this a good C program for splitting a command line without doing any expansion on it? Don't worry too much about main() and the output -- those are for testing.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <assert.h>
void pullwhitespace(char **input);...

Here's my attempt at Weekend Challenge #3.
Key characteristics of this Python entry are:
The strategy is to alternate between "autocomplete" (making simple deductions such as naked singles and hidden singles) and recursive guessing.
The puzzle state is stored in a Sudoku object, which has a mu...

I have a small program which makes uses of pycparser to parse C header files. The code, unfornatuley, kinda sprawls out everywhere to handle the different cases (example below).
What's the best way to make this more Pythonic? I thought about case-statements, but those don't exist in Python. Is s...

I am writing a cron job to manipulate and transfer remote data.
I need to cache data from a table, process it, merge with previous table, iterate the process, and eventually send the result data to remote database.
Here is a basic in-memory cache storage with thin simple CRUD type API.
It has to...

How would I use threads or any other python parallel function to make parallel the following code? It takes 8 seconds to execute, and I want to cut that down.
for pol in range(100, 2100):
for x1 in range(24):
d[x1] = go(x1 + 1, pol, False)
x[x1][pol - 100] = d[x1]

I am only active in SO and Code Review, and I find that Code Review answers can take a bit of time, especially when fiddling around with a Plunker or JSFiddle sample or finding some reference as to why one approach is generally accepted to be better than another approach.
Right now, I actually k...

I have to admit that I don't know much about JavaFX, but I do know Java so I can help you with the things I can come up with:
If by "more compact" you mean "less number of lines" there are several things that you can do:
Use Java coding conventions and don't put { on a new line. That alone wil...

I have to reverse the string "He is the one" to "one the is He". Written some programs in java but looking for other best solution .Suggest if current program can also be minimized .
First Approach:
class StringRev{
public static void main(String args[]){
String str = "He is the one";
...

So, I have an image loader, now only for bitmaps. I'm a little confused because I want to split my code to different classes, one for writing a BMP data to a file (WRITER), one for loading BMP data from file, or from pre-generated dataset (1) and storing it in its private members.( (1) like a noi...

am writing a flask app that I will deploy it on Heroku to test it . There is a page that will generate daily photos and information based on a json file. The view is valid for 24 hours beginning from 00:00 to 23:59 of everyday.
I am thinking about using cache otherwise the app will consume unnec...

Following on from Simon's answer (which I believe will be more than great for 99.99% of users).....
... actually, I have looked though the code, and I don't understand enough of it to make sense of the right answer:
why do you do the map-reduce at all if a = and(a,e) will be 'false' if a start...

I've given the question a downvote because it really isn't a very good question, it seems like he's expecting a whole lot from us but whenever we expect something from him he just says "NO, that's not possible. Please just help me with my problem"

The remaining old zombies are hard ones. There's a lot of questions about libraries and stuff I've never heard of. There are some I think I can answer, I just need to make myself time to answer them also :)

the grouping is a grouping of <int, SudokuTile>, can I make that become a bool[] where the ints are indexes in the bool array, and the values are for whether or not that int has at least one SudokuTile?

As it happens, not the worst bug I have found ... I found an error in IBM's JVM implementation of Arrays.binarySearch(data[], from, to, key); If the from was > 0, and the value was not found, it returned -1 instead of -from - 1.... which required fixes to IBM's JDK, as well as the entire Jav compatibility test harness for all oracle-certified JVM's.

I'm building an http handler at work which has about 6 methods and I'm trying to figure out what design pattern will work the best for my needs:
What's done already (Only an example to make this more clear, methods are not real, but the main concept is there):
#region interfaces
public interfac...

Things I would fix:
Don't do this:
import java.util.*;
It could be problematic for the compiler to import a bunch of packages at once. If two packages provide the same type, both are imported, and the type is used in the class, a compile-time error occurs. This is described in [JLS 6.5.5.1][1...

the problem is that in certain domains figuring out a proper epsilon can be very difficult. in the case of discrete values such as money, it's much, much, much, easier to just use an int than worry about a trillion corner cases

@rolfl interesting. never heard that before. but, I'm also not very familiar with java these days. seems for any amount of money that's not very, very large, it would make more sense to just use a long. i suppose the precision in bigdecimal would never be a problem, but still.... something about using a decimal representation for money irks me, even if it is arbitrary precision

i suppose it is more natural to think of $2.50 though than 250 cents

interesting

(not to mention that bigdecimal makes other things much easier/safer like division)

An off-by-one error (OBOE) is a logic error involving the discrete equivalent of a boundary condition. It often occurs in computer programming when an iterative loop iterates one time too many or too few. This problem could arise when a programmer makes mistakes such as using "is less than or equal to" where "is less than" should have been used in a comparison or fails to take into account that a sequence starts at zero rather than one (as with array indices in many languages). This can also occur in a mathematical context.
Looping over arrays
Consider an array of items, and items m throu...