Posts

Showing posts from April, 2012

The WeakReference class, monitoring memory leak and garbage collection in a Java application

-
Image
 Below is a Stack implementation that uses an internal resizeable array structure.  public class MyStack< T > implements Stack< T > { private static final int CAPACITY = 100 ; private Object[] array ; private int pos = 0 ; public MyStack () { this . array = new Object[ CAPACITY ] ; } @Override public void push ( T item) { if ( pos >= array . length / 2 ) { Object[] newArray = new Object[ pos * 2 ] ; System. arraycopy ( array , 0 , newArray , 0 , array . length ) ; array = newArray ; } array [ pos ++] = item ; } @Override public T pop () { if (isEmpty()) { throw new RuntimeException( "empty stack" ) ; } @SuppressWarnings ( "unchecked" ) T item = ( T ) array [ pos - 1 ] ; pos -= 1 ; return item ; } @Override @SuppressWarnings ( "unchecked" ) public T peek...
Post a Comment
Read more

Real life TestDrivenDevelopment benefit: Tests as Documentation

-
I ve been working on an integration component that listens to LDAP server and notifies applications about changes on LDAP entries. My component searches for LDAP change logs. And a change log has the "targetdn" attribute. Example: targetDn: uid=ND2392,ou=Users,dc=MyCompany There is a business rule about notification process: If Organization Unit is “Special Users”, skip the notification for that change. Example: targetDn: uid=ND2392,ou=Special Users,dc=MyCompany   This changeLog should be skipped because it is about "Special Users" organization unit. I am using a regular expression to parse the targetdn. I isolated the code that does parsing and wrote unit tests for many inputs. Of course I added a unit test for the Business Rule mentioned above. At a point, I thought my regular expression is not good enough and changed it: Old regex: [oO][uU]=[^,]* New regex: [oO][uU]=[^,\s]* I was getting prepared to commit my cod...
Post a Comment
Read more

Fluent Interface Example in an Enterprise Integration Project

-
While working on an enterprise integration project about virtual bank payments, I utilized a simple fluent interface approach. The purpose of the code is creating strongly typed objects from a generic SMO (ServiceMessageObject) instance. Note: In the context of IBM integration technologies, ServiceMessageObject represents the “message”. In our example, it represents a Web Service request. Old Code: if (paymentInfo.getDataObject("totalAmount") != null) { totalAmount = paymentInfo.getDataObject("totalAmount"); DataObject totalAmount2 = totalAmount.getDataObject("totalAmount"); if (totalAmount2.getBigDecimal("amount") != null) { parameters.setAmount(totalAmount2.getBigDecimal("amount")); } String currencyCode = totalAmount2.getString("currencyCode"); parameters.setCurrencyCode(currencyCode); } Byte numberOfInstallments = paymentInfo.getByte("numberOfInstallments"); if (numberOfInstallments !...
Post a Comment
Read more

Popular posts from this blog

Trie Data Structure and Finding Patterns in a Collection of Words

-
Image
 I faced a very hard problem recently about finding substrings based on a collection of patterns.  Example For  words = ["Apple", "Melon", "Orange", "Watermelon"]  and  parts = ["a", "mel", "lon", "el", "An"] , the output should be  findSubstrings(words, parts) = ["Apple", "Me[lon]", "Or[a]nge", "Water[mel]on"] . While  "Watermelon"  contains three substrings from the  parts  array,  "a" ,  "mel" , and  "lon" ,  "mel"  is the longest substring that appears first in the string. Note: Number of words and number of parts can be huge! A brute force method or careless usage of Java String methods would make it impossible to handle a large number of words and parts (patterns). Solution Approach Whenever we want to search patterns inside a string, we should think about the Trie data structure:  https://en.wikipedia....
Read more

My Crappy Looking Solution to "Binary Tree Common Ancestor" Problem

-
I was able to solve this problem and make all the tests pass: https://www.hackerrank.com/challenges/binary-search-tree-lowest-common-ancestor/problem But I'm not happy with the code, so later I need to refactor the code. Here it is: static Node lca(Node root, int v1, int v2) { ArrayList result = new ArrayList<>(); Node result2 = traverse (root, v1, v2, result); if (result.isEmpty()) return result2; return result.get( 0 ); } private static Node traverse(Node root, int v1, int v2, ArrayList result) { if (!result.isEmpty()) { return result.get( 0 ); } if (root. left == null && root. right == null ) { return root; } if (root. data == v1 || root. data == v2) { return root; } Node node1 = null , node2 = null ; if (root. left != null ) node1 = traverse (root. left , v1, v2, result); if (root. right != null ) node2 = traverse (root. right , v1, v...
Read more

A Graph Application in Java: Using WordNet to Find Outcast Words

-
Image
I'll explain our intent with an example: Let's say we have the following words: horse, zebra, cat, bear, table Which one is the outcast? The table.. But how can a computer system find this? We are talking about the whole English language and any word can be in this list. The number of words in the list can be huge, so the solution should use appropriate data structures and algorithms.  We'll use WordNet which is a graph of English words. It contains the semantic relationships between words and our concern is the "is a" relationship. For our example, we know that horse and cat are both animals. "Table" is not an animal and it is the outcast in this situation. But we even have the ability to tell that horse and zebra is very close. Below is a unit test that shows a high level view of our application in Java: public class OutcastTest {     private WordNet wordNet;     private Outcast outcast;     @Before ...
Read more