Win a copy of Pipeline as Code this week in the Cloud/Virtualization forum!

Scott Halepaska

Ranch Hand
+ Follow
since Dec 26, 2006
Cows and Likes
Cows
Total received
0
In last 30 days
0
Total given
0
Likes
Total received
7
Received in last 30 days
0
Total given
10
Given in last 30 days
0
Forums and Threads
Scavenger Hunt
expand Ranch Hand Scavenger Hunt
expand Greenhorn Scavenger Hunt

Recent posts by Scott Halepaska

Adam Scheller wrote:Let's replace sugar with poison, that should do the trick.



A main plot point:

https://en.wikipedia.org/wiki/9_to_5_(film)
5 years ago

Mike. J. Thompson wrote:I've had a quick look through, and the things that stand out are:

1) you have an except block that does nothing but raise the exception it just caught. This is redundant. Was there meant to be some other logic in it? If not it should be removed.

2) you are filtering a list by looping through it and selectively deleting entries. This is not the pythonic way to do this. Instead you should use a list comprehension.




Thank you for taking a look. I will modify accordingly.
5 years ago
We had to check for some duplicate files based off of hash on a large file share and decided to try my hand at Python. This appears to be working correctly but was wondering if there were any glaring mistakes the more experienced would change. Please let me know.


5 years ago

chris webster wrote:I was watching "Zombieland" on TV the other night (great fun), and I noticed that "I am Legend" was on another channel at the same time, and "Shaun of the Dead" on yet another channel. Zombies all over the TV schedules.

This prompted me to wonder, when did zombies get so fast? In older movies, zombies were usually a bit rubbish, shuffling along and groaning out demands for "More brains". Unless you were cornered, you could mostly escape at a brisk walk.

Since "28 Days Later" (at least) movie zombies are typically super-speedy predators with herculean strength and only occasionally shedding their own digits, limbs or major organs at random. Much more scary.

So does anybody know when the first fast zombies appeared?



http://www.urbandictionary.com/define.php?term=zombie+bullshit
6 years ago

Amit Ghorpade wrote:
Yes, found a DZ in NY. Excited!




And how did things go?
6 years ago

Andrew Monkhouse wrote:You do realize that this might just be the vanguard of a Martian invasion? Right now the entire population of Mars is robots!



Nuclear robots with lasers even!
6 years ago

J. Kevin Robbins wrote:I'm trying to understand this. How would you define "Sense Object"? I don't understand that term.



Kind of a 'mental thingie'.
6 years ago

Dieter Quickfend wrote:The Team of Lemmings of Code Complexity, for a team writing unnecessarily complicated methods.




How about the Unladen Swallow of Code Complexity for those that don't know what their code does?
6 years ago
What I would like to see would be an example or exercise that continues through all the chapters of a book. For example, the small class we build in chapter one would be added to in chapter two when we learn about methods and added to again in chapter 3 when we learn about I/O. I have never found a book designed in this way.
7 years ago

Greg Charles wrote:Are you trying to find the index of the element that matches searchnum? What do you want to return if searchnum doesn't exist in the array? It looks to me that with line 6 and 7, if searchnum falls between the elements at indexes n and n+1, you return n. Is that what you want? What happens if the searchnum you pass in is less than the element at index 0, or greater then the element at index length-1?



The exercise was to produce a random float[] and then print the floats that border a user inputted int. It works as expected and it could surely be hardened as you mention for better tests. Really just wondering if it is decent implementation. Is it feasible that an int would ever equal a random float? Might have to deal with that also. Thanks for your time.
7 years ago
Doing an early exercise out of the Java Examples in a Nutshell book and they are asking for 'an efficient search algorithm to find the desired position' of two floats in a sorted array that bound an int. My try is below:



This is working for the example but I would like to know if it is considered 'efficient' or even good?
7 years ago
What does everyone use to keep track of the business processes they help design and build? I am an Oracle ERP developer and I find myself always having to go back to the code to know what a program is doing. It would extremely useful to have some kind of combination of overview document/process flow/dependencies/code used/lookup tables/etc. all in a single place. Does anyone use something like that?
7 years ago

Bear Bibeault wrote:Who got a rock?



Only you, blockhead.
7 years ago
My altimeter I use when skydiving was always sticky on the way up. Always had to tap it. I ended up replacing it when it started getting sticky on the way down.
7 years ago

Jim Venolia wrote:I'll need to try The Last of Us again, I didn't get into it at all. Think I made it to the second chapter.




Keep playing, it is worth it. There is a scene with some giraffes(!?) late in the game that is about about as good of a couple minutes as you will see on your TV. It is really incredible.
7 years ago