a.k.a. MayCXC

less than 1 minute read

The results are in. I rigged up a quick nanosecond timer to compare the five recursive directory streams from my last post, and You Won’t Believe What Happened Next!

Recursive method:           617245
Recursive traversal 1:      6513210
Recursive traversal 2:      2099201
Recursive traversal 3:      StackOverFlowError
Recursive stream method:    910222
Times are reliable averages of the nanoseconds it took to find calc.exe in System32.

The nested and unfolded maps brought us to the higher and lower ends of ten milliseconds. Still, the recursive method with no streams was around ten times faster, and my favorite method threw a StackOverFlowError :(

Why and how this happened is unknown to me, which could mean a part three is coming. The methods work fine on smaller directory structures, and traversal three is the only one that I have seen overflow.

Oh well, better luck next time and don’t worry so much.

Comments

You May Also Enjoy

Pretending there are pointers in Java

3 minute read

Values. References. Value of a reference? Reference to a value? Value of a value? Reference to a reference? Pass by value, or pass by reference? Pass referen...

The lazy FizzBuzz: an interview interlude

1 minute read

It’s internship season, and I’m on the hunt. I better know my interview questions if I want to survive the winter. Let’s start out with good old FizzBuzz:

Can we zip it? (Yes, we can.)

3 minute read

Another day, another assignment to overthink. Last time, we used a recursive flatMap to generate a stream of files with a given parent directory. In today’s ...