Match Group 0 of size 1+2 ---- Ranked Result: ---- Match Group 1 of size 3+14 ---- Ranked Result: ---- Match Group 2 of size 1+1 ---- Ranked Result: ---- Match Group 3 of size 1+9 ---- Ranked Result: ---- Match Group 4 of size 3+4 ---- Ranked Result: ---- Match Group 5 of size 1+15 ---- Ranked Result: ---- Match Group 6 of size 1+6 ---- Ranked Result: ---- Match Group 7 of size 1+1 ---- Ranked Result: ---- Match Group 8 of size 1+1 ---- Ranked Result: ---- Match Group 9 of size 2+1 ---- Ranked Result: ---- Match Group 10 of size 1+1 ---- Ranked Result: ---- Match Group 11 of size 1+6 ---- Ranked Result: ---- Match Group 12 of size 1+7 ---- Ranked Result: ---- Match Group 13 of size 1+4 ---- Ranked Result: ---- Match Group 14 of size 2+2 ---- Ranked Result: ---- Match Group 15 of size 1+1 ---- Ranked Result: ---- Match Group 16 of size 1+1 ---- Ranked Result: ---- Match Group 17 of size 1+1 ---- Ranked Result: 1. (size 13) Something has happened to the data that may have invalidated the row order. 2. (size 78) The last check, for (modelToView != null) is to see if modelToView is already allocated. If we don't do this check; sorting can become a performance bottleneck for applications where cells change rapidly in different parts of the table. If cells change alternately in the sorting column and then outside of it this class can end up re-sorting on alternate cell updates - which can be a performance problem for large tables. The last clause avoids this problem. ---- /home/edmund/evaluate_projects/freemind/accessories/plugins/time/TableSorter.java: 367-410 Length: 8 when the following conditions apply: a) all the changes are on one row (e.getFirstRow() == e.getLastRow()) and, b) all the changes are in one column (column != TableModelEvent.ALL_COLUMNS) and, c) we are not sorting on that column (getSortingStatus(column) == NOT_SORTED) and, d) a reverse lookup will not trigger a sort (modelToView != null) Note: INSERT and DELETE events fail this test as they have column == ALL_COLUMNS. The last check, for (modelToView != null) is to see if modelToView is already allocated. If we don't do this check; sorting can become a performance bottleneck for applications where cells change rapidly in different parts of the table. If cells change alternately in the sorting column and then outside of it this class can end up re-sorting on alternate cell updates - which can be a performance problem for large tables. The last clause avoids this problem. Something has happened to the data that may have invalidated the row order. * cancelSorting(); * fireTableChanged(e); * return; * } * * // We can map a cell event through to the view without widening * // when the following conditions apply: * // * // a) all the changes are on one row (e.getFirstRow() == * // e.getLastRow()) and, * // b) all the changes are in one column (column != * // TableModelEvent.ALL_COLUMNS) and, * // c) we are not sorting on that column (getSortingStatus(column) == * // NOT_SORTED) and, * // d) a reverse lookup will not trigger a sort (modelToView != null) * // * // Note: INSERT and DELETE events fail this test as they have column * // == ALL_COLUMNS. * // * // The last check, for (modelToView != null) is to see if * // modelToView * // is already allocated. If we don't do this check; sorting can * // become * // a performance bottleneck for applications where cells * // change rapidly in different parts of the table. If cells * // change alternately in the sorting column and then outside of * // it this class can end up re-sorting on alternate cell updates - * // which can be a performance problem for large tables. The last * // clause avoids this problem. * int column = e.getColumn(); * if (e.getFirstRow() == e.getLastRow() * && column != TableModelEvent.ALL_COLUMNS * && getSortingStatus(column) == NOT_SORTED * && modelToView != null) { * int viewIndex = getModelToView()[e.getFirstRow()]; * fireTableChanged(new TableModelEvent(TableSorter.this, * viewIndex, viewIndex, column, e.getType())); * return; * } * * // Something has happened to the data that may have invalidated the * // row order. * clearSortingState(); * fireTableDataChanged(); ---- /home/edmund/database-mana/databaseGitHub/voltdb/src/hsqldb19b3/org/hsqldb_voltpatches/util/TableSorter.java: 413-454 Length: 8 local sim: [[view, last, sorting, column, model, to, table], [data, row]] global sim: [[], []] [modelToView] The last check, for (modelToView != null) is to see if modelToView is already allocated. If we don't do this check; sorting can become a performance bottleneck for applications where cells change rapidly in different parts of the table. If cells change alternately in the sorting column and then outside of it this class can end up re-sorting on alternate cell updates - which can be a performance problem for large tables. The last clause avoids this problem. Something has happened to the data that may have invalidated the row order. < cancelSorting(); < fireTableChanged(e); < < return; < } < < // We can map a cell event through to the view without widening < // when the following conditions apply: < // < // a) all the changes are on one row (e.getFirstRow() == e.getLastRow()) and, < // b) all the changes are in one column (column != TableModelEvent.ALL_COLUMNS) and, < // c) we are not sorting on that column (getSortingStatus(column) == NOT_SORTED) and, < // d) a reverse lookup will not trigger a sort (modelToView != null) < // < // Note: INSERT and DELETE events fail this test as they have column == ALL_COLUMNS. < // < // The last check, for (modelToView != null) is to see if modelToView < // is already allocated. If we don't do this check; sorting can become < // a performance bottleneck for applications where cells < // change rapidly in different parts of the table. If cells < // change alternately in the sorting column and then outside of < // it this class can end up re-sorting on alternate cell updates - < // which can be a performance problem for large tables. The last < // clause avoids this problem. < int column = e.getColumn(); < < if (e.getFirstRow() == e.getLastRow() < && column != TableModelEvent.ALL_COLUMNS < && getSortingStatus(column) == NOT_SORTED < && modelToView != null) { < int viewIndex = getModelToView()[e.getFirstRow()]; < < fireTableChanged(new TableModelEvent(TableSorter.this, < viewIndex, viewIndex, < column, e.getType())); < < return; < } < < // Something has happened to the data that may have invalidated the row order. < clearSortingState(); < fireTableDataChanged(); ---- Comments (size 2): 1. The last check, for (modelToView != null) is to see if modelToView is already allocated. If we don't do this check; sorting can become a performance bottleneck for applications where cells change rapidly in different parts of the table. If cells change alternately in the sorting column and then outside of it this class can end up re-sorting on alternate cell updates - which can be a performance problem for large tables. The last clause avoids this problem. 2. Something has happened to the data that may have invalidated the row order. ---- Match Group 18 of size 1+1 ---- Ranked Result: ---- Match Group 19 of size 1+1 ---- Ranked Result: ---- Match Group 20 of size 2+9 ---- Ranked Result: ---- Match Group 21 of size 1+4 ---- Ranked Result: ---- Match Group 22 of size 1+25 ---- Ranked Result: ---- Match Group 23 of size 1+1 ---- Ranked Result: ---- Match Group 24 of size 1+1 ---- Ranked Result: 1. (size 6) prepare the parameter to the ciphers ---- /home/edmund/evaluate_projects/freemind/freemind/main/Tools.java: 714-719 Length: 3 Prepare the parameter to the ciphers Create the ciphers * AlgorithmParameterSpec paramSpec = new PBEParameterSpec( * salt, iterationCount); * * // Create the ciphers * ecipher.init(Cipher.ENCRYPT_MODE, key, paramSpec); * dcipher.init(Cipher.DECRYPT_MODE, key, paramSpec); ---- /home/edmund/database-mana/databaseGitHub/jodd/jodd-joy/src/main/java/jodd/joy/crypt/SymmetricEncryptor.java: 50-54 Length: 3 local sim: [[parameter]] global sim: [[]] prepare the parameter to the ciphers < AlgorithmParameterSpec paramSpec = new PBEParameterSpec(salt, iterationCount); < < // create the ciphers < ecipher.init(Cipher.ENCRYPT_MODE, key, paramSpec); < dcipher.init(Cipher.DECRYPT_MODE, key, paramSpec); ---- Comments (size 1): 1. prepare the parameter to the ciphers ---- Match Group 25 of size 1+5 ---- Ranked Result: ---- Match Group 26 of size 1+4 ---- Ranked Result: 1. (size 1) entry ---- /home/edmund/evaluate_projects/freemind/freemind/extensions/ImportWizard.java: 129-131 Length: 3 * while (enumeration.hasMoreElements()) { * ZipEntry zipEntry = (ZipEntry) enumeration.nextElement(); * String current = zipEntry.getName(); ---- /home/edmund/database-mana/databaseGitHub/otter/node/etl/src/main/java/com/alibaba/otter/node/etl/common/pipe/impl/http/archive/ArchiveBean.java: 291-294 Length: 3 local sim: [[entry]] global sim: [[]] entry < while (entries.hasMoreElements()) { < // entry < ZipEntry entry = (ZipEntry) entries.nextElement(); < String entryName = entry.getName(); ---- Comments (size 1): 1. entry ---- Match Group 27 of size 1+2 ---- Ranked Result: ---- Match Group 28 of size 3+7 ---- Ranked Result: ---- Match Group 29 of size 1+2 ---- Ranked Result: ---- Match Group 30 of size 1+3 ---- Ranked Result: 1. (size 7) wait until the thread queue gets freed ---- /home/edmund/evaluate_projects/freemind/plugins/map/Registration.java: 289-292 Length: 3 * break; * } * Thread.sleep(100); * } catch (Exception e) { ---- /home/edmund/database-mana/databaseGitHub/dsploit/dSploit/src/it/evilsocket/dsploit/net/NetworkDiscovery.java: 412-419 Length: 3 local sim: [[thread]] global sim: [[]] wait until the thread queue gets freed < break; < } < } < } < < Thread.sleep(1000); < } < catch(Exception e){ } ---- Comments (size 1): 1. wait until the thread queue gets freed ---- Match Group 31 of size 1+2 ---- Ranked Result: ---- Match Group 32 of size 1+3 ---- Ranked Result: ---- Match Group 33 of size 1+5 ---- Ranked Result: ---- Match Group 34 of size 1+3 ---- Ranked Result: ---- Match Group 35 of size 2+2 ---- Ranked Result: ---- Match Group 36 of size 1+2 ---- Ranked Result: ---- Match Group 37 of size 1+6 ---- Ranked Result: ---- Match Group 38 of size 1+1 ---- Ranked Result: ---- Match Group 39 of size 2+3 ---- Ranked Result: ---- Match Group 40 of size 1+1 ---- Ranked Result: ---- Match Group 41 of size 1+20 ---- Ranked Result: ---- Match Group 42 of size 1+1 ---- Ranked Result: ---- Match Group 43 of size 1+2 ---- Ranked Result: ---- Match Group 44 of size 1+1 ---- Ranked Result: ---- Match Group 45 of size 1+1 ---- Ranked Result: ---- Match Group 46 of size 1+1 ---- Ranked Result: ---- Match Group 47 of size 1+1 ---- Ranked Result: ---- Match Group 48 of size 1+2 ---- Ranked Result: ---- Match Group 49 of size 1+2 ---- Ranked Result: ---- Match Group 50 of size 2+3 ---- Ranked Result: ---- Match Group 51 of size 1+1 ---- Ranked Result: ---- Match Group 52 of size 1+1 ---- Ranked Result: 1. (size 11) The extension of the file" @param f File @return file extension ---- /home/edmund/evaluate_projects/freemind/freemind/main/ExampleFileFilter.java: 178-185 Length: 4 Return the extension portion of the file's name . * /** * * Return the extension portion of the file's name . * * * */ * public String getExtension(File f) { * if (f != null) { * String filename = f.getName(); * int i = filename.lastIndexOf('.'); ---- /home/edmund/database-mana/databaseGitHub/jitsi/src/net/java/sip/communicator/plugin/whiteboard/gui/WhiteboardFileFilter.java: 79-87 Length: 4 local sim: [[extension, file]] global sim: [[]] The extension of the file" @param f File @return file extension < /** < * The extension of the file" < * @param f File < * @return file extension < */ < public String getExtension (File f) { < if (f != null) { < String filename = f.getName (); < int i = filename.lastIndexOf ('.'); ---- Comments (size 1): 1. The extension of the file" @param f File @return file extension ---- Match Group 53 of size 2+11 ---- Ranked Result: ---- Match Group 54 of size 1+3 ---- Ranked Result: ---- Match Group 55 of size 1+8 ---- Ranked Result: ---- Match Group 56 of size 1+3 ---- Ranked Result: ---- Match Group 57 of size 1+4 ---- Ranked Result: ---- Match Group 58 of size 1+2 ---- Ranked Result: ---- Match Group 59 of size 1+12 ---- Ranked Result: ---- Match Group 60 of size 1+1 ---- Ranked Result: ---- Match Group 61 of size 1+4 ---- Ranked Result: ---- Match Group 62 of size 1+1 ---- Ranked Result: ---- Match Group 63 of size 1+1 ---- Ranked Result: ---- Match Group 64 of size 1+4 ---- Ranked Result: ---- Match Group 65 of size 1+3 ---- Ranked Result: ---- Match Group 66 of size 1+3 ---- Ranked Result: 1. (size 12) Returns the preferred size. @param parent the parent. @return the preferred size. ---- /home/edmund/evaluate_projects/freemind/freemind/preferences/layout/VariableSizeCardLayout.java: 42-55 Length: 3 Determines the preferred size of the container argument using this card layout. @param parent the parent container in which to do the layout @return the preferred dimensions to lay out the subcomponents of the specified container @see java.awt.Container#getPreferredSize @see java.awt.CardLayout#minimumLayoutSize * /** * * Determines the preferred size of the container argument using this card * * layout. * * * * @param parent * * the parent container in which to do the layout * * @return the preferred dimensions to lay out the subcomponents of the * * specified container * * @see java.awt.Container#getPreferredSize * * @see java.awt.CardLayout#minimumLayoutSize * */ * public Dimension preferredLayoutSize(Container parent) { * synchronized (parent.getTreeLock()) { * Insets insets = parent.getInsets(); ---- /home/edmund/database-mana/databaseGitHub/mdrill/trunk/adhoc-internal/src/main/java/org/jfree/layout/CenterLayout.java: 70-80 Length: 3 local sim: [[parent, size, preferred]] global sim: [[]] Returns the preferred size. @param parent the parent. @return the preferred size. < /** < * Returns the preferred size. < * < * @param parent the parent. < * < * @return the preferred size. < */ < public Dimension preferredLayoutSize(final Container parent) { < < synchronized (parent.getTreeLock()) { < final Insets insets = parent.getInsets(); ---- Comments (size 1): 1. Returns the preferred size. @param parent the parent. @return the preferred size. ---- Match Group 67 of size 1+1 ---- Ranked Result: 1. (size 20) Returns the preferred size using this layout manager. @param parent the parent. @return the preferred size using this layout manager. ---- /home/edmund/evaluate_projects/freemind/freemind/preferences/layout/VariableSizeCardLayout.java: 42-56 Length: 4 Determines the preferred size of the container argument using this card layout. @param parent the parent container in which to do the layout @return the preferred dimensions to lay out the subcomponents of the specified container @see java.awt.Container#getPreferredSize @see java.awt.CardLayout#minimumLayoutSize * /** * * Determines the preferred size of the container argument using this card * * layout. * * * * @param parent * * the parent container in which to do the layout * * @return the preferred dimensions to lay out the subcomponents of the * * specified container * * @see java.awt.Container#getPreferredSize * * @see java.awt.CardLayout#minimumLayoutSize * */ * public Dimension preferredLayoutSize(Container parent) { * synchronized (parent.getTreeLock()) { * Insets insets = parent.getInsets(); * int ncomponents = parent.getComponentCount(); ---- /home/edmund/database-mana/databaseGitHub/mdrill/trunk/adhoc-internal/src/main/java/org/jfree/layout/LCBLayout.java: 93-104 Length: 4 local sim: [[layout, parent, size, preferred]] global sim: [[]] Returns the preferred size using this layout manager. @param parent the parent. @return the preferred size using this layout manager. < /** < * Returns the preferred size using this layout manager. < * < * @param parent the parent. < * < * @return the preferred size using this layout manager. < */ < public Dimension preferredLayoutSize(final Container parent) { < < synchronized (parent.getTreeLock()) { < final Insets insets = parent.getInsets(); < final int ncomponents = parent.getComponentCount(); ---- Comments (size 1): 1. Returns the preferred size using this layout manager. @param parent the parent. @return the preferred size using this layout manager. ---- Match Group 68 of size 1+2 ---- Ranked Result: ---- Match Group 69 of size 1+1 ---- Ranked Result: ---- Match Group 70 of size 1+1 ---- Ranked Result: ---- Match Group 71 of size 1+2 ---- Ranked Result: ---- Match Group 72 of size 1+2 ---- Ranked Result: ---- Match Group 73 of size 1+1 ---- Ranked Result: ---- Match Group 74 of size 1+3 ---- Ranked Result: ---- Match Group 75 of size 1+1 ---- Ranked Result: ---- Match Group 76 of size 1+2 ---- Ranked Result: ---- Match Group 77 of size 1+4 ---- Ranked Result: ---- Match Group 78 of size 1+4 ---- Ranked Result: ---- Match Group 79 of size 1+4 ---- Ranked Result: 1. (size 3) Remove temporary file. ---- /home/edmund/evaluate_projects/freemind/freemind/modes/mindmapmode/MindMapMapModel.java: 700-702 Length: 3 * if (lockedSemaphoreFile != null) { * lockedSemaphoreFile.delete(); * lockedSemaphoreFile = null; ---- /home/edmund/database-mana/databaseGitHub/android-async-http/sample/src/main/java/com/loopj/android/http/sample/RangeResponseSample.java: 73-75 Length: 3 local sim: [[file]] global sim: [[]] Remove temporary file. < if (file != null) { < file.delete(); < file = null; ---- Comments (size 1): 1. Remove temporary file. ---- Match Group 80 of size 1+1 ---- Ranked Result: ---- Match Group 81 of size 1+1 ---- Ranked Result: ---- Match Group 82 of size 1+1 ---- Ranked Result: ---- Match Group 83 of size 1+1 ---- Ranked Result: ---- Match Group 84 of size 1+1 ---- Ranked Result: ---- Match Group 85 of size 1+1 ---- Ranked Result: ---- Match Group 86 of size 1+1 ---- Ranked Result: ---- Match Group 87 of size 1+1 ---- Ranked Result: ---- Match Group 88 of size 1+1 ---- Ranked Result: ---- Match Group 89 of size 1+1 ---- Ranked Result: ---- Match Group 90 of size 1+1 ---- Ranked Result: ---- Number of internal clones: 1.0 median, 1.0 average, 8 total. Number of external clones: 2.0 median, 2.25 average, 18 total. InternalMap: {1=8} ExternalMap: {1=4, 3=2, 4=2} 8 comment groups has a comment Elapsed for 8 minutes Finish @ 09:10:13 AM graceful exit...