I updated my animation of the Microsoft's logo. It's available on CodePen. Overall, I am quite satisfied with it now apart from one thing.
I cannot seem to figure out how to stop the animation so the logo looks correct. I tried setting the delay to 6000ms = 6s = length of the animation, but it l...
http://www.commitstrip.com/en/2015/08/18/when-star-wars-park-will-be-opened/ CommitStrip - Blog relating the daily life of web agencies developers When Star Wars park will be opened CommitStrip 1439918576
This class allows for easy management of the KeyboardState of an XNA game.
It provides a simple, easy-to-use API for interacting with the Keyboard and getting key-presses.
As far as I can test, it works as intended.
GitHub Link (for future reference) as of this version: KeyboardStateManager.
...
This class allows for easy management of the KeyboardState of an XNA game.
It provides a simple, easy-to-use API for interacting with the Keyboard and getting key-presses, via a few (trivial) events.
As far as I can test, it works as intended.
GitHub Link (for future reference) as of this vers...
Yes they can as per your answer, however I didn't want to overdo the code reworking, that answer is more suited for CodeReview than StackOverflow. — Emz18 secs ago
@JeroenVannevel you shouldn't be looking for failed requests though. as the chat message was posted, there's nothing wrong with the link between Github and Duga, hence it won't show as failed message.
they're sent from AppVeyor to Github, and from Github to Duga. Duga listens to the build event sent by github, so you can find it on the Github history.
The problem:
2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
The solution in Swift:
import Foundation
var number = 2520
var fou...
guys and ladies. I need your help with code review.
I have the following code:
public final class PropertyFileLoader {
private static final Logger logger = LoggerFactory.getLogger(PropertyFileLoader.class);
private final String propertyFileName;
public PropertyFileLoader (String propertyFile...
Due to some constraints I had to manually parse an HTTP response coming out of a stream.
I could not use buffered reader or scanner because the perform buffering and end up buffering bytes beyond the response header itself.
I'll be hitting my AWS S3 and only expect 200 or 206 status response.
...
> We wish to notify you that the UNITED NATIONS has agreed to compensate some selected individuals. Following the economic recovery process. Read the attached document carefully regarding your Compensation draft from the United Nation Organization. Best Regards, Dato Ramlan Ibrahim (Malaysian UN Ambassador)
I was inspired by this answer and decided to implement an AVL tree with the methods equals and hashCode as if I was asked to do that at a job interview.
This is my code on GitHub.
In addition to the solution itself, I wrote tests for all the possible cases. If I missed something, or if my solut...
@EBrown why are you using a single pipe instead of a double pipe in the last if statements assigning a value to kv? what is the purpose of checking the second value if the first is already true?
This one: kv = kv | (Framework.Windows.Forms.Keys)Enum.Parse(typeof(Framework.Windows.Forms.Keys), key.ToString());?
If so, it's because kv is not a boolean, and kv || (Framework.Windows.Forms.Keys)Enum.Parse(typeof(Framework.Windows.Forms.Keys), key.ToString()) would evaluate to false or true instead of doing a bitwise-or. (Or not even compile, as is this case.)
The single pipe in this case is a bitwise-or symbol.
So, instead of evaluating to true or false (or failing to compile), it does a literal bitwise combination on the two values.
if I can find the program I will make a copy available somehow for you guys here. it has some bugs but it is pretty cool so far. I just need to make a todo list and get on it
I have the following that loops through a range. When the initial value is found on the second sheet it goes to the cell to be able to compare some date values on the same row. Once the comparison is complete another value from the same row is copied to be placed back onto the first sheet. I b...
What's best practice with GIT: many micro-commits (each time a small edit is made, push), or few large-commits (only push cumulatively substantial edits)?
Small programs as such should be relatively honored, since they are a lot used as a practical examples, usually for beginners. So an appropriate review follows to be a Nobel improvement attempt of this particular variation.
Name of program
The name of a program like that must be exclusively i...
The task of this project was to create a method that takes in an array of stock prices, one for each hypothetical day. From there, the method should return the best day to buy and the best day to sell the stock to maximize return.
A few ground rules:
Stocks need to be bought before they can ...
I have lots of competition with vb.net @Mat'sMug and @RubberDuck. they are really good. much better than me. but they also code in VBA on the regular too. I like my C#.
So I am using this code to display all the permutations of a given input string. But this code is not working for strings above length 7. Any advice/solution will be very helpful.
#include<iostream>
using namespace std;
/* Function to swap two characters */
void swap(char& a, char& b)
{
char t...
@RubberDuck the last thing that I mentioned in my review? it is a boolean function
Module MyExtensions
<Extension()>
Public Function IsAllocated(ByVal input As System.Array) As Boolean
Return Not ((input Is Nothing) OrElse (input.Length = 0) OrElse (input.GetValue(0) Is Nothing))
End Function
End Module
This handles a parsing system to look at every users profile page and determine their job classification based on the class of a div element. I noticed that the class was always consistent on specific types of employees so I created this script to weed them out from other classes so I can have a ...
If (Path.Contains(pathNPR) AndAlso Path.Contains(extNPR)) _ OrElse (Path.Contains(pathDRR) AndAlso Path.Contains(extDRR)) Then ValidPaths.Add(Path) End If