idx int64 0 165k | question stringlengths 73 4.15k | target stringlengths 5 918 | len_question int64 21 890 | len_target int64 3 255 |
|---|---|---|---|---|
144,700 | public static void close ( Statement stmt ) { try { Connection conn = stmt . getConnection ( ) ; try { if ( ! stmt . isClosed ( ) ) stmt . close ( ) ; } catch ( UnsupportedOperationException e ) { // not all JDBC drivers implement the isClosed() method. // ugly, but probably the only way to get around this. // http://stackoverflow.com/questions/12845385/duke-fast-deduplication-java-lang-unsupportedoperationexception-operation-not stmt . close ( ) ; } if ( conn != null && ! conn . isClosed ( ) ) conn . close ( ) ; } catch ( SQLException e ) { throw new DukeException ( e ) ; } } | Closes the JDBC statement and its associated connection . | 169 | 11 |
144,701 | public static boolean validate ( Statement stmt ) { try { Connection conn = stmt . getConnection ( ) ; if ( conn == null ) return false ; if ( ! conn . isClosed ( ) && conn . isValid ( 10 ) ) return true ; stmt . close ( ) ; conn . close ( ) ; } catch ( SQLException e ) { // this may well fail. that doesn't matter. we're just making an // attempt to clean up, and if we can't, that's just too bad. } return false ; } | Verifies that the connection is still alive . Returns true if it is false if it is not . If the connection is broken we try closing everything too so that the caller need only open a new connection . | 116 | 41 |
144,702 | public static int queryForInt ( Statement stmt , String sql , int nullvalue ) { try { ResultSet rs = stmt . executeQuery ( sql ) ; try { if ( ! rs . next ( ) ) return nullvalue ; return rs . getInt ( 1 ) ; } finally { rs . close ( ) ; } } catch ( SQLException e ) { throw new DukeException ( e ) ; } } | Runs a query that returns a single int . | 88 | 10 |
144,703 | public static boolean queryHasResult ( Statement stmt , String sql ) { try { ResultSet rs = stmt . executeQuery ( sql ) ; try { return rs . next ( ) ; } finally { rs . close ( ) ; } } catch ( SQLException e ) { throw new DukeException ( e ) ; } } | Returns true if the query result has at least one row . | 69 | 12 |
144,704 | public static String replaceAnyOf ( String value , String chars , char replacement ) { char [ ] tmp = new char [ value . length ( ) ] ; int pos = 0 ; for ( int ix = 0 ; ix < tmp . length ; ix ++ ) { char ch = value . charAt ( ix ) ; if ( chars . indexOf ( ch ) != - 1 ) tmp [ pos ++ ] = replacement ; else tmp [ pos ++ ] = ch ; } return new String ( tmp , 0 , tmp . length ) ; } | Replaces all characters in the second parameter found in the first parameter with the final character . | 114 | 18 |
144,705 | public static String normalizeWS ( String value ) { char [ ] tmp = new char [ value . length ( ) ] ; int pos = 0 ; boolean prevws = false ; for ( int ix = 0 ; ix < tmp . length ; ix ++ ) { char ch = value . charAt ( ix ) ; if ( ch != ' ' && ch != ' ' && ch != ' ' && ch != ' ' ) { if ( prevws && pos != 0 ) tmp [ pos ++ ] = ' ' ; tmp [ pos ++ ] = ch ; prevws = false ; } else prevws = true ; } return new String ( tmp , 0 , pos ) ; } | Removes trailing and leading whitespace and also reduces each sequence of internal whitespace to a single space . | 143 | 21 |
144,706 | public static String get ( Properties props , String name , String defval ) { String value = props . getProperty ( name ) ; if ( value == null ) value = defval ; return value ; } | Returns the value of an optional property if the property is set . If it is not set defval is returned . | 42 | 23 |
144,707 | public Collection < DataSource > getDataSources ( int groupno ) { if ( groupno == 1 ) return group1 ; else if ( groupno == 2 ) return group2 ; else throw new DukeConfigException ( "Invalid group number: " + groupno ) ; } | Returns the data sources belonging to a particular group of data sources . Data sources are grouped in record linkage mode but not in deduplication mode so only use this method in record linkage mode . | 57 | 39 |
144,708 | public void addDataSource ( int groupno , DataSource datasource ) { // the loader takes care of validation if ( groupno == 0 ) datasources . add ( datasource ) ; else if ( groupno == 1 ) group1 . add ( datasource ) ; else if ( groupno == 2 ) group2 . add ( datasource ) ; } | Adds a data source to the configuration . If in deduplication mode groupno == 0 otherwise it gives the number of the group to which the data source belongs . | 74 | 34 |
144,709 | public double compare ( String v1 , String v2 ) { // FIXME: it should be possible here to say that, actually, we // didn't learn anything from comparing these two values, so that // probability is set to 0.5. if ( comparator == null ) return 0.5 ; // we ignore properties with no comparator // first, we call the comparator, to get a measure of how similar // these two values are. note that this is not the same as what we // are going to return, which is a probability. double sim = comparator . compare ( v1 , v2 ) ; // we have been configured with a high probability (for equal // values) and a low probability (for different values). given // sim, which is a measure of the similarity somewhere in between // equal and different, we now compute our estimate of the // probability. // if sim = 1.0, we return high. if sim = 0.0, we return low. for // values in between we need to compute a little. the obvious // formula to use would be (sim * (high - low)) + low, which // spreads the values out equally spaced between high and low. // however, if the similarity is higher than 0.5 we don't want to // consider this negative evidence, and so there's a threshold // there. also, users felt Duke was too eager to merge records, // and wanted probabilities to fall off faster with lower // probabilities, and so we square sim in order to achieve this. if ( sim >= 0.5 ) return ( ( high - 0.5 ) * ( sim * sim ) ) + 0.5 ; else return low ; } | Returns the probability that the records v1 and v2 came from represent the same entity based on high and low probability settings etc . | 351 | 26 |
144,710 | public SparqlResult runQuery ( String endpoint , String query ) { return SparqlClient . execute ( endpoint , query , username , password ) ; } | An extension point so we can control how the query gets executed . This exists for testing purposes not because we believe it will actually be used for real . | 33 | 30 |
144,711 | private void merge ( Integer cid1 , Integer cid2 ) { Collection < String > klass1 = classix . get ( cid1 ) ; Collection < String > klass2 = classix . get ( cid2 ) ; // if klass1 is the smaller, swap the two if ( klass1 . size ( ) < klass2 . size ( ) ) { Collection < String > tmp = klass2 ; klass2 = klass1 ; klass1 = tmp ; Integer itmp = cid2 ; cid2 = cid1 ; cid1 = itmp ; } // now perform the actual merge for ( String id : klass2 ) { klass1 . add ( id ) ; recordix . put ( id , cid1 ) ; } // delete the smaller class, and we're done classix . remove ( cid2 ) ; } | Merges the two classes into a single class . The smaller class is removed while the largest class is kept . | 189 | 22 |
144,712 | private void bumpScores ( Map < Long , Score > candidates , List < Bucket > buckets , int ix ) { for ( ; ix < buckets . size ( ) ; ix ++ ) { Bucket b = buckets . get ( ix ) ; if ( b . nextfree > CUTOFF_FACTOR_2 * candidates . size ( ) ) return ; double score = b . getScore ( ) ; for ( Score s : candidates . values ( ) ) if ( b . contains ( s . id ) ) s . score += score ; } } | Goes through the buckets from ix and out checking for each candidate if it s in one of the buckets and if so increasing its score accordingly . No new candidates are added . | 118 | 36 |
144,713 | private int collectCandidates ( Map < Long , Score > candidates , List < Bucket > buckets , int threshold ) { int ix ; for ( ix = 0 ; ix < threshold && candidates . size ( ) < ( CUTOFF_FACTOR_1 * max_search_hits ) ; ix ++ ) { Bucket b = buckets . get ( ix ) ; long [ ] ids = b . records ; double score = b . getScore ( ) ; for ( int ix2 = 0 ; ix2 < b . nextfree ; ix2 ++ ) { Score s = candidates . get ( ids [ ix2 ] ) ; if ( s == null ) { s = new Score ( ids [ ix2 ] ) ; candidates . put ( ids [ ix2 ] , s ) ; } s . score += score ; } if ( DEBUG ) System . out . println ( "Bucket " + b . nextfree + " -> " + candidates . size ( ) ) ; } return ix ; } | Goes through the first buckets picking out candidate records and tallying up their scores . | 222 | 17 |
144,714 | private List < Bucket > lookup ( Record record ) { List < Bucket > buckets = new ArrayList ( ) ; for ( Property p : config . getLookupProperties ( ) ) { String propname = p . getName ( ) ; Collection < String > values = record . getValues ( propname ) ; if ( values == null ) continue ; for ( String value : values ) { String [ ] tokens = StringUtils . split ( value ) ; for ( int ix = 0 ; ix < tokens . length ; ix ++ ) { Bucket b = store . lookupToken ( propname , tokens [ ix ] ) ; if ( b == null || b . records == null ) continue ; long [ ] ids = b . records ; if ( DEBUG ) System . out . println ( propname + ", " + tokens [ ix ] + ": " + b . nextfree + " (" + b . getScore ( ) + ")" ) ; buckets . add ( b ) ; } } } return buckets ; } | Tokenizes lookup fields and returns all matching buckets in the index . | 216 | 13 |
144,715 | public void spawnThread ( DukeController controller , int check_interval ) { this . controller = controller ; timer = mgr . schedule ( this , 0 , check_interval * 1000 ) ; // convert to ms } | Starts a background thread which calls the controller every check_interval milliseconds . Returns immediately leaving the background thread running . | 46 | 24 |
144,716 | public String [ ] init ( String [ ] argv , int min , int max , Collection < CommandLineParser . Option > options ) throws IOException , SAXException { // parse command line parser = new CommandLineParser ( ) ; parser . setMinimumArguments ( min ) ; parser . setMaximumArguments ( max ) ; parser . registerOption ( new CommandLineParser . BooleanOption ( "reindex" , ' ' ) ) ; if ( options != null ) for ( CommandLineParser . Option option : options ) parser . registerOption ( option ) ; try { argv = parser . parse ( argv ) ; } catch ( CommandLineParser . CommandLineParserException e ) { System . err . println ( "ERROR: " + e . getMessage ( ) ) ; usage ( ) ; System . exit ( 1 ) ; } // do we need to reindex? boolean reindex = parser . getOptionState ( "reindex" ) ; // load configuration config = ConfigLoader . load ( argv [ 0 ] ) ; database = config . getDatabase ( reindex ) ; // overwrite iff reindex if ( database . isInMemory ( ) ) reindex = true ; // no other way to do it in this case // reindex, if requested if ( reindex ) reindex ( config , database ) ; return argv ; } | These exact lines are shared between three different tools so they have been moved here to reduce code duplication . | 282 | 20 |
144,717 | public static File createTempDirectory ( String prefix ) { File temp = null ; try { temp = File . createTempFile ( prefix != null ? prefix : "temp" , Long . toString ( System . nanoTime ( ) ) ) ; if ( ! ( temp . delete ( ) ) ) { throw new IOException ( "Could not delete temp file: " + temp . getAbsolutePath ( ) ) ; } if ( ! ( temp . mkdir ( ) ) ) { throw new IOException ( "Could not create temp directory: " + temp . getAbsolutePath ( ) ) ; } } catch ( IOException e ) { throw new DukeException ( "Unable to create temporary directory with prefix " + prefix , e ) ; } return temp ; } | Creates a temporary folder using the given prefix to generate its name . | 159 | 14 |
144,718 | public static Configuration loadFromString ( String config ) throws IOException , SAXException { ConfigurationImpl cfg = new ConfigurationImpl ( ) ; XMLReader parser = XMLReaderFactory . createXMLReader ( ) ; parser . setContentHandler ( new ConfigHandler ( cfg , null ) ) ; Reader reader = new StringReader ( config ) ; parser . parse ( new InputSource ( reader ) ) ; return cfg ; } | Loads the configuration XML from the given string . | 88 | 10 |
144,719 | public void endRecord_ ( ) { // this is where we actually update the link database. basically, // all we need to do is to retract those links which weren't seen // this time around, and that can be done via assertLink, since it // can override existing links. // get all the existing links Collection < Link > oldlinks = linkdb . getAllLinksFor ( getIdentity ( current ) ) ; // build a hashmap so we can look up corresponding old links from // new links if ( oldlinks != null ) { Map < String , Link > oldmap = new HashMap ( oldlinks . size ( ) ) ; for ( Link l : oldlinks ) oldmap . put ( makeKey ( l ) , l ) ; // removing all the links we found this time around from the set of // old links. any links remaining after this will be stale, and need // to be retracted for ( Link newl : new ArrayList < Link > ( curlinks ) ) { String key = makeKey ( newl ) ; Link oldl = oldmap . get ( key ) ; if ( oldl == null ) continue ; if ( oldl . overrides ( newl ) ) // previous information overrides this link, so ignore curlinks . remove ( newl ) ; else if ( sameAs ( oldl , newl ) ) { // there's no new information here, so just ignore this curlinks . remove ( newl ) ; oldmap . remove ( key ) ; // we don't want to retract the old one } else // the link is out of date, but will be overwritten, so remove oldmap . remove ( key ) ; } // all the inferred links left in oldmap are now old links we // didn't find on this pass. there is no longer any evidence // supporting them, and so we can retract them. for ( Link oldl : oldmap . values ( ) ) if ( oldl . getStatus ( ) == LinkStatus . INFERRED ) { oldl . retract ( ) ; // changes to retracted, updates timestamp curlinks . add ( oldl ) ; } } // okay, now we write it all to the database for ( Link l : curlinks ) linkdb . assertLink ( l ) ; } | this method is called from the event methods | 472 | 8 |
144,720 | public void write ( Configuration config ) throws IOException { pp . startDocument ( ) ; pp . startElement ( "duke" , null ) ; // FIXME: here we should write the objects, but that's not // possible with the current API. we don't need that for the // genetic algorithm at the moment, but it would be useful. pp . startElement ( "schema" , null ) ; writeElement ( "threshold" , "" + config . getThreshold ( ) ) ; if ( config . getMaybeThreshold ( ) != 0.0 ) writeElement ( "maybe-threshold" , "" + config . getMaybeThreshold ( ) ) ; for ( Property p : config . getProperties ( ) ) writeProperty ( p ) ; pp . endElement ( "schema" ) ; String dbclass = config . getDatabase ( false ) . getClass ( ) . getName ( ) ; AttributeListImpl atts = new AttributeListImpl ( ) ; atts . addAttribute ( "class" , "CDATA" , dbclass ) ; pp . startElement ( "database" , atts ) ; pp . endElement ( "database" ) ; if ( config . isDeduplicationMode ( ) ) for ( DataSource src : config . getDataSources ( ) ) writeDataSource ( src ) ; else { pp . startElement ( "group" , null ) ; for ( DataSource src : config . getDataSources ( 1 ) ) writeDataSource ( src ) ; pp . endElement ( "group" ) ; pp . startElement ( "group" , null ) ; for ( DataSource src : config . getDataSources ( 2 ) ) writeDataSource ( src ) ; pp . endElement ( "group" ) ; } pp . endElement ( "duke" ) ; pp . endDocument ( ) ; } | Writes the given configuration to the given file . | 395 | 10 |
144,721 | public static void parse ( Reader src , StatementHandler handler ) throws IOException { new NTriplesParser ( src , handler ) . parse ( ) ; } | Reads the NTriples file from the reader pushing statements into the handler . | 32 | 16 |
144,722 | public static int distance ( String s1 , String s2 ) { if ( s1 . length ( ) == 0 ) return s2 . length ( ) ; if ( s2 . length ( ) == 0 ) return s1 . length ( ) ; int s1len = s1 . length ( ) ; // we use a flat array for better performance. we address it by // s1ix + s1len * s2ix. this modification improves performance // by about 30%, which is definitely worth the extra complexity. int [ ] matrix = new int [ ( s1len + 1 ) * ( s2 . length ( ) + 1 ) ] ; for ( int col = 0 ; col <= s2 . length ( ) ; col ++ ) matrix [ col * s1len ] = col ; for ( int row = 0 ; row <= s1len ; row ++ ) matrix [ row ] = row ; for ( int ix1 = 0 ; ix1 < s1len ; ix1 ++ ) { char ch1 = s1 . charAt ( ix1 ) ; for ( int ix2 = 0 ; ix2 < s2 . length ( ) ; ix2 ++ ) { int cost ; if ( ch1 == s2 . charAt ( ix2 ) ) cost = 0 ; else cost = 1 ; int left = matrix [ ix1 + ( ( ix2 + 1 ) * s1len ) ] + 1 ; int above = matrix [ ix1 + 1 + ( ix2 * s1len ) ] + 1 ; int aboveleft = matrix [ ix1 + ( ix2 * s1len ) ] + cost ; matrix [ ix1 + 1 + ( ( ix2 + 1 ) * s1len ) ] = Math . min ( left , Math . min ( above , aboveleft ) ) ; } } // for (int ix1 = 0; ix1 <= s1len; ix1++) { // for (int ix2 = 0; ix2 <= s2.length(); ix2++) { // System.out.print(matrix[ix1 + (ix2 * s1len)] + " "); // } // System.out.println(); // } return matrix [ s1len + ( s2 . length ( ) * s1len ) ] ; } | This is the original naive implementation using the Wagner & Fischer algorithm from 1974 . It uses a flattened matrix for speed but still computes the entire matrix . | 501 | 30 |
144,723 | public static int compactDistance ( String s1 , String s2 ) { if ( s1 . length ( ) == 0 ) return s2 . length ( ) ; if ( s2 . length ( ) == 0 ) return s1 . length ( ) ; // the maximum edit distance there is any point in reporting. int maxdist = Math . min ( s1 . length ( ) , s2 . length ( ) ) / 2 ; // we allocate just one column instead of the entire matrix, in // order to save space. this also enables us to implement the // algorithm somewhat faster. the first cell is always the // virtual first row. int s1len = s1 . length ( ) ; int [ ] column = new int [ s1len + 1 ] ; // first we need to fill in the initial column. we use a separate // loop for this, because in this case our basis for comparison is // not the previous column, but a virtual first column. int ix2 = 0 ; char ch2 = s2 . charAt ( ix2 ) ; column [ 0 ] = 1 ; // virtual first row for ( int ix1 = 1 ; ix1 <= s1len ; ix1 ++ ) { int cost = s1 . charAt ( ix1 - 1 ) == ch2 ? 0 : 1 ; // Lowest of three: above (column[ix1 - 1]), aboveleft: ix1 - 1, // left: ix1. Latter cannot possibly be lowest, so is // ignored. column [ ix1 ] = Math . min ( column [ ix1 - 1 ] , ix1 - 1 ) + cost ; } // okay, now we have an initialized first column, and we can // compute the rest of the matrix. int above = 0 ; for ( ix2 = 1 ; ix2 < s2 . length ( ) ; ix2 ++ ) { ch2 = s2 . charAt ( ix2 ) ; above = ix2 + 1 ; // virtual first row int smallest = s1len * 2 ; // used to implement cutoff for ( int ix1 = 1 ; ix1 <= s1len ; ix1 ++ ) { int cost = s1 . charAt ( ix1 - 1 ) == ch2 ? 0 : 1 ; // above: above // aboveleft: column[ix1 - 1] // left: column[ix1] int value = Math . min ( Math . min ( above , column [ ix1 - 1 ] ) , column [ ix1 ] ) + cost ; column [ ix1 - 1 ] = above ; // write previous above = value ; // keep current smallest = Math . min ( smallest , value ) ; } column [ s1len ] = above ; // check if we can stop because we'll be going over the max distance if ( smallest > maxdist ) return smallest ; } // ok, we're done return above ; } | Optimized version of the Wagner & Fischer algorithm that only keeps a single column in the matrix in memory at a time . It implements the simple cutoff but otherwise computes the entire matrix . It is roughly twice as fast as the original function . | 623 | 49 |
144,724 | public void commit ( ) { if ( directory == null ) return ; try { if ( reader != null ) reader . close ( ) ; // it turns out that IndexWriter.optimize actually slows // searches down, because it invalidates the cache. therefore // not calling it any more. // http://www.searchworkings.org/blog/-/blogs/uwe-says%3A-is-your-reader-atomic // iwriter.optimize(); iwriter . commit ( ) ; openSearchers ( ) ; } catch ( IOException e ) { throw new DukeException ( e ) ; } } | Flushes all changes to disk . | 129 | 7 |
144,725 | public Record findRecordById ( String id ) { if ( directory == null ) init ( ) ; Property idprop = config . getIdentityProperties ( ) . iterator ( ) . next ( ) ; for ( Record r : lookup ( idprop , id ) ) if ( r . getValue ( idprop . getName ( ) ) . equals ( id ) ) return r ; return null ; // not found } | Look up record by identity . | 86 | 6 |
144,726 | public String clean ( String value ) { String orig = value ; // check if there's a + before the first digit boolean initialplus = findPlus ( value ) ; // remove everything but digits value = sub . clean ( value ) ; if ( value == null ) return null ; // check for initial '00' boolean zerozero = ! initialplus && value . startsWith ( "00" ) ; if ( zerozero ) value = value . substring ( 2 ) ; // strip off the zeros // look for country code CountryCode ccode = findCountryCode ( value ) ; if ( ccode == null ) { // no country code, let's do what little we can if ( initialplus || zerozero ) return orig ; // this number is messed up. dare not touch return value ; } else { value = value . substring ( ccode . getPrefix ( ) . length ( ) ) ; // strip off ccode if ( ccode . getStripZero ( ) && value . startsWith ( "0" ) ) value = value . substring ( 1 ) ; // strip the zero if ( ccode . isRightFormat ( value ) ) return "+" + ccode . getPrefix ( ) + " " + value ; else return orig ; // don't dare touch this } } | look for zero after country code and remove if present | 271 | 10 |
144,727 | public boolean overrides ( Link other ) { if ( other . getStatus ( ) == LinkStatus . ASSERTED && status != LinkStatus . ASSERTED ) return false ; else if ( status == LinkStatus . ASSERTED && other . getStatus ( ) != LinkStatus . ASSERTED ) return true ; // the two links are from equivalent sources of information, so we // believe the most recent return timestamp > other . getTimestamp ( ) ; } | Returns true if the information in this link should take precedence over the information in the other link . | 96 | 19 |
144,728 | public void process ( ) { // are we ready to process yet, or have we had an error, and are // waiting a bit longer in the hope that it will resolve itself? if ( error_skips > 0 ) { error_skips -- ; return ; } try { if ( logger != null ) logger . debug ( "Starting processing" ) ; status = "Processing" ; lastCheck = System . currentTimeMillis ( ) ; // FIXME: how to break off processing if we don't want to keep going? processor . deduplicate ( batch_size ) ; status = "Sleeping" ; if ( logger != null ) logger . debug ( "Finished processing" ) ; } catch ( Throwable e ) { status = "Thread blocked on error: " + e ; if ( logger != null ) logger . error ( "Error in processing; waiting" , e ) ; error_skips = error_factor ; } } | Runs the record linkage process . | 200 | 7 |
144,729 | void reportError ( Throwable throwable ) { if ( logger != null ) logger . error ( "Timer reported error" , throwable ) ; status = "Thread blocked on error: " + throwable ; error_skips = error_factor ; } | called by timer thread | 53 | 4 |
144,730 | public static String makePropertyName ( String name ) { char [ ] buf = new char [ name . length ( ) + 3 ] ; int pos = 0 ; buf [ pos ++ ] = ' ' ; buf [ pos ++ ] = ' ' ; buf [ pos ++ ] = ' ' ; for ( int ix = 0 ; ix < name . length ( ) ; ix ++ ) { char ch = name . charAt ( ix ) ; if ( ix == 0 ) ch = Character . toUpperCase ( ch ) ; else if ( ch == ' ' ) { ix ++ ; if ( ix == name . length ( ) ) break ; ch = Character . toUpperCase ( name . charAt ( ix ) ) ; } buf [ pos ++ ] = ch ; } return new String ( buf , 0 , pos ) ; } | public because it s used by other packages that use Duke | 180 | 11 |
144,731 | @ NonNull private List < String > mapObsoleteElements ( List < String > names ) { List < String > elementsToRemove = new ArrayList <> ( names . size ( ) ) ; for ( String name : names ) { if ( name . startsWith ( "android" ) ) continue ; elementsToRemove . add ( name ) ; } return elementsToRemove ; } | Maps all views that don t start with android namespace . | 80 | 11 |
144,732 | private void removeObsoleteElements ( List < String > names , Map < String , View > sharedElements , List < String > elementsToRemove ) { if ( elementsToRemove . size ( ) > 0 ) { names . removeAll ( elementsToRemove ) ; for ( String elementToRemove : elementsToRemove ) { sharedElements . remove ( elementToRemove ) ; } } } | Removes obsolete elements from names and shared elements . | 82 | 10 |
144,733 | @ Override public void onBindViewHolder ( GalleryAdapter . ViewHolder holder , int position , List < Object > payloads ) { if ( payloads . isEmpty ( ) ) { // If doesn't have any payload then bind the fully item super . onBindViewHolder ( holder , position , payloads ) ; } else { for ( Object payload : payloads ) { boolean selected = isSelected ( position ) ; if ( SELECTION_PAYLOAD . equals ( payload ) ) { if ( VIEW_TYPE_MEDIA == getItemViewType ( position ) ) { MediaViewHolder viewHolder = ( MediaViewHolder ) holder ; viewHolder . mCheckView . setChecked ( selected ) ; if ( selected ) { AnimationHelper . scaleView ( holder . mImageView , SELECTED_SCALE ) ; } else { AnimationHelper . scaleView ( holder . mImageView , UNSELECTED_SCALE ) ; } } } } } } | Binding view holder with payloads is used to handle partial changes in item . | 208 | 16 |
144,734 | public Slice newSlice ( long address , int size ) { if ( address <= 0 ) { throw new IllegalArgumentException ( "Invalid address: " + address ) ; } if ( size == 0 ) { return Slices . EMPTY_SLICE ; } return new Slice ( null , address , size , 0 , null ) ; } | Creates a slice for directly a raw memory address . This is inherently unsafe as it may be used to access arbitrary memory . | 74 | 25 |
144,735 | public Slice newSlice ( long address , int size , Object reference ) { if ( address <= 0 ) { throw new IllegalArgumentException ( "Invalid address: " + address ) ; } if ( reference == null ) { throw new NullPointerException ( "Object reference is null" ) ; } if ( size == 0 ) { return Slices . EMPTY_SLICE ; } return new Slice ( null , address , size , size , reference ) ; } | Creates a slice for directly a raw memory address . This is inherently unsafe as it may be used to access arbitrary memory . The slice will hold the specified object reference to prevent the garbage collector from freeing it while it is in use by the slice . | 100 | 50 |
144,736 | public static int hash ( int input ) { int k1 = mixK1 ( input ) ; int h1 = mixH1 ( DEFAULT_SEED , k1 ) ; return fmix ( h1 , SizeOf . SIZE_OF_INT ) ; } | Special - purpose version for hashing a single int value . Value is treated as little - endian | 57 | 19 |
144,737 | public static boolean isAscii ( Slice utf8 ) { int length = utf8 . length ( ) ; int offset = 0 ; // Length rounded to 8 bytes int length8 = length & 0x7FFF_FFF8 ; for ( ; offset < length8 ; offset += 8 ) { if ( ( utf8 . getLongUnchecked ( offset ) & TOP_MASK64 ) != 0 ) { return false ; } } // Enough bytes left for 32 bits? if ( offset + 4 < length ) { if ( ( utf8 . getIntUnchecked ( offset ) & TOP_MASK32 ) != 0 ) { return false ; } offset += 4 ; } // Do the rest one by one for ( ; offset < length ; offset ++ ) { if ( ( utf8 . getByteUnchecked ( offset ) & 0x80 ) != 0 ) { return false ; } } return true ; } | Does the slice contain only 7 - bit ASCII characters . | 197 | 11 |
144,738 | public static int lengthOfCodePoint ( int codePoint ) { if ( codePoint < 0 ) { throw new InvalidCodePointException ( codePoint ) ; } if ( codePoint < 0x80 ) { // normal ASCII // 0xxx_xxxx return 1 ; } if ( codePoint < 0x800 ) { return 2 ; } if ( codePoint < 0x1_0000 ) { return 3 ; } if ( codePoint < 0x11_0000 ) { return 4 ; } // Per RFC3629, UTF-8 is limited to 4 bytes, so more bytes are illegal throw new InvalidCodePointException ( codePoint ) ; } | Gets the UTF - 8 sequence length of the code point . | 133 | 13 |
144,739 | public ComplexDouble divi ( ComplexDouble c , ComplexDouble result ) { double d = c . r * c . r + c . i * c . i ; double newR = ( r * c . r + i * c . i ) / d ; double newI = ( i * c . r - r * c . i ) / d ; result . r = newR ; result . i = newI ; return result ; } | Divide two complex numbers in - place | 92 | 8 |
144,740 | public static int [ ] randomPermutation ( int size ) { Random r = new Random ( ) ; int [ ] result = new int [ size ] ; for ( int j = 0 ; j < size ; j ++ ) { result [ j ] = j ; } for ( int j = size - 1 ; j > 0 ; j -- ) { int k = r . nextInt ( j ) ; int temp = result [ j ] ; result [ j ] = result [ k ] ; result [ k ] = temp ; } return result ; } | Create a random permutation of the numbers 0 ... size - 1 . | 114 | 14 |
144,741 | public static int [ ] randomSubset ( int k , int n ) { assert ( 0 < k && k <= n ) ; Random r = new Random ( ) ; int t = 0 , m = 0 ; int [ ] result = new int [ k ] ; while ( m < k ) { double u = r . nextDouble ( ) ; if ( ( n - t ) * u < k - m ) { result [ m ] = t ; m ++ ; } t ++ ; } return result ; } | Get a random sample of k out of n elements . | 106 | 11 |
144,742 | public static DoubleMatrix [ ] fullSVD ( DoubleMatrix A ) { int m = A . rows ; int n = A . columns ; DoubleMatrix U = new DoubleMatrix ( m , m ) ; DoubleMatrix S = new DoubleMatrix ( min ( m , n ) ) ; DoubleMatrix V = new DoubleMatrix ( n , n ) ; int info = NativeBlas . dgesvd ( ' ' , ' ' , m , n , A . dup ( ) . data , 0 , m , S . data , 0 , U . data , 0 , m , V . data , 0 , n ) ; if ( info > 0 ) { throw new LapackConvergenceException ( "GESVD" , info + " superdiagonals of an intermediate bidiagonal form failed to converge." ) ; } return new DoubleMatrix [ ] { U , S , V . transpose ( ) } ; } | Compute a singular - value decomposition of A . | 189 | 11 |
144,743 | private InputStream tryPath ( String path ) { Logger . getLogger ( ) . debug ( "Trying path \"" + path + "\"." ) ; return getClass ( ) . getResourceAsStream ( path ) ; } | Try to open a file at the given position . | 50 | 10 |
144,744 | private void loadLibraryFromStream ( String libname , InputStream is ) { try { File tempfile = createTempFile ( libname ) ; OutputStream os = new FileOutputStream ( tempfile ) ; logger . debug ( "tempfile.getPath() = " + tempfile . getPath ( ) ) ; long savedTime = System . currentTimeMillis ( ) ; // Leo says 8k block size is STANDARD ;) byte buf [ ] = new byte [ 8192 ] ; int len ; while ( ( len = is . read ( buf ) ) > 0 ) { os . write ( buf , 0 , len ) ; } os . flush ( ) ; InputStream lock = new FileInputStream ( tempfile ) ; os . close ( ) ; double seconds = ( double ) ( System . currentTimeMillis ( ) - savedTime ) / 1e3 ; logger . debug ( "Copying took " + seconds + " seconds." ) ; logger . debug ( "Loading library from " + tempfile . getPath ( ) + "." ) ; System . load ( tempfile . getPath ( ) ) ; lock . close ( ) ; } catch ( IOException io ) { logger . error ( "Could not create the temp file: " + io . toString ( ) + ".\n" ) ; } catch ( UnsatisfiedLinkError ule ) { logger . error ( "Couldn't load copied link file: " + ule . toString ( ) + ".\n" ) ; throw ule ; } } | Load a system library from a stream . Copies the library to a temp file and loads from there . | 323 | 21 |
144,745 | public static void checkVectorAddition ( ) { DoubleMatrix x = new DoubleMatrix ( 3 , 1 , 1.0 , 2.0 , 3.0 ) ; DoubleMatrix y = new DoubleMatrix ( 3 , 1 , 4.0 , 5.0 , 6.0 ) ; DoubleMatrix z = new DoubleMatrix ( 3 , 1 , 5.0 , 7.0 , 9.0 ) ; check ( "checking vector addition" , x . add ( y ) . equals ( z ) ) ; } | Check whether vector addition works . This is pure Java code and should work . | 107 | 15 |
144,746 | public static void checkXerbla ( ) { double [ ] x = new double [ 9 ] ; System . out . println ( "Check whether we're catching XERBLA errors. If you see something like \"** On entry to DGEMM parameter number 4 had an illegal value\", it didn't work!" ) ; try { NativeBlas . dgemm ( ' ' , ' ' , 3 , - 1 , 3 , 1.0 , x , 0 , 3 , x , 0 , 3 , 0.0 , x , 0 , 3 ) ; } catch ( IllegalArgumentException e ) { check ( "checking XERBLA" , e . getMessage ( ) . contains ( "XERBLA" ) ) ; return ; } assert ( false ) ; // shouldn't happen } | Check whether error handling works . If it works you should see an ok otherwise you might see the actual error message and then the program exits . | 169 | 28 |
144,747 | public static void checkEigenvalues ( ) { DoubleMatrix A = new DoubleMatrix ( new double [ ] [ ] { { 3.0 , 2.0 , 0.0 } , { 2.0 , 3.0 , 2.0 } , { 0.0 , 2.0 , 3.0 } } ) ; DoubleMatrix E = new DoubleMatrix ( 3 , 1 ) ; NativeBlas . dsyev ( ' ' , ' ' , 3 , A . data , 0 , 3 , E . data , 0 ) ; check ( "checking existence of dsyev..." , true ) ; } | Compute eigenvalues . This is a routine not in ATLAS but in the original LAPACK . | 128 | 22 |
144,748 | public static DoubleMatrix cholesky ( DoubleMatrix A ) { DoubleMatrix result = A . dup ( ) ; int info = NativeBlas . dpotrf ( ' ' , A . rows , result . data , 0 , A . rows ) ; if ( info < 0 ) { throw new LapackArgumentException ( "DPOTRF" , - info ) ; } else if ( info > 0 ) { throw new LapackPositivityException ( "DPOTRF" , "Minor " + info + " was negative. Matrix must be positive definite." ) ; } clearLower ( result ) ; return result ; } | Compute Cholesky decomposition of A | 130 | 9 |
144,749 | public static QRDecomposition < DoubleMatrix > qr ( DoubleMatrix A ) { int minmn = min ( A . rows , A . columns ) ; DoubleMatrix result = A . dup ( ) ; DoubleMatrix tau = new DoubleMatrix ( minmn ) ; SimpleBlas . geqrf ( result , tau ) ; DoubleMatrix R = new DoubleMatrix ( A . rows , A . columns ) ; for ( int i = 0 ; i < A . rows ; i ++ ) { for ( int j = i ; j < A . columns ; j ++ ) { R . put ( i , j , result . get ( i , j ) ) ; } } DoubleMatrix Q = DoubleMatrix . eye ( A . rows ) ; SimpleBlas . ormqr ( ' ' , ' ' , result , tau , Q ) ; return new QRDecomposition < DoubleMatrix > ( Q , R ) ; } | QR decomposition . | 195 | 5 |
144,750 | public static DoubleMatrix absi ( DoubleMatrix x ) { /*# mapfct('Math.abs') #*/ //RJPP-BEGIN------------------------------------------------------------ for ( int i = 0 ; i < x . length ; i ++ ) x . put ( i , ( double ) Math . abs ( x . get ( i ) ) ) ; return x ; //RJPP-END-------------------------------------------------------------- } | Sets all elements in this matrix to their absolute values . Note that this operation is in - place . | 83 | 21 |
144,751 | public static DoubleMatrix expm ( DoubleMatrix A ) { // constants for pade approximation final double c0 = 1.0 ; final double c1 = 0.5 ; final double c2 = 0.12 ; final double c3 = 0.01833333333333333 ; final double c4 = 0.0019927536231884053 ; final double c5 = 1.630434782608695E-4 ; final double c6 = 1.0351966873706E-5 ; final double c7 = 5.175983436853E-7 ; final double c8 = 2.0431513566525E-8 ; final double c9 = 6.306022705717593E-10 ; final double c10 = 1.4837700484041396E-11 ; final double c11 = 2.5291534915979653E-13 ; final double c12 = 2.8101705462199615E-15 ; final double c13 = 1.5440497506703084E-17 ; int j = Math . max ( 0 , 1 + ( int ) Math . floor ( Math . log ( A . normmax ( ) ) / Math . log ( 2 ) ) ) ; DoubleMatrix As = A . div ( ( double ) Math . pow ( 2 , j ) ) ; // scaled version of A int n = A . getRows ( ) ; // calculate D and N using special Horner techniques DoubleMatrix As_2 = As . mmul ( As ) ; DoubleMatrix As_4 = As_2 . mmul ( As_2 ) ; DoubleMatrix As_6 = As_4 . mmul ( As_2 ) ; // U = c0*I + c2*A^2 + c4*A^4 + (c6*I + c8*A^2 + c10*A^4 + c12*A^6)*A^6 DoubleMatrix U = DoubleMatrix . eye ( n ) . muli ( c0 ) . addi ( As_2 . mul ( c2 ) ) . addi ( As_4 . mul ( c4 ) ) . addi ( DoubleMatrix . eye ( n ) . muli ( c6 ) . addi ( As_2 . mul ( c8 ) ) . addi ( As_4 . mul ( c10 ) ) . addi ( As_6 . mul ( c12 ) ) . mmuli ( As_6 ) ) ; // V = c1*I + c3*A^2 + c5*A^4 + (c7*I + c9*A^2 + c11*A^4 + c13*A^6)*A^6 DoubleMatrix V = DoubleMatrix . eye ( n ) . muli ( c1 ) . addi ( As_2 . mul ( c3 ) ) . addi ( As_4 . mul ( c5 ) ) . addi ( DoubleMatrix . eye ( n ) . muli ( c7 ) . addi ( As_2 . mul ( c9 ) ) . addi ( As_4 . mul ( c11 ) ) . addi ( As_6 . mul ( c13 ) ) . mmuli ( As_6 ) ) ; DoubleMatrix AV = As . mmuli ( V ) ; DoubleMatrix N = U . add ( AV ) ; DoubleMatrix D = U . subi ( AV ) ; // solve DF = N for F DoubleMatrix F = Solve . solve ( D , N ) ; // now square j times for ( int k = 0 ; k < j ; k ++ ) { F . mmuli ( F ) ; } return F ; } | Calculate matrix exponential of a square matrix . | 789 | 10 |
144,752 | public static VectorTile . Tile . GeomType toGeomType ( Geometry geometry ) { VectorTile . Tile . GeomType result = VectorTile . Tile . GeomType . UNKNOWN ; if ( geometry instanceof Point || geometry instanceof MultiPoint ) { result = VectorTile . Tile . GeomType . POINT ; } else if ( geometry instanceof LineString || geometry instanceof MultiLineString ) { result = VectorTile . Tile . GeomType . LINESTRING ; } else if ( geometry instanceof Polygon || geometry instanceof MultiPolygon ) { result = VectorTile . Tile . GeomType . POLYGON ; } return result ; } | Get the MVT type mapping for the provided JTS Geometry . | 143 | 14 |
144,753 | private static boolean equalAsInts ( Vec2d a , Vec2d b ) { return ( ( int ) a . x ) == ( ( int ) b . x ) && ( ( int ) a . y ) == ( ( int ) b . y ) ; } | Return true if the values of the two vectors are equal when cast as ints . | 57 | 17 |
144,754 | private static void validate ( String name , Collection < Geometry > geometries , int extent ) { if ( name == null ) { throw new IllegalArgumentException ( "layer name is null" ) ; } if ( geometries == null ) { throw new IllegalArgumentException ( "geometry collection is null" ) ; } if ( extent <= 0 ) { throw new IllegalArgumentException ( "extent is less than or equal to 0" ) ; } } | Validate the JtsLayer . | 99 | 7 |
144,755 | public int addKey ( String key ) { JdkUtils . requireNonNull ( key ) ; int nextIndex = keys . size ( ) ; final Integer mapIndex = JdkUtils . putIfAbsent ( keys , key , nextIndex ) ; return mapIndex == null ? nextIndex : mapIndex ; } | Add the key and return it s index code . If the key already is present the previous index code is returned and no insertion is done . | 67 | 28 |
144,756 | private void findScrollView ( ViewGroup viewGroup ) { scrollChild = viewGroup ; if ( viewGroup . getChildCount ( ) > 0 ) { int count = viewGroup . getChildCount ( ) ; View child ; for ( int i = 0 ; i < count ; i ++ ) { child = viewGroup . getChildAt ( i ) ; if ( child instanceof AbsListView || child instanceof ScrollView || child instanceof ViewPager || child instanceof WebView ) { scrollChild = child ; return ; } } } } | Find out the scrollable child view from a ViewGroup . | 114 | 12 |
144,757 | private void removeAllBroadcasts ( Set < String > sessionIds ) { if ( sessionIds == null ) { for ( CmsSessionInfo info : OpenCms . getSessionManager ( ) . getSessionInfos ( ) ) { OpenCms . getSessionManager ( ) . getBroadcastQueue ( info . getSessionId ( ) . getStringValue ( ) ) . clear ( ) ; } return ; } for ( String sessionId : sessionIds ) { OpenCms . getSessionManager ( ) . getBroadcastQueue ( sessionId ) . clear ( ) ; } } | Removes all pending broadcasts | 125 | 5 |
144,758 | @ UiHandler ( "m_atDay" ) void onWeekDayChange ( ValueChangeEvent < String > event ) { if ( handleChange ( ) ) { m_controller . setWeekDay ( event . getValue ( ) ) ; } } | Handles week day changes . | 53 | 6 |
144,759 | private void addCheckBox ( final String internalValue , String labelMessageKey ) { CmsCheckBox box = new CmsCheckBox ( Messages . get ( ) . key ( labelMessageKey ) ) ; box . setInternalValue ( internalValue ) ; box . addValueChangeHandler ( new ValueChangeHandler < Boolean > ( ) { public void onValueChange ( ValueChangeEvent < Boolean > event ) { if ( handleChange ( ) ) { m_controller . weeksChange ( internalValue , event . getValue ( ) ) ; } } } ) ; m_weekPanel . add ( box ) ; m_checkboxes . add ( box ) ; } | Creates a check box and adds it to the week panel and the checkboxes . | 137 | 17 |
144,760 | private void checkExactlyTheWeeksCheckBoxes ( Collection < WeekOfMonth > weeksToCheck ) { for ( CmsCheckBox cb : m_checkboxes ) { cb . setChecked ( weeksToCheck . contains ( WeekOfMonth . valueOf ( cb . getInternalValue ( ) ) ) ) ; } } | Check exactly the week check - boxes representing the given weeks . | 71 | 12 |
144,761 | private void fillWeekPanel ( ) { addCheckBox ( WeekOfMonth . FIRST . toString ( ) , Messages . GUI_SERIALDATE_WEEKDAYNUMBER_1_0 ) ; addCheckBox ( WeekOfMonth . SECOND . toString ( ) , Messages . GUI_SERIALDATE_WEEKDAYNUMBER_2_0 ) ; addCheckBox ( WeekOfMonth . THIRD . toString ( ) , Messages . GUI_SERIALDATE_WEEKDAYNUMBER_3_0 ) ; addCheckBox ( WeekOfMonth . FOURTH . toString ( ) , Messages . GUI_SERIALDATE_WEEKDAYNUMBER_4_0 ) ; addCheckBox ( WeekOfMonth . LAST . toString ( ) , Messages . GUI_SERIALDATE_WEEKDAYNUMBER_5_0 ) ; } | Fills the week panel with checkboxes . | 188 | 9 |
144,762 | public Label htmlLabel ( String html ) { Label label = new Label ( ) ; label . setContentMode ( ContentMode . HTML ) ; label . setValue ( html ) ; return label ; } | Creates a new HTML - formatted label with the given content . | 41 | 13 |
144,763 | public String readSnippet ( String name ) { String path = CmsStringUtil . joinPaths ( m_context . getSetupBean ( ) . getWebAppRfsPath ( ) , CmsSetupBean . FOLDER_SETUP , "html" , name ) ; try ( InputStream stream = new FileInputStream ( path ) ) { byte [ ] data = CmsFileUtil . readFully ( stream , false ) ; String result = new String ( data , "UTF-8" ) ; return result ; } catch ( Exception e ) { throw new RuntimeException ( e ) ; } } | Reads an HTML snippet with the given name . | 134 | 10 |
144,764 | public static List < String > getSelectOptionValues ( CmsObject cms , String rootPath , boolean allRemoved ) { try { cms = OpenCms . initCmsObject ( cms ) ; cms . getRequestContext ( ) . setSiteRoot ( "" ) ; CmsADEConfigData adeConfig = OpenCms . getADEManager ( ) . lookupConfiguration ( cms , rootPath ) ; if ( adeConfig . parent ( ) != null ) { adeConfig = adeConfig . parent ( ) ; } List < CmsSelectWidgetOption > options = getFormatterOptionsStatic ( cms , adeConfig , rootPath , allRemoved ) ; List < CmsSelectWidgetOption > typeOptions = getTypeOptionsStatic ( cms , adeConfig , allRemoved ) ; options . addAll ( typeOptions ) ; List < String > result = new ArrayList < String > ( options . size ( ) ) ; for ( CmsSelectWidgetOption o : options ) { result . add ( o . getValue ( ) ) ; } return result ; } catch ( CmsException e ) { // should never happen LOG . error ( e . getLocalizedMessage ( ) , e ) ; return null ; } } | Returns all values that can be selected in the widget . | 267 | 11 |
144,765 | public void addRow ( Component component ) { Component actualComponent = component == null ? m_newComponentFactory . get ( ) : component ; I_CmsEditableGroupRow row = m_rowBuilder . buildRow ( this , actualComponent ) ; m_container . addComponent ( row ) ; updatePlaceholder ( ) ; updateButtonBars ( ) ; updateGroupValidation ( ) ; } | Adds a row for the given component at the end of the group . | 84 | 14 |
144,766 | public void addRowAfter ( I_CmsEditableGroupRow row ) { int index = m_container . getComponentIndex ( row ) ; if ( index >= 0 ) { Component component = m_newComponentFactory . get ( ) ; I_CmsEditableGroupRow newRow = m_rowBuilder . buildRow ( this , component ) ; m_container . addComponent ( newRow , index + 1 ) ; } updatePlaceholder ( ) ; updateButtonBars ( ) ; updateGroupValidation ( ) ; } | Adds a new row after the given one . | 112 | 9 |
144,767 | public List < I_CmsEditableGroupRow > getRows ( ) { List < I_CmsEditableGroupRow > result = Lists . newArrayList ( ) ; for ( Component component : m_container ) { if ( component instanceof I_CmsEditableGroupRow ) { result . add ( ( I_CmsEditableGroupRow ) component ) ; } } return result ; } | Gets all rows . | 87 | 5 |
144,768 | public void moveDown ( I_CmsEditableGroupRow row ) { int index = m_container . getComponentIndex ( row ) ; if ( ( index >= 0 ) && ( index < ( m_container . getComponentCount ( ) - 1 ) ) ) { m_container . removeComponent ( row ) ; m_container . addComponent ( row , index + 1 ) ; } updateButtonBars ( ) ; } | Moves the given row down . | 90 | 7 |
144,769 | public void moveUp ( I_CmsEditableGroupRow row ) { int index = m_container . getComponentIndex ( row ) ; if ( index > 0 ) { m_container . removeComponent ( row ) ; m_container . addComponent ( row , index - 1 ) ; } updateButtonBars ( ) ; } | Moves the given row up . | 70 | 7 |
144,770 | public void remove ( I_CmsEditableGroupRow row ) { int index = m_container . getComponentIndex ( row ) ; if ( index >= 0 ) { m_container . removeComponent ( row ) ; } updatePlaceholder ( ) ; updateButtonBars ( ) ; updateGroupValidation ( ) ; } | Removes the given row . | 68 | 6 |
144,771 | public void adjustLinks ( String sourceFolder , String targetFolder ) throws CmsException { String rootSourceFolder = addSiteRoot ( sourceFolder ) ; String rootTargetFolder = addSiteRoot ( targetFolder ) ; String siteRoot = getRequestContext ( ) . getSiteRoot ( ) ; getRequestContext ( ) . setSiteRoot ( "" ) ; try { CmsLinkRewriter linkRewriter = new CmsLinkRewriter ( this , rootSourceFolder , rootTargetFolder ) ; linkRewriter . rewriteLinks ( ) ; } finally { getRequestContext ( ) . setSiteRoot ( siteRoot ) ; } } | Adjusts all links in the target folder that point to the source folder so that they are kept relative in the target folder where possible . | 130 | 27 |
144,772 | public void setRGB ( int red , int green , int blue ) throws Exception { CmsColor color = new CmsColor ( ) ; color . setRGB ( red , green , blue ) ; m_red = red ; m_green = green ; m_blue = blue ; m_hue = color . getHue ( ) ; m_saturation = color . getSaturation ( ) ; m_brightness = color . getValue ( ) ; m_tbRed . setText ( Integer . toString ( m_red ) ) ; m_tbGreen . setText ( Integer . toString ( m_green ) ) ; m_tbBlue . setText ( Integer . toString ( m_blue ) ) ; m_tbHue . setText ( Integer . toString ( m_hue ) ) ; m_tbSaturation . setText ( Integer . toString ( m_saturation ) ) ; m_tbBrightness . setText ( Integer . toString ( m_brightness ) ) ; m_tbHexColor . setText ( color . getHex ( ) ) ; setPreview ( color . getHex ( ) ) ; updateSliders ( ) ; } | Sets the Red Green and Blue color variables . This will automatically populate the Hue Saturation and Brightness and Hexadecimal fields too . | 262 | 29 |
144,773 | protected void doSave ( ) { List < CmsFavoriteEntry > entries = getEntries ( ) ; try { m_favDao . saveFavorites ( entries ) ; } catch ( Exception e ) { CmsErrorDialog . showErrorDialog ( e ) ; } } | Saves the list of currently displayed favorites . | 60 | 9 |
144,774 | List < CmsFavoriteEntry > getEntries ( ) { List < CmsFavoriteEntry > result = new ArrayList <> ( ) ; for ( I_CmsEditableGroupRow row : m_group . getRows ( ) ) { CmsFavoriteEntry entry = ( ( CmsFavInfo ) row ) . getEntry ( ) ; result . add ( entry ) ; } return result ; } | Gets the favorite entries corresponding to the currently displayed favorite widgets . | 87 | 13 |
144,775 | private CmsFavInfo createFavInfo ( CmsFavoriteEntry entry ) throws CmsException { String title = "" ; String subtitle = "" ; CmsFavInfo result = new CmsFavInfo ( entry ) ; CmsObject cms = A_CmsUI . getCmsObject ( ) ; String project = getProject ( cms , entry ) ; String site = getSite ( cms , entry ) ; try { CmsUUID idToLoad = entry . getDetailId ( ) != null ? entry . getDetailId ( ) : entry . getStructureId ( ) ; CmsResource resource = cms . readResource ( idToLoad , CmsResourceFilter . IGNORE_EXPIRATION . addRequireVisible ( ) ) ; CmsResourceUtil resutil = new CmsResourceUtil ( cms , resource ) ; switch ( entry . getType ( ) ) { case explorerFolder : title = CmsStringUtil . isEmpty ( resutil . getTitle ( ) ) ? CmsResource . getName ( resource . getRootPath ( ) ) : resutil . getTitle ( ) ; break ; case page : title = resutil . getTitle ( ) ; break ; } subtitle = resource . getRootPath ( ) ; CmsResourceIcon icon = result . getResourceIcon ( ) ; icon . initContent ( resutil , CmsResource . STATE_UNCHANGED , false , false ) ; } catch ( CmsException e ) { LOG . warn ( e . getLocalizedMessage ( ) , e ) ; } result . getTopLine ( ) . setValue ( title ) ; result . getBottomLine ( ) . setValue ( subtitle ) ; result . getProjectLabel ( ) . setValue ( project ) ; result . getSiteLabel ( ) . setValue ( site ) ; return result ; } | Creates a favorite widget for a favorite entry . | 397 | 10 |
144,776 | private CmsFavoriteEntry getEntry ( Component row ) { if ( row instanceof CmsFavInfo ) { return ( ( CmsFavInfo ) row ) . getEntry ( ) ; } return null ; } | Gets the favorite entry for a given row . | 46 | 10 |
144,777 | private String getProject ( CmsObject cms , CmsFavoriteEntry entry ) throws CmsException { String result = m_projectLabels . get ( entry . getProjectId ( ) ) ; if ( result == null ) { result = cms . readProject ( entry . getProjectId ( ) ) . getName ( ) ; m_projectLabels . put ( entry . getProjectId ( ) , result ) ; } return result ; } | Gets the project name for a favorite entry . | 95 | 10 |
144,778 | private String getSite ( CmsObject cms , CmsFavoriteEntry entry ) { CmsSite site = OpenCms . getSiteManager ( ) . getSiteForRootPath ( entry . getSiteRoot ( ) ) ; Item item = m_sitesContainer . getItem ( entry . getSiteRoot ( ) ) ; if ( item != null ) { return ( String ) ( item . getItemProperty ( "caption" ) . getValue ( ) ) ; } String result = entry . getSiteRoot ( ) ; if ( site != null ) { if ( ! CmsStringUtil . isEmpty ( site . getTitle ( ) ) ) { result = site . getTitle ( ) ; } } return result ; } | Gets the site label for the entry . | 153 | 9 |
144,779 | private void onClickAdd ( ) { if ( m_currentLocation . isPresent ( ) ) { CmsFavoriteEntry entry = m_currentLocation . get ( ) ; List < CmsFavoriteEntry > entries = getEntries ( ) ; entries . add ( entry ) ; try { m_favDao . saveFavorites ( entries ) ; } catch ( Exception e ) { CmsErrorDialog . showErrorDialog ( e ) ; } m_context . close ( ) ; } } | The click handler for the add button . | 105 | 8 |
144,780 | public void setLocale ( String locale ) { try { m_locale = LocaleUtils . toLocale ( locale ) ; } catch ( IllegalArgumentException e ) { LOG . error ( Messages . get ( ) . getBundle ( ) . key ( Messages . ERR_TAG_INVALID_LOCALE_1 , "cms:navigation" ) , e ) ; m_locale = null ; } } | Sets the locale for which the property should be read . | 93 | 12 |
144,781 | public List < CmsFavoriteEntry > loadFavorites ( ) throws CmsException { List < CmsFavoriteEntry > result = new ArrayList <> ( ) ; try { CmsUser user = readUser ( ) ; String data = ( String ) user . getAdditionalInfo ( ADDINFO_KEY ) ; if ( CmsStringUtil . isEmptyOrWhitespaceOnly ( data ) ) { return new ArrayList <> ( ) ; } JSONObject json = new JSONObject ( data ) ; JSONArray array = json . getJSONArray ( BASE_KEY ) ; for ( int i = 0 ; i < array . length ( ) ; i ++ ) { JSONObject fav = array . getJSONObject ( i ) ; try { CmsFavoriteEntry entry = new CmsFavoriteEntry ( fav ) ; if ( validate ( entry ) ) { result . add ( entry ) ; } } catch ( Exception e ) { LOG . warn ( e . getLocalizedMessage ( ) , e ) ; } } } catch ( JSONException e ) { LOG . error ( e . getLocalizedMessage ( ) , e ) ; } return result ; } | Loads the favorite list . | 241 | 6 |
144,782 | public void saveFavorites ( List < CmsFavoriteEntry > favorites ) throws CmsException { try { JSONObject json = new JSONObject ( ) ; JSONArray array = new JSONArray ( ) ; for ( CmsFavoriteEntry entry : favorites ) { array . put ( entry . toJson ( ) ) ; } json . put ( BASE_KEY , array ) ; String data = json . toString ( ) ; CmsUser user = readUser ( ) ; user . setAdditionalInfo ( ADDINFO_KEY , data ) ; m_cms . writeUser ( user ) ; } catch ( JSONException e ) { LOG . error ( e . getLocalizedMessage ( ) , e ) ; } } | Saves the favorites . | 149 | 5 |
144,783 | private boolean validate ( CmsFavoriteEntry entry ) { try { String siteRoot = entry . getSiteRoot ( ) ; if ( ! m_okSiteRoots . contains ( siteRoot ) ) { m_rootCms . readResource ( siteRoot ) ; m_okSiteRoots . add ( siteRoot ) ; } CmsUUID project = entry . getProjectId ( ) ; if ( ! m_okProjects . contains ( project ) ) { m_cms . readProject ( project ) ; m_okProjects . add ( project ) ; } for ( CmsUUID id : Arrays . asList ( entry . getDetailId ( ) , entry . getStructureId ( ) ) ) { if ( ( id != null ) && ! m_okStructureIds . contains ( id ) ) { m_cms . readResource ( id , CmsResourceFilter . IGNORE_EXPIRATION . addRequireVisible ( ) ) ; m_okStructureIds . add ( id ) ; } } return true ; } catch ( Exception e ) { LOG . info ( "Favorite entry validation failed: " + e . getLocalizedMessage ( ) , e ) ; return false ; } } | Validates a favorite entry . | 261 | 6 |
144,784 | public void showCurrentDates ( Collection < CmsPair < Date , Boolean > > dates ) { m_overviewList . setDatesWithCheckState ( dates ) ; m_overviewPopup . center ( ) ; } | Shows the provided list of dates as current dates . | 50 | 11 |
144,785 | public void updateExceptions ( ) { m_exceptionsList . setDates ( m_model . getExceptions ( ) ) ; if ( m_model . getExceptions ( ) . size ( ) > 0 ) { m_exceptionsPanel . setVisible ( true ) ; } else { m_exceptionsPanel . setVisible ( false ) ; } } | Updates the exceptions panel . | 79 | 6 |
144,786 | @ UiHandler ( "m_currentTillEndCheckBox" ) void onCurrentTillEndChange ( ValueChangeEvent < Boolean > event ) { if ( handleChange ( ) ) { m_controller . setCurrentTillEnd ( event . getValue ( ) ) ; } } | Handle a current till end change event . | 61 | 8 |
144,787 | @ UiHandler ( "m_endTime" ) void onEndTimeChange ( CmsDateBoxEvent event ) { if ( handleChange ( ) && ! event . isUserTyping ( ) ) { m_controller . setEndTime ( event . getDate ( ) ) ; } } | Handle an end time change . | 62 | 6 |
144,788 | void onEndTypeChange ( ) { EndType endType = m_model . getEndType ( ) ; m_groupDuration . selectButton ( getDurationButtonForType ( endType ) ) ; switch ( endType ) { case DATE : case TIMES : m_durationPanel . setVisible ( true ) ; m_seriesEndDate . setValue ( m_model . getSeriesEndDate ( ) ) ; int occurrences = m_model . getOccurrences ( ) ; if ( ! m_occurrences . isFocused ( ) ) { m_occurrences . setFormValueAsString ( occurrences > 0 ? "" + occurrences : "" ) ; } break ; default : m_durationPanel . setVisible ( false ) ; break ; } updateExceptions ( ) ; } | Called when the end type is changed . | 169 | 9 |
144,789 | void onPatternChange ( ) { PatternType patternType = m_model . getPatternType ( ) ; boolean isSeries = ! patternType . equals ( PatternType . NONE ) ; setSerialOptionsVisible ( isSeries ) ; m_seriesCheckBox . setChecked ( isSeries ) ; if ( isSeries ) { m_groupPattern . selectButton ( m_patternButtons . get ( patternType ) ) ; m_controller . getPatternView ( ) . onValueChange ( ) ; m_patternOptions . setWidget ( m_controller . getPatternView ( ) ) ; onEndTypeChange ( ) ; } m_controller . sizeChanged ( ) ; } | Called when the pattern has changed . | 143 | 8 |
144,790 | @ UiHandler ( "m_seriesCheckBox" ) void onSeriesChange ( ValueChangeEvent < Boolean > event ) { if ( handleChange ( ) ) { m_controller . setIsSeries ( event . getValue ( ) ) ; } } | Handle changes of the series check box . | 53 | 8 |
144,791 | @ UiHandler ( "m_startTime" ) void onStartTimeChange ( CmsDateBoxEvent event ) { if ( handleChange ( ) && ! event . isUserTyping ( ) ) { m_controller . setStartTime ( event . getDate ( ) ) ; } } | Handle a start time change . | 62 | 6 |
144,792 | @ UiHandler ( "m_wholeDayCheckBox" ) void onWholeDayChange ( ValueChangeEvent < Boolean > event ) { //TODO: Improve - adjust time selections? if ( handleChange ( ) ) { m_controller . setWholeDay ( event . getValue ( ) ) ; } } | Handle a whole day change event . | 69 | 7 |
144,793 | private void createAndAddButton ( PatternType pattern , String messageKey ) { CmsRadioButton btn = new CmsRadioButton ( pattern . toString ( ) , Messages . get ( ) . key ( messageKey ) ) ; btn . addStyleName ( I_CmsWidgetsLayoutBundle . INSTANCE . widgetCss ( ) . radioButtonlabel ( ) ) ; btn . setGroup ( m_groupPattern ) ; m_patternButtons . put ( pattern , btn ) ; m_patternRadioButtonsPanel . add ( btn ) ; } | Creates a pattern choice radio button and adds it where necessary . | 124 | 13 |
144,794 | private void initDatesPanel ( ) { m_startLabel . setText ( Messages . get ( ) . key ( Messages . GUI_SERIALDATE_TIME_STARTTIME_0 ) ) ; m_startTime . setAllowInvalidValue ( true ) ; m_startTime . setValue ( m_model . getStart ( ) ) ; m_endLabel . setText ( Messages . get ( ) . key ( Messages . GUI_SERIALDATE_TIME_ENDTIME_0 ) ) ; m_endTime . setAllowInvalidValue ( true ) ; m_endTime . setValue ( m_model . getEnd ( ) ) ; m_seriesCheckBox . setText ( Messages . get ( ) . key ( Messages . GUI_SERIALDATE_SERIES_CHECKBOX_0 ) ) ; m_wholeDayCheckBox . setText ( Messages . get ( ) . key ( Messages . GUI_SERIALDATE_WHOLE_DAY_CHECKBOX_0 ) ) ; m_currentTillEndCheckBox . setText ( Messages . get ( ) . key ( Messages . GUI_SERIALDATE_CURRENT_TILL_END_CHECKBOX_0 ) ) ; m_currentTillEndCheckBox . getButton ( ) . setTitle ( Messages . get ( ) . key ( Messages . GUI_SERIALDATE_CURRENT_TILL_END_CHECKBOX_HELP_0 ) ) ; } | Initialize dates panel elements . | 314 | 6 |
144,795 | private void initDeactivationPanel ( ) { m_deactivationPanel . setVisible ( false ) ; m_deactivationText . setText ( Messages . get ( ) . key ( Messages . GUI_SERIALDATE_DEACTIVE_TEXT_0 ) ) ; } | Initialize elements of the panel displayed for the deactivated widget . | 59 | 13 |
144,796 | private void initDurationButtonGroup ( ) { m_groupDuration = new CmsRadioButtonGroup ( ) ; m_endsAfterRadioButton = new CmsRadioButton ( EndType . TIMES . toString ( ) , Messages . get ( ) . key ( Messages . GUI_SERIALDATE_DURATION_ENDTYPE_OCC_0 ) ) ; m_endsAfterRadioButton . setGroup ( m_groupDuration ) ; m_endsAtRadioButton = new CmsRadioButton ( EndType . DATE . toString ( ) , Messages . get ( ) . key ( Messages . GUI_SERIALDATE_DURATION_ENDTYPE_DATE_0 ) ) ; m_endsAtRadioButton . setGroup ( m_groupDuration ) ; m_groupDuration . addValueChangeHandler ( new ValueChangeHandler < String > ( ) { public void onValueChange ( ValueChangeEvent < String > event ) { if ( handleChange ( ) ) { String value = event . getValue ( ) ; if ( null != value ) { m_controller . setEndType ( value ) ; } } } } ) ; } | Configure all UI elements in the ending - options panel . | 243 | 12 |
144,797 | private void initDurationPanel ( ) { m_durationPrefixLabel . setText ( Messages . get ( ) . key ( Messages . GUI_SERIALDATE_DURATION_PREFIX_0 ) ) ; m_durationAfterPostfixLabel . setText ( Messages . get ( ) . key ( Messages . GUI_SERIALDATE_DURATION_ENDTYPE_OCC_POSTFIX_0 ) ) ; m_seriesEndDate . setDateOnly ( true ) ; m_seriesEndDate . setAllowInvalidValue ( true ) ; m_seriesEndDate . setValue ( m_model . getSeriesEndDate ( ) ) ; m_seriesEndDate . getTextField ( ) . addFocusHandler ( new FocusHandler ( ) { public void onFocus ( FocusEvent event ) { if ( handleChange ( ) ) { onSeriesEndDateFocus ( event ) ; } } } ) ; } | Initialize elements from the duration panel . | 195 | 8 |
144,798 | private void initExceptionsPanel ( ) { m_exceptionsPanel . setLegend ( Messages . get ( ) . key ( Messages . GUI_SERIALDATE_PANEL_EXCEPTIONS_0 ) ) ; m_exceptionsPanel . addCloseHandler ( this ) ; m_exceptionsPanel . setVisible ( false ) ; } | Configure all UI elements in the exceptions panel . | 74 | 10 |
144,799 | private void initManagementPart ( ) { m_manageExceptionsButton . setText ( Messages . get ( ) . key ( Messages . GUI_SERIALDATE_BUTTON_MANAGE_EXCEPTIONS_0 ) ) ; m_manageExceptionsButton . getElement ( ) . getStyle ( ) . setFloat ( Style . Float . RIGHT ) ; } | Initialize the ui elements for the management part . | 79 | 11 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.