idx
int64
0
165k
question
stringlengths
73
5.81k
target
stringlengths
5
918
16,900
public Blob open_blob ( String db , String table , String column , long row , boolean rw ) throws jsqlite . Exception { synchronized ( this ) { Blob blob = new Blob ( ) ; _open_blob ( db , table , column , row , rw , blob ) ; return blob ; } }
Open an SQLite3 blob . Only available in SQLite 3 . 4 . 0 and above .
16,901
public static long long_from_julian ( String s ) throws jsqlite . Exception { try { double d = Double . valueOf ( s ) . doubleValue ( ) ; return long_from_julian ( d ) ; } catch ( java . lang . Exception ee ) { throw new jsqlite . Exception ( "not a julian date: " + s + ": " + ee ) ; } }
Make long value from julian date for java . lang . Date
16,902
public void clear ( ) { column = new String [ 0 ] ; types = null ; rows = new Vector ( ) ; ncolumns = nrows = 0 ; atmaxrows = false ; }
Clear result set .
16,903
public boolean newrow ( String rowdata [ ] ) { if ( rowdata != null ) { if ( maxrows > 0 && nrows >= maxrows ) { atmaxrows = true ; return true ; } rows . addElement ( rowdata ) ; nrows ++ ; } return false ; }
Callback method used while the query is executed .
16,904
public ColumnVector solve ( ColumnVector b , boolean improve ) throws MatrixException { if ( b . nRows != nRows ) { throw new MatrixException ( MatrixException . INVALID_DIMENSIONS ) ; } decompose ( ) ; ColumnVector y = forwardSubstitution ( b ) ; ColumnVector x = backSubstitution ( y ) ; if ( improve ) improve ( b , x ) ; return x ; }
Solve Ax = b for x using the Gaussian elimination algorithm .
16,905
private void forwardElimination ( double scales [ ] ) throws MatrixException { for ( int rPivot = 0 ; rPivot < nRows - 1 ; ++ rPivot ) { double largestScaledElmt = 0 ; int rLargest = 0 ; for ( int r = rPivot ; r < nRows ; ++ r ) { int pr = permutation [ r ] ; double absElmt = Math . abs ( LU . at ( pr , rPivot ) ) ; double scaledElmt = absElmt * scales [ pr ] ; if ( largestScaledElmt < scaledElmt ) { largestScaledElmt = scaledElmt ; rLargest = r ; } } if ( largestScaledElmt == 0 ) { throw new MatrixException ( MatrixException . SINGULAR ) ; } if ( rLargest != rPivot ) { int temp = permutation [ rPivot ] ; permutation [ rPivot ] = permutation [ rLargest ] ; permutation [ rLargest ] = temp ; ++ exchangeCount ; } int prPivot = permutation [ rPivot ] ; double pivotElmt = LU . at ( prPivot , rPivot ) ; for ( int r = rPivot + 1 ; r < nRows ; ++ r ) { int pr = permutation [ r ] ; double multiple = LU . at ( pr , rPivot ) / pivotElmt ; LU . set ( pr , rPivot , multiple ) ; if ( multiple != 0 ) { for ( int c = rPivot + 1 ; c < nCols ; ++ c ) { double elmt = LU . at ( pr , c ) ; elmt -= multiple * LU . at ( prPivot , c ) ; LU . set ( pr , c , elmt ) ; } } } } }
Do forward elimination with scaled partial row pivoting .
16,906
private ColumnVector forwardSubstitution ( ColumnVector b ) throws MatrixException { ColumnVector y = new ColumnVector ( nRows ) ; for ( int r = 0 ; r < nRows ; ++ r ) { int pr = permutation [ r ] ; double dot = 0 ; for ( int c = 0 ; c < r ; ++ c ) { dot += LU . at ( pr , c ) * y . at ( c ) ; } y . set ( r , b . at ( pr ) - dot ) ; } return y ; }
Solve Ly = b for y by forward substitution .
16,907
private ColumnVector backSubstitution ( ColumnVector y ) throws MatrixException { ColumnVector x = new ColumnVector ( nRows ) ; for ( int r = nRows - 1 ; r >= 0 ; -- r ) { int pr = permutation [ r ] ; double dot = 0 ; for ( int c = r + 1 ; c < nRows ; ++ c ) { dot += LU . at ( pr , c ) * x . at ( c ) ; } x . set ( r , ( y . at ( r ) - dot ) / LU . at ( pr , r ) ) ; } return x ; }
Solve Ux = y for x by back substitution .
16,908
private void improve ( ColumnVector b , ColumnVector x ) throws MatrixException { double largestX = 0 ; for ( int r = 0 ; r < nRows ; ++ r ) { double absX = Math . abs ( x . values [ r ] [ 0 ] ) ; if ( largestX < absX ) largestX = absX ; } if ( largestX == 0 ) return ; ColumnVector residuals = new ColumnVector ( nRows ) ; for ( int iter = 0 ; iter < MAX_ITER ; ++ iter ) { for ( int r = 0 ; r < nRows ; ++ r ) { double dot = 0 ; double row [ ] = values [ r ] ; for ( int c = 0 ; c < nRows ; ++ c ) { double elmt = at ( r , c ) ; dot += elmt * x . at ( c ) ; } double value = b . at ( r ) - dot ; residuals . set ( r , ( double ) value ) ; } ColumnVector z = solve ( residuals , false ) ; double largestDiff = 0 ; for ( int r = 0 ; r < nRows ; ++ r ) { double oldX = x . at ( r ) ; x . set ( r , oldX + z . at ( r ) ) ; double diff = Math . abs ( x . at ( r ) - oldX ) ; if ( largestDiff < diff ) largestDiff = diff ; } if ( largestDiff < largestX * TOLERANCE ) return ; } throw new MatrixException ( MatrixException . NO_CONVERGENCE ) ; }
Iteratively improve the solution x to machine accuracy .
16,909
void addFillComponents ( Container panel , int [ ] cols , int [ ] rows ) { Dimension filler = new Dimension ( 10 , 10 ) ; boolean filled_cell_11 = false ; CellConstraints cc = new CellConstraints ( ) ; if ( cols . length > 0 && rows . length > 0 ) { if ( cols [ 0 ] == 1 && rows [ 0 ] == 1 ) { panel . add ( Box . createRigidArea ( filler ) , cc . xy ( 1 , 1 ) ) ; filled_cell_11 = true ; } } for ( int index = 0 ; index < cols . length ; index ++ ) { if ( cols [ index ] == 1 && filled_cell_11 ) { continue ; } panel . add ( Box . createRigidArea ( filler ) , cc . xy ( cols [ index ] , 1 ) ) ; } for ( int index = 0 ; index < rows . length ; index ++ ) { if ( rows [ index ] == 1 && filled_cell_11 ) { continue ; } panel . add ( Box . createRigidArea ( filler ) , cc . xy ( 1 , rows [ index ] ) ) ; } }
Adds fill components to empty cells in the first row and first column of the grid . This ensures that the grid spacing will be the same as shown in the designer .
16,910
public ImageIcon loadImage ( String imageName ) { try { ClassLoader classloader = getClass ( ) . getClassLoader ( ) ; java . net . URL url = classloader . getResource ( imageName ) ; if ( url != null ) { ImageIcon icon = new ImageIcon ( url ) ; return icon ; } } catch ( Exception e ) { e . printStackTrace ( ) ; } throw new IllegalArgumentException ( "Unable to load image: " + imageName ) ; }
Helper method to load an image file from the CLASSPATH
16,911
public synchronized Class < ? > compileSource ( String name , String code ) throws Exception { Class < ? > c = cache . get ( name ) ; if ( c == null ) { c = compileSource0 ( name , code ) ; cache . put ( name , c ) ; } return c ; }
Compiles a single source file and loads the class with a default class loader . The default class loader is the one used to load the test case class .
16,912
private Class < ? > compileSource0 ( String className , String sourceCode ) throws Exception { List < MemorySourceJavaFileObject > compUnits = new ArrayList < MemorySourceJavaFileObject > ( 1 ) ; compUnits . add ( new MemorySourceJavaFileObject ( className + ".java" , sourceCode ) ) ; DiagnosticCollector < JavaFileObject > diag = new DiagnosticCollector < JavaFileObject > ( ) ; Boolean result = compiler . getTask ( null , fileManager , diag , compilerOptions , null , compUnits ) . call ( ) ; if ( result . equals ( Boolean . FALSE ) ) { throw new RuntimeException ( diag . getDiagnostics ( ) . toString ( ) ) ; } try { String classDotName = className . replace ( '/' , '.' ) ; return Class . forName ( classDotName , true , loader ) ; } catch ( ClassNotFoundException e ) { throw e ; } }
Compiles multiple sources file and loads the classes .
16,913
public void setValue ( int position , double value ) { if ( position >= internalArray . length ) { double [ ] newArray = new double [ position + growingSize ] ; System . arraycopy ( internalArray , 0 , newArray , 0 , internalArray . length ) ; internalArray = newArray ; } internalArray [ position ] = value ; lastIndex = max ( lastIndex , position ) ; }
Safe set the value in a certain position .
16,914
public double [ ] getTrimmedInternalArray ( ) { if ( internalArray . length == lastIndex + 1 ) { return internalArray ; } double [ ] newArray = new double [ lastIndex + 1 ] ; System . arraycopy ( internalArray , 0 , newArray , 0 , newArray . length ) ; return newArray ; }
Get a trimmed version of the array i . e . without ending unset positions .
16,915
public byte [ ] getColor ( float cat ) { float diff = cat - low ; if ( diff <= 0f ) return catColor ; else if ( diff > range ) { return new byte [ ] { ( byte ) ( ( int ) ( rmul * range ) + ( int ) catColor [ 0 ] ) , ( byte ) ( ( int ) ( gmul * range ) + ( int ) catColor [ 1 ] ) , ( byte ) ( ( int ) ( bmul * range ) + ( int ) catColor [ 2 ] ) , ( byte ) catColor [ 3 ] } ; } return new byte [ ] { ( byte ) ( ( int ) ( rmul * diff ) + ( int ) catColor [ 0 ] ) , ( byte ) ( ( int ) ( gmul * diff ) + ( int ) catColor [ 1 ] ) , ( byte ) ( ( int ) ( bmul * diff ) + ( int ) catColor [ 2 ] ) , ( byte ) catColor [ 3 ] } ; }
Return the colour tupple for specified category value
16,916
private String [ ] getExpectedRow ( TableIterator < String [ ] > tableRowIterator , DateTime expectedDT ) throws IOException { while ( tableRowIterator . hasNext ( ) ) { String [ ] row = tableRowIterator . next ( ) ; DateTime currentTimestamp = formatter . parseDateTime ( row [ 1 ] ) ; if ( currentTimestamp . equals ( expectedDT ) ) { if ( pNum == 1 ) { return row ; } else { String [ ] [ ] allRows = new String [ pNum ] [ ] ; allRows [ 0 ] = row ; int rowNum = 1 ; for ( int i = 1 ; i < pNum ; i ++ ) { if ( tableRowIterator . hasNext ( ) ) { String [ ] nextRow = tableRowIterator . next ( ) ; allRows [ i ] = nextRow ; rowNum ++ ; } } String [ ] aggregatedRow = new String [ row . length ] ; aggregatedRow [ 0 ] = allRows [ 0 ] [ 0 ] ; aggregatedRow [ 1 ] = allRows [ 0 ] [ 1 ] ; for ( int col = 2 ; col < allRows [ 0 ] . length ; col ++ ) { boolean hasOne = false ; switch ( pAggregation ) { case 0 : double sum = 0 ; for ( int j = 0 ; j < rowNum ; j ++ ) { String valueStr = allRows [ j ] [ col ] ; if ( ! valueStr . equals ( fileNovalue ) ) { double value = Double . parseDouble ( valueStr ) ; sum = sum + value ; hasOne = true ; } } if ( ! hasOne ) { sum = doubleNovalue ; } aggregatedRow [ col ] = String . valueOf ( sum ) ; break ; case 1 : double avg = 0 ; for ( int j = 0 ; j < rowNum ; j ++ ) { String valueStr = allRows [ j ] [ col ] ; if ( ! valueStr . equals ( fileNovalue ) ) { double value = Double . parseDouble ( valueStr ) ; avg = avg + value ; hasOne = true ; } } if ( ! hasOne ) { avg = doubleNovalue ; } else { avg = avg / pNum ; } aggregatedRow [ col ] = String . valueOf ( avg ) ; break ; default : break ; } } return aggregatedRow ; } } else if ( currentTimestamp . isBefore ( expectedDT ) ) { continue ; } else if ( currentTimestamp . isAfter ( expectedDT ) ) { String message = "The data are not aligned with the simulation interval (" + currentTimestamp + "/" + expectedDT + "). Check your data file: " + file ; throw new IOException ( message ) ; } } return null ; }
Get the needed datarow from the table .
16,917
@ SuppressWarnings ( "unchecked" ) public void process ( ) throws Exception { checkNull ( inVector , pMaxOverlap , inRaster ) ; RandomIter rasterIter = CoverageUtilities . getRandomIterator ( inRaster ) ; GridGeometry2D gridGeometry = inRaster . getGridGeometry ( ) ; double [ ] tm_utm_tac = new double [ 3 ] ; STRtree circlesTree = FeatureUtilities . featureCollectionToSTRtree ( inVector ) ; List < SimpleFeature > circlesList = FeatureUtilities . featureCollectionToList ( inVector ) ; DefaultFeatureCollection outFC = new DefaultFeatureCollection ( ) ; for ( SimpleFeature circleFeature : circlesList ) { Geometry geometry = ( Geometry ) circleFeature . getDefaultGeometry ( ) ; Polygon circle = ( Polygon ) geometry . getGeometryN ( 0 ) ; PreparedGeometry preparedCircle = PreparedGeometryFactory . prepare ( circle ) ; List < SimpleFeature > circlesAround = circlesTree . query ( circle . getEnvelopeInternal ( ) ) ; List < Geometry > intersectedCircles = new ArrayList < Geometry > ( ) ; for ( SimpleFeature circleAround : circlesAround ) { if ( circleAround . equals ( circleFeature ) ) { continue ; } Geometry circleAroundGeometry = ( Geometry ) circleAround . getDefaultGeometry ( ) ; if ( preparedCircle . intersects ( circleAroundGeometry ) ) { intersectedCircles . add ( circleAroundGeometry ) ; } } Point centroid = circle . getCentroid ( ) ; int intersectionsCount = intersectedCircles . size ( ) ; if ( intersectionsCount != 0 ) { if ( intersectionsCount > pMaxOverlapCount ) { continue ; } boolean intersected = false ; for ( Geometry intersectedCircle : intersectedCircles ) { if ( intersectedCircle . intersects ( centroid ) ) { intersected = true ; break ; } } if ( intersected ) { continue ; } } double value = CoverageUtilities . getValue ( inRaster , centroid . getCoordinate ( ) ) ; if ( ! HMConstants . isNovalue ( value ) ) { continue ; } double [ ] stats = OmsZonalStats . polygonStats ( circle , gridGeometry , rasterIter , false , tm_utm_tac , 0 , pm ) ; double activeCells = stats [ 5 ] ; double novalues = stats [ 6 ] ; if ( activeCells * 1.5 > novalues ) { continue ; } outFC . add ( circleFeature ) ; } outCircles = outFC ; rasterIter . done ( ) ; }
VARS DESCR END
16,918
private static byte [ ] byteCopy ( byte [ ] source , int offset , int count , byte [ ] target ) { for ( int i = offset , j = 0 ; i < offset + count ; i ++ , j ++ ) { target [ j ] = source [ i ] ; } return target ; }
Copies count elements from source starting at element with index offset to the given target .
16,919
public static String encodeX ( byte [ ] a ) { if ( a == null || a . length == 0 ) { return "X''" ; } char [ ] out = new char [ a . length * 2 + 3 ] ; int i = 2 ; for ( int j = 0 ; j < a . length ; j ++ ) { out [ i ++ ] = xdigits [ ( a [ j ] >> 4 ) & 0x0F ] ; out [ i ++ ] = xdigits [ a [ j ] & 0x0F ] ; } out [ 0 ] = 'X' ; out [ 1 ] = '\'' ; out [ i ] = '\'' ; return new String ( out ) ; }
Encodes the given byte array into SQLite3 blob notation ie X ..
16,920
public double [ ] [ ] getWindow ( int size , boolean doCircular ) { if ( size % 2 == 0 ) { size ++ ; } double [ ] [ ] window = new double [ size ] [ size ] ; int delta = ( size - 1 ) / 2 ; if ( ! doCircular ) { for ( int c = - delta ; c <= delta ; c ++ ) { int tmpCol = col + c ; for ( int r = - delta ; r <= delta ; r ++ ) { int tmpRow = row + r ; GridNode n = new GridNode ( gridIter , cols , rows , xRes , yRes , tmpCol , tmpRow ) ; window [ r + delta ] [ c + delta ] = n . elevation ; } } } else { double radius = delta ; for ( int c = - delta ; c <= delta ; c ++ ) { int tmpCol = col + c ; for ( int r = - delta ; r <= delta ; r ++ ) { int tmpRow = row + r ; double distance = sqrt ( c * c + r * r ) ; if ( distance <= radius ) { GridNode n = new GridNode ( gridIter , cols , rows , xRes , yRes , tmpCol , tmpRow ) ; window [ r + delta ] [ c + delta ] = n . elevation ; } else { window [ r + delta ] [ c + delta ] = doubleNovalue ; } } } } return window ; }
Get a window of values surrounding the current node .
16,921
public double getElevationAt ( Direction direction ) { switch ( direction ) { case E : return eElev ; case W : return wElev ; case N : return nElev ; case S : return sElev ; case EN : return enElev ; case NW : return nwElev ; case WS : return wsElev ; case SE : return seElev ; default : throw new IllegalArgumentException ( ) ; } }
Get the value of the elevation in one of the surrounding direction .
16,922
public int getFlow ( ) { GridNode nextDown = goDownstreamSP ( ) ; if ( nextDown == null ) { return HMConstants . intNovalue ; } int dcol = nextDown . col - col ; int drow = nextDown . row - row ; Direction dir = Direction . getDir ( dcol , drow ) ; return dir . getFlow ( ) ; }
Get the flow value of this node based in the steepest path .
16,923
public GridNode getNodeAt ( Direction direction ) { int newCol = col + direction . col ; int newRow = row + direction . row ; GridNode node = new GridNode ( gridIter , cols , rows , xRes , yRes , newCol , newRow ) ; return node ; }
Get a neighbor node at a certain direction .
16,924
public Direction isNeighborOf ( GridNode otherNode ) { Direction [ ] orderedDirs = Direction . getOrderedDirs ( ) ; for ( int i = 0 ; i < orderedDirs . length ; i ++ ) { Direction direction = orderedDirs [ i ] ; int newCol = col + direction . col ; int newRow = row + direction . row ; if ( otherNode . col == newCol && otherNode . row == newRow ) { return direction ; } } return null ; }
Checks if the supplied node is adjacent to the current .
16,925
public Direction isSameValueNeighborOf ( GridNode otherNode ) { Direction direction = isNeighborOf ( otherNode ) ; if ( direction != null && NumericsUtilities . dEq ( elevation , otherNode . elevation ) ) { return direction ; } return null ; }
Checks if the supplied node is adjacent to the current and has the same value .
16,926
public double getSlopeTo ( GridNode node ) { double slope = ( elevation - node . elevation ) / getDistance ( node ) ; return slope ; }
Calculates the slope from the current to the supplied point .
16,927
protected static String getXmlEncoding ( Reader reader ) { try { StringWriter sw = new StringWriter ( MAX_XMLDECL_SIZE ) ; int c ; int count = 0 ; for ( ; ( 6 > count ) && ( - 1 != ( c = reader . read ( ) ) ) ; count ++ ) { sw . write ( c ) ; } if ( ( 6 > count ) || ( ! "<?xml " . equals ( sw . toString ( ) ) ) ) { if ( LOGGER . isLoggable ( Level . FINER ) ) { LOGGER . finer ( "Invalid(?) XML declaration: " + sw . toString ( ) + "." ) ; } return null ; } for ( ; ( MAX_XMLDECL_SIZE > count ) && ( - 1 != ( c = reader . read ( ) ) ) && ( RIGHT_ANGLE_BRACKET != ( char ) c ) ; count ++ ) { sw . write ( c ) ; } Matcher m = ENCODING_PATTERN . matcher ( sw . toString ( ) ) ; if ( m . find ( ) ) { String result = m . group ( 1 ) ; return result ; } else { return null ; } } catch ( IOException e ) { if ( LOGGER . isLoggable ( Level . WARNING ) ) { LOGGER . warning ( "Failed to extract charset info from XML " + "declaration due to IOException: " + e . getMessage ( ) ) ; } return null ; } }
Gets the encoding of the xml request made to the dispatcher . This works by reading the temp file where we are storing the request looking to match the header specified encoding that should be present on all xml files . This call should only be made after the temp file has been set . If no encoding is found or if an IOError is encountered then null shall be returned .
16,928
public static List < LasCell > getLasCells ( ASpatialDb db , Envelope envelope , Geometry exactGeometry , boolean doPosition , boolean doIntensity , boolean doReturns , boolean doTime , boolean doColor , int limitTo ) throws Exception { List < LasCell > lasCells = new ArrayList < > ( ) ; String sql = "SELECT " + COLUMN_GEOM + "," + COLUMN_ID + "," + COLUMN_SOURCE_ID + "," + COLUMN_POINTS_COUNT ; if ( doPosition ) sql += "," + COLUMN_AVG_ELEV + "," + COLUMN_MIN_ELEV + "," + COLUMN_MAX_ELEV + "," + COLUMN_POSITION_BLOB ; if ( doIntensity ) sql += "," + COLUMN_AVG_INTENSITY + "," + COLUMN_MIN_INTENSITY + "," + COLUMN_MAX_INTENSITY + "," + COLUMN_INTENS_CLASS_BLOB ; if ( doReturns ) sql += "," + COLUMN_RETURNS_BLOB ; if ( doTime ) sql += "," + COLUMN_MIN_GPSTIME + "," + COLUMN_MAX_GPSTIME + "," + COLUMN_GPSTIME_BLOB ; if ( doColor ) sql += "," + COLUMN_COLORS_BLOB ; sql += " FROM " + TABLENAME ; if ( exactGeometry != null ) { sql += " WHERE " + db . getSpatialindexGeometryWherePiece ( TABLENAME , null , exactGeometry ) ; } else if ( envelope != null ) { double x1 = envelope . getMinX ( ) ; double y1 = envelope . getMinY ( ) ; double x2 = envelope . getMaxX ( ) ; double y2 = envelope . getMaxY ( ) ; sql += " WHERE " + db . getSpatialindexBBoxWherePiece ( TABLENAME , null , x1 , y1 , x2 , y2 ) ; } if ( limitTo > 0 ) { sql += " LIMIT " + limitTo ; } String _sql = sql ; IGeometryParser gp = db . getType ( ) . getGeometryParser ( ) ; return db . execOnConnection ( conn -> { try ( IHMStatement stmt = conn . createStatement ( ) ; IHMResultSet rs = stmt . executeQuery ( _sql ) ) { while ( rs . next ( ) ) { LasCell lasCell = resultSetToCell ( db , gp , doPosition , doIntensity , doReturns , doTime , doColor , rs ) ; lasCells . add ( lasCell ) ; } return lasCells ; } } ) ; }
Query the las cell table .
16,929
public static List < LasCell > getLasCells ( ASpatialDb db , Geometry geometry , boolean doPosition , boolean doIntensity , boolean doReturns , boolean doTime , boolean doColor ) throws Exception { List < LasCell > lasCells = new ArrayList < > ( ) ; String sql = "SELECT " + COLUMN_GEOM + "," + COLUMN_ID + "," + COLUMN_SOURCE_ID + "," + COLUMN_POINTS_COUNT ; if ( doPosition ) sql += "," + COLUMN_AVG_ELEV + "," + COLUMN_MIN_ELEV + "," + COLUMN_MAX_ELEV + "," + COLUMN_POSITION_BLOB ; if ( doIntensity ) sql += "," + COLUMN_AVG_INTENSITY + "," + COLUMN_MIN_INTENSITY + "," + COLUMN_MAX_INTENSITY + "," + COLUMN_INTENS_CLASS_BLOB ; if ( doReturns ) sql += "," + COLUMN_RETURNS_BLOB ; if ( doTime ) sql += "," + COLUMN_MIN_GPSTIME + "," + COLUMN_MAX_GPSTIME + "," + COLUMN_GPSTIME_BLOB ; if ( doColor ) sql += "," + COLUMN_COLORS_BLOB ; sql += " FROM " + TABLENAME ; if ( geometry != null ) { sql += " WHERE " + db . getSpatialindexGeometryWherePiece ( TABLENAME , null , geometry ) ; } String _sql = sql ; IGeometryParser gp = db . getType ( ) . getGeometryParser ( ) ; return db . execOnConnection ( conn -> { try ( IHMStatement stmt = conn . createStatement ( ) ; IHMResultSet rs = stmt . executeQuery ( _sql ) ) { while ( rs . next ( ) ) { LasCell lasCell = resultSetToCell ( db , gp , doPosition , doIntensity , doReturns , doTime , doColor , rs ) ; lasCells . add ( lasCell ) ; } return lasCells ; } } ) ; }
Query the las cell table on a geometry intersection .
16,930
public ValidationResult check ( Feature feature ) { result = new ValidationResult ( ) ; if ( feature == null ) { return result ; } List < Qualifier > collectionDateQualifiers = feature . getQualifiers ( Qualifier . COLLECTION_DATE_QUALIFIER_NAME ) ; if ( collectionDateQualifiers . isEmpty ( ) ) { return result ; } for ( Qualifier collectionDateQualifier : collectionDateQualifiers ) { String collectionDateValue = collectionDateQualifier . getValue ( ) ; if ( INSDC_DATE_FORMAT_PATTERN_1 . matcher ( collectionDateValue ) . matches ( ) ) { collectionDateQualifier . setValue ( "0" + collectionDateValue ) ; reportMessage ( Severity . FIX , collectionDateQualifier . getOrigin ( ) , CollectionDateQualifierFix_ID_1 , collectionDateValue , collectionDateQualifier . getValue ( ) ) ; } if ( getEmblEntryValidationPlanProperty ( ) . validationScope . get ( ) == ValidationScope . NCBI ) { Matcher matcher = NCBI_DATE_FORMAT_PATTERN . matcher ( collectionDateValue ) ; if ( matcher . matches ( ) ) { String monthYear = "-" + matcher . group ( 2 ) + "-20" + matcher . group ( 3 ) ; collectionDateQualifier . setValue ( matcher . group ( 1 ) . length ( ) == 1 ? "0" + matcher . group ( 1 ) + monthYear : matcher . group ( 1 ) + monthYear ) ; reportMessage ( Severity . FIX , collectionDateQualifier . getOrigin ( ) , CollectionDateQualifierFix_ID_1 , collectionDateValue , collectionDateQualifier . getValue ( ) ) ; } } } return result ; }
DD - Mmm - YY
16,931
public static OSType getOperatingSystemType ( ) { if ( detectedOS == null ) { String OS = System . getProperty ( "os.name" , "generic" ) . toLowerCase ( Locale . ENGLISH ) ; if ( ( OS . indexOf ( "mac" ) >= 0 ) || ( OS . indexOf ( "darwin" ) >= 0 ) ) { detectedOS = OSType . MacOS ; } else if ( OS . indexOf ( "win" ) >= 0 ) { detectedOS = OSType . Windows ; } else if ( OS . indexOf ( "nux" ) >= 0 ) { detectedOS = OSType . Linux ; } else { detectedOS = OSType . Other ; } } return detectedOS ; }
detect the operating system from the os . name System property and cache the result
16,932
public static Point2D [ ] calculateGisModelCircle ( Point2D c , double r ) { Point2D [ ] pts = new Point2D [ 360 ] ; int angulo = 0 ; for ( angulo = 0 ; angulo < 360 ; angulo ++ ) { pts [ angulo ] = new Point2D . Double ( c . getX ( ) , c . getY ( ) ) ; pts [ angulo ] . setLocation ( pts [ angulo ] . getX ( ) + r * Math . sin ( angulo * Math . PI / ( double ) 180.0 ) , pts [ angulo ] . getY ( ) + r * Math . cos ( angulo * Math . PI / ( double ) 180.0 ) ) ; } return pts ; }
This method calculates an array of Point2D that represents a circle . The distance between it points is 1 angular unit
16,933
public static Point2D [ ] calculateGisModelBulge ( Point2D [ ] newPts , double [ ] bulges ) { Vector ptspol = new Vector ( ) ; Point2D init = new Point2D . Double ( ) ; Point2D end = new Point2D . Double ( ) ; for ( int j = 0 ; j < newPts . length ; j ++ ) { init = newPts [ j ] ; if ( j != newPts . length - 1 ) end = newPts [ j + 1 ] ; if ( bulges [ j ] == 0 || j == newPts . length - 1 || ( init . getX ( ) == end . getX ( ) && init . getY ( ) == end . getY ( ) ) ) { ptspol . add ( init ) ; } else { ArcFromBulgeCalculator arcCalculator = new ArcFromBulgeCalculator ( init , end , bulges [ j ] ) ; Vector arc = arcCalculator . getPoints ( 1 ) ; if ( bulges [ j ] < 0 ) { for ( int k = arc . size ( ) - 1 ; k >= 0 ; k -- ) { ptspol . add ( arc . get ( k ) ) ; } ptspol . remove ( ptspol . size ( ) - 1 ) ; } else { for ( int k = 0 ; k < arc . size ( ) ; k ++ ) { ptspol . add ( arc . get ( k ) ) ; } ptspol . remove ( ptspol . size ( ) - 1 ) ; } } } Point2D [ ] points = new Point2D [ ptspol . size ( ) ] ; for ( int j = 0 ; j < ptspol . size ( ) ; j ++ ) { points [ j ] = ( Point2D ) ptspol . get ( j ) ; } return points ; }
This method applies an array of bulges to an array of Point2D that defines a polyline . The result is a polyline with the input points with the addition of the points that define the new arcs added to the polyline
16,934
public byte [ ] seal ( byte [ ] nonce , byte [ ] plaintext ) { final XSalsa20Engine xsalsa20 = new XSalsa20Engine ( ) ; final Poly1305 poly1305 = new Poly1305 ( ) ; xsalsa20 . init ( true , new ParametersWithIV ( new KeyParameter ( key ) , nonce ) ) ; final byte [ ] sk = new byte [ Keys . KEY_LEN ] ; xsalsa20 . processBytes ( sk , 0 , Keys . KEY_LEN , sk , 0 ) ; final byte [ ] out = new byte [ plaintext . length + poly1305 . getMacSize ( ) ] ; xsalsa20 . processBytes ( plaintext , 0 , plaintext . length , out , poly1305 . getMacSize ( ) ) ; poly1305 . init ( new KeyParameter ( sk ) ) ; poly1305 . update ( out , poly1305 . getMacSize ( ) , plaintext . length ) ; poly1305 . doFinal ( out , 0 ) ; return out ; }
Encrypt a plaintext using the given key and nonce .
16,935
public Optional < byte [ ] > open ( byte [ ] nonce , byte [ ] ciphertext ) { final XSalsa20Engine xsalsa20 = new XSalsa20Engine ( ) ; final Poly1305 poly1305 = new Poly1305 ( ) ; xsalsa20 . init ( false , new ParametersWithIV ( new KeyParameter ( key ) , nonce ) ) ; final byte [ ] sk = new byte [ Keys . KEY_LEN ] ; xsalsa20 . processBytes ( sk , 0 , sk . length , sk , 0 ) ; poly1305 . init ( new KeyParameter ( sk ) ) ; final int len = Math . max ( ciphertext . length - poly1305 . getMacSize ( ) , 0 ) ; poly1305 . update ( ciphertext , poly1305 . getMacSize ( ) , len ) ; final byte [ ] calculatedMAC = new byte [ poly1305 . getMacSize ( ) ] ; poly1305 . doFinal ( calculatedMAC , 0 ) ; final byte [ ] presentedMAC = new byte [ poly1305 . getMacSize ( ) ] ; System . arraycopy ( ciphertext , 0 , presentedMAC , 0 , Math . min ( ciphertext . length , poly1305 . getMacSize ( ) ) ) ; if ( ! MessageDigest . isEqual ( calculatedMAC , presentedMAC ) ) { return Optional . empty ( ) ; } final byte [ ] plaintext = new byte [ len ] ; xsalsa20 . processBytes ( ciphertext , poly1305 . getMacSize ( ) , plaintext . length , plaintext , 0 ) ; return Optional . of ( plaintext ) ; }
Decrypt a ciphertext using the given key and nonce .
16,936
public byte [ ] nonce ( ) { final byte [ ] nonce = new byte [ NONCE_SIZE ] ; final SecureRandom random = new SecureRandom ( ) ; random . nextBytes ( nonce ) ; return nonce ; }
Generates a random nonce .
16,937
public byte [ ] nonce ( byte [ ] message ) { final byte [ ] n1 = new byte [ 16 ] ; final byte [ ] n2 = new byte [ 16 ] ; final SecureRandom random = new SecureRandom ( ) ; random . nextBytes ( n1 ) ; random . nextBytes ( n2 ) ; final Blake2bDigest blake2b = new Blake2bDigest ( key , NONCE_SIZE , n1 , n2 ) ; blake2b . update ( message , message . length , 0 ) ; final byte [ ] nonce = new byte [ NONCE_SIZE ] ; blake2b . doFinal ( nonce , 0 ) ; return nonce ; }
Generates a random nonce which is guaranteed to be unique even if the process s PRNG is exhausted or compromised .
16,938
public Object get ( int row , int col ) { return ( dstore == null ) ? null : dstore . get ( row , col ) ; }
Returns the data of this objects row and column cell .
16,939
public static boolean go_downstream ( int [ ] colRow , double flowdirection ) { int n = ( int ) flowdirection ; if ( n == 10 ) { return true ; } else if ( n < 1 || n > 9 ) { return false ; } else { colRow [ 1 ] += DIR [ n ] [ 0 ] ; colRow [ 0 ] += DIR [ n ] [ 1 ] ; return true ; } }
Moves one pixel downstream .
16,940
public static boolean sourcesNet ( RandomIter flowIterator , int [ ] colRow , int num , RandomIter netNum ) { int [ ] [ ] dir = { { 0 , 0 , 0 } , { 1 , 0 , 5 } , { 1 , - 1 , 6 } , { 0 , - 1 , 7 } , { - 1 , - 1 , 8 } , { - 1 , 0 , 1 } , { - 1 , 1 , 2 } , { 0 , 1 , 3 } , { 1 , 1 , 4 } } ; if ( flowIterator . getSampleDouble ( colRow [ 0 ] , colRow [ 1 ] , 0 ) <= 10.0 && flowIterator . getSampleDouble ( colRow [ 0 ] , colRow [ 1 ] , 0 ) > 0.0 ) { for ( int k = 1 ; k <= 8 ; k ++ ) { if ( flowIterator . getSampleDouble ( colRow [ 0 ] + dir [ k ] [ 0 ] , colRow [ 1 ] + dir [ k ] [ 1 ] , 0 ) == dir [ k ] [ 2 ] && netNum . getSampleDouble ( colRow [ 0 ] + dir [ k ] [ 0 ] , colRow [ 1 ] + dir [ k ] [ 1 ] , 0 ) == num ) { return false ; } } return true ; } else { return false ; } }
Controls if the considered point is a source in the network map .
16,941
public static double [ ] vectorizeDoubleMatrix ( RenderedImage input ) { double [ ] U = new double [ input . getWidth ( ) * input . getHeight ( ) ] ; RandomIter inputRandomIter = RandomIterFactory . create ( input , null ) ; int j = 0 ; for ( int i = 0 ; i < input . getHeight ( ) * input . getWidth ( ) ; i = i + input . getWidth ( ) ) { double tmp [ ] = new double [ input . getWidth ( ) ] ; for ( int k = 0 ; k < input . getWidth ( ) ; k ++ ) { tmp [ k ] = inputRandomIter . getSampleDouble ( k , j , 0 ) ; } System . arraycopy ( tmp , 0 , U , i , input . getWidth ( ) ) ; j ++ ; } return U ; }
Takes a input raster and vectorializes it .
16,942
public static double calculateNthMoment ( double [ ] values , int validValues , double mean , double momentOrder , IHMProgressMonitor pm ) { double moment = 0.0 ; double n = 0.0 ; if ( momentOrder == 1.0 ) { for ( int i = 0 ; i < validValues ; i ++ ) { if ( ! isNovalue ( values [ i ] ) ) { moment += values [ i ] ; n ++ ; } } if ( n >= 1 ) { moment /= n ; } } else if ( momentOrder == 2.0 ) { for ( int i = 0 ; i < validValues ; i ++ ) { if ( ! isNovalue ( values [ i ] ) ) { moment += ( values [ i ] ) * ( values [ i ] ) ; n ++ ; } } if ( n >= 1 ) { moment = ( moment / n - mean * mean ) ; } } else { for ( int i = 0 ; i < validValues ; i ++ ) { if ( ! isNovalue ( values [ i ] ) ) { moment += pow ( ( values [ i ] - mean ) , momentOrder ) ; n ++ ; } } if ( n >= 1 ) { moment /= n ; } } if ( n == 0 ) { pm . errorMessage ( "No valid data were processed, setting moment value to zero." ) ; moment = 0.0 ; } return moment ; }
Calculates the nth moment of a set of values .
16,943
public static WritableRaster extractSubbasins ( WritableRandomIter flowIter , RandomIter netIter , WritableRandomIter netNumberIter , int rows , int cols , IHMProgressMonitor pm ) { for ( int r = 0 ; r < rows ; r ++ ) { for ( int c = 0 ; c < cols ; c ++ ) { if ( ! isNovalue ( netIter . getSampleDouble ( c , r , 0 ) ) ) flowIter . setSample ( c , r , 0 , FlowNode . OUTLET ) ; } } WritableRaster subbasinWR = CoverageUtilities . createWritableRaster ( cols , rows , Integer . class , null , null ) ; WritableRandomIter subbasinIter = RandomIterFactory . createWritable ( subbasinWR , null ) ; markHillSlopeWithLinkValue ( flowIter , netNumberIter , subbasinIter , cols , rows , pm ) ; try { for ( int r = 0 ; r < rows ; r ++ ) { for ( int c = 0 ; c < cols ; c ++ ) { int netValue = netIter . getSample ( c , r , 0 ) ; int netNumberValue = netNumberIter . getSample ( c , r , 0 ) ; if ( ! isNovalue ( netValue ) ) { subbasinIter . setSample ( c , r , 0 , netNumberValue ) ; } if ( NumericsUtilities . dEq ( netNumberValue , 0 ) ) { netNumberIter . setSample ( c , r , 0 , HMConstants . intNovalue ) ; } int subbValue = subbasinIter . getSample ( c , r , 0 ) ; if ( NumericsUtilities . dEq ( subbValue , 0 ) ) subbasinIter . setSample ( c , r , 0 , HMConstants . intNovalue ) ; } } } finally { subbasinIter . done ( ) ; } return subbasinWR ; }
Extract the subbasins of a raster map .
16,944
public static void markHillSlopeWithLinkValue ( RandomIter flowIter , RandomIter attributeIter , WritableRandomIter markedIter , int cols , int rows , IHMProgressMonitor pm ) { pm . beginTask ( "Marking the hillslopes with the channel value..." , rows ) ; for ( int r = 0 ; r < rows ; r ++ ) { for ( int c = 0 ; c < cols ; c ++ ) { FlowNode flowNode = new FlowNode ( flowIter , cols , rows , c , r ) ; if ( flowNode . isHeadingOutside ( ) ) { continue ; } if ( flowNode . isMarkedAsOutlet ( ) ) { double attributeValue = flowNode . getDoubleValueFromMap ( attributeIter ) ; flowNode . setDoubleValueInMap ( markedIter , attributeValue ) ; continue ; } if ( flowNode . isValid ( ) && flowNode . isSource ( ) ) { double attributeValue = doubleNovalue ; FlowNode runningNode = flowNode . goDownstream ( ) ; int runningRow = - 1 ; int runningCol = - 1 ; while ( runningNode != null && runningNode . isValid ( ) ) { runningRow = runningNode . row ; runningCol = runningNode . col ; if ( runningNode . isMarkedAsOutlet ( ) ) { attributeValue = runningNode . getDoubleValueFromMap ( attributeIter ) ; break ; } runningNode = runningNode . goDownstream ( ) ; } if ( ! isNovalue ( attributeValue ) ) { runningNode = flowNode ; while ( runningNode != null && runningNode . isValid ( ) ) { runningNode . setDoubleValueInMap ( markedIter , attributeValue ) ; if ( runningNode . isMarkedAsOutlet ( ) ) { break ; } runningNode = runningNode . goDownstream ( ) ; } } else { throw new ModelsIllegalargumentException ( "Could not find a value of the attributes map in the channel after point: " + runningCol + "/" + runningRow + ". Are you sure that everything leads to a channel or outlet?" , "MODELSENGINE" , pm ) ; } } } pm . worked ( 1 ) ; } pm . done ( ) ; }
Marks a map on the hillslope with the values on the channel of an attribute map .
16,945
public static boolean isSourcePixel ( RandomIter flowIter , int col , int row ) { double flowDirection = flowIter . getSampleDouble ( col , row , 0 ) ; if ( flowDirection < 9.0 && flowDirection > 0.0 ) { for ( int k = 1 ; k <= 8 ; k ++ ) { if ( flowIter . getSampleDouble ( col + dirIn [ k ] [ 1 ] , row + dirIn [ k ] [ 0 ] , 0 ) == dirIn [ k ] [ 2 ] ) { return false ; } } return true ; } else { return false ; } }
Verifies if the point is a source pixel in the supplied flow raster .
16,946
public static double width_interpolate ( double [ ] [ ] data , double x , int nx , int ny ) { int rows = data . length ; double xuno = 0 , xdue = 0 , yuno = 0 , ydue = 0 , y = 0 ; if ( x >= 0 && x < data [ 0 ] [ nx ] ) { xuno = 0 ; xdue = data [ 0 ] [ nx ] ; yuno = 0 ; ydue = data [ 0 ] [ ny ] ; y = ( ( ydue - yuno ) / ( xdue - xuno ) ) * ( x - xuno ) + yuno ; } if ( x > data [ ( rows - 1 ) ] [ nx ] || x < 0 ) { throw new RuntimeException ( MessageFormat . format ( "Error in the interpolation algorithm: entering with x = {0} (min = 0.0 max = {1}" , x , data [ ( rows - 1 ) ] [ nx ] ) ) ; } for ( int i = 0 ; i < rows - 1 ; i ++ ) { if ( x > data [ i ] [ nx ] && x <= data [ ( i + 1 ) ] [ nx ] ) { xuno = data [ i ] [ nx ] ; xdue = data [ ( i + 1 ) ] [ nx ] ; yuno = data [ i ] [ ny ] ; ydue = data [ ( i + 1 ) ] [ ny ] ; y = ( ( ydue - yuno ) / ( xdue - xuno ) ) * ( x - xuno ) + yuno ; } } return y ; }
Linear interpolation between two values
16,947
public static double henderson ( double [ ] [ ] data , int tp ) { int rows = data . length ; int j = 1 , n = 0 ; double dt = 0 , muno , mdue , a , b , x , y , ydue , s_uno , s_due , smax = 0 , tstar ; for ( int i = 1 ; i < rows ; i ++ ) { if ( data [ i ] [ 0 ] + tp <= data [ ( rows - 1 ) ] [ 0 ] ) { muno = ( data [ i ] [ 1 ] - data [ ( i - 1 ) ] [ 1 ] ) / ( data [ i ] [ 0 ] - data [ ( i - 1 ) ] [ 0 ] ) ; a = data [ i ] [ 1 ] - ( data [ i ] [ 0 ] + tp ) * muno ; for ( j = 1 ; j <= ( rows - 1 ) ; j ++ ) { mdue = ( data [ j ] [ 1 ] - data [ ( j - 1 ) ] [ 1 ] ) / ( data [ j ] [ 0 ] - data [ ( j - 1 ) ] [ 0 ] ) ; b = data [ j ] [ 1 ] - data [ j ] [ 0 ] * mdue ; x = ( a - b ) / ( mdue - muno ) ; y = muno * x + a ; if ( x >= data [ ( j - 1 ) ] [ 0 ] && x <= data [ j ] [ 0 ] && x - tp >= data [ ( i - 1 ) ] [ 0 ] && x - tp <= data [ i ] [ 0 ] ) { ydue = width_interpolate ( data , x - tp , 0 , 1 ) ; n ++ ; s_uno = width_interpolate ( data , x - tp , 0 , 2 ) ; s_due = width_interpolate ( data , x , 0 , 2 ) ; if ( s_due - s_uno > smax ) { smax = s_due - s_uno ; dt = x - tp ; tstar = x ; } } } } } return dt ; }
Interpolates the width function in a given tp .
16,948
public static double gamma ( double x ) { double tmp = ( x - 0.5 ) * log ( x + 4.5 ) - ( x + 4.5 ) ; double ser = 1.0 + 76.18009173 / ( x + 0 ) - 86.50532033 / ( x + 1 ) + 24.01409822 / ( x + 2 ) - 1.231739516 / ( x + 3 ) + 0.00120858003 / ( x + 4 ) - 0.00000536382 / ( x + 5 ) ; double gamma = exp ( tmp + log ( ser * sqrt ( 2 * PI ) ) ) ; return gamma ; }
The Gamma function .
16,949
public static WritableRaster sumDownstream ( RandomIter flowIter , RandomIter mapToSumIter , int width , int height , Double upperThreshold , Double lowerThreshold , IHMProgressMonitor pm ) { final int [ ] point = new int [ 2 ] ; WritableRaster summedMapWR = CoverageUtilities . createWritableRaster ( width , height , null , null , null ) ; WritableRandomIter summedMapIter = RandomIterFactory . createWritable ( summedMapWR , null ) ; double uThres = Double . POSITIVE_INFINITY ; if ( upperThreshold != null ) { uThres = upperThreshold ; } double lThres = Double . NEGATIVE_INFINITY ; if ( lowerThreshold != null ) { lThres = lowerThreshold ; } pm . beginTask ( "Calculating downstream sum..." , height ) ; for ( int r = 0 ; r < height ; r ++ ) { for ( int c = 0 ; c < width ; c ++ ) { double mapToSumValue = mapToSumIter . getSampleDouble ( c , r , 0 ) ; if ( ! isNovalue ( flowIter . getSampleDouble ( c , r , 0 ) ) && mapToSumValue < uThres && mapToSumValue > lThres ) { point [ 0 ] = c ; point [ 1 ] = r ; while ( flowIter . getSampleDouble ( point [ 0 ] , point [ 1 ] , 0 ) < 9 && ! isNovalue ( flowIter . getSampleDouble ( point [ 0 ] , point [ 1 ] , 0 ) ) && ( checkRange ( mapToSumIter . getSampleDouble ( point [ 0 ] , point [ 1 ] , 0 ) , uThres , lThres ) ) ) { double sumValue = summedMapIter . getSampleDouble ( point [ 0 ] , point [ 1 ] , 0 ) + mapToSumIter . getSampleDouble ( c , r , 0 ) ; summedMapIter . setSample ( point [ 0 ] , point [ 1 ] , 0 , sumValue ) ; if ( ! go_downstream ( point , flowIter . getSampleDouble ( point [ 0 ] , point [ 1 ] , 0 ) ) ) return null ; } if ( ! isNovalue ( flowIter . getSampleDouble ( point [ 0 ] , point [ 1 ] , 0 ) ) ) { double summedMapValue = summedMapIter . getSampleDouble ( point [ 0 ] , point [ 1 ] , 0 ) ; if ( ! isNovalue ( summedMapValue ) ) { double sumValue = summedMapValue + mapToSumIter . getSampleDouble ( c , r , 0 ) ; summedMapIter . setSample ( point [ 0 ] , point [ 1 ] , 0 , sumValue ) ; } } } else { summedMapIter . setSample ( c , r , 0 , doubleNovalue ) ; } } pm . worked ( 1 ) ; } pm . done ( ) ; return summedMapWR ; }
Calculates the sum of the values of a specified quantity from every point to the outlet .
16,950
public static double [ ] calcInverseSunVector ( double [ ] sunVector ) { double m = Math . max ( Math . abs ( sunVector [ 0 ] ) , Math . abs ( sunVector [ 1 ] ) ) ; return new double [ ] { - sunVector [ 0 ] / m , - sunVector [ 1 ] / m , - sunVector [ 2 ] / m } ; }
Calculating the inverse of the sun vector .
16,951
public static double [ ] calcNormalSunVector ( double [ ] sunVector ) { double [ ] normalSunVector = new double [ 3 ] ; normalSunVector [ 2 ] = Math . sqrt ( Math . pow ( sunVector [ 0 ] , 2 ) + Math . pow ( sunVector [ 1 ] , 2 ) ) ; normalSunVector [ 0 ] = - sunVector [ 0 ] * sunVector [ 2 ] / normalSunVector [ 2 ] ; normalSunVector [ 1 ] = - sunVector [ 1 ] * sunVector [ 2 ] / normalSunVector [ 2 ] ; return normalSunVector ; }
Calculating the normal to the sun vector .
16,952
public static double scalarProduct ( double [ ] a , double [ ] b ) { double c = 0 ; for ( int i = 0 ; i < a . length ; i ++ ) { c = c + a [ i ] * b [ i ] ; } return c ; }
Compute the dot product .
16,953
public static WritableRaster calculateFactor ( int h , int w , double [ ] sunVector , double [ ] inverseSunVector , double [ ] normalSunVector , WritableRaster demWR , double dx ) { double casx = 1e6 * sunVector [ 0 ] ; double casy = 1e6 * sunVector [ 1 ] ; int f_i = 0 ; int f_j = 0 ; if ( casx <= 0 ) { f_i = 0 ; } else { f_i = w - 1 ; } if ( casy <= 0 ) { f_j = 0 ; } else { f_j = h - 1 ; } WritableRaster sOmbraWR = CoverageUtilities . createWritableRaster ( w , h , null , null , 1.0 ) ; int j = f_j ; for ( int i = 0 ; i < sOmbraWR . getWidth ( ) ; i ++ ) { shadow ( i , j , sOmbraWR , demWR , dx , normalSunVector , inverseSunVector ) ; } int i = f_i ; for ( int k = 0 ; k < sOmbraWR . getHeight ( ) ; k ++ ) { shadow ( i , k , sOmbraWR , demWR , dx , normalSunVector , inverseSunVector ) ; } return sOmbraWR ; }
Evaluate the shadow map calling the shadow method .
16,954
private static WritableRaster shadow ( int i , int j , WritableRaster tmpWR , WritableRaster demWR , double res , double [ ] normalSunVector , double [ ] inverseSunVector ) { int n = 0 ; double zcompare = - Double . MAX_VALUE ; double dx = ( inverseSunVector [ 0 ] * n ) ; double dy = ( inverseSunVector [ 1 ] * n ) ; int nCols = tmpWR . getWidth ( ) ; int nRows = tmpWR . getHeight ( ) ; int idx = ( int ) Math . round ( i + dx ) ; int jdy = ( int ) Math . round ( j + dy ) ; double vectorToOrigin [ ] = new double [ 3 ] ; while ( idx >= 0 && idx <= nCols - 1 && jdy >= 0 && jdy <= nRows - 1 ) { vectorToOrigin [ 0 ] = dx * res ; vectorToOrigin [ 1 ] = dy * res ; int tmpY = ( int ) ( j + dy ) ; if ( tmpY < 0 ) { tmpY = 0 ; } else if ( tmpY > nRows ) { tmpY = nRows - 1 ; } int tmpX = ( int ) ( i + dx ) ; if ( tmpX < 0 ) { tmpX = 0 ; } else if ( tmpY > nCols ) { tmpX = nCols - 1 ; } vectorToOrigin [ 2 ] = demWR . getSampleDouble ( idx , jdy , 0 ) ; double zprojection = scalarProduct ( vectorToOrigin , normalSunVector ) ; if ( ( zprojection < zcompare ) ) { tmpWR . setSample ( idx , jdy , 0 , 0 ) ; } else { zcompare = zprojection ; } n = n + 1 ; dy = ( inverseSunVector [ 1 ] * n ) ; dx = ( inverseSunVector [ 0 ] * n ) ; idx = ( int ) Math . round ( i + dx ) ; jdy = ( int ) Math . round ( j + dy ) ; } return tmpWR ; }
Evaluate the shadow map .
16,955
public static double meanDoublematrixColumn ( double [ ] [ ] matrix , int column ) { double mean ; mean = 0 ; int length = matrix . length ; for ( int i = 0 ; i < length ; i ++ ) { mean += matrix [ i ] [ column ] ; } return mean / length ; }
Return the mean of a column of a matrix .
16,956
public static double varianceDoublematrixColumn ( double [ ] [ ] matrix , int column , double mean ) { double variance ; variance = 0 ; for ( int i = 0 ; i < matrix . length ; i ++ ) { variance += ( matrix [ i ] [ column ] - mean ) * ( matrix [ i ] [ column ] - mean ) ; } return variance / matrix . length ; }
Return the variance of a column of a matrix .
16,957
public static double sumDoublematrixColumns ( int coolIndex , double [ ] [ ] matrixToSum , double [ ] [ ] resultMatrix , int firstRowIndex , int lastRowIndex , IHMProgressMonitor pm ) { double maximum ; maximum = 0 ; if ( matrixToSum . length != resultMatrix . length ) { pm . errorMessage ( msg . message ( "trentoP.error.matrix" ) ) ; throw new ArithmeticException ( msg . message ( "trentoP.error.matrix" ) ) ; } if ( firstRowIndex < 0 || lastRowIndex < firstRowIndex ) { pm . errorMessage ( msg . message ( "trentoP.error.nCol" ) ) ; throw new ArithmeticException ( msg . message ( "trentoP.error.nCol" ) ) ; } for ( int i = 0 ; i < matrixToSum . length ; ++ i ) { resultMatrix [ i ] [ coolIndex ] = 0 ; for ( int j = firstRowIndex ; j <= lastRowIndex ; ++ j ) { resultMatrix [ i ] [ coolIndex ] += matrixToSum [ i ] [ j ] ; } if ( resultMatrix [ i ] [ coolIndex ] >= maximum ) { maximum = resultMatrix [ i ] [ coolIndex ] ; } } return maximum ; }
Sum columns .
16,958
public Long getRelativePosition ( Long position ) { long relativePosition = 0L ; for ( Location location : locations ) { if ( location instanceof RemoteLocation ) { relativePosition += location . getLength ( ) ; } else { if ( position < location . getBeginPosition ( ) || position > location . getEndPosition ( ) ) { relativePosition += location . getLength ( ) ; } else { if ( location . isComplement ( ) ) { relativePosition += ( location . getEndPosition ( ) - position + 1 ) ; } else { relativePosition += ( position - location . getBeginPosition ( ) + 1 ) ; } if ( isComplement ( ) ) { relativePosition = getLength ( ) - relativePosition + 1 ; } return relativePosition ; } } } return null ; }
Returns the sequence position relative to the compound location .
16,959
protected boolean concatOr ( boolean ... statements ) { boolean isTrue = statements [ 0 ] ; for ( int i = 1 ; i < statements . length ; i ++ ) { isTrue = isTrue || statements [ i ] ; } return isTrue ; }
Utility method to concatenate conditions with or .
16,960
protected void checkNull ( Object ... objects ) { for ( Object object : objects ) { if ( object == null ) { throw new ModelsIllegalargumentException ( "Mandatory input argument is missing. Check your syntax..." , this . getClass ( ) . getSimpleName ( ) , pm ) ; } } }
Checks if the passed objects are all ! = null and if one is null throws Exception .
16,961
protected void checkFileExists ( String ... existingFilePath ) { StringBuilder sb = null ; for ( String filePath : existingFilePath ) { File file = new File ( filePath ) ; if ( ! file . exists ( ) ) { if ( sb == null ) { sb = new StringBuilder ( ) ; sb . append ( "The following file doesn't seem to exist: " ) ; } sb . append ( "\n\t" ) . append ( file . getAbsolutePath ( ) ) ; } } if ( sb != null ) throw new ModelsIllegalargumentException ( sb . toString ( ) , this . getClass ( ) . getSimpleName ( ) , pm ) ; }
Checks if passed path strings exist on the filesystem . If not an Exception is thrown .
16,962
protected String checkWorkingFolderInPath ( String filePath ) { if ( filePath . contains ( HMConstants . WORKINGFOLDER ) ) { return null ; } return filePath ; }
Checks if a passed path contains the workingfolder constant . If yes it is set to null .
16,963
public GridCoverage2D getRaster ( String source ) throws Exception { if ( source == null || source . trim ( ) . length ( ) == 0 ) return null ; OmsRasterReader reader = new OmsRasterReader ( ) ; reader . pm = pm ; reader . file = source ; reader . process ( ) ; GridCoverage2D geodata = reader . outRaster ; return geodata ; }
Fast default reading of raster from definition .
16,964
public SimpleFeatureCollection getVector ( String source ) throws Exception { if ( source == null || source . trim ( ) . length ( ) == 0 ) return null ; OmsVectorReader reader = new OmsVectorReader ( ) ; reader . pm = pm ; reader . file = source ; reader . process ( ) ; SimpleFeatureCollection fc = reader . outVector ; return fc ; }
Fast default reading of vector from definition .
16,965
public void dumpRaster ( GridCoverage2D raster , String source ) throws Exception { if ( raster == null || source == null ) return ; OmsRasterWriter writer = new OmsRasterWriter ( ) ; writer . pm = pm ; writer . inRaster = raster ; writer . file = source ; writer . process ( ) ; }
Fast default writing of raster to source .
16,966
public void dumpVector ( SimpleFeatureCollection vector , String source ) throws Exception { if ( vector == null || source == null ) return ; OmsVectorWriter writer = new OmsVectorWriter ( ) ; writer . pm = pm ; writer . file = source ; writer . inVector = vector ; writer . process ( ) ; }
Fast default writing of vector to source .
16,967
public void setParameter ( String key , Object obj ) { if ( key . equals ( "novalue" ) ) { novalue = obj ; } else if ( key . equals ( "matrixtype" ) ) { Integer dmtype = ( Integer ) obj ; matrixType = dmtype . intValue ( ) ; } }
utility to set particular parameters
16,968
private ByteBuffer readHeader ( RandomAccessFile ds ) throws IOException { int first = ds . read ( ) ; ByteBuffer fileHeader = ByteBuffer . allocate ( 1 + first * fileWindow . getRows ( ) + first ) ; ds . seek ( 0 ) ; ds . read ( fileHeader . array ( ) ) ; return fileHeader ; }
Reads the header part of the file into memory
16,969
private long [ ] getRowAddressesFromHeader ( ByteBuffer header ) { byte firstbyte = header . get ( ) ; long [ ] adrows = new long [ fileWindow . getRows ( ) + 1 ] ; if ( firstbyte == 4 ) { for ( int i = 0 ; i <= fileWindow . getRows ( ) ; i ++ ) { adrows [ i ] = header . getInt ( ) ; } } else if ( firstbyte == 8 ) { for ( int i = 0 ; i <= fileWindow . getRows ( ) ; i ++ ) { adrows [ i ] = header . getLong ( ) ; } } else { } return adrows ; }
Extract the row addresses from the header information of the file
16,970
private void getMapRow ( int currentrow , ByteBuffer rowdata , boolean iscompressed ) throws IOException , DataFormatException { if ( iscompressed ) { if ( rasterMapType == - 2 ) { readCompressedFPRowByNumber ( rowdata , currentrow , addressesofrows , cellFile , numberOfBytesPerValue ) ; } else if ( rasterMapType == - 1 ) { readCompressedFPRowByNumber ( rowdata , currentrow , addressesofrows , cellFile , numberOfBytesPerValue ) ; } else if ( rasterMapType > 0 ) { readCompressedIntegerRowByNumber ( rowdata , currentrow , addressesofrows , cellFile ) ; } else { } } else { if ( rasterMapType < 0 ) { readUncompressedFPRowByNumber ( rowdata , currentrow , cellFile , numberOfBytesPerValue ) ; } else if ( rasterMapType > 0 ) { readUncompressedIntegerRowByNumber ( rowdata , currentrow , cellFile ) ; } else { } } return ; }
read a row of the map from the active region
16,971
private void readCompressedFPRowByNumber ( ByteBuffer rowdata , int rn , long [ ] adrows , RandomAccessFile thefile , int typeBytes ) throws DataFormatException , IOException { int offset = ( int ) ( adrows [ rn + 1 ] - adrows [ rn ] ) ; byte [ ] tmp = new byte [ offset - 1 ] ; thefile . seek ( adrows [ rn ] ) ; int firstbyte = ( thefile . read ( ) & 0xff ) ; if ( firstbyte == 49 ) { thefile . read ( tmp , 0 , offset - 1 ) ; Inflater decompresser = new Inflater ( ) ; decompresser . setInput ( tmp , 0 , tmp . length ) ; decompresser . inflate ( rowdata . array ( ) ) ; decompresser . end ( ) ; } else if ( firstbyte == 48 ) { thefile . read ( rowdata . array ( ) , 0 , offset - 1 ) ; } }
read a row of data from a compressed floating point map
16,972
private void readUncompressedFPRowByNumber ( ByteBuffer rowdata , int rn , RandomAccessFile thefile , int typeBytes ) throws IOException , DataFormatException { int datanumber = fileWindow . getCols ( ) * typeBytes ; thefile . seek ( ( rn * datanumber ) ) ; thefile . read ( rowdata . array ( ) ) ; }
read a row of data from an uncompressed floating point map
16,973
private void readCompressedIntegerRowByNumber ( ByteBuffer rowdata , int rn , long [ ] adrows , RandomAccessFile thefile ) throws IOException , DataFormatException { int offset = ( int ) ( adrows [ rn + 1 ] - adrows [ rn ] ) ; thefile . seek ( adrows [ rn ] ) ; int bytespervalue = ( thefile . read ( ) & 0xff ) ; ByteBuffer cell = ByteBuffer . allocate ( bytespervalue ) ; int cellValue = 0 ; byte [ ] tmp = new byte [ offset - 1 ] ; thefile . read ( tmp ) ; ByteBuffer tmpBuffer = ByteBuffer . wrap ( tmp ) ; tmpBuffer . order ( ByteOrder . nativeOrder ( ) ) ; if ( ( offset - 1 ) == ( bytespervalue * fileWindow . getCols ( ) ) ) { for ( int i = 0 ; i < offset - 1 ; i = i + bytespervalue ) { tmpBuffer . get ( cell . array ( ) ) ; if ( bytespervalue == 1 ) { cellValue = ( cell . get ( 0 ) & 0xff ) ; } else if ( bytespervalue == 2 ) { cellValue = cell . getShort ( 0 ) ; } else if ( bytespervalue == 4 ) { cellValue = cell . getInt ( 0 ) ; } rowdata . putInt ( cellValue ) ; } } else { int couples = ( offset - 1 ) / ( 1 + bytespervalue ) ; for ( int i = 0 ; i < couples ; i ++ ) { int count = ( tmpBuffer . get ( ) & 0xff ) ; tmpBuffer . get ( cell . array ( ) ) ; if ( bytespervalue == 1 ) { cellValue = ( cell . get ( 0 ) & 0xff ) ; } else if ( bytespervalue == 2 ) { cellValue = cell . getShort ( 0 ) ; } else if ( bytespervalue == 4 ) { cellValue = cell . getInt ( 0 ) ; } for ( int j = 0 ; j < count ; j ++ ) { rowdata . putInt ( cellValue ) ; } } } }
read a row of data from a compressed integer point map
16,974
private void readUncompressedIntegerRowByNumber ( ByteBuffer rowdata , int rn , RandomAccessFile thefile ) throws IOException , DataFormatException { int cellValue = 0 ; ByteBuffer cell = ByteBuffer . allocate ( rasterMapType ) ; int filerowsize = fileWindow . getCols ( ) * rasterMapType ; thefile . seek ( ( rn * filerowsize ) ) ; ByteBuffer tmpBuffer = ByteBuffer . allocate ( filerowsize ) ; thefile . read ( tmpBuffer . array ( ) ) ; while ( tmpBuffer . hasRemaining ( ) ) { tmpBuffer . get ( cell . array ( ) ) ; if ( rasterMapType == 1 ) { cellValue = ( cell . get ( 0 ) & 0xff ) ; } else if ( rasterMapType == 2 ) { cellValue = cell . getShort ( 0 ) ; } else if ( rasterMapType == 4 ) { cellValue = cell . getInt ( 0 ) ; } rowdata . putInt ( cellValue ) ; } }
read a row of data from an uncompressed integer map
16,975
public Color getColorFor ( double value ) { if ( value <= min ) { return colors [ 0 ] ; } else if ( value >= max ) { return colors [ colors . length - 1 ] ; } else { for ( int i = 1 ; i < colors . length ; i ++ ) { double v1 = values [ i - 1 ] ; double v2 = values [ i ] ; if ( value < v2 ) { double v = ( value - v1 ) / ( v2 - v1 ) ; Color interpolateColor = interpolateColor ( colors [ i - 1 ] , colors [ i ] , ( float ) v ) ; return interpolateColor ; } } return colors [ colors . length - 1 ] ; } }
Get the color of the defined table by its value .
16,976
public static Color interpolateColor ( Color color1 , Color color2 , float fraction ) { float int2Float = 1f / 255f ; fraction = Math . min ( fraction , 1f ) ; fraction = Math . max ( fraction , 0f ) ; float r1 = color1 . getRed ( ) * int2Float ; float g1 = color1 . getGreen ( ) * int2Float ; float b1 = color1 . getBlue ( ) * int2Float ; float a1 = color1 . getAlpha ( ) * int2Float ; float r2 = color2 . getRed ( ) * int2Float ; float g2 = color2 . getGreen ( ) * int2Float ; float b2 = color2 . getBlue ( ) * int2Float ; float a2 = color2 . getAlpha ( ) * int2Float ; float deltaR = r2 - r1 ; float deltaG = g2 - g1 ; float deltaB = b2 - b1 ; float deltaA = a2 - a1 ; float red = r1 + ( deltaR * fraction ) ; float green = g1 + ( deltaG * fraction ) ; float blue = b1 + ( deltaB * fraction ) ; float alpha = a1 + ( deltaA * fraction ) ; red = Math . min ( red , 1f ) ; red = Math . max ( red , 0f ) ; green = Math . min ( green , 1f ) ; green = Math . max ( green , 0f ) ; blue = Math . min ( blue , 1f ) ; blue = Math . max ( blue , 0f ) ; alpha = Math . min ( alpha , 1f ) ; alpha = Math . max ( alpha , 0f ) ; return new Color ( red , green , blue , alpha ) ; }
Interpolate a color at a given fraction between 0 and 1 .
16,977
public void addSeries ( String seriesName , double [ ] x , double [ ] y ) { XYSeries series = new XYSeries ( seriesName ) ; for ( int i = 0 ; i < x . length ; i ++ ) { series . add ( x [ i ] , y [ i ] ) ; } dataset . addSeries ( series ) ; }
Add a new series by name and data .
16,978
public static long insertLasSource ( ASpatialDb db , int srid , int levels , double resolution , double factor , Polygon polygon , String name , double minElev , double maxElev , double minIntens , double maxIntens ) throws Exception { String sql = "INSERT INTO " + TABLENAME + " (" + COLUMN_GEOM + "," + COLUMN_NAME + "," + COLUMN_RESOLUTION + "," + COLUMN_FACTOR + "," + COLUMN_LEVELS + "," + COLUMN_MINZ + "," + COLUMN_MAXZ + "," + COLUMN_MININTENSITY + "," + COLUMN_MAXINTENSITY + ") VALUES (ST_GeomFromText(?, " + srid + "),?,?,?,?,?,?,?,?)" ; return db . execOnConnection ( connection -> { try ( IHMPreparedStatement pStmt = connection . prepareStatement ( sql , Statement . RETURN_GENERATED_KEYS ) ) { pStmt . setString ( 1 , polygon . toText ( ) ) ; pStmt . setString ( 2 , name ) ; pStmt . setDouble ( 3 , resolution ) ; pStmt . setDouble ( 4 , factor ) ; pStmt . setInt ( 5 , levels ) ; pStmt . setDouble ( 6 , minElev ) ; pStmt . setDouble ( 7 , maxElev ) ; pStmt . setDouble ( 8 , minIntens ) ; pStmt . setDouble ( 9 , maxIntens ) ; pStmt . executeUpdate ( ) ; IHMResultSet rs = pStmt . getGeneratedKeys ( ) ; rs . next ( ) ; long generatedId = rs . getLong ( 1 ) ; return generatedId ; } } ) ; }
Insert values in the table
16,979
public static void updateMinMaxIntensity ( ASpatialDb db , long sourceId , double minIntens , double maxIntens ) throws Exception { String sql = "UPDATE " + TABLENAME + " SET " + COLUMN_MININTENSITY + "=" + minIntens + ", " + COLUMN_MAXINTENSITY + "=" + maxIntens + " WHERE " + COLUMN_ID + "=" + sourceId ; db . executeInsertUpdateDeleteSql ( sql ) ; }
Update the intensity values .
16,980
public static List < LasSource > getLasSources ( ASpatialDb db ) throws Exception { List < LasSource > sources = new ArrayList < > ( ) ; String sql = "SELECT " + COLUMN_GEOM + "," + COLUMN_ID + "," + COLUMN_NAME + "," + COLUMN_RESOLUTION + "," + COLUMN_FACTOR + "," + COLUMN_LEVELS + "," + COLUMN_MINZ + "," + COLUMN_MAXZ + "," + COLUMN_MININTENSITY + "," + COLUMN_MAXINTENSITY + " FROM " + TABLENAME ; return db . execOnConnection ( connection -> { IGeometryParser gp = db . getType ( ) . getGeometryParser ( ) ; try ( IHMStatement stmt = connection . createStatement ( ) ; IHMResultSet rs = stmt . executeQuery ( sql ) ) { while ( rs . next ( ) ) { LasSource lasSource = new LasSource ( ) ; int i = 1 ; Geometry geometry = gp . fromResultSet ( rs , i ++ ) ; if ( geometry instanceof Polygon ) { Polygon polygon = ( Polygon ) geometry ; lasSource . polygon = polygon ; lasSource . id = rs . getLong ( i ++ ) ; lasSource . name = rs . getString ( i ++ ) ; lasSource . resolution = rs . getDouble ( i ++ ) ; lasSource . levelFactor = rs . getDouble ( i ++ ) ; lasSource . levels = rs . getInt ( i ++ ) ; lasSource . minElev = rs . getDouble ( i ++ ) ; lasSource . maxElev = rs . getDouble ( i ++ ) ; lasSource . minIntens = rs . getDouble ( i ++ ) ; lasSource . maxIntens = rs . getDouble ( i ++ ) ; sources . add ( lasSource ) ; } } return sources ; } } ) ; }
Query the las sources table .
16,981
public static boolean isLasDatabase ( ASpatialDb db ) throws Exception { if ( ! db . hasTable ( TABLENAME ) || ! db . hasTable ( LasCellsTable . TABLENAME ) ) { return false ; } return true ; }
Checks if the db is a las database readable by HortonMachine .
16,982
protected Point limitPointToWorldWindow ( Point point ) { Rectangle viewport = this . getWwd ( ) . getView ( ) . getViewport ( ) ; int x = point . x ; if ( x < viewport . x ) x = viewport . x ; if ( x > viewport . x + viewport . width ) x = viewport . x + viewport . width ; int y = point . y ; if ( y < viewport . y ) y = viewport . y ; if ( y > viewport . y + viewport . height ) y = viewport . y + viewport . height ; return new Point ( x , y ) ; }
Limits the specified point s x and y coordinates to the World Window s viewport and returns a new point with the limited coordinates . For example if the World Window s viewport rectangle is x = 0 y = 0 width = 100 height = 100 and the point s coordinates are x = 50 y = 200 this returns a new point with coordinates x = 50 y = 100 . If the specified point is already inside the World Window s viewport this returns a new point with the same x and y coordinates as the specified point .
16,983
public static void show ( BufferedImage image , String title , boolean modal ) { JDialog f = new JDialog ( ) ; f . add ( new ImageViewer ( image ) , BorderLayout . CENTER ) ; f . setTitle ( title ) ; f . setIconImage ( ImageCache . getInstance ( ) . getBufferedImage ( ImageCache . HORTONMACHINE_FRAME_ICON ) ) ; f . setModal ( modal ) ; f . pack ( ) ; int h = image . getHeight ( ) ; int w = image . getWidth ( ) ; if ( h > w ) { f . setSize ( new Dimension ( 600 , 800 ) ) ; } else { f . setSize ( new Dimension ( 800 , 600 ) ) ; } f . setLocationRelativeTo ( null ) ; f . setVisible ( true ) ; f . setDefaultCloseOperation ( JDialog . DISPOSE_ON_CLOSE ) ; f . getRootPane ( ) . registerKeyboardAction ( e -> { f . dispose ( ) ; } , KeyStroke . getKeyStroke ( KeyEvent . VK_ESCAPE , 0 ) , JComponent . WHEN_IN_FOCUSED_WINDOW ) ; }
Opens a JDialog with the image viewer in it .
16,984
public static List < Image > getImagesList ( IHMConnection connection ) throws Exception { List < Image > images = new ArrayList < Image > ( ) ; String sql = "select " + ImageTableFields . COLUMN_ID . getFieldName ( ) + "," + ImageTableFields . COLUMN_LON . getFieldName ( ) + "," + ImageTableFields . COLUMN_LAT . getFieldName ( ) + "," + ImageTableFields . COLUMN_ALTIM . getFieldName ( ) + "," + ImageTableFields . COLUMN_TS . getFieldName ( ) + "," + ImageTableFields . COLUMN_AZIM . getFieldName ( ) + "," + ImageTableFields . COLUMN_TEXT . getFieldName ( ) + "," + ImageTableFields . COLUMN_NOTE_ID . getFieldName ( ) + "," + ImageTableFields . COLUMN_IMAGEDATA_ID . getFieldName ( ) + " from " + TABLE_IMAGES ; try ( IHMStatement statement = connection . createStatement ( ) ; IHMResultSet rs = statement . executeQuery ( sql ) ; ) { statement . setQueryTimeout ( 30 ) ; while ( rs . next ( ) ) { long id = rs . getLong ( 1 ) ; double lon = rs . getDouble ( 2 ) ; double lat = rs . getDouble ( 3 ) ; double altim = rs . getDouble ( 4 ) ; long ts = rs . getLong ( 5 ) ; double azim = rs . getDouble ( 6 ) ; String text = rs . getString ( 7 ) ; long noteId = rs . getLong ( 8 ) ; long imageDataId = rs . getLong ( 9 ) ; Image image = new Image ( id , text , lon , lat , altim , azim , imageDataId , noteId , ts ) ; images . add ( image ) ; } } return images ; }
Get the list of Images from the db .
16,985
public static byte [ ] getImageData ( IHMConnection connection , long imageDataId ) throws Exception { String sql = "select " + ImageDataTableFields . COLUMN_IMAGE . getFieldName ( ) + " from " + TABLE_IMAGE_DATA + " where " + ImageDataTableFields . COLUMN_ID . getFieldName ( ) + " = " + imageDataId ; try ( IHMStatement statement = connection . createStatement ( ) ; IHMResultSet rs = statement . executeQuery ( sql ) ; ) { statement . setQueryTimeout ( 30 ) ; if ( rs . next ( ) ) { byte [ ] bytes = rs . getBytes ( 1 ) ; return bytes ; } } return null ; }
Get Image data from data id .
16,986
public static void convert ( SquareMatrix sm ) { for ( int r = 0 ; r < sm . nRows ; ++ r ) { for ( int c = 0 ; c < sm . nCols ; ++ c ) { sm . values [ r ] [ c ] = ( r == c ) ? 1 : 0 ; } } }
Convert a square matrix into an identity matrix .
16,987
public static SimpleFeatureCollection createFeatureCollection ( SimpleFeature ... features ) { DefaultFeatureCollection fcollection = new DefaultFeatureCollection ( ) ; for ( SimpleFeature feature : features ) { fcollection . add ( feature ) ; } return fcollection ; }
Create a featurecollection from a vector of features
16,988
public static Object getAttributeCaseChecked ( SimpleFeature feature , String field ) { Object attribute = feature . getAttribute ( field ) ; if ( attribute == null ) { attribute = feature . getAttribute ( field . toLowerCase ( ) ) ; if ( attribute != null ) return attribute ; attribute = feature . getAttribute ( field . toUpperCase ( ) ) ; if ( attribute != null ) return attribute ; SimpleFeatureType featureType = feature . getFeatureType ( ) ; field = findAttributeName ( featureType , field ) ; if ( field != null ) { return feature . getAttribute ( field ) ; } } return attribute ; }
Getter for attributes of a feature .
16,989
public static String findAttributeName ( SimpleFeatureType featureType , String field ) { List < AttributeDescriptor > attributeDescriptors = featureType . getAttributeDescriptors ( ) ; for ( AttributeDescriptor attributeDescriptor : attributeDescriptors ) { String name = attributeDescriptor . getLocalName ( ) ; if ( name . toLowerCase ( ) . equals ( field . toLowerCase ( ) ) ) { return name ; } } return null ; }
Find the name of an attribute case insensitive .
16,990
public static QueryResult featureCollection2QueryResult ( SimpleFeatureCollection featureCollection ) { List < AttributeDescriptor > attributeDescriptors = featureCollection . getSchema ( ) . getAttributeDescriptors ( ) ; QueryResult queryResult = new QueryResult ( ) ; int count = 0 ; for ( AttributeDescriptor attributeDescriptor : attributeDescriptors ) { if ( ! ( attributeDescriptor instanceof GeometryDescriptor ) ) { String fieldName = attributeDescriptor . getLocalName ( ) ; String type = attributeDescriptor . getType ( ) . getBinding ( ) . toString ( ) ; queryResult . names . add ( fieldName ) ; queryResult . types . add ( type ) ; count ++ ; } } SimpleFeatureIterator featureIterator = featureCollection . features ( ) ; while ( featureIterator . hasNext ( ) ) { SimpleFeature f = featureIterator . next ( ) ; Geometry geometry = ( Geometry ) f . getDefaultGeometry ( ) ; queryResult . geometries . add ( geometry ) ; Object [ ] dataRow = new Object [ count ] ; int index = 0 ; for ( AttributeDescriptor attributeDescriptor : attributeDescriptors ) { if ( ! ( attributeDescriptor instanceof GeometryDescriptor ) ) { String fieldName = attributeDescriptor . getLocalName ( ) ; Object attribute = f . getAttribute ( fieldName ) ; if ( attribute == null ) { attribute = "" ; } dataRow [ index ++ ] = attribute ; } } queryResult . data . add ( dataRow ) ; } return queryResult ; }
Utility to convert a featurecollection to a queryresult format .
16,991
private static URI createUriFromName ( String name ) { if ( name == null ) { throw new NullPointerException ( "name" ) ; } try { return new URI ( name ) ; } catch ( final URISyntaxException e ) { throw new IllegalArgumentException ( "Invalid name: " + name , e ) ; } }
Creates a URI from a source file name .
16,992
public static void addNote ( Connection connection , long id , double lon , double lat , double altim , long timestamp , String text , String form ) throws Exception { String insertSQL = "INSERT INTO " + TableDescriptions . TABLE_NOTES + "(" + TableDescriptions . NotesTableFields . COLUMN_ID . getFieldName ( ) + ", " + TableDescriptions . NotesTableFields . COLUMN_LAT . getFieldName ( ) + ", " + TableDescriptions . NotesTableFields . COLUMN_LON . getFieldName ( ) + ", " + TableDescriptions . NotesTableFields . COLUMN_ALTIM . getFieldName ( ) + ", " + TableDescriptions . NotesTableFields . COLUMN_TS . getFieldName ( ) + ", " + TableDescriptions . NotesTableFields . COLUMN_TEXT . getFieldName ( ) + ", " + TableDescriptions . NotesTableFields . COLUMN_FORM . getFieldName ( ) + ", " + TableDescriptions . NotesTableFields . COLUMN_ISDIRTY . getFieldName ( ) + ") VALUES" + "(?,?,?,?,?,?,?,?)" ; try ( PreparedStatement writeStatement = connection . prepareStatement ( insertSQL ) ) { writeStatement . setLong ( 1 , id ) ; writeStatement . setDouble ( 2 , lat ) ; writeStatement . setDouble ( 3 , lon ) ; writeStatement . setDouble ( 4 , altim ) ; writeStatement . setLong ( 5 , timestamp ) ; writeStatement . setString ( 6 , text ) ; writeStatement . setString ( 7 , form ) ; writeStatement . setInt ( 8 , 1 ) ; writeStatement . executeUpdate ( ) ; } }
Add a new note to the database .
16,993
public static List < Note > getNotesList ( IHMConnection connection , float [ ] nswe ) throws Exception { String query = "SELECT " + NotesTableFields . COLUMN_ID . getFieldName ( ) + ", " + NotesTableFields . COLUMN_LON . getFieldName ( ) + ", " + NotesTableFields . COLUMN_LAT . getFieldName ( ) + ", " + NotesTableFields . COLUMN_ALTIM . getFieldName ( ) + ", " + NotesTableFields . COLUMN_TEXT . getFieldName ( ) + ", " + NotesTableFields . COLUMN_TS . getFieldName ( ) + ", " + NotesTableFields . COLUMN_DESCRIPTION . getFieldName ( ) + " FROM " + TABLE_NOTES ; if ( nswe != null ) { query = query + " WHERE (lon BETWEEN XXX AND XXX) AND (lat BETWEEN XXX AND XXX)" ; query = query . replaceFirst ( "XXX" , String . valueOf ( nswe [ 2 ] ) ) ; query = query . replaceFirst ( "XXX" , String . valueOf ( nswe [ 3 ] ) ) ; query = query . replaceFirst ( "XXX" , String . valueOf ( nswe [ 1 ] ) ) ; query = query . replaceFirst ( "XXX" , String . valueOf ( nswe [ 0 ] ) ) ; } List < Note > notes = new ArrayList < > ( ) ; try ( IHMStatement statement = connection . createStatement ( ) ; IHMResultSet rs = statement . executeQuery ( query ) ; ) { statement . setQueryTimeout ( 30 ) ; while ( rs . next ( ) ) { Note note = new Note ( ) ; note . id = rs . getLong ( 1 ) ; note . lon = rs . getDouble ( 2 ) ; note . lat = rs . getDouble ( 3 ) ; note . altim = rs . getDouble ( 4 ) ; note . simpleText = rs . getString ( 5 ) ; note . timeStamp = rs . getLong ( 6 ) ; note . description = rs . getString ( 7 ) ; notes . add ( note ) ; } } return notes ; }
Get the collected notes from the database inside a given bound .
16,994
private boolean isAtLeastOneAssignable ( String main , Class < ? > ... classes ) { for ( Class < ? > clazz : classes ) { if ( clazz . getCanonicalName ( ) . equals ( main ) ) { return true ; } } return false ; }
Checks if one class is assignable from at least one of the others .
16,995
public void sort ( double [ ] values , double [ ] valuesToFollow ) { this . valuesToSortDouble = values ; this . valuesToFollowDouble = valuesToFollow ; number = values . length ; monitor . beginTask ( "Sorting..." , - 1 ) ; monitor . worked ( 1 ) ; quicksort ( 0 , number - 1 ) ; monitor . done ( ) ; }
Sorts an array of double values and moves with the sort a second array .
16,996
public void sort ( float [ ] values , float [ ] valuesToFollow ) { this . valuesToSortFloat = values ; this . valuesToFollowFloat = valuesToFollow ; number = values . length ; monitor . beginTask ( "Sorting..." , - 1 ) ; monitor . worked ( 1 ) ; quicksortFloat ( 0 , number - 1 ) ; monitor . done ( ) ; }
Sorts an array of float values and moves with the sort a second array .
16,997
public float nextCentral ( ) { float sum = 0.0f ; for ( int j = 0 ; j < 12 ; ++ j ) sum += gen . nextFloat ( ) ; return stddev * ( sum - 6 ) + mean ; }
Compute the next random value using the Central Limit Theorem which states that the averages of sets of uniformly - distributed random values are normally distributed .
16,998
public float nextPolar ( ) { if ( haveNextPolar ) { haveNextPolar = false ; return nextPolar ; } float u1 , u2 , r ; do { u1 = 2 * gen . nextFloat ( ) - 1 ; u2 = 2 * gen . nextFloat ( ) - 1 ; r = u1 * u1 + u2 * u2 ; } while ( r >= 1 ) ; float factor = ( float ) ( stddev * Math . sqrt ( - 2 * Math . log ( r ) / r ) ) ; float v1 = factor * u1 + mean ; float v2 = factor * u2 + mean ; nextPolar = v1 ; haveNextPolar = true ; return v2 ; }
Compute the next randomn value using the polar algorithm . Requires two uniformly - distributed random values in [ - 1 + 1 ) . Actually computes two random values and saves the second one for the next invokation .
16,999
public float nextRatio ( ) { float u , v , x , xx ; do { while ( ( u = gen . nextFloat ( ) ) == 0 ) ; v = gen . nextFloat ( ) ; float y = C1 * ( v - 0.5f ) ; x = y / u ; xx = x * x ; } while ( ( xx > 5f - C2 * u ) && ( ( xx >= C3 / u + 1.4f ) || ( xx > ( float ) ( - 4 * Math . log ( u ) ) ) ) ) ; return stddev * x + mean ; }
Compute the next random value using the ratio algorithm . Requires two uniformly - distributed random values in [ 0 1 ) .