idx int64 0 41.2k | question stringlengths 83 4.15k | target stringlengths 5 715 |
|---|---|---|
32,400 | private static List < JoinNode > generateOuterJoinOrdersForTree ( JoinNode subTree ) { List < JoinNode > treePermutations = new ArrayList < > ( ) ; treePermutations . add ( subTree ) ; return treePermutations ; } | Helper method to generate join orders for an OUTER join tree . At the moment permutations for LEFT Joins are not supported yet |
32,401 | private static List < JoinNode > generateFullJoinOrdersForTree ( JoinNode subTree ) { assert ( subTree != null ) ; List < JoinNode > joinOrders = new ArrayList < > ( ) ; if ( ! ( subTree instanceof BranchNode ) ) { joinOrders . add ( subTree ) ; return joinOrders ; } BranchNode branchNode = ( BranchNode ) subTree ; ass... | Helper method to generate join orders for a join tree containing only FULL joins . The only allowed permutation is a join order that has original left and right nodes swapped . |
32,402 | private void generateMorePlansForJoinTree ( JoinNode joinTree ) { assert ( joinTree != null ) ; generateAccessPaths ( joinTree ) ; List < JoinNode > nodes = joinTree . generateAllNodesJoinOrder ( ) ; generateSubPlanForJoinNodeRecursively ( joinTree , 0 , nodes ) ; } | Given a specific join order compute all possible sub - plan - graphs for that join order and add them to the deque of plans . If this doesn t add plans it doesn t mean no more plans can be generated . It s possible that the particular join order it got had no reasonable plans . |
32,403 | private void generateInnerAccessPaths ( BranchNode parentNode ) { JoinNode innerChildNode = parentNode . getRightNode ( ) ; assert ( innerChildNode != null ) ; if ( parentNode . getJoinType ( ) == JoinType . INNER ) { parentNode . m_joinInnerOuterList . addAll ( parentNode . m_whereInnerOuterList ) ; parentNode . m_whe... | Generate all possible access paths for an inner node in a join . The set of potential index expressions depends whether the inner node can be inlined with the NLIJ or not . In the former case inner and inner - outer join expressions can be considered for the index access . In the latter only inner join expressions qual... |
32,404 | private AbstractPlanNode getSelectSubPlanForJoinNode ( JoinNode joinNode ) { assert ( joinNode != null ) ; if ( joinNode instanceof BranchNode ) { BranchNode branchJoinNode = ( BranchNode ) joinNode ; AbstractPlanNode outerScanPlan = getSelectSubPlanForJoinNode ( branchJoinNode . getLeftNode ( ) ) ; if ( outerScanPlan ... | Given a specific join node and access path set for inner and outer tables construct the plan that gives the right tuples . |
32,405 | private static List < AbstractExpression > filterSingleTVEExpressions ( List < AbstractExpression > exprs , List < AbstractExpression > otherExprs ) { List < AbstractExpression > singleTVEExprs = new ArrayList < > ( ) ; for ( AbstractExpression expr : exprs ) { List < TupleValueExpression > tves = ExpressionUtil . getT... | A method to filter out single - TVE expressions . |
32,406 | public void notifyShutdown ( ) { if ( m_shutdown . compareAndSet ( false , true ) ) { for ( KafkaExternalConsumerRunner consumer : m_consumers ) { consumer . shutdown ( ) ; } close ( ) ; } } | shutdown hook to notify kafka consumer threads of shutdown |
32,407 | protected void runDDL ( String ddl , boolean transformDdl ) { String modifiedDdl = ( transformDdl ? transformDDL ( ddl ) : ddl ) ; printTransformedSql ( ddl , modifiedDdl ) ; super . runDDL ( modifiedDdl ) ; } | Optionally modifies DDL statements in such a way that PostgreSQL results will match VoltDB results ; and then passes the remaining work to the base class version . |
32,408 | protected String getVoltColumnTypeName ( String columnTypeName ) { String equivalentTypeName = m_PostgreSQLTypeNames . get ( columnTypeName ) ; return ( equivalentTypeName == null ) ? columnTypeName . toUpperCase ( ) : equivalentTypeName ; } | Returns the column type name in VoltDB corresponding to the specified column type name in PostgreSQL . |
32,409 | static private int numOccurencesOfCharIn ( String str , char ch ) { boolean inMiddleOfQuote = false ; int num = 0 , previousIndex = 0 ; for ( int index = str . indexOf ( ch ) ; index >= 0 ; index = str . indexOf ( ch , index + 1 ) ) { if ( hasOddNumberOfSingleQuotes ( str . substring ( previousIndex , index ) ) ) { inM... | Returns the number of occurrences of the specified character in the specified String but ignoring those contained in single quotes . |
32,410 | static private int indexOfNthOccurrenceOfCharIn ( String str , char ch , int n ) { boolean inMiddleOfQuote = false ; int index = - 1 , previousIndex = 0 ; for ( int i = 0 ; i < n ; i ++ ) { do { index = str . indexOf ( ch , index + 1 ) ; if ( index < 0 ) { return - 1 ; } if ( hasOddNumberOfSingleQuotes ( str . substrin... | Returns the Nth occurrence of the specified character in the specified String but ignoring those contained in single quotes . |
32,411 | protected VoltTable runDML ( String dml , boolean transformDml ) { String modifiedDml = ( transformDml ? transformDML ( dml ) : dml ) ; printTransformedSql ( dml , modifiedDml ) ; return super . runDML ( modifiedDml ) ; } | Optionally modifies queries in such a way that PostgreSQL results will match VoltDB results ; and then passes the remaining work to the base class version . |
32,412 | static int getClassCode ( Class cla ) { if ( ! cla . isPrimitive ( ) ) { return ArrayUtil . CLASS_CODE_OBJECT ; } return classCodeMap . get ( cla , - 1 ) ; } | Returns a distinct int code for each primitive type and for all Object types . |
32,413 | public static void clearArray ( int type , Object data , int from , int to ) { switch ( type ) { case ArrayUtil . CLASS_CODE_BYTE : { byte [ ] array = ( byte [ ] ) data ; while ( -- to >= from ) { array [ to ] = 0 ; } return ; } case ArrayUtil . CLASS_CODE_CHAR : { byte [ ] array = ( byte [ ] ) data ; while ( -- to >= ... | Clears an area of the given array of the given type . |
32,414 | public static void adjustArray ( int type , Object array , int usedElements , int index , int count ) { if ( index >= usedElements ) { return ; } int newCount = usedElements + count ; int source ; int target ; int size ; if ( count >= 0 ) { source = index ; target = index + count ; size = usedElements - index ; } else ... | Moves the contents of an array to allow both addition and removal of elements . Used arguments must be in range . |
32,415 | public static void sortArray ( int [ ] array ) { boolean swapped ; do { swapped = false ; for ( int i = 0 ; i < array . length - 1 ; i ++ ) { if ( array [ i ] > array [ i + 1 ] ) { int temp = array [ i + 1 ] ; array [ i + 1 ] = array [ i ] ; array [ i ] = temp ; swapped = true ; } } } while ( swapped ) ; } | Basic sort for small arrays of int . |
32,416 | public static int find ( Object [ ] array , Object object ) { for ( int i = 0 ; i < array . length ; i ++ ) { if ( array [ i ] == object ) { return i ; } if ( object != null && object . equals ( array [ i ] ) ) { return i ; } } return - 1 ; } | Basic find for small arrays of Object . |
32,417 | public static int findNot ( int [ ] array , int value ) { for ( int i = 0 ; i < array . length ; i ++ ) { if ( array [ i ] != value ) { return i ; } } return - 1 ; } | Finds the first element of the array that is not equal to the given value . |
32,418 | public static boolean areEqualSets ( int [ ] arra , int [ ] arrb ) { return arra . length == arrb . length && ArrayUtil . haveEqualSets ( arra , arrb , arra . length ) ; } | Returns true if arra and arrb contain the same set of integers not necessarily in the same order . This implies the arrays are of the same length . |
32,419 | public static boolean haveEqualArrays ( int [ ] arra , int [ ] arrb , int count ) { if ( count > arra . length || count > arrb . length ) { return false ; } for ( int j = 0 ; j < count ; j ++ ) { if ( arra [ j ] != arrb [ j ] ) { return false ; } } return true ; } | Returns true if the first count elements of arra and arrb are identical subarrays of integers |
32,420 | public static boolean haveEqualArrays ( Object [ ] arra , Object [ ] arrb , int count ) { if ( count > arra . length || count > arrb . length ) { return false ; } for ( int j = 0 ; j < count ; j ++ ) { if ( arra [ j ] != arrb [ j ] ) { if ( arra [ j ] == null || ! arra [ j ] . equals ( arrb [ j ] ) ) { return false ; }... | Returns true if the first count elements of arra and arrb are identical subarrays of Objects |
32,421 | public static int countSameElements ( byte [ ] arra , int start , byte [ ] arrb ) { int k = 0 ; int limit = arra . length - start ; if ( limit > arrb . length ) { limit = arrb . length ; } for ( int i = 0 ; i < limit ; i ++ ) { if ( arra [ i + start ] == arrb [ i ] ) { k ++ ; } else { break ; } } return k ; } | Returns the count of elements in arra from position start that are sequentially equal to the elements of arrb . |
32,422 | public static int find ( byte [ ] arra , int start , int limit , byte [ ] arrb ) { int k = start ; limit = limit - arrb . length + 1 ; int value = arrb [ 0 ] ; for ( ; k < limit ; k ++ ) { if ( arra [ k ] == value ) { if ( arrb . length == 1 ) { return k ; } if ( containsAt ( arra , k , arrb ) ) { return k ; } } } retu... | Returns the index of the first occurence of arrb in arra . Or - 1 if not found . |
32,423 | public static int find ( byte [ ] arra , int start , int limit , int b , int c ) { int k = 0 ; for ( ; k < limit ; k ++ ) { if ( arra [ k ] == b || arra [ k ] == c ) { return k ; } } return - 1 ; } | Returns the index of b or c in arra . Or - 1 if not found . |
32,424 | public static void intIndexesToBooleanArray ( int [ ] arra , boolean [ ] arrb ) { for ( int i = 0 ; i < arra . length ; i ++ ) { if ( arra [ i ] < arrb . length ) { arrb [ arra [ i ] ] = true ; } } } | Set elements of arrb true if their indexes appear in arrb . |
32,425 | public static boolean containsAllTrueElements ( boolean [ ] arra , boolean [ ] arrb ) { for ( int i = 0 ; i < arra . length ; i ++ ) { if ( arrb [ i ] && ! arra [ i ] ) { return false ; } } return true ; } | Return true if for each true element in arrb the corresponding element in arra is true |
32,426 | public static int countTrueElements ( boolean [ ] arra ) { int count = 0 ; for ( int i = 0 ; i < arra . length ; i ++ ) { if ( arra [ i ] ) { count ++ ; } } return count ; } | Return count of true elements in array |
32,427 | public static boolean hasNull ( Object [ ] array , int [ ] columnMap ) { int count = columnMap . length ; for ( int i = 0 ; i < count ; i ++ ) { if ( array [ columnMap [ i ] ] == null ) { return true ; } } return false ; } | Determines if the array has a null column for any of the positions given in the rowColMap array . |
32,428 | public static boolean containsAt ( byte [ ] arra , int start , byte [ ] arrb ) { return countSameElements ( arra , start , arrb ) == arrb . length ; } | Returns true if arra from position start contains all elements of arrb in sequential order . |
32,429 | public static int countStartElementsAt ( byte [ ] arra , int start , byte [ ] arrb ) { int k = 0 ; mainloop : for ( int i = start ; i < arra . length ; i ++ ) { for ( int j = 0 ; j < arrb . length ; j ++ ) { if ( arra [ i ] == arrb [ j ] ) { k ++ ; continue mainloop ; } } break ; } return k ; } | Returns the count of elements in arra from position start that are among the elements of arrb . Stops at any element not in arrb . |
32,430 | public static int [ ] arraySlice ( int [ ] source , int start , int count ) { int [ ] slice = new int [ count ] ; System . arraycopy ( source , start , slice , 0 , count ) ; return slice ; } | Returns a range of elements of source from start to end of the array . |
32,431 | public static void fillArray ( Object [ ] array , Object value ) { int to = array . length ; while ( -- to >= 0 ) { array [ to ] = value ; } } | Fills the array with a value . |
32,432 | public static Object duplicateArray ( Object source ) { int size = Array . getLength ( source ) ; Object newarray = Array . newInstance ( source . getClass ( ) . getComponentType ( ) , size ) ; System . arraycopy ( source , 0 , newarray , 0 , size ) ; return newarray ; } | Returns a duplicates of an array . |
32,433 | public static Object resizeArrayIfDifferent ( Object source , int newsize ) { int oldsize = Array . getLength ( source ) ; if ( oldsize == newsize ) { return source ; } Object newarray = Array . newInstance ( source . getClass ( ) . getComponentType ( ) , newsize ) ; if ( oldsize < newsize ) { newsize = oldsize ; } Sys... | Returns the given array if newsize is the same as existing . Returns a new array of given size containing as many elements of the original array as it can hold . |
32,434 | public static void copyAdjustArray ( Object source , Object dest , Object addition , int colindex , int adjust ) { int length = Array . getLength ( source ) ; if ( colindex < 0 ) { System . arraycopy ( source , 0 , dest , 0 , length ) ; return ; } System . arraycopy ( source , 0 , dest , 0 , colindex ) ; if ( adjust ==... | Copies elements of source to dest . If adjust is - 1 the element at colindex is not copied . If adjust is + 1 that element is filled with the Object addition . All the rest of the elements in source are shifted left or right accordingly when they are copied . If adjust is 0 the addition is copied over the element at co... |
32,435 | private static ColumnInfo [ ] prependColumn ( ColumnInfo firstColumn , ColumnInfo [ ] columns ) { int allLen = 1 + columns . length ; ColumnInfo [ ] allColumns = new ColumnInfo [ allLen ] ; allColumns [ 0 ] = firstColumn ; for ( int i = 0 ; i < columns . length ; i ++ ) { allColumns [ i + 1 ] = columns [ i ] ; } return... | Given a column and an array of columns return a new array of columns with the single guy prepended onto the others . This function is used in the constructor below so that one constructor can call another without breaking Java rules about chained constructors being the first thing called . |
32,436 | public final String getColumnName ( int index ) { assert ( verifyTableInvariants ( ) ) ; if ( ( index < 0 ) || ( index >= m_colCount ) ) { throw new IllegalArgumentException ( "Not a valid column index." ) ; } int pos = POS_COL_TYPES + m_colCount ; String name = null ; for ( int i = 0 ; i < index ; i ++ ) { pos += m_bu... | Return the name of the column with the specified index . |
32,437 | public final void addRow ( Object ... values ) { assert ( verifyTableInvariants ( ) ) ; if ( m_readOnly ) { throw new IllegalStateException ( "Table is read-only. Make a copy before changing." ) ; } if ( m_colCount == 0 ) { throw new IllegalStateException ( "Table has no columns defined" ) ; } if ( values . length != m... | Append a new row to the table using the supplied column values . |
32,438 | public static String varbinaryToPrintableString ( byte [ ] bin ) { PureJavaCrc32 crc = new PureJavaCrc32 ( ) ; StringBuilder sb = new StringBuilder ( ) ; sb . append ( "bin[crc:" ) ; crc . update ( bin ) ; sb . append ( crc . getValue ( ) ) ; sb . append ( ",value:0x" ) ; String hex = Encoder . hexEncode ( bin ) ; if (... | Make a printable short string for a varbinary . String includes a CRC and the contents of the varbinary in hex . Contents longer than 13 chars are truncated and elipsized . Yes elipsized is totally a word . |
32,439 | public String toJSONString ( ) { JSONStringer js = new JSONStringer ( ) ; try { js . object ( ) ; js . keySymbolValuePair ( JSON_STATUS_KEY , getStatusCode ( ) ) ; js . key ( JSON_SCHEMA_KEY ) . array ( ) ; for ( int i = 0 ; i < getColumnCount ( ) ; i ++ ) { js . object ( ) ; js . keySymbolValuePair ( JSON_NAME_KEY , g... | Get a JSON representation of this table . |
32,440 | public static VoltTable fromJSONString ( String json ) throws JSONException , IOException { JSONObject jsonObj = new JSONObject ( json ) ; return fromJSONObject ( jsonObj ) ; } | Construct a table from a JSON string . Only parses VoltDB VoltTable JSON format . |
32,441 | VoltTable semiDeepCopy ( ) { assert ( verifyTableInvariants ( ) ) ; final VoltTable cloned = new VoltTable ( m_extraMetadata ) ; cloned . m_colCount = m_colCount ; cloned . m_rowCount = m_rowCount ; cloned . m_rowStart = m_rowStart ; cloned . m_buffer = m_buffer . duplicate ( ) ; cloned . m_activeRowIndex = m_activeRow... | Non - public method to duplicate a table . It s possible this might be useful to end - users of VoltDB but we should talk about naming and semantics first don t just make this public . |
32,442 | public ColumnInfo [ ] getTableSchema ( ) { ColumnInfo [ ] schema = new ColumnInfo [ m_colCount ] ; for ( int i = 0 ; i < m_colCount ; i ++ ) { ColumnInfo col = new ColumnInfo ( getColumnName ( i ) , getColumnType ( i ) ) ; schema [ i ] = col ; } return schema ; } | Get the schema of the table . Can be fed into another table s constructor . |
32,443 | public void checkProcessorConfig ( Properties properties ) { String exportClientClass = properties . getProperty ( EXPORT_TO_TYPE ) ; Preconditions . checkNotNull ( exportClientClass , "export to type is undefined or custom export plugin class missing." ) ; try { final Class < ? > clientClass = Class . forName ( export... | Pass processor specific processor configuration properties for checking |
32,444 | private long extractCommittedSpHandle ( ExportRow row , long committedSeqNo ) { long ret = 0 ; if ( committedSeqNo == ExportDataSource . NULL_COMMITTED_SEQNO ) { return ret ; } long seqNo = ( long ) row . values [ 2 ] ; if ( seqNo != committedSeqNo ) { return ret ; } ret = ( long ) row . values [ 0 ] ; return ret ; } | If the row is the last committed row return the SpHandle otherwise return 0 |
32,445 | public void processMaterializedViewWarnings ( Database db , HashMap < Table , String > matViewMap ) throws VoltCompilerException { for ( Table table : db . getTables ( ) ) { for ( MaterializedViewInfo mvInfo : table . getViews ( ) ) { for ( Statement stmt : mvInfo . getFallbackquerystmts ( ) ) { if ( needsWarningForSin... | Process materialized view warnings . |
32,446 | public static MaterializedViewInfo getMaterializedViewInfo ( Table tbl ) { MaterializedViewInfo mvInfo = null ; Table source = tbl . getMaterializer ( ) ; if ( source != null ) { mvInfo = source . getViews ( ) . get ( tbl . getTypeName ( ) ) ; } return mvInfo ; } | If the argument table is a single - table materialized view then return the attendant MaterializedViewInfo object . Otherwise return null . |
32,447 | public static long getFragmentIdForPlanHash ( byte [ ] planHash ) { Sha1Wrapper key = new Sha1Wrapper ( planHash ) ; FragInfo frag = null ; synchronized ( FragInfo . class ) { frag = m_plansByHash . get ( key ) ; } assert ( frag != null ) ; return frag . fragId ; } | Get the site - local fragment id for a given plan identified by 20 - byte sha - 1 hash |
32,448 | public static String getStmtTextForPlanHash ( byte [ ] planHash ) { Sha1Wrapper key = new Sha1Wrapper ( planHash ) ; FragInfo frag = null ; synchronized ( FragInfo . class ) { frag = m_plansByHash . get ( key ) ; } assert ( frag != null ) ; assert ( frag . stmtText != null ) ; return frag . stmtText ; } | Get the statement text for the fragment identified by its hash |
32,449 | public static long loadOrAddRefPlanFragment ( byte [ ] planHash , byte [ ] plan , String stmtText ) { Sha1Wrapper key = new Sha1Wrapper ( planHash ) ; synchronized ( FragInfo . class ) { FragInfo frag = m_plansByHash . get ( key ) ; if ( frag == null ) { frag = new FragInfo ( key , plan , m_nextFragId ++ , stmtText ) ;... | Get the site - local fragment id for a given plan identified by 20 - byte sha - 1 hash If the plan isn t known to this SPC load it up . Otherwise addref it . |
32,450 | public static byte [ ] planForFragmentId ( long fragmentId ) { assert ( fragmentId > 0 ) ; FragInfo frag = null ; synchronized ( FragInfo . class ) { frag = m_plansById . get ( fragmentId ) ; } assert ( frag != null ) ; return frag . plan ; } | Get the full JSON plan associated with a given site - local fragment id . Called by the EE |
32,451 | public List < AbstractExpression > bindingToIndexedExpression ( AbstractExpression expr ) { if ( m_type != expr . m_type ) { return null ; } if ( ! hasEqualAttributes ( expr ) ) { return null ; } if ( ( expr . m_left == null ) != ( m_left == null ) ) { return null ; } if ( ( expr . m_right == null ) != ( m_right == nul... | strict expression equality that didn t involve parameters . |
32,452 | public static void toJSONArrayFromSortList ( JSONStringer stringer , List < AbstractExpression > sortExpressions , List < SortDirectionType > sortDirections ) throws JSONException { stringer . key ( SortMembers . SORT_COLUMNS ) ; stringer . array ( ) ; int listSize = sortExpressions . size ( ) ; for ( int ii = 0 ; ii <... | Given a JSONStringer and a sequence of sort expressions and directions serialize the sort expressions . These will be in an array which is the value of SortMembers . SORT_COLUMNS in the current object of the JSONString . The JSONString should be in object state not array state . |
32,453 | public static void loadSortListFromJSONArray ( List < AbstractExpression > sortExpressions , List < SortDirectionType > sortDirections , JSONObject jobj ) throws JSONException { if ( jobj . has ( SortMembers . SORT_COLUMNS ) ) { sortExpressions . clear ( ) ; if ( sortDirections != null ) { sortDirections . clear ( ) ; ... | Load two lists from a JSONObject . One list is for sort expressions and the other is for sort directions . The lists are cleared before they are filled in . This is the inverse of toJSONArrayFromSortList . |
32,454 | public static List < AbstractExpression > loadFromJSONArrayChild ( List < AbstractExpression > starter , JSONObject parent , String label , StmtTableScan tableScan ) throws JSONException { if ( parent . isNull ( label ) ) { return null ; } JSONArray jarray = parent . getJSONArray ( label ) ; return loadFromJSONArray ( ... | For TVEs it is only serialized column index and table index . In order to match expression there needs more information to revert back the table name table alisa and column name . By adding |
32,455 | public AbstractExpression replaceWithTVE ( Map < AbstractExpression , Integer > aggTableIndexMap , Map < Integer , ParsedColInfo > indexToColumnMap ) { Integer ii = aggTableIndexMap . get ( this ) ; if ( ii != null ) { ParsedColInfo col = indexToColumnMap . get ( ii ) ; TupleValueExpression tve = new TupleValueExpressi... | This function recursively replaces any subexpression matching an entry in aggTableIndexMap with an equivalent TVE . Its column index and alias are also built up here . |
32,456 | public boolean hasAnySubexpressionWithPredicate ( SubexprFinderPredicate pred ) { if ( pred . matches ( this ) ) { return true ; } if ( m_left != null && m_left . hasAnySubexpressionWithPredicate ( pred ) ) { return true ; } if ( m_right != null && m_right . hasAnySubexpressionWithPredicate ( pred ) ) { return true ; }... | Searches the expression tree rooted at this for nodes for which pred evaluates to true . |
32,457 | void refineOperandType ( VoltType valueType ) { if ( m_valueType != VoltType . NUMERIC ) { return ; } if ( valueType == VoltType . DECIMAL ) { m_valueType = VoltType . DECIMAL ; m_valueSize = VoltType . DECIMAL . getLengthInBytesForFixedTypes ( ) ; } else { m_valueType = VoltType . FLOAT ; m_valueSize = VoltType . FLOA... | Helper function to patch up NUMERIC typed constant operands and the functions and operators that they parameterize . |
32,458 | protected final void finalizeChildValueTypes ( ) { if ( m_left != null ) { m_left . finalizeValueTypes ( ) ; updateContentDeterminismMessage ( m_left . getContentDeterminismMessage ( ) ) ; } if ( m_right != null ) { m_right . finalizeValueTypes ( ) ; updateContentDeterminismMessage ( m_right . getContentDeterminismMess... | Do the recursive part of finalizeValueTypes as requested . Note that this updates the content non - determinism state . |
32,459 | protected final void resolveChildrenForTable ( Table table ) { if ( m_left != null ) { m_left . resolveForTable ( table ) ; } if ( m_right != null ) { m_right . resolveForTable ( table ) ; } if ( m_args != null ) { for ( AbstractExpression argument : m_args ) { argument . resolveForTable ( table ) ; } } } | Walk the expression tree resolving TVEs and function expressions as we go . |
32,460 | public boolean isValidExprForIndexesAndMVs ( StringBuffer msg , boolean isMV ) { if ( containsFunctionById ( FunctionSQL . voltGetCurrentTimestampId ( ) ) ) { msg . append ( "cannot include the function NOW or CURRENT_TIMESTAMP." ) ; return false ; } else if ( hasAnySubexpressionOfClass ( AggregateExpression . class ) ... | Return true if the given expression usable as part of an index or MV s group by and where clause expression . If false put the tail of an error message in the string buffer . The string buffer will be initialized with the name of the index . |
32,461 | public static boolean validateExprsForIndexesAndMVs ( List < AbstractExpression > checkList , StringBuffer msg , boolean isMV ) { for ( AbstractExpression expr : checkList ) { if ( ! expr . isValidExprForIndexesAndMVs ( msg , isMV ) ) { return false ; } } return true ; } | Return true if the all of the expressions in the list can be part of an index expression or in group by and where clause of MV . As with validateExprForIndexesAndMVs for individual expression the StringBuffer parameter msg contains the name of the index . Error messages should be appended to it . |
32,462 | private boolean containsFunctionById ( int functionId ) { if ( this instanceof AbstractValueExpression ) { return false ; } List < AbstractExpression > functionsList = findAllFunctionSubexpressions ( ) ; for ( AbstractExpression funcExpr : functionsList ) { assert ( funcExpr instanceof FunctionExpression ) ; if ( ( ( F... | This function will recursively find any function expression with ID functionId . If found return true . Otherwise return false . |
32,463 | public boolean isValueTypeIndexable ( StringBuffer msg ) { if ( ! m_valueType . isIndexable ( ) ) { msg . append ( "expression of type " + m_valueType . getName ( ) ) ; return false ; } return true ; } | Returns true iff the expression is indexable . If the expression is not indexable expression information gets populated in the msg string buffer passed in . |
32,464 | public boolean isValueTypeUniqueIndexable ( StringBuffer msg ) { if ( ! isValueTypeIndexable ( msg ) ) { return false ; } if ( ! m_valueType . isUniqueIndexable ( ) ) { msg . append ( "expression of type " + m_valueType . getName ( ) ) ; return false ; } return true ; } | Returns true iff the expression is indexable in a unique index . If the expression is not indexable expression information gets populated in the msg string buffer passed in . |
32,465 | public void findUnsafeOperatorsForDDL ( UnsafeOperatorsForDDL ops ) { if ( ! m_type . isSafeForDDL ( ) ) { ops . add ( m_type . symbol ( ) ) ; } if ( m_left != null ) { m_left . findUnsafeOperatorsForDDL ( ops ) ; } if ( m_right != null ) { m_right . findUnsafeOperatorsForDDL ( ops ) ; } if ( m_args != null ) { for ( A... | Returns true iff this expression is allowable when creating materialized views on nonempty tables . We have marked all the ExpressionType enumerals and all the function id integers which are safe . These are marked statically . So we just recurse through the tree looking at operation types and function types until we f... |
32,466 | public AbstractExpression getFirstArgument ( ) { if ( m_left != null ) { assert ( m_args == null ) ; return m_left ; } if ( m_args != null && m_args . size ( ) > 0 ) { assert ( m_left == null && m_right == null ) ; return m_args . get ( 0 ) ; } return null ; } | Ferret out the first argument . This can be m_left or else the first element of m_args . |
32,467 | public static byte [ ] getHashedPassword ( ClientAuthScheme scheme , String password ) { if ( password == null ) { return null ; } MessageDigest md = null ; try { md = MessageDigest . getInstance ( ClientAuthScheme . getDigestScheme ( scheme ) ) ; } catch ( NoSuchAlgorithmException e ) { e . printStackTrace ( ) ; Syste... | Get a hashed password using SHA - 1 in a consistent way . |
32,468 | public static Object [ ] getAuthenticatedConnection ( String host , String username , byte [ ] hashedPassword , int port , final Subject subject , ClientAuthScheme scheme , long timeoutMillis ) throws IOException { String service = subject == null ? "database" : Constants . KERBEROS ; return getAuthenticatedConnection ... | Create a connection to a Volt server and authenticate the connection . |
32,469 | public JSONObject getJSONObjectForZK ( ) throws JSONException { final JSONObject jsObj = new JSONObject ( ) ; jsObj . put ( SnapshotUtil . JSON_PATH , m_path ) ; jsObj . put ( SnapshotUtil . JSON_PATH_TYPE , m_stype . toString ( ) ) ; jsObj . put ( SnapshotUtil . JSON_NONCE , m_nonce ) ; jsObj . put ( SnapshotUtil . JS... | When we write to ZK to request the snapshot generate the JSON which will be written to the node s data . |
32,470 | public static DatabaseSizes getCatalogSizes ( Database dbCatalog , boolean isXDCR ) { DatabaseSizes dbSizes = new DatabaseSizes ( ) ; for ( Table table : dbCatalog . getTables ( ) ) { dbSizes . addTable ( getTableSize ( table , isXDCR ) ) ; } return dbSizes ; } | Produce a sizing of all significant database objects . |
32,471 | static public void main ( String [ ] sa ) throws IOException , TarMalformatException { if ( sa . length < 1 ) { System . out . println ( RB . singleton . getString ( RB . TARGENERATOR_SYNTAX , DbBackup . class . getName ( ) ) ) ; System . exit ( 0 ) ; } TarGenerator generator = new TarGenerator ( new File ( sa [ 0 ] ) ... | Creates specified tar file to contain specified files or stdin using default blocks - per - record and replacing tar file if it already exists . |
32,472 | public static byte [ ] fileToBytes ( File path ) throws IOException { FileInputStream fin = new FileInputStream ( path ) ; byte [ ] buffer = new byte [ ( int ) fin . getChannel ( ) . size ( ) ] ; try { if ( fin . read ( buffer ) == - 1 ) { throw new IOException ( "File " + path . getAbsolutePath ( ) + " is empty" ) ; }... | Serialize a file into bytes . Used to serialize catalog and deployment file for UpdateApplicationCatalog on the client . |
32,473 | public VoltTable run ( SystemProcedureExecutionContext ctx , String tableName , String columnName , String compStr , VoltTable parameter , long chunksize ) { return nibbleDeleteCommon ( ctx , tableName , columnName , compStr , parameter , chunksize , true ) ; } | Nibble delete procedure for replicated tables |
32,474 | public byte [ ] read ( ) throws IOException { if ( m_exception . get ( ) != null ) { throw m_exception . get ( ) ; } byte bytes [ ] = null ; if ( m_activeConverters . get ( ) == 0 ) { bytes = m_available . poll ( ) ; } else { try { bytes = m_available . take ( ) ; } catch ( InterruptedException e ) { throw new IOExcept... | Returns a more CSV data in UTF - 8 format . Returns null when there is no more data . May block . |
32,475 | public boolean compileFromDDL ( final String jarOutputPath , final String ... ddlFilePaths ) { if ( ddlFilePaths . length == 0 ) { compilerLog . error ( "At least one DDL file is required." ) ; return false ; } List < VoltCompilerReader > ddlReaderList ; try { ddlReaderList = DDLPathsToReaderList ( ddlFilePaths ) ; } c... | Compile from a set of DDL files . |
32,476 | public boolean compileDDLString ( String ddl , String jarPath ) { final File schemaFile = VoltProjectBuilder . writeStringToTempFile ( ddl ) ; schemaFile . deleteOnExit ( ) ; final String schemaPath = schemaFile . getPath ( ) ; return compileFromDDL ( jarPath , schemaPath ) ; } | Compile from DDL in a single string |
32,477 | public boolean compileEmptyCatalog ( final String jarOutputPath ) { List < VoltCompilerReader > ddlReaderList = new ArrayList < > ( 1 ) ; ddlReaderList . add ( new VoltCompilerStringReader ( "ddl.sql" , m_emptyDDLComment ) ) ; InMemoryJarfile jarFile = new InMemoryJarfile ( ) ; try { ddlReaderList . get ( 0 ) . putInJa... | Compile empty catalog jar |
32,478 | private void debugVerifyCatalog ( InMemoryJarfile origJarFile , Catalog origCatalog ) { final VoltCompiler autoGenCompiler = new VoltCompiler ( m_isXDCR ) ; autoGenCompiler . m_classLoader = origJarFile . getLoader ( ) ; List < VoltCompilerReader > autogenReaderList = new ArrayList < > ( 1 ) ; autogenReaderList . add (... | Internal method that takes the generated DDL from the catalog and builds a new catalog . The generated catalog is diffed with the original catalog to verify compilation and catalog generation consistency . |
32,479 | private Catalog replayFailedCatalogRebuildUnderDebug ( VoltCompiler autoGenCompiler , List < VoltCompilerReader > autogenReaderList , InMemoryJarfile autoGenJarOutput ) { Catalog autoGenCatalog = autoGenCompiler . compileCatalogInternal ( null , null , autogenReaderList , autoGenJarOutput ) ; return autoGenCatalog ; } | Take two steps back to retry and potentially debug a catalog rebuild that generated an unintended change . This code is PURPOSELY redundant with the mainline call in debugVerifyCatalog above . Keep the two calls in synch and only redirect through this function in the post - mortem replay after the other call created a ... |
32,480 | HashMap < String , byte [ ] > getExplainPlans ( Catalog catalog ) { HashMap < String , byte [ ] > retval = new HashMap < > ( ) ; Database db = getCatalogDatabase ( m_catalog ) ; assert ( db != null ) ; for ( Procedure proc : db . getProcedures ( ) ) { for ( Statement stmt : proc . getStatements ( ) ) { String s = "SQL:... | Get textual explain plan info for each plan from the catalog to be shoved into the catalog jarfile . |
32,481 | private Catalog compileCatalogInternal ( final VoltCompilerReader cannonicalDDLIfAny , final Catalog previousCatalogIfAny , final List < VoltCompilerReader > ddlReaderList , final InMemoryJarfile jarOutput ) { m_catalog = new Catalog ( ) ; m_catalog . execute ( "add / clusters cluster" ) ; m_catalog . getClusters ( ) .... | Internal method for compiling the catalog . |
32,482 | private void addExtraClasses ( final InMemoryJarfile jarOutput ) throws VoltCompilerException { List < String > addedClasses = new ArrayList < > ( ) ; for ( String className : m_addedClasses ) { if ( ! jarOutput . containsKey ( className ) ) { try { Class < ? > clz = Class . forName ( className , true , m_classLoader )... | Once the DDL file is over take all of the extra classes found and add them to the jar . |
32,483 | public List < String > harvestCapturedDetail ( ) { List < String > harvested = m_capturedDiagnosticDetail ; m_capturedDiagnosticDetail = null ; return harvested ; } | Access recent plan output for diagnostic purposes |
32,484 | String getKeyPrefix ( StatementPartitioning partitioning , DeterminismMode detMode , String joinOrder ) { if ( partitioning . isInferred ( ) ) { return null ; } String joinOrderPrefix = "#" ; if ( joinOrder != null ) { joinOrderPrefix += joinOrder ; } boolean partitioned = partitioning . wasSpecifiedAsSingle ( ) ; retu... | Key prefix includes attributes that make a cached statement usable if they match |
32,485 | Statement getCachedStatement ( String keyPrefix , String sql ) { String key = keyPrefix + sql ; Statement candidate = m_previousCatalogStmts . get ( key ) ; if ( candidate == null ) { ++ m_stmtCacheMisses ; return null ; } String [ ] tablesTouched = candidate . getTablesread ( ) . split ( "," ) ; for ( String tableName... | Look for a match from the previous catalog that matches the key + sql |
32,486 | public HashRangeExpressionBuilder put ( Integer value1 , Integer value2 ) { m_builder . put ( value1 , value2 ) ; return this ; } | Add a value pair . |
32,487 | public HashRangeExpression build ( Integer hashColumnIndex ) { Map < Integer , Integer > ranges = m_builder . build ( ) ; HashRangeExpression predicate = new HashRangeExpression ( ) ; predicate . setRanges ( ranges ) ; predicate . setHashColumnIndex ( hashColumnIndex ) ; return predicate ; } | Generate a hash range expression . |
32,488 | public OrderableTransaction poll ( ) { OrderableTransaction retval = null ; updateQueueState ( ) ; if ( m_state == QueueState . UNBLOCKED ) { retval = super . peek ( ) ; super . poll ( ) ; assert ( retval != null ) ; } return retval ; } | Only return transaction state objects that are ready to run . |
32,489 | public boolean add ( OrderableTransaction txnState ) { if ( m_initiatorData . containsKey ( txnState . initiatorHSId ) == false ) { return false ; } boolean retval = super . add ( txnState ) ; if ( retval ) updateQueueState ( ) ; return retval ; } | Drop data for unknown initiators . This is the only valid add interface . |
32,490 | public long noteTransactionRecievedAndReturnLastSeen ( long initiatorHSId , long txnId , long lastSafeTxnIdFromInitiator ) { assert ( txnId != 0 ) ; if ( m_initiatorData . containsKey ( initiatorHSId ) == false ) { return DtxnConstants . DUMMY_LAST_SEEN_TXN_ID ; } LastInitiatorData lid = m_initiatorData . get ( initiat... | Update the information stored about the latest transaction seen from each initiator . Compute the newest safe transaction id . |
32,491 | public void gotFaultForInitiator ( long initiatorId ) { noteTransactionRecievedAndReturnLastSeen ( initiatorId , Long . MAX_VALUE , DtxnConstants . DUMMY_LAST_SEEN_TXN_ID ) ; LastInitiatorData remove = m_initiatorData . remove ( initiatorId ) ; assert ( remove != null ) ; } | Remove all pending transactions from the specified initiator and do not require heartbeats from that initiator to proceed . |
32,492 | public int ensureInitiatorIsKnown ( long initiatorId ) { int newInitiatorCount = 0 ; if ( m_initiatorData . get ( initiatorId ) == null ) { m_initiatorData . put ( initiatorId , new LastInitiatorData ( ) ) ; newInitiatorCount ++ ; } return newInitiatorCount ; } | After a catalog change double check that all initators in the catalog that are known to be up are here in the RPQ s list . |
32,493 | public Long getNewestSafeTransactionForInitiator ( Long initiatorId ) { LastInitiatorData lid = m_initiatorData . get ( initiatorId ) ; if ( lid == null ) { return null ; } return lid . m_lastSafeTxnId ; } | Return the largest confirmed txn id for the initiator given . Used to figure out what to do after an initiator fails . |
32,494 | public Long safeToRecover ( ) { boolean safe = true ; for ( LastInitiatorData data : m_initiatorData . values ( ) ) { final long lastSeenTxnId = data . m_lastSeenTxnId ; if ( lastSeenTxnId == DtxnConstants . DUMMY_LAST_SEEN_TXN_ID ) { safe = false ; } } if ( ! safe ) { return null ; } OrderableTransaction next = peek (... | Determine if it is safe to recover and if it is what txnid it is safe to recover at . Recovery is initiated by the recovering source partition . It can t be initiated until the recovering partition has heard from every initiator . This is because it is not possible to pick a point in the global txn ordering for the rec... |
32,495 | public void unauthenticate ( HttpServletRequest request ) { if ( HTTP_DONT_USE_SESSION ) return ; HttpSession session = request . getSession ( false ) ; if ( session != null ) { session . removeAttribute ( AUTH_USER_SESSION_KEY ) ; session . invalidate ( ) ; } } | reuses it and happily validates it . |
32,496 | public AuthenticationResult authenticate ( HttpServletRequest request ) { HttpSession session = null ; AuthenticationResult authResult = null ; if ( ! HTTP_DONT_USE_SESSION && ! m_dontUseSession ) { try { session = request . getSession ( ) ; if ( session != null ) { if ( session . isNew ( ) ) { session . setMaxInactive... | Look to get session if no session found or created fallback to always authenticate mode . |
32,497 | public static FunctionSQL newSQLFunction ( String token , CompileContext context ) { int id = regularFuncMap . get ( token , - 1 ) ; if ( id == - 1 ) { id = valueFuncMap . get ( token , - 1 ) ; } if ( id == - 1 ) { return null ; } FunctionSQL function = new FunctionSQL ( id ) ; if ( id == FUNC_VALUE ) { if ( context . ... | End of VoltDB extension |
32,498 | public ProcessTxnResult processTxn ( TxnHeader hdr , Record txn ) { return dataTree . processTxn ( hdr , txn ) ; } | the process txn on the data |
32,499 | public Stat statNode ( String path , ServerCnxn serverCnxn ) throws KeeperException . NoNodeException { return dataTree . statNode ( path , serverCnxn ) ; } | stat the path |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.