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

UTF-8 Validation in Java

-

A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:
  • For 1-byte character, the first bit is a 0, followed by its unicode code.
  • For n-bytes character, the first n-bits are all one's, the n+1 bit is 0, followed by n-1 bytes with most significant 2 bits being 10.

 Given an array of integers representing the data, lets calculate whether it is a valid utf-8 encoding.

 Example:
data = [235, 140, 4], which represented the octet sequence: 11101011 10001100 00000100. 
Return false. 

The first 3 bits are all one's and the 4th bit is 0 means it is a 3-bytes character. The next byte is a continuation byte which starts with 10 and that's correct. But the second continuation byte does not start with 10, so it is invalid.

Source Code:

public static void main(String[] args) {

        // should be true
        System.out.println(validUtf8(new int[]{228, 189, 160, 229, 165, 189, 13, 10}));

        //should be false
         System.out.println(validUtf8(new int[]{240, 162, 138, 147, 145}));

        //should be true
        System.out.println(validUtf8(new int[]{197, 130, 1}));

        //should be false
        System.out.println(validUtf8(new int[]{235, 140, 4}));

        //should be false
        System.out.println(validUtf8(new int[]{255}));

        //should be false
        System.out.println(validUtf8(new int[]{250, 145, 145, 145, 145}));

    }


public static boolean validUtf8(int[] data) {

        int nOctetLeft = 0;

        for (int i = 0; i < data.length; ++i) {

            int octet = data[i];

            // n-byte character
            if ((octet & (1 << 7)) != 0) {

                int n = getCount(octet);

                if (n > 4) {
                    return false;
                }

                if (n > 1) {
                    if (nOctetLeft > 0) {
                        return false;
                    }

                    nOctetLeft += n;
                    --nOctetLeft;
                } else if (n == 1) {

                    --nOctetLeft;
                }
            } else {
                // one-byte character

                if (nOctetLeft != 0) {
                    return false;
                }
            }
        }

        // unsatisfied header
        if (nOctetLeft != 0) {
            return false;
        }

        return true;
    }

    private static int getCount(int octet) {
        int count = 0;
        int i = 7;
        while (i >= 0) {
            if ((octet & (1 << i)) == 0) {
                break;
            } else {
                ++count;
            }

            --i;
        }
        return count;
    }

Comments

Post a Comment

Popular posts from this blog

A Pattern Recognition Problem: Finding Line Segments Effectively In Java

-
Lets say we are given a set of  n  points and we need to find every line segment that connects 4 or more of the points. We have an immutable data type for Point: public class Point implements Comparable {     private final int x;        private final int y;        //...     public int compareTo(Point that) {         if (that.y == y && that.x == x) {             return 0;         }         if (y < that.y) {             return -1;         }         if (y > that.y) {             return 1;         }         if (x < that.x) {             return -1;         }         // ...
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

Notes On Multithreading With Java 8

-
Synchronization is the coordination of two or more tasks to get the desired results. Control synchronization: One task depends on the end of another task, the second task can't start before the first has finished. Data access synchronization: Tasks have access to a shared variable and only one of the tasks can access the variable at any given time. Critical section:   A piece of code that can be only executed by a task at any given time because of its access to a shared resource. Synchronization helps us to avoid concurrency problems but this comes at a cost. So if our algorithm will not be more efficient because of heavy synchronization, then a serial program may perform better. We can use a semaphore  to control the access to a resource. A mutex (short for mutual exclusion) is a special kind of semaphore that can take only two values (resource is free and resource is busy), and only the process that sets the mutex to busy can release it. Monitor??? Tasks ca...
Read more