aboutsummaryrefslogtreecommitdiff
path: root/challenge-278/luca-ferrari/pljava/src/main/java/Task2.java
blob: ad79c4417f35fb9561190cbb5a47620a1247987e (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
package PWC278;

/**
 * PL/Java implementation for PWC 278
 * Task 2
 * See <https://perlweeklychallenge.org/blog/perl-weekly-challenge-278>
 *
 *
 * To compile on the local machine:

 $ export JAVA_HOME=/usr/lib/jvm/java-17-openjdk-amd64/  # if not already set
 $ mvn clean build
 $ scp target/PWC278-1.jar  luca@rachel:/tmp


 * To install into PostgreSQL execute:

 select sqlj.install_jar( 'file:///tmp/PWC278-1.jar', 'PWC278', true );
 select sqlj.set_classpath( 'public', 'PWC278' );

 select pwc278.task2_pljava();

 and then to redeploy:

 select sqlj.replace_jar( 'file:///tmp/PWC278-1.jar', 'PWC278', true );

*/

import org.postgresql.pljava.*;
import org.postgresql.pljava.annotation.Function;
import static org.postgresql.pljava.annotation.Function.Effects.IMMUTABLE;
import static org.postgresql.pljava.annotation.Function.OnNullInput.RETURNS_NULL;

import java.util.*;
import java.util.stream.*;
import java.sql.SQLException;
import java.util.logging.*;
import java.sql.ResultSet;
import java.sql.Date;

public class Task2 {

    private final static Logger logger = Logger.getAnonymousLogger();

    @Function( schema = "pwc278",
	       onNullInput = RETURNS_NULL,
	       effects = IMMUTABLE )
    public static final String task2_pljava( String word, String c ) throws SQLException {
	logger.log( Level.INFO, "Entering pwc278.task2_pljava" );

	if ( ! word.contains( c ) )
	    return word;

	final List<String> left = new LinkedList<String>();
	final List<String> right = new LinkedList<String>();
	final boolean[] found = { false };
	Stream.of( word.split( "" ) ).forEach( letter -> {
		if ( found[ 0 ] )
		    right.add( letter );
		else {
		    left.add( letter );

		    if ( letter.equals( c ) )
			found[ 0 ] = true;
		}
	    } );

	Collections.sort( left );
	return left.stream().collect( Collectors.joining() ) + right.stream().collect( Collectors.joining() );
    }
}