Toluu

testingReflections.com - The mind-share information resource for software testing, agile testing and test-first/test-driven development

testingReflections.com is a place to share your knowledge and reflections on your experiences with others. Acting as a central hub to the distributed-knowledge in software testing, test-driven-development, tools and related subject matter.

TotT: Use EasyMockYesterday

Welcome back! We trust you all had a good holiday season and are ready for more TotTs -- DaveMost of us are aware that mock and stub objects can make testing easier by isolating the class under test from external dependencies. This goes hand-in-hand with dependency injection. Writing all these classes can be a pain though. EasyMock provides an alternative. It dynamically implements an interface which records and replays your desired behavior. Let's say you want to model an ATM interface:

public interface Atm {   boolean enterAccount(String accountNumber);   boolean enterPin(String pin);   boolean enterWithdrawalAmount(int dollars); }

I'm On TwitterYesterday

As an experiment to see what all the fuss is about, I've decided to join the so-called Twitterati so you can see a minute-by-minute account of just how dull my life actually is. (Okay, maybe not minute-by-minute, but you know what I mean.)

You can follow me on my Twitter profile page.

Instant gratification with HolodeckYesterday

I’m starting to learn how to use AutomatedQA’s TestComplete tool. I’ll talk more about that later. What I did this morning can be done with practically any Windows application.I have a bad habit of wanting to crash any application I work with, before I start doing anything useful with. Perhaps it’s my male needed to [...]

Software Craftsmanship 2009 Programme AnnouncedYesterday

The sessions and timings of the two main tracks of the upcoming Software Craftsmanship conference are now published, so you can see what you're letting yourself in for!

Tarjan Offline Least Common Ancestor in C# (with QuickGraph)Yesterday

Following the implementation of the disjointset, another fun algorithm to implement was the offline least common ancestor problem. Tarjan proposed a algorithm based on the disjoint-set and a DFS traversal. Given that I now have all those ingredients in QuickGraph, it was just a matter of hooking together the implementation with the right events. The beef of the implementation looks as follows (and looks quite elegant to me):