Skip to main content

[JAVA] Evil Null

Elvis operator could have been a good use here. But unfortunately have been decline till now.

Its used to say "?." Operate only if not null.

Class A
{
 public B getB()
{
   return new B();
}
}

public void test( A a)
{
    if ( a != null  )
        return a.getB();
 }

Above method would be replaced with

public void test ( A a)
{
     return a?.getB();
 }

Unfortunately its still some time we can see some think like that. So till that we have to live with two choices:

1. Check for null.
2. Use the Null Object Pattern.

So we all know that how to check for null objects and believe me i had real long chain of checking null.

Second way can be useful but if this chain is pretty long its can be tiresome to have null object for all the hierarchy

Null Object means there will be definition of class A (mostly derived from same interface.) and will have dummy methods which will nullify any call to these methods.


Comments

Popular posts from this blog

Car Parking Problem

There is n parking slots and n-1 car already parked. Lets say car parked with initial arrangement and we want to make the car to be parked to some other arrangement. Lets say n = 5, inital = free, 3, 4, 1, 2 desired = 1, free, 2, 4 ,3 Give an algorithm with minimum steps needed to get desired arrangement. Told by one of my friend and after a lot of search i really got a nice solution. I will post solution in comment part

Median of Five Numbers

U have 5 NOs , X1,X2,X3,X4,X5 With minimum no. of comparisons we have to find a median. SWAP(X,Y) function is available to u . I have a answer of six comparisons and eight swaps....wait for people to find out by themselves.

Consistent Hashing

I will try to explain consistent hashing with a real world example. Let's assume I have a restaurant with 60 tables and 5 servers (waiter). Each server is given an equal number of tables to serve. Now let's assume we have addition of a new server (waiter), so his addition will be marked in the circle and he will be receiving tables from the previous server to his distance only. Check the attached example. Assume a server (waiter) has left the organisation and we have only 4 servers now. Server3 has left the restaurant, so his table will be assigned to server 4. I am sure you have noticed the load is not equally distributed. But to make the system less prone to addition/removal we just rotate in clockwise and assign range from the previous server to present server.  To make sure load is balanced or optimally balanced we need to use virtual nodes. Check links here: http://tom-e-white.com/2007/11/consistent-hashing.html https://www.toptal.com/big-data/...