aboutsummaryrefslogtreecommitdiff
path: root/challenge-333/luca-ferrari/pljava/src/main/java/Task1.java
blob: 350a46cf82236c718379129a9e687eed408e054d (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
75
76
package PWC333;

/**
 * PL/Java implementation for PWC 333
 * Task 1
 * See <https://perlweeklychallenge.org/blog/perl-weekly-challenge-333>
 *
 *
 * 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/PWC333-1.jar  luca@rachel:/tmp


 * To install into PostgreSQL execute:

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

 select pwc333.task2_pljava();

 and then to redeploy:

 select sqlj.replace_jar( 'file:///tmp/PWC333-1.jar', 'PWC333', 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 Task1 {

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

    @Function( schema = "pwc333",
	       onNullInput = RETURNS_NULL,
	       effects = IMMUTABLE )
    public static final boolean task1_pljava( int coordinates[] ) throws SQLException {
	logger.log( Level.INFO, "Entering pwc333.task1_pljava" );

	List<Map<String, Integer>> coords = new LinkedList<Map<String, Integer>>();

	for ( int i = 0; i < coordinates.length - 1; i++ ) {
	    Map<String, Integer> current = new HashMap<String, Integer>();
	    current.put( "x", coordinates[ i++ ] );
	    current.put( "y", coordinates[ i ] );
	    coords.add( current );
	}

	Map<String, Integer> first  = coords.get( 0 );
	Map<String, Integer> second = coords.get( 1 );

	for ( int i = 2; i < coords.size(); i++ ) {
	    Map<String, Integer> current = coords.get( i );

	    if ( ( current.get( "x" ) - first.get( "x" ) ) * ( first.get( "y" ) - second.get( "y" ) )
		 != ( current.get( "y" ) - first.get( "y" ) ) * ( first.get( "x" ) - second.get( "x" ) ) )
		return false;
	}

	return true;
    }
}