StringJoiner

package java8examples;

import java.util.Arrays;
import java.util.List;
import java.util.StringJoiner;
import java.util.stream.Collectors;

public class StringJoinerExp {

public static void main (String args[]){
StringJoiner sj = new StringJoiner("/", "prefix-", "-suffix");
        sj.add("2016");
        sj.add("02");
        sj.add("26");
        String result = sj.toString(); //prefix-2016/02/26-suffix
        System.out.println(" result : "+result);
       
       
       // StringJoiner is used internally by static String.join().
        String result1 = String.join("-", "2015", "10", "31" );
        System.out.println("StringJoiner  result1 : "+result1);
       
        // Collectors.joining
        // Join List<String> example.
        List<String> list = Arrays.asList("java", "python", "nodejs", "ruby");
      //java | python | nodejs | ruby
    String result2 = list.stream().map(x -> x).collect(Collectors.joining(" | "));
   
    System.out.println("Collectors.joining  result2: "+result2);
}

}

Comments

Post a Comment

Popular posts from this blog

Codity Test and results

1) A non-empty array A consisting of N integers is given. The array contains an odd number of elements, and each element of the array can be paired with another element that has the same value, except for one element that is left unpaired. For example, in array A such that:   A[0] = 9  A[1] = 3  A[2] = 9   A[3] = 3  A[4] = 9  A[5] = 7   A[6] = 9 the elements at indexes 0 and 2 have value 9, the elements at indexes 1 and 3 have value 3, the elements at indexes 4 and 6 have value 9, the element at index 5 has value 7 and is unpaired. Write a function: class Solution { public int solution(int[] A); } that, given an array A consisting of N integers fulfilling the above conditions, returns the value of the unpaired element. For example, given array A such that:   A[0] = 9  A[1] = 3  A[2] = 9 A[3] = 3  A[4] = 9  A[5] = 7   A[6] = 9     the function should return 7, as explained in the example above. Write an efficient algorithm for the following assumptions: N
Read more

TTD - Test Driven Development for Java Programmers

Image
What is Test Driven Development? Test Driven Development (TDD)  is a programming practice that instructs developers to write new code only if an automated test has failed. This avoids duplication of code. Test-Driven Development starts with designing and developing tests for every small functionality of an application. In TDD approach, first, the test is developed which specifies and validates what the code will do. TDD means "Test Driven Development". The primary goal of TDD is to make the code clearer, simple and bug-free. In the normal Software Testing process, we first generate the code and then test. Tests might fail since tests are developed even before the development. In order to pass the test, the development team has to develop and refactors the code. Refactoring a code means changing some code without affecting its behavior. The simple concept of TDD is to write and correct the failed tests before writing new code (before development). This helps to avo
Read more

Generics In Java:

Generics In Java: Java Generics programming is introduced in J2SE 5 to deal with type-safe objects. It makes the code stable by detecting the bugs at compile time. Before generics, we can store any type of objects in the collection, i.e., non-generic. Now generics force the java programmer to store a specific type of objects. Advantage of Java Generics: There are mainly 3 advantages of generics. They are as follows: 1) Type-safety:   We can hold only a single type of objects in generics. It doesn?t allow to store other objects. Without Generics, we can store any type of objects. List list = new ArrayList();    list.add(10);  list.add("10");  With Generics, it is required to specify the type of object we need to store.  List<Integer> list = new ArrayList<Integer>();    list.add(10);  list.add("10");// compile-time error  2) Type casting is not required: There is no need to typecast the object. Before Generics, w
Read more