Uses of Annotation Interface
com.ocient.annotations.SuppressFBWarnings
Packages that use SuppressFBWarnings
Package
Description
-
Uses of SuppressFBWarnings in com.ocient.auth
Methods in com.ocient.auth with annotations of type SuppressFBWarningsModifier and TypeMethodDescriptionstatic OpenIDAuthenticators.AuthorizationCodeWithPKCEClient.AuthorizationCodeGrant<OpenIDAuthenticators.OAuthToken> OktaAuthenticators.OktaAuthenticationClient.exchangeSessionToken(OpenIDAuthenticators.AuthorizationCodeWithPKCEClient client, ClientWireProtocol.OpenIDAuthenticator authenticator, String sessionToken) Exchanges the given session token for an OAuth Tokenstatic com.google.gson.JsonObjectOpenIDAuthenticators.getDiscoveryDocument(String issuer) Returns the issuer's discovery document -
Uses of SuppressFBWarnings in com.ocient.classloader
Methods in com.ocient.classloader with annotations of type SuppressFBWarnings -
Uses of SuppressFBWarnings in com.ocient.jdbc
Classes in com.ocient.jdbc with annotations of type SuppressFBWarningsMethods in com.ocient.jdbc with annotations of type SuppressFBWarningsModifier and TypeMethodDescriptionXGDatabaseMetaData.getSystemTables(String catalog, String schemaPattern, String tableNamePattern, String[] types) XGDatabaseMetaData.getTables(String catalog, String schemaPattern, String tableNamePattern, String[] types) XGDatabaseMetaData.getViews(String catalog, String schemaPattern, String viewNamePattern, String[] types) booleanXGConnection.isValid(int arg0) -
Uses of SuppressFBWarnings in com.ocient.jdbc.graph
Methods in com.ocient.jdbc.graph with annotations of type SuppressFBWarningsModifier and TypeMethodDescriptionstatic voidOCGraph.aggregateMessages(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultVerticesTable, String sendToSourceExpr, String sendToDestExpr, String aggregateExpr, ArrayList<String> resultVerticesIndexes, Statement stmt) Aggregates messages passed between connected vertices in a graph and stores the results in a new table.static voidOCGraph.collectEdges(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultVerticesTable, OCGraph.EdgeDirection direction, ArrayList<String> resultVerticesIndexes, Statement stmt) Collects edge information associated with each vertex in a graph stored in database tables and stores the results in a new table.static voidOCGraph.collectNeighbors(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultVerticesTable, OCGraph.EdgeDirection direction, ArrayList<String> resultVerticesIndexes, Statement stmt) Collects neighbor information for each vertex in a graph stored in database tables and stores the results in a new table.static voidOCGraph.cosineSimilarity(String inputSchema, String inputEdgesTable, String resultSchema, String resultTable, ArrayList<String> resultIndexes, Statement stmt) Computes the Cosine Similarity between pairs of vertices that share at least one neighbor.static voidOCGraph.createTripletsTable(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultTripletsTable, ArrayList<String> resultTripletsIndexes, Statement stmt) Creates a materialized triplet table by joining vertex and edge data from input tables.static voidOCGraph.createTripletsView(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultTripletsView, Statement stmt) Creates a database view representing graph triplets (source vertex, edge, destination vertex).static voidOCGraph.cycleDetection(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultTable, ArrayList<String> resultIndexes, Statement stmt) Detects cycles in a directed graph by iteratively removing nodes with out-degree 0.static voidOCGraph.degrees(String inputSchema, String inputEdgesTable, String resultSchema, String resultDegreesTable, ArrayList<String> resultIndexes, Statement stmt) Calculates the total degree (combined in-degree and out-degree) for each node in a graph represented by an edges table and stores the results in a new table.static voidOCGraph.eigenvectorCentrality(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultTable, int maxIterations, double tolerance, ArrayList<String> resultIndexes, Statement stmt) Computes Eigenvector Centrality using the Power Iteration method.static voidOCGraph.fromEdges(String inputSchema, String inputEdgesTable, String resultSchema, String resultVerticesTable, ArrayList<String> resultColumnExpressions, ArrayList<String> resultVerticesIndexes, Statement stmt) Creates a vertices table from an existing edges table by extracting unique source and destination IDs.static voidOCGraph.groupEdges(String inputSchema, String inputEdgesTable, String resultSchema, String resultEdgesTable, ArrayList<String> resultColumnExpressions, ArrayList<String> resultEdgesIndexes, Statement stmt) Groups duplicate edges from an input table into a new result table using SQL aggregation.static voidOCGraph.inDegrees(String inputSchema, String inputEdgesTable, String resultSchema, String resultInDegreesTable, ArrayList<String> resultIndexes, Statement stmt) Calculates the in-degree for each destination node in a given edge table and stores the results (node ID and its in-degree count) in a newly created table.static voidOCGraph.jaccardSimilarity(String inputSchema, String inputEdgesTable, String resultSchema, String resultTable, ArrayList<String> resultIndexes, Statement stmt) Computes the Jaccard Similarity coefficient between pairs of vertices that share at least one neighbor.static voidOCGraph.joinVertices(String inputSchema, String inputVerticesTable, String modificationSchema, String modificationVerticesTable, String resultSchema, String resultVerticesTable, ArrayList<String> resultAttributeExpressions, ArrayList<String> resultVerticesIndexes, Statement stmt) Joins two sets of vertices (input and modification) into a result table.static voidOCGraph.kCoreDecomposition(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultTable, ArrayList<String> resultIndexes, Statement stmt) Computes the K-Core Decomposition of the graph.static voidOCGraph.labelPropagation(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultVerticesTable, int maxIterations, ArrayList<String> resultVerticesIndexes, Statement stmt) Performs the Label Propagation Algorithm (LPA) iteratively on graph data stored in database tables, assigning community labels to vertices.static voidOCGraph.louvainModularityOptimization(String inputSchema, String inputVerticesTable, String inputEdgesTable, String weightCol, String resultSchema, String resultTable, int maxIterations, ArrayList<String> resultIndexes, Statement stmt) Performs Phase 1 of the Louvain Method (Modularity Optimization).static voidOCGraph.mapTriplets(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultEdgesTable, ArrayList<String> resultColumnExpressions, ArrayList<String> resultEdgesIndexes, Statement stmt) Transforms edge attributes by incorporating information from the source and destination vertices (the "triplet").static voidOCGraph.maxBipartiteMatching(String inputSchema, String inputEdgesTable, String resultSchema, String resultTable, int maxIterations, ArrayList<String> resultIndexes, Statement stmt) Computes a Maximal Bipartite Matching using a Greedy strategy.static voidOCGraph.outDegrees(String inputSchema, String inputEdgesTable, String resultSchema, String resultOutDegreesTable, ArrayList<String> resultIndexes, Statement stmt) Calculates the out-degree for each node in a graph represented by an edge table and stores the results in a new database table.static voidOCGraph.pregel(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultVerticesTable, String initializerExpr, String sendToSourceExpr, String sendToDestExpr, String aggregateExpr, String updaterExpr, int maxIterations, ArrayList<String> resultVerticesIndexes, Statement stmt) Performs a Pregel-like graph computation using SQL.static voidOCGraph.reverseEdges(String inputSchema, String inputEdgesTable, String resultSchema, String resultEdgesTable, ArrayList<String> resultEdgesIndexes, Statement stmt) Reverses the direction of edges stored in a database table.static voidOCGraph.shortestPaths(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultTable, List<Long> landmarks, String edgeWeightColumn, int maxIterations, ArrayList<String> resultIndexes, Statement stmt) Computes the shortest paths from all vertices in the graph to a specified set of landmark vertices.static voidOCGraph.stableMarriage(String inputSchema, String suitorPrefsTable, String candidatePrefsTable, String resultSchema, String resultTable, int maxIterations, ArrayList<String> resultIndexes, Statement stmt) Performs the Gale-Shapley Stable Marriage algorithm to find a stable matching between two disjoint sets of vertices (Suitors and Candidates).static voidOCGraph.stronglyConnectedComponents(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultVerticesTable, ArrayList<String> resultVerticesIndexes, Statement stmt) Computes the Strongly Connected Components (SCCs) of a directed graph represented by vertex and edge tables in a database.static voidOCGraph.subgraph(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultVerticesTable, String resultEdgesTable, String vertexFilter, String edgeFilter, ArrayList<String> resultVerticesIndexes, ArrayList<String> resultEdgesIndexes, Statement stmt) Creates a subgraph consisting of new vertex and edge tables based on filtering criteria applied to existing input graph tables.static voidOCGraph.triangleCount(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultVerticesTable, ArrayList<String> resultVerticesIndexes, Statement stmt) Runs the full triangle counting process.static voidOCGraph.triangleCountPreCanonicalized(String inputSchema, String inputVerticesTable, String canonicalEdgesTable, String resultSchema, String resultVerticesTable, ArrayList<String> resultVerticesIndexes, Statement stmt) Runs triangle count on a graph where the input vertices and canonical edges reside in the same schema, and the edges are already canonicalized (srcid invalid input: '<' destid, no duplicates or self-loops). -
Uses of SuppressFBWarnings in com.ocient.rest.exceptionMappers
Classes in com.ocient.rest.exceptionMappers with annotations of type SuppressFBWarnings -
Uses of SuppressFBWarnings in com.ocient.transport
Classes in com.ocient.transport with annotations of type SuppressFBWarnings -
Uses of SuppressFBWarnings in com.ocient.util
Methods in com.ocient.util with annotations of type SuppressFBWarnings