();\\r\\n // all edges in graph, sorted by edge weights\\r\\n ArrayList<Edge> worklist = initalE;\\r\\n for (Edge e : worklist) {\\r\\n Vertex fromVR = new Utils().findR(map, e.from);\\r\\n Vertex fromTR = new Utils().findR(map, e.to);\\r\\n if (fromVR.vEquals(fromTR)) {\\r\\n // do nothing and ignore this edge,\\r\\n // which will form one cycle, discard it.\\r\\n }\\r\\n else {\\r\\n // add it will not create cycle,\\r\\n // add it and union vertices in this edge\\r\\n edgesInTree.add(e);\\r\\n union(map, fromVR, fromTR);\\r\\n }\\r\\n }\\r\\n return edgesInTree;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7b5e725bf6016fc46ad14a0ba114979\",\n \"score\": \"0.54771394\",\n \"text\": \"public static void main(String[] args) {\\n Scanner in = new Scanner(System.in);\\n int numV = in.nextInt();\\n long[][] adjMatrix = new long[numV+1][numV+1];\\n for(int i=1;i<=numV;i++) {\\n for(int j=1;j<=numV;j++) {\\n if(i==j) {\\n adjMatrix[i][j] = 0;\\n } else {\\n adjMatrix[i][j] = Integer.MAX_VALUE;\\n }\\n }\\n }\\n int numE = in.nextInt();\\n for(int i=0;i<numE;i++) {\\n int v1 = in.nextInt();\\n int v2 = in.nextInt();\\n int wt = in.nextInt();\\n adjMatrix[v1][v2] = wt;\\n adjMatrix[v2][v1] = wt;\\n }\\n int numS = in.nextInt();\\n int[] special = new int[numS];\\n for(int i=0;i<numS;i++) {\\n special[i] = in.nextInt();\\n }\\n\\n for(int k=1;k<=numV;k++) {\\n for(int i=1;i<=numV;i++) {\\n for(int j=1;j<=numV;j++) {\\n adjMatrix[i][j] = Math.min(adjMatrix[i][j], (adjMatrix[i][k] == Integer.MAX_VALUE ||\\n adjMatrix[k][j] == Integer.MAX_VALUE) ? Integer\\n .MAX_VALUE :\\n adjMatrix[i][k] +\\n adjMatrix[k][j]);\\n }\\n }\\n }\\n long min;\\n for(int i=1;i<=numV;i++) {\\n min = Integer.MAX_VALUE;\\n for(int j=0;j<numS;j++) {\\n if(adjMatrix[i][special[j]] < min) {\\n min = adjMatrix[i][special[j]];\\n }\\n }\\n System.out.println(min);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79a13dd8e849abf6f0fde8b3f2cf3040\",\n \"score\": \"0.54678476\",\n \"text\": \"public int nbVertex() {return wGraph.size();}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"12ef037860b7e88aca7ce84600286d97\",\n \"score\": \"0.54646707\",\n \"text\": \"public void buildScaleFreeGraph(){\\n\\t\\tint totalDegree=0;\\n\\t\\tint numberOfStubs=2;\\n\\t\\tclearGraph();\\n\\t\\tif (numON>1) {\\n\\t\\t\\t// build seed\\n\\t\\t\\tsetEdge(0,1);\\n\\t\\t\\tdegreeDistribution[0]=1;\\n\\t\\t\\ttotalDegree++;\\n\\t\\t\\tdegreeDistribution[1]=1;\\n\\t\\t\\ttotalDegree++;\\n\\t\\t\\t// loop over nodes the need to be added\\n\\t\\t\\tfor (int i = 2; i < numON; i++) {\\n\\t\\t\\t\\tint[] stubs = new int[numberOfStubs];\\n\\t\\t\\t\\t// loop over stubs\\t\\n\\t\\t\\t\\tfor (int j = 0; j < numberOfStubs; j++) {\\n\\t\\t\\t\\t\\tboolean connected=false;\\n\\t\\t\\t\\t\\tdouble linkProb=Math.random()*(totalDegree-j);\\n\\t\\t\\t\\t\\t//loop over candidates\\n\\t\\t\\t\\t\\tint c=0;\\n\\t\\t\\t\\t\\tdouble tmp=0;\\n\\t\\t\\t\\t\\twhile(!connected){\\n\\t\\t\\t\\t\\t\\tif(!getEdge(c, i)){\\n\\t\\t\\t\\t\\t\\t\\ttmp+=degreeDistribution[c];\\n\\t\\t\\t\\t\\t\\t\\tif(linkProb<=tmp){\\n\\t\\t\\t\\t\\t\\t\\t\\t// then i->c is new edge\\n\\t\\t\\t\\t\\t\\t\\t\\tconnected=true;\\n\\t\\t\\t\\t\\t\\t\\t\\tstubs[j]=c;\\n\\t\\t\\t\\t\\t\\t\\t\\tsetEdge(c, i);\\n\\t\\t\\t\\t\\t\\t\\t\\tdegreeDistribution[i]++;\\n\\t\\t\\t\\t\\t\\t\\t\\tdegreeDistribution[c]++;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tc++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttotalDegree+=2;\\n\\t\\t\\t} \\n\\t\\t}\\n\\t\\tcomputeExtremeDegrees();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4930de4b15183f920f14dd789f0d38a9\",\n \"score\": \"0.5464291\",\n \"text\": \"List<EdgeNode> getCoveredEdgeNodes() {\\n if (coveredNodes == null) {\\n List<Connection> connections = new ArrayList<>(connectedNodes.values());\\n connections.sort(new ConnectionComparator());\\n\\n coveredNodes = new ArrayList<>();\\n int remaining = coveredCount;\\n for (int i = 0; i < connections.size() && remaining > 0; ++i) {\\n Connection connection = connections.get(i);\\n\\n if (connection.edge.getDeviceCount() <= remaining) {\\n coveredNodes.add(connection.edge);\\n remaining -= connection.edge.getDeviceCount();\\n }\\n }\\n\\n //TODO debug\\n if (this instanceof EdgeNode) {\\n assert coveredNodes.contains((EdgeNode) this) : \\\"edge node is not part of its own covered nodes set\\\";\\n }\\n }\\n\\n return coveredNodes;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"413af359fbc561654d5f8a44e092ece9\",\n \"score\": \"0.54562914\",\n \"text\": \"public int leastBricks(List<List<Integer>> wall) {\\n if (wall == null || wall.size() == 0 || wall.get(0) == null || wall.get(0).size() == 0) {\\n return 0;\\n }\\n\\n Map<Integer, Integer> edgeToCount = new HashMap<Integer, Integer>();\\n int totalLenth = 0;\\n for(Integer level : wall.get(0)){\\n totalLenth += level;\\n }\\n int numOfWalls = wall.size();\\n\\n for(List<Integer> level : wall) {\\n int end = 0;\\n for(Integer len : level) {\\n end += len;\\n Integer counter = edgeToCount.get(end);\\n if (counter == null) {\\n counter = 1;\\n } else {\\n counter += 1;\\n }\\n edgeToCount.put(end, counter);\\n }\\n }\\n int min =Integer.MAX_VALUE;\\n if (edgeToCount.size() == 1) {\\n int val = 0;\\n for(Integer key : edgeToCount.keySet()) {\\n val = edgeToCount.get(key);\\n }\\n return val;\\n }\\n for(Integer key : edgeToCount.keySet()) {\\n if(key == totalLenth) {\\n continue;\\n }\\n min = Math.min(min, numOfWalls - edgeToCount.get(key));\\n }\\n return min;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58ae24bd8c9fc3077a6a875654c670a5\",\n \"score\": \"0.5453906\",\n \"text\": \"public void primMST(int[][] graph) {\\n\\n\\t\\t// Array to store constructed MST\\n\\t\\tint parent[] = new int[vertices];\\n\\n\\t\\t// Key values used to pick minimum weight edge in cut\\n\\t\\tint key[] = new int[vertices];\\n\\n\\t\\t// To represent set of vertices not yet included in MST\\n\\t\\tboolean mstSet[] = new boolean[vertices];\\n\\n\\t\\t// Initialize all keys as INFINITE\\n\\t\\tfor (int i = 0; i < vertices; i++) {\\n\\t\\t\\tkey[i] = Integer.MAX_VALUE;\\n\\t\\t\\tmstSet[i] = false;\\n\\t\\t}\\n\\n\\t\\t// Always include first 1st vertex in MST.\\n\\t\\t// Make key 0 so that this vertex is picked as first vertex\\n\\t\\tkey[0] = 0;\\n\\n\\t\\t// First node is always root of MST\\n\\t\\tparent[0] = -1;\\n\\n\\t\\t// The MST will have vertices-1 edges\\n\\t\\tfor (int count = 0; count < vertices - 1; count++) {\\n\\n\\t\\t\\t// Pick the minimum key vertex from the set of vertices not yet\\n\\t\\t\\t// included in MST\\n\\t\\t\\tint u = minKey(key, mstSet);\\n\\n\\t\\t\\t// Add the picked vertex to the MST Set\\n\\t\\t\\tmstSet[u] = true;\\n\\n\\t\\t\\t// Update key value and parent index of the adjacent\\n\\t\\t\\t// vertices of the picked vertex. Consider only those\\n\\t\\t\\t// vertices which are not yet included in MST\\n\\t\\t\\tfor (int v = 0; v < vertices; v++) {\\n\\n\\t\\t\\t\\t// graph[u][v] is non zero only for adjacent vertices of m\\n\\t\\t\\t\\t// mstSet[v] is false for vertices not yet included in MST\\n\\t\\t\\t\\t// Update the key only if graph[u][v] is smaller than key[v]\\n\\t\\t\\t\\tif (graph[u][v] != 0 && !mstSet[v] && graph[u][v] < key[v]) {\\n\\t\\t\\t\\t\\tparent[v] = u;\\n\\t\\t\\t\\t\\tkey[v] = graph[u][v];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println(Arrays.toString(key));\\n\\t\\t}\\n\\t\\t\\tSystem.out.println(Arrays.toString(parent));\\n\\t\\t\\n\\n\\t\\t// Print the constructed MST\\n//\\t\\tprintMST(parent, vertices, graph);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f35d21d07ab1cb814db80b5c7b3284e7\",\n \"score\": \"0.5453627\",\n \"text\": \"public void test_computeShortestCycles_maxSize_differentCycles() {\\n\\n /*\\n * Graph (k = vertex of index and id k).\\n * \\n * 3\\n * ^\\\\\\n * /| v\\n * 0 | 2\\n * ^ |/\\n * \\\\v\\n * 1\\n * \\n * All cycles:\\n * [1,3]\\n * [0,3,1]\\n * [1,3,2]\\n * [0,3,2,1]\\n */\\n \\n final ArrayList<InterfaceVertex> vByIndex = new ArrayList<InterfaceVertex>();\\n GraphTestsUtilz.newInGraph(vByIndex, 0);\\n GraphTestsUtilz.newInGraph(vByIndex, 1);\\n GraphTestsUtilz.newInGraph(vByIndex, 2);\\n GraphTestsUtilz.newInGraph(vByIndex, 3);\\n GraphTestsUtilz.ensurePathFromIndexes(vByIndex, 0, 3, 2, 1, 0);\\n GraphTestsUtilz.ensurePathFromIndexes(vByIndex, 1, 3, 1);\\n \\n for (int maxSize : new int[]{-1, 2}) {\\n \\n if (DEBUG) {\\n System.out.println(\\\"maxSize = \\\" + maxSize);\\n }\\n \\n @SuppressWarnings(\\\"unchecked\\\")\\n final List<InterfaceVertex> graph = (List<InterfaceVertex>) vByIndex.clone();\\n\\n final MyCycleComputerVcp processor = new MyCycleComputerVcp();\\n ShortestCyclesComputer.computeShortestCycles(graph, maxSize, processor);\\n\\n final List<List<InterfaceVertex>> expectedCycleList = new ArrayList<List<InterfaceVertex>>();\\n if (maxSize < 0) {\\n expectedCycleList.add(GraphTestsUtilz.asListFromIndexes(vByIndex, 0, 3, 1));\\n expectedCycleList.add(GraphTestsUtilz.asListFromIndexes(vByIndex, 1, 3, 2));\\n } else {\\n expectedCycleList.add(GraphTestsUtilz.asListFromIndexes(vByIndex, 1, 3));\\n }\\n \\n checkEqualAfterNormalization(expectedCycleList, processor.cycleList);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8da647207d8d38fd615d94e1db666d96\",\n \"score\": \"0.5452059\",\n \"text\": \"public Graph(File source) throws IOException {\\n\\t\\tScanner s = new Scanner(source);\\n\\t\\tString[] startAndEnd = s.nextLine().split(\\\" \\\");\\n\\t\\tstart = Integer.parseInt(startAndEnd[0]);\\n\\t\\tend = Integer.parseInt(startAndEnd[1]);\\n\\t\\tArrayList<ArrayList<Integer>> conns = new ArrayList<>();\\n\\t\\twhile (s.hasNextLine()) {\\n\\t\\t\\tString[] otherVertices = s.nextLine().split(\\\" \\\");\\n\\t\\t\\tArrayList<Integer> al = new ArrayList<>();\\n\\t\\t\\tconns.add(al);\\n\\t\\t\\tfor (int i = 1; i < otherVertices.length; i++) {\\n\\t\\t\\t\\tal.add(Integer.parseInt(otherVertices[i]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\ts.close();\\n\\t\\tfor (int i = 0; i < conns.size(); i++) {\\n\\t\\t\\tArrayList<Integer> c = conns.get(i);\\n\\t\\t\\tfor (int j = 0; j < c.size(); j++) {\\n\\t\\t\\t\\tif (!conns.get(c.get(j)).contains(i))\\n\\t\\t\\t\\t\\tconns.get(c.get(j)).add(i);\\n\\t\\t\\t}\\n\\t\\t\\t// c.sort((a, b) -> a - b);\\n\\t\\t}\\n\\t\\tif (SHORTEN_CHAINS) {\\n\\t\\t\\tfor (int i = 0; i < conns.size(); i++) {\\n\\t\\t\\t\\tif (start == i || end == i)\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\tArrayList<Integer> m = conns.get(i);\\n\\t\\t\\t\\tif (m.size() == 2) {\\n\\t\\t\\t\\t\\tint ir = m.get(0);\\n\\t\\t\\t\\t\\tint il = m.get(1);\\n\\t\\t\\t\\t\\tArrayList<Integer> r = conns.get(ir), l = conns.get(il);\\n\\t\\t\\t\\t\\tif ((ir != start && ir != end && r.size() == 2) || (il != start && il != end && l.size() == 2)\\n\\t\\t\\t\\t\\t\\t\\t|| ((ir == start || ir == end) && r.size() == 1)\\n\\t\\t\\t\\t\\t\\t\\t|| ((il == start || il == end) && l.size() == 1)) {// remove m\\n\\t\\t\\t\\t\\t\\tl.remove((Integer) i);\\n\\t\\t\\t\\t\\t\\tr.remove((Integer) i);\\n\\t\\t\\t\\t\\t\\tr.add(il);\\n\\t\\t\\t\\t\\t\\tl.add(ir);\\n\\t\\t\\t\\t\\t\\tconns.set(i, null);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tint shift = 0;\\n\\t\\t\\tfor (int i = 0; i < conns.size() - shift; i++) {\\n\\t\\t\\t\\twhile (conns.get(i + shift) == null) {\\n\\t\\t\\t\\t\\tif (shift++ == conns.size())\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (shift > 0) {\\n\\t\\t\\t\\t\\tif (i + shift == start)\\n\\t\\t\\t\\t\\t\\tstart -= shift;\\n\\t\\t\\t\\t\\tif (i + shift == end)\\n\\t\\t\\t\\t\\t\\tend -= shift;\\n\\t\\t\\t\\t\\tArrayList<Integer> e = conns.get(i + shift);\\n\\t\\t\\t\\t\\tconns.set(i, e);\\n\\t\\t\\t\\t\\tconns.set(i + shift, null);\\n\\t\\t\\t\\t\\tfor (int j : e) {\\n\\t\\t\\t\\t\\t\\tconns.get(j).set(conns.get(j).indexOf(i + shift), i);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i = 0; i < shift; i++) {\\n\\t\\t\\t\\tconns.remove(conns.size() - 1);\\n\\t\\t\\t}\\n\\t\\t}\\n//\\t\\tfor (ArrayList<Integer> line : conns) {//never possible to get back to start vertex\\n//\\t\\t\\tline.remove(new Integer(start));\\n//\\t\\t}\\n//\\t\\tconns.get(end).clear();//never possible to leave end vertex\\n\\t\\tfor (ArrayList<Integer> c : conns) {\\n\\t\\t\\tc.sort((a, b) -> a - b);\\n\\t\\t}\\n\\t\\tconnections = new int[conns.size()][];\\n\\t\\tfor (int i = 0; i < conns.size(); i++) {\\n\\t\\t\\tArrayList<Integer> c = conns.get(i);\\n\\t\\t\\tconnections[i] = new int[c.size()];\\n\\t\\t\\tfor (int j = 0; j < c.size(); j++) {\\n\\t\\t\\t\\tconnections[i][j] = c.get(j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54fd049e4415052cb5c4e2378235d4df\",\n \"score\": \"0.5448542\",\n \"text\": \"public boolean validTree(int n, int[][] edges) { \\n if(n == 0 || edges == null) {\\n return false;\\n } \\n if(edges.length != n -1) {\\n return false;\\n }\\n UnionFind uf = new UnionFind(n);\\n for(int[] edge : edges) {\\n int x = edge[0];\\n int y = edge[1];\\n if(!uf.union(x, y)) { // cycle check\\n return false;\\n }\\n }\\n return uf.getCount() == 1; //single tree check\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ad911cba680fdeb328b03aada826bed4\",\n \"score\": \"0.5445615\",\n \"text\": \"private static void connectGraph(ArrayList<ArrayList<Integer>> adj_mat, int min, boolean []visited) {\\n\\t\\tif(allVisited(visited) || min==-1)\\n\\t\\t\\treturn;\\n\\t\\tArrayList<Integer> list = adj_mat.get(min);\\n\\t\\t\\n\\t\\tpath.add(min);\\n\\t\\t//adj_mat.remove(min);\\n\\t\\tvisited[min]=true;\\n\\t\\t\\n\\t\\t\\n\\t\\tif(allVisited(visited) || min==-1)\\n\\t\\t\\treturn;\\n\\t\\t\\n\\t\\tmin = minNodeInNode(list, adj_mat, visited);\\n\\t\\t\\n\\t\\tconnectGraph(adj_mat, min, visited);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f507be9955bb80ac623e3ac30ba1e474\",\n \"score\": \"0.5444355\",\n \"text\": \"public void test_computeShortestCycles_general_sturdiness_againstNaive() {\\n final Random random = new Random(SEED);\\n for (int maxGraphSize = 2; maxGraphSize < 15; maxGraphSize++) {\\n for (int i = 0; i < 10*1000; i++) {\\n final int maxCycleSize = -1 + random.nextInt(10);\\n this.test_computeShortestCycles_againstNaive(\\n new RandomGraphGenerator(\\n random.nextLong(),\\n maxGraphSize),\\n maxCycleSize);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c53313923e7224b2a943c330ca122c89\",\n \"score\": \"0.54366505\",\n \"text\": \"@Override\\n\\tprotected void configureNetworkTopology() {\\n\\n\\t\\tfinal int NUMBER_OF_NODES = allNodes.length;\\n\\t\\t//create a random order of the indices using shuffle:\\n\\t\\tArrayList<Integer> unsubscribedNodes = new ArrayList<Integer>(NUMBER_OF_NODES);\\n\\t\\tfor (int i = 0; i < NUMBER_OF_NODES; i++) \\n\\t\\t{\\n\\t\\t\\tunsubscribedNodes.add((Integer)i);\\t\\t\\t\\t\\n\\t\\t}\\n\\t\\tCollections.shuffle(unsubscribedNodes);\\n\\n\\n\\t\\t// edge i goes from edge[2*i] to ends[2*i+1], \\n\\t\\t//so we need twice as many fields as edges\\n\\t\\t//this will be slightly less than this due to initial unconnected nodes:\\n\\t\\tint[] edges = new int[(2*params.getMaxSubscriptions()*NUMBER_OF_NODES)];\\n\\t\\t//init the array edges with -1;\\n\\t\\tfor (int i = 0; i < edges.length; i++) \\n\\t\\t{\\n\\t\\t\\tedges[i] = -1;\\n\\t\\t}\\n\\t\\tint edgesFound = 0;\\n\\n\\t\\t/* \\n\\t\\t * Part 1, Start:\\n\\t\\t * #NUMBER_SUBSCRIPTIONS nodes are unconnected, and \\n\\t\\t * one nodes is connected to and from all of the initial set\\n\\t\\t * \\n\\t\\t */\\n\\t\\tInteger firstToConnect = unsubscribedNodes.remove(0);\\n\\n\\t\\t// Add initial edges to and from first connected node:\\n\\t\\t// Link all to and from the last one: \\n\\t\\tfor(int i=0; i < 2*params.getMaxSubscriptions(); i=i+2)\\n\\t\\t{\\n\\t\\t\\tInteger current = unsubscribedNodes.remove(0);\\n\\t\\t\\t// from first to current\\n\\t\\t\\tedges[2*i]= (int)firstToConnect; \\n\\t\\t\\tedges[2*i+1]= (int)current;\\n\\t\\t\\tedgesFound++;\\n\\n\\t\\t\\t// from current to first\\n\\t\\t\\tedges[2*i+2]= (int)current; \\n\\t\\t\\tedges[2*i+3]= (int)firstToConnect;\\n\\t\\t\\tedgesFound++;\\n\\t\\t}\\n\\n\\n\\t\\t/* \\n\\t\\t * Part 2, \\n\\t\\t * take remaining nodes and wire them up with with preferential attachment\\n\\t\\t * with small fraction reverse link\\n\\t\\t */\\t\\t\\t\\n\\n\\t\\t// over the remaining nodes\\n\\t\\tint nodesToDo =unsubscribedNodes.size();\\n\\t\\tfor(int rest=0; rest < nodesToDo; rest++)\\n\\t\\t{\\t\\n\\t\\t\\tint current = (int)unsubscribedNodes.remove(0);\\n\\t\\t\\t// over the new edges for this new node\\t\\t\\t\\n\\t\\t\\tfor (int j=0; j < params.getMaxSubscriptions(); j++)\\n\\t\\t\\t{ \\t\\t\\n\\t\\t\\t\\tint targetCandidate = -1;\\n\\t\\t\\t\\tboolean validCandidate = false;\\n\\t\\t\\t\\twhile(!validCandidate)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttargetCandidate = edges[uniformDistribution.nextIntFromTo(0, (2*edgesFound)-1)]; \\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//Check if this Candidate is valid\\n\\t\\t\\t\\t\\t//it has to be different than self\\n\\t\\t\\t\\t\\tif (targetCandidate == current)\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\n\\t\\t\\t\\t\\t//and targetCandidate can't be used for current already\\n\\t\\t\\t\\t\\t//current is wired in the array from (2*edgesFound) to (2*edgesFound+2*j+1)\\n\\t\\t\\t\\t\\tvalidCandidate = true;\\n\\t\\t\\t\\t\\tfor (int k = (2*edgesFound); k < (2*edgesFound+2*j+1); k++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif (edges[k]==targetCandidate)\\n\\t\\t\\t\\t\\t\\t\\tvalidCandidate = false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t//Now set the edge:\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t//with low probability invert the edge\\n\\t\\t\\t\\tif(uniformDistribution.nextDouble() <= SubscriptionsModuleConfigParams.DEFAULT_INVERT_EDGE_PROBABILITY)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tedges[2*edgesFound+2*j]= targetCandidate;\\n\\t\\t\\t\\t\\tedges[2*edgesFound+2*j+1]= current ;\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\tedges[2*edgesFound+2*j]=current;\\n\\t\\t\\t\\t\\tedges[2*edgesFound+2*j+1]=targetCandidate;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t//This Loop has found #NUMBER_SUBSCRIPTIONS new edges\\n\\t\\t\\tedgesFound += params.getMaxSubscriptions();\\n\\t\\t}\\n\\n\\t\\t/* \\n\\t\\t * Part 3: \\n\\t\\t * Now make the array into subscriptions\\n\\t\\t */\\n\\t\\tfor (int i=0; i<edges.length; i=i+2)\\n\\t\\t{\\n\\t\\t\\t//if the value is negative then this is from init of array and it is not a valid edge\\n\\t\\t\\tif ((edges[i]<0)||(edges[i+1]<0))\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tallNodes[(edges[i])].addSubscription( edges[i+1], timeNow );\\n\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41f384032edd2ec5306ce9746d926203\",\n \"score\": \"0.54344845\",\n \"text\": \"private static Node getLowestDistanceNode(Set<Node> unsettledNodes) {\\n Node lowestDistanceNode = null;\\n int lowestDistance = Integer.MAX_VALUE;\\n for (Node node: unsettledNodes) {\\n int nodeDistance = node.getDistance();\\n if (nodeDistance < lowestDistance) {\\n lowestDistance = nodeDistance;\\n lowestDistanceNode = node;\\n }\\n }\\n return lowestDistanceNode;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51eacd8c6753fe7456e132f1c19d2660\",\n \"score\": \"0.54288673\",\n \"text\": \"public static void fillGraph(int n, int m, MutableGraph<Integer> graph){\\n\\n Scanner scan = new Scanner(System.in);\\n\\n for (int i = 1; i <= n ; i++) { //label vertices in X: v_1,...v_n\\n for (int j = 1; j <= m; j++) { //label vertices in Y: v_(n+1),...,v_(n+m)\\n int isAdjacent = 0;\\n\\n try {\\n System.out.printf(\\\"Is v_%d∈X adjacent to v_%d∈Y (1 for Yes, 0 for No) %n\\\", i, n + j); // Finds the pairs of vertices in X and Y which are adjacent\\n isAdjacent = Integer.parseInt(scan.nextLine());\\n }catch (NumberFormatException e){\\n System.out.println(\\\"Entered a non-integer value, try again.\\\"); //Try again if enter string instead of integer\\n j--;\\n continue;\\n }\\n\\n if (isAdjacent == 1) {\\n graph.putEdge(i, n + j); //If the vertices are adjacent, put an edge in the graph connecting them\\n }else if(isAdjacent != 1 && isAdjacent != 0){\\n System.out.println(\\\"Enter a non-binary integer value, try again.\\\"); //Try again if enter an integer which is not 0 or 1\\n j--;\\n continue;\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7148c2f177fd103da440c164a79ff6ce\",\n \"score\": \"0.5425081\",\n \"text\": \"public ArrayList<Edge> connectVertex_nearestN(Vertex v, ArrayList<Vertex> graph, int maxConnections, int maxAttempts) {\\n PriorityQueue<VertexTuple> closestNodes = new PriorityQueue<VertexTuple>(graph.size());\\n \\n for (Vertex vert : graph) {\\n if (vert == v || vert.getConnectedVertices().size() >= maxConnections){\\n continue;\\n }\\n closestNodes.add(new VertexTuple(vert, getEuclideanDistance(v, vert)));\\n }\\n \\n ArrayList<Edge> connections = new ArrayList<Edge>();\\n \\n int connectionAttempts = 0;\\n int connectionCount = v.getConnectedVertices().size();\\n while (connectionAttempts < maxAttempts && connectionCount < maxConnections) {\\n VertexTuple vt = closestNodes.poll();\\n // Run out of nodes to check so exit.\\n if (vt == null){\\n break;\\n }\\n Vertex vert = vt.v1;\\n \\n if (vert.getConnectedVertices().contains(v)){\\n // If we've already been connected to this node, carry on.\\n continue;\\n }\\n \\n if (!isConnected(v, vert)) {\\n if (connectedInFreeSpace(inflatedMap,\\n v.getLocation().getX(),\\n v.getLocation().getY(),\\n vert.getLocation().getX(),\\n vert.getLocation().getY(), vt.distance)) {\\n \\n v.addConnectedVertex(vert);\\n vert.addConnectedVertex(v);\\n connections.add(new Edge(v, vert, vt.distance));\\n connectionCount++;\\n }\\n }\\n connectionAttempts++;\\n }\\n \\n return connections;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27ebe60d36e4ad8d0d3888f0401bd144\",\n \"score\": \"0.54246926\",\n \"text\": \"public static void main(String[] args) {\\n Scanner sc=new Scanner(System.in);\\n int testcases=sc.nextInt();\\n \\n for(int z=1;z<=testcases;z++){ \\n int n=sc.nextInt();\\n int edges=sc.nextInt();\\n graph g=new graph();\\n g.nodes=new Node[n+1];\\n for(int i=1;i<=n;i++){\\n g.nodes[i]=new Node();\\n g.nodes[i].data=i;\\n g.nodes[i].cost=-1;\\n g.nodes[i].children=new ArrayList<Node>();\\n }\\n for(int i=1;i<=edges;i++){\\n int s=sc.nextInt();\\n int e=sc.nextInt();\\n g.nodes[s].children.add(g.nodes[e]);\\n g.nodes[e].children.add(g.nodes[s]);\\n \\n }\\n int source=sc.nextInt();\\n int cost[]=new int[n+1];\\n int visited[]=new int[n+1];\\n LinkedList<Node> q=new LinkedList<Node>();\\n g.nodes[source].cost=0;\\n q.add(g.nodes[source]);\\n visited[source]=1;\\n \\n while(!q.isEmpty()){\\n Node t=q.removeFirst();\\n ///if(visited[t.data]==0){\\n // visited[t.data]=1;\\n for(Node x:t.children){\\n if(visited[x.data]==0){\\n q.add(g.nodes[x.data]);\\n visited[x.data]=1;\\n x.cost=t.cost+6;\\n }\\n }\\n //}\\n }\\n for(int l=1;l<=n;l++){\\n if(l!=source){\\n System.out.print(g.nodes[l].cost+\\\" \\\");\\n }\\n }System.out.println();\\n }\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2ed5c284e73f5b6328dcef93181b7a4\",\n \"score\": \"0.54222566\",\n \"text\": \"public static void main(String[] args) {\\n In in = new In(\\\"./circlesEWD.txt\\\");\\n EdgeWeightedDigraph G = new EdgeWeightedDigraph(in);\\n int len = G.V();\\n DijkstraSP sp;\\n int vNum = Integer.parseInt(args[1]);\\n double [] sum = new double[len];\\n int [] spCount = new int[len];\\n int prev;\\n int size;\\n for (int i =0; i < len; i++){ //loop through all vertecies\\n sp = new DijkstraSP(G, i);\\n \\n for (int j = 0; j< len; j++){ //loop all verticies\\n sum[i] +=sp.distTo(j);\\n \\n for(DirectedEdge e : sp.pathTo(j)){ //loop through shortest path\\n if (e.to() != j){ //if not an endpoint\\n spCount[e.to()] +=1;\\n }\\n }\\n }\\n }\\n Edge e;\\n MaxPQ<Edge> between = new MaxPQ<Edge>();\\n MinPQ<Edge> close = new MinPQ<Edge>();\\n for(int i = 0; i <len; i++){ //build min and max pws for sorting output\\n //i am using edges for simplicity in coding, v is vertex, w issnt used, and the weight is what is being counted and sorted by\\n e = new Edge(i, 0, spCount[i]);\\n between.insert(e);\\n e = new Edge(i, 0, sum[i]);\\n close.insert(e);\\n //System.out.println(i+\\\" \\\"+sum[i]);\\n }\\n System.out.print(\\\"Vertices with high betweenness centrality: \\\");\\n for (int k = 0; k < vNum && (!between.isEmpty()); k++){\\n e = between.delMax();\\n System.out.print(e.either());\\n if(k+1 < vNum && (!between.isEmpty())){\\n System.out.print(\\\", \\\");\\n }else{\\n System.out.print(\\\"\\\\n\\\");\\n }\\n }\\n System.out.print(\\\"Vertices with high closeness centrality: \\\");\\n for (int k = 0; k < vNum && (!close.isEmpty()); k++){\\n e = close.delMin();\\n System.out.print(e.either());\\n if(k+1 < vNum && (!close.isEmpty())){\\n System.out.print(\\\", \\\");\\n }else{\\n System.out.print(\\\"\\\\n\\\");\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c47be175d04ca138ba9e8615fb1883a\",\n \"score\": \"0.54195297\",\n \"text\": \"private Node smallest(Node n) {\\n return null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9fb714ed6eed3feb1e31b04decf542ff\",\n \"score\": \"0.54190135\",\n \"text\": \"int getEdgeCount();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89648fa865877dfb1ed30742caa61dab\",\n \"score\": \"0.5409541\",\n \"text\": \"@Override\\n\\tpublic int edgeSize() {\\n\\t\\treturn 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"083e3bfb3704c499fecb32b9dd867b0f\",\n \"score\": \"0.54060704\",\n \"text\": \"public interface OptimizedGraph<N>{\\n /**This is used in the same way as getConnections(), but does not use Connection objects.*/\\n N[] connectionsOf(N node);\\n\\n /** Returns the unique index of the given node.\\n * @param node the node whose index will be returned\\n * @return the unique index of the given node. */\\n int getIndex (N node);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c84815cca605d2e4ee6ce7a81b7ea930\",\n \"score\": \"0.5403468\",\n \"text\": \"private void consolidate()\\r\\n\\t{\\r\\n\\t\\tint D = (int) (Math.log10(n)/Math.log10(1.61803));\\r\\n\\r\\n\\t\\tFibNode x = min;\\r\\n\\t\\tint RootListLen = 0;\\r\\n\\t\\tdo{\\r\\n\\t\\t\\tRootListLen++;\\r\\n\\t\\t\\tx = x.right;\\r\\n\\t\\t}while(x != min);\\r\\n\\t\\t\\r\\n\\t\\tFibNode[] A = new FibNode[D];\\r\\n\\t\\tx = min;\\r\\n\\t\\tfor(int i = 0; i < RootListLen; i++)\\r\\n\\t\\t{\\r\\n\\t\\t\\tint d = x.degree;\\r\\n\\t\\t\\twhile(A[d] != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tFibNode y = A[d];\\r\\n\\t\\t\\t\\tif(x.key > y.key)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//exchange x <-> y\\r\\n\\t\\t\\t\\t\\tFibNode temp = x;\\r\\n\\t\\t\\t\\t\\tx = y;\\r\\n\\t\\t\\t\\t\\ty = temp;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tFib_heap_link(y, x);\\r\\n\\t\\t\\t\\tA[d] = null;\\r\\n\\t\\t\\t\\td++;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tA[d] = x;\\r\\n\\t\\t\\tx = x.right;\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tmin = null;\\r\\n\\t\\tfor(int i = 0; i < D; i++)\\r\\n\\t\\t\\tif(A[i] != null)\\r\\n\\t\\t\\t\\tif(min == null || A[i].key < min.key)\\r\\n\\t\\t\\t\\t\\tmin = A[i];\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f7835b492641677621d9623dd62443a\",\n \"score\": \"0.5396368\",\n \"text\": \"protected abstract int getMinimumNumberOfBlocksForAssembledMachine();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c6d4168c8c967fb3aa03891666297d7\",\n \"score\": \"0.53947204\",\n \"text\": \"private Node getSmallestUnSettledNodeCost()\\n {\\n double minVal = Double.MAX_VALUE;\\n Node minNode = null;\\n for(Node node : costToUnsettledNodes.keySet())\\n {\\n double costToNode = costToUnsettledNodes.get(node);\\n if(minVal > costToNode)\\n {\\n minVal = costToNode;\\n minNode = node;\\n }\\n }\\n\\n return minNode;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6d118661498e628c1c7d281c27b8165b\",\n \"score\": \"0.53815854\",\n \"text\": \"public int computePaths()\\n {\\n source = fringe.findMin();\\n source.distance = 0;\\n //visit each vertex, visiting vertex with minDistance first\\n //need some kind of data structure (binary min heap?) to function as priority queue\\n //priority queue would contain all veriticies in the graph\\n //after visiting vertex, remove it from the priority queue and put it into a collection\\n //of visited verticies--so we don't go back to it and create a cycle\\n while (!fringe.isEmpty())\\n {\\n v = fringe.deleteMin();\\n if (v.known = false)\\n {\\n v.known = true;\\n for (int i = 0; i < v.adj.length; i++)\\n if (v.adj[i].known = false)\\n {\\n for (int j = 0; j < v.outEdges.length; j++)\\n if (v.outEdges[j].getVertex2 == adj[i])\\n e = v.outEdges[j]; \\n if (v.adj[i].distance > v.distance + e.weight)\\n {\\n v.adj[i].distance = v.distance + e.weight;\\n fringe.percolateDown(0);\\n }\\n \\n }\\n } \\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79af3d66dc4350612aece586a59a5663\",\n \"score\": \"0.5376849\",\n \"text\": \"public int[][] undirUnconGraph(int n,int maxWeight){\\n \\n int [][]undir=init(n);\\n // int[][] undir = new int[n][n];\\n Random rand = new Random();\\n int k = rand.nextInt(n*(n-1)/2);\\n for(int i=0; i<k;i++){\\n undirUnconEdges(undir,maxWeight);\\n }\\n return undir;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"76a6b48c250bd7ef520bea55b74ec07c\",\n \"score\": \"0.53753704\",\n \"text\": \"public int first() { return edges.firstIn(); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab542a39ab9f386f1f3ffb6f74ea96c0\",\n \"score\": \"0.5373269\",\n \"text\": \"public static void main(String[] args) {\\n \\n Scanner sc = new Scanner(System.in);\\n int N = sc.nextInt(); //numVertices\\n int M = sc.nextInt(); //numEdges\\n DEdge[] adj = new DEdge[N]; //N empty adjacency lists\\n\\n \\n for (int i = 0; i < M; ++i) {\\n int u = sc.nextInt()-1;\\n int v = sc.nextInt()-1;\\n int h = sc.nextInt();\\n adj[u] = new DEdge(v, h, adj[u]);\\n adj[v] = new DEdge(u, h, adj[v]);\\n }\\n \\n PriorityQueue<Pair> pq = new PriorityQueue<Pair>(\\n new Comparator<Pair> () {\\n public int compare(Pair a, Pair b) {\\n return b.vht - a.vht; //maxPQ\\n }\\n }\\n );\\n\\n \\n int[] ht = new int[N];\\n ht[0] = 1000; //max height\\n \\n pq.add(new Pair(ht[0], 0));\\n while (!pq.isEmpty()) {\\n \\n Pair max = pq.poll(); //relax edges in max height order\\n if (max.vht == ht[max.vert]) { //check if height has updated since this PQ entry\\n while (adj[max.vert] != null) { //check entire adjacency list\\n \\n //relax method provided in class (Grigni)\\n if (Math.min(ht[max.vert], adj[(max.vert)].h) > ht[(adj[max.vert].v)]) {\\n ht[(adj[max.vert].v)] = (Math.min(ht[max.vert], adj[(max.vert)].h));\\n pq.add(new Pair(ht[(adj[max.vert].v)], adj[max.vert].v));\\n }\\n \\n adj[max.vert] = adj[max.vert].next; //check next vertex in adjacency list\\n }\\n }\\n }\\n\\n\\n //print max height for path to each vertex \\n for (int l = 1; l < N; l++) {\\n System.out.print(ht[l] + \\\" \\\");\\n } \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77910b11a966e90d68c79303f62c0e7e\",\n \"score\": \"0.53728807\",\n \"text\": \"public int getNumNodes();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa1a2d972300a40bd9f2d3e6c799668f\",\n \"score\": \"0.5370474\",\n \"text\": \"@Override\\n public int nodeSize() {\\n return wGraph.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09b2fa1dc6ee8fd1b971c4bc2d750855\",\n \"score\": \"0.5365205\",\n \"text\": \"public static int[] findRedundantConnectionUnionFind(int[][] edges) {\\n DSU dsu = new DSU(MAX_EDGE_VAL + 1);\\n for (int[] edge: edges) {\\n if (!dsu.union(edge[0], edge[1])) return edge;\\n }\\n throw new AssertionError();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6098fe8dce77c5d1a7b419ef05e2ec65\",\n \"score\": \"0.53643954\",\n \"text\": \"public Graph<Integer> randSimpGraph(int n);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b775ab532a4962e4e56c853c64afee88\",\n \"score\": \"0.53587687\",\n \"text\": \"@SuppressWarnings(\\\"Main Logic\\\")\\n void solve() {\\n int des = ii(), k = ii();\\n boolean used[] = new boolean[1000001];\\n used[0] = used[des] = true;\\n HashMap<Edge, Integer> graph = new HashMap<>();\\n for (int i = 0; i < k; i++) {\\n int u = ii(), v = ii(), w = ii();\\n if (u > des || v > des) continue;\\n used[u] = used[v] = true;\\n Edge e = new Edge(u, v);\\n if (graph.containsKey(e)) graph.put(e, Math.min(graph.get(e), w));\\n else graph.put(e, w);\\n }\\n int V[] = vertices(used);\\n int n = 0;\\n for (int v : V) n = Math.max(n, v + 1);\\n for (int i = 0; i < V.length; i++) {\\n for (int j = i + 1; j < V.length; j++) {\\n int u = V[i], v = V[j], w = Math.abs(V[j] - V[i]);\\n// out.println(u + \\\" \\\" + v + \\\" \\\" + w);\\n Edge e = new Edge(u, v);\\n if (graph.containsKey(e)) graph.put(e, Math.min(graph.get(e), w));\\n else graph.put(e, w);\\n }\\n }\\n int m = graph.size();\\n int from[] = new int[m];\\n int to[] = new int[m];\\n int w[] = new int[m];\\n int c = 0;\\n for (Map.Entry<Edge, Integer> es : graph.entrySet()) {\\n Edge e = es.getKey();\\n int we = es.getValue();\\n int u = e.from, v = e.to;\\n from[c] = u;\\n to[c] = v;\\n w[c++] = we;\\n }\\n// for (int i = 0; i < m; i++) {\\n// out.println(from[i] + \\\" \\\" + to[i] + \\\" \\\" + w[i]);\\n// }\\n g = packWD(n, from, to, w);\\n long d[] = Dij(0, g);\\n out.println(d[des]);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13733bddf52ec6760fa4933852f30d46\",\n \"score\": \"0.53578794\",\n \"text\": \"private void removeEmptyNetworkEdge(Network network){\\n List<NetworkEdge> networkEdges = new ArrayList<>(network.getEdges());\\n\\n List<NetworkEdge> removableEdges = networkEdges.stream()\\n .filter(e -> !e.isRootEdge())\\n .filter(e -> e.childNode.isReassortment())\\n .filter(e -> e.hasSegments.cardinality()==0)\\n .filter(e -> e.parentNode.isCoalescence())\\n .collect(Collectors.toList());\\n \\n while (removableEdges.size()>0){\\n int edgeInd = Randomizer.nextInt(removableEdges.size()); \\n \\n \\tremoveEmptyReassortmentEdge(network, removableEdges.get(edgeInd));\\n \\t\\n \\tnetworkEdges = new ArrayList<>(network.getEdges());\\n \\n removableEdges = networkEdges.stream()\\n .filter(e -> !e.isRootEdge())\\n .filter(e -> e.childNode.isReassortment())\\n .filter(e -> e.hasSegments.cardinality()==0)\\n .filter(e -> e.parentNode.isCoalescence())\\n .collect(Collectors.toList()); \\n } \\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"594ec9ab75ba6c4df7eb357b2cd01995\",\n \"score\": \"0.53570527\",\n \"text\": \"private static void printVisited() {\\n\\t\\tint count = 0;\\n\\t\\tfor ( int i = 0 ; i < n; i ++ ) {\\n\\t\\t\\tfor ( int j = 0 ; j < m;j++ ) {\\n\\t\\t\\t\\tif ( visited[i][j] == 0 ) count++;\\n//\\t\\t\\t\\tSystem.out.print(visited[i][j] + \\\" \\\");\\n\\t\\t\\t}\\n//\\t\\t\\tSystem.out.println();\\n\\t\\t}\\n//\\t\\tSystem.out.println(count);\\n\\t\\tif ( count < min ) min = count;\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7a8e53b68e6b43e832bc8c5e1392ad\",\n \"score\": \"0.5355866\",\n \"text\": \"public static int getLowerBoundMaxMatch (HashSet<Edge> unCoveredEdges, LinkedList<Edge>[] adj) {\\n int lowerBound = 0;\\n HashSet<Edge> coveredEdges = new HashSet<Edge>();\\n int numEdge = unCoveredEdges.size();\\n for (Edge e : unCoveredEdges) {\\n if (numEdge == coveredEdges.size()) break;\\n if (!coveredEdges.contains(e)){\\n int u = e.endPoint();\\n int v = e.endPoint(u);\\n lowerBound+=2;\\n coveredEdges.addAll(adj[u]);\\n coveredEdges.addAll(adj[v]);\\n coveredEdges.add(e);\\n }\\n }\\n return lowerBound/2;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b0fce843b5a889ef9fdde2e97d5d58b\",\n \"score\": \"0.5355738\",\n \"text\": \"Set<Edge> incomingEdgesOf(Vertex vertex);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09d1ac6a10296177d8d7c17c79b66763\",\n \"score\": \"0.53539205\",\n \"text\": \"private void findImportantNodes()\\n\\t{\\n\\t\\t// We use a modified version of quickselect to get the important nodes.\\n\\t\\t\\n\\t\\t// Keep track of all nodes still being considered.\\n\\t\\tSet<String> node_set = new HashSet<String>();\\n\\t\\tnode_set.addAll(node_map.keySet());\\n\\t\\t\\n\\t\\t// Keep track of the important nodes.\\n\\t\\tint available_space = options.getMaxImportantNodes();\\n\\t\\t\\n\\t\\t// Keep track of those elements with IC score larger than the pivot,\\n\\t\\t// those with IC score equal to the pivot, and those with IC score\\n\\t\\t// less than the pivot.\\n\\t\\tSet<String> large = new HashSet<String>();\\n\\t\\tSet<String> equal = new HashSet<String>();\\n\\t\\tSet<String> small = new HashSet<String>();\\n\\t\\t\\n\\t\\twhile (node_set.size() > available_space)\\n\\t\\t{\\n\\t\\t\\t// Keep a pivot for partitioning.\\n\\t\\t\\tString pivot = node_set.iterator().next();\\n\\t\\t\\tdouble pivot_ic = node_map.get(pivot).getICScore();\\n\\t\\t\\t\\n\\t\\t\\t// Partition the nodes by IC score.\\n\\t\\t\\tfor (String current_node : node_set)\\n\\t\\t\\t{\\t\\t\\t\\t\\n\\t\\t\\t\\t// Check each node against the pivot and partition accordingly.\\n\\t\\t\\t\\tdouble current_ic = node_map.get(current_node).getICScore();\\n\\t\\t\\t\\tif (current_ic > pivot_ic)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tlarge.add(current_node);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (current_ic < pivot_ic)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tsmall.add(current_node);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tequal.add(current_node);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// If we've got more large elements than nodes we want to keep,\\n\\t\\t\\t// throw out all the small nodes and recurse on the large ones.\\n\\t\\t\\tif (large.size() > available_space)\\n\\t\\t\\t{\\n\\t\\t\\t\\tnode_set.retainAll(large);\\n\\t\\t\\t\\tlarge.clear();\\n\\t\\t\\t\\tequal.clear();\\n\\t\\t\\t\\tsmall.clear();\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Otherwise, all the large nodes are important.\\n\\t\\t\\timportant_nodes.addAll(large);\\n\\t\\t\\tavailable_space -= large.size();\\n\\t\\t\\t\\n\\t\\t\\t// If we've got more elements with equal IC scores than available\\n\\t\\t\\t// space, throw them all out and say we're done.\\n\\t\\t\\tif (equal.size() > available_space)\\n\\t\\t\\t{\\n\\t\\t\\t\\tnode_set.clear();\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Otherwise, the equal node are important too.\\n\\t\\t\\timportant_nodes.addAll(equal);\\n\\t\\t\\tavailable_space -= equal.size();\\n\\t\\t\\t\\n\\t\\t\\t// Recurse on the small nodes.\\n\\t\\t\\tnode_set.retainAll(small);\\n\\t\\t\\tlarge.clear();\\n\\t\\t\\tequal.clear();\\n\\t\\t\\tsmall.clear();\\n\\t\\t}\\n\\t\\t\\n\\t\\t// When we have space for all the remaining nodes, they're all important.\\n\\t\\timportant_nodes.addAll(node_set);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd76b20bcd86a95813598a71400a15c8\",\n \"score\": \"0.5353039\",\n \"text\": \"public LazyPrimMst(WeightedUndirectedGraph graph) {\\n // It is expected that the graph is connected.\\n final int vertexCount = graph.vertexCount();\\n final boolean[] verticesOnMst = new boolean[vertexCount];\\n final Queue<Edge> minEdges = new PriorityQueue<>(graph.edgeCount());\\n final int mstSize = vertexCount - 1;\\n // Start with initial vertex and then grow the MST from that vertex.\\n addAdjacentEdges(graph, minEdges, verticesOnMst, 0);\\n while (!minEdges.isEmpty() && mstEdges.size() < mstSize) {\\n // An edge that could potentially be added into the MST\\n final Edge minEdge = minEdges.remove();\\n final int vertex1 = minEdge.eitherVertex();\\n final int vertex2 = minEdge.otherVertex(vertex1);\\n // Found an edge that is already in the MST.\\n if (verticesOnMst[vertex1] && verticesOnMst[vertex2]) continue;\\n mstEdges.add(minEdge);\\n totalWeight += minEdge.weight();\\n // Explore other edges of the graph.\\n if (!verticesOnMst[vertex1]) {\\n addAdjacentEdges(graph, minEdges, verticesOnMst, vertex1);\\n }\\n if (!verticesOnMst[vertex2]) {\\n addAdjacentEdges(graph, minEdges, verticesOnMst, vertex2);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec17bbe9456e5d7f8ea277685c9ebc0f\",\n \"score\": \"0.53478247\",\n \"text\": \"Dimension minimumSize(int rows, int cols);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"528f00a39ea3daad211a3f29bef5b1c1\",\n \"score\": \"0.53462315\",\n \"text\": \"private static int checkConnections(PersonVertex p) {\\n\\t\\treturn checkConnections(p, new ArrayList<PersonVertex>(), 0).size() - 1;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67b855d096903884786215863bd145c8\",\n \"score\": \"0.53428227\",\n \"text\": \"public AbstractGraph(int n) {\\n\\t\\tnbEdges = 0;\\n\\t\\tadjacencyList = new ArrayList<List<Integer>>();\\n\\t\\tfor ( int i = 0; i < n; i++ )\\n\\t\\t\\tadjacencyList.add(new LinkedList<Integer>());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1bdbb54d4b33999f970e7c8552eda120\",\n \"score\": \"0.534241\",\n \"text\": \"public static void main(String... args) {\\n int V = parseInt(args[0]),\\n minEdges = parseInt(args[1]),\\n maxWeight = parseInt(args[2]);\\n long seed = parseLong(args[3]);\\n\\n int[][] E = randomConnectedGraph(V, minEdges, maxWeight, seed);\\n if (args.length > 4) {\\n printEdges(E);\\n }\\n int[][] T = MST.mst(V, E);\\n System.out.println(totalWeight(T));\\n if (args.length > 4) {\\n printEdges(T);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe2ee6832fe8f0f4b73b081d8c3879b4\",\n \"score\": \"0.5335434\",\n \"text\": \"public List<Node> findConnected(Collection<Node> nodes, boolean includeDerivedEdges);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c8c695816b3e07fb714514cd3d09da71\",\n \"score\": \"0.53342485\",\n \"text\": \"private void generate()\\n {\\n // All the nodes we have processed so far.\\n ArrayList<Integer> allNodesSoFar = new ArrayList<Integer>();\\n allNodesSoFar.add(1);\\n allNodesSoFar.add(2);\\n\\n // Add an edge between the first two nodes if possible. \\n if (this.numNodes >= 2)\\n addUndirectedEdge(1, 2);\\n\\n // The total edges we have added so far.\\n double totalEdges = 1.0;\\n\\n // For each node except the first two...\\n for (int i = 3; i <= this.numNodes; i++)\\n {\\n // Nodes we can possibly choose from.\\n ArrayList<Integer> possible = new ArrayList<Integer>(allNodesSoFar);\\n\\n // Add links until we run out of nodes or run out of links.\\n for (int k = 1; k <= this.disparity && k < i; k++)\\n {\\n // Have we created this edge?\\n boolean created = false;\\n\\n // We will keep on trying to create the edge.\\n // An edge will not be created if it already exists.\\n while(!created)\\n {\\n // Our previous and current index in the distribution.\\n double prev = 0.0;\\n double curr = 0.0;\\n\\n // The new edge we selected from the distribution.\\n double newEdge = Math.random();\\n\\n // Search all the possible nodes we can add for the edge we\\n // need to add.\\n for (Integer possibility : possible)\\n {\\n // The neighbors of the node we are considering. \\n Set<Integer> possNeighs = this.nodes.get(possibility).getNeighbors();\\n \\n // Update our right endpoint in the distribution.\\n // Halve the value because we only have undirected edges.\\n curr += 0.5*(possNeighs.size() / totalEdges);\\n\\n // If the random number falls between these bounds this\\n // might be the edge we are going to add.\\n if (prev <= newEdge && newEdge < curr)\\n {\\n // Only add the edge if it doesn't already exist.\\n if(!possNeighs.contains(i))\\n {\\n addUndirectedEdge(i, possibility);\\n created = true;\\n }\\n // Break out of the for loop regardless of whether\\n // an edge was added or not.\\n break;\\n }\\n prev = curr;\\n }\\n }\\n // We have created a new edge.\\n totalEdges++;\\n }\\n\\n // We have now seen this node.\\n allNodesSoFar.add(i);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"393f4afbe41b7831c0fe5d9b999bf3c4\",\n \"score\": \"0.5329141\",\n \"text\": \"protected abstract Integer getInitialConnections();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7d8565b614d53c006efcddee97f824b\",\n \"score\": \"0.5328402\",\n \"text\": \"static void initNodeNeighbors() {\\r\\n for (Node node : nodes) {\\r\\n int count = 0; // Count number of neighbors of node\\r\\n for (Relation relation : relations) {\\r\\n if (relation.hasNode(node)) { ++count; }\\r\\n }\\r\\n node.setNeighbors(count);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49bd68997127a45a1134bb819bb75cb7\",\n \"score\": \"0.5325536\",\n \"text\": \"public JavaPairRDD<Tuple2<Integer, Integer>, IntSet> start(JavaPairRDD<Integer, Integer> edges) {\\n JavaPairRDD<Tuple2<Integer, Integer>, IntSet> tvSets = createTriangleVertexSet(edges);\\n\\n final int minSup = conf.k - 2;\\n\\n int iteration = 0;\\n boolean stop = false;\\n\\n while (!stop) {\\n// JavaPairRDD<Tuple2<Integer, Integer>, IntSet> prevTvSets = tvSets;\\n iteration++;\\n long t1 = System.currentTimeMillis();\\n\\n // Detect invalid edges by comparing the support of triangle vertex set\\n JavaPairRDD<Tuple2<Integer, Integer>, IntSet> invalids = tvSets.filter(kv -> kv._2.size() < minSup).cache();\\n JavaPairRDD<Tuple2<Integer, Integer>, IntSet> prevInvalids = invalids;\\n long invalidEdgeCount = invalids.count();\\n\\n // If no invalid edge is found then the program terminates\\n if (invalidEdgeCount == 0) {\\n break;\\n }\\n long t2 = System.currentTimeMillis();\\n String msg = \\\"iteration: \\\" + iteration + \\\", invalid edge count: \\\" + invalidEdgeCount;\\n log(msg, t2 - t1);\\n\\n // The edges in the key part of invalids key-values should be removed. So, we detect other\\n // edges of their involved triangle from their triangle vertex set. Here, we determine the\\n // vertices which should be removed from the triangle vertex set related to the other edges.\\n JavaPairRDD<Tuple2<Integer, Integer>, Iterable<Integer>> invUpdates = invalids.flatMapToPair(kv -> {\\n IntSet original = kv._2;\\n List<Tuple2<Tuple2<Integer, Integer>, Integer>> out = new ArrayList<>(original.size() * 2);\\n Tuple2<Integer, Integer> iEdge = kv._1;\\n\\n for (Integer w : kv._2) {\\n if (w < iEdge._1)\\n out.add(new Tuple2<>(new Tuple2<>(w, iEdge._1), iEdge._2));\\n else\\n out.add(new Tuple2<>(new Tuple2<>(iEdge._1, w), iEdge._2));\\n\\n if (w < iEdge._2)\\n out.add(new Tuple2<>(new Tuple2<>(w, iEdge._2), iEdge._1));\\n else\\n out.add(new Tuple2<>(new Tuple2<>(iEdge._2, w), iEdge._1));\\n }\\n return out.iterator();\\n }).groupByKey(partitioner2);\\n\\n // Remove the invalid vertices from the triangle vertex set of each remaining (valid) edge.\\n tvSets = tvSets.filter(kv -> kv._2.size() >= minSup).leftOuterJoin(invUpdates)\\n .mapValues(values -> {\\n Optional<Iterable<Integer>> invalidUpdate = values._2;\\n IntSet original = values._1;\\n\\n // If no invalid vertex is present for the current edge then return the original value.\\n if (!invalidUpdate.isPresent()) {\\n return original;\\n }\\n\\n // Remove all invalid vertices from the original triangle vertex set.\\n for (Integer v : invalidUpdate.get()) {\\n original.remove(v.intValue());\\n }\\n\\n // When the triangle vertex set has no other element then the current edge should also\\n // be eliminated from the current tvSets.\\n if (original.size() == 0)\\n return null;\\n\\n return original;\\n }).filter(kv -> kv._2 != null)\\n .persist(StorageLevel.MEMORY_ONLY());\\n// prevTvSets.unpersist();\\n// prevInvalids.unpersist();\\n }\\n return tvSets;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5da798d787883a5f75de47ad7224ff2e\",\n \"score\": \"0.5324252\",\n \"text\": \"public int findNumberOfOneWays()\\r\\n\\t{\\r\\n\\t\\tint sum = 0;\\r\\n\\r\\n\\t\\tfor (Edge e : edges)\\r\\n\\t\\t\\tif(findEdge(e.getTo(), e.getFrom()) == null)\\r\\n\\t\\t\\t\\tsum++;\\r\\n\\r\\n\\t\\treturn sum;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f394479b0aaf855346c960157f35e6f6\",\n \"score\": \"0.5323953\",\n \"text\": \"public void test_computeShortestCycles_general_sameSizeShortestCycles() {\\n\\n /*\\n * Graph (k = vertex of index and id k).\\n * \\n * -> 1 <-\\n * / / \\\\ \\\\\\n * / v v \\\\\\n * 0 4 5 2\\n * ^ \\\\ / ^\\n * \\\\ v /\\n * -- 3 --\\n * \\n * All cycles:\\n * [0,1,4,3]\\n * [0,1,5,3]\\n * [1,4,3,2]\\n * [1,5,3,2]\\n */\\n \\n final ArrayList<InterfaceVertex> vByIndex = new ArrayList<InterfaceVertex>();\\n GraphTestsUtilz.newInGraph(vByIndex, 0);\\n GraphTestsUtilz.newInGraph(vByIndex, 1);\\n GraphTestsUtilz.newInGraph(vByIndex, 2);\\n GraphTestsUtilz.newInGraph(vByIndex, 3);\\n GraphTestsUtilz.newInGraph(vByIndex, 4);\\n GraphTestsUtilz.newInGraph(vByIndex, 5);\\n GraphTestsUtilz.ensurePathFromIndexes(vByIndex, 0, 1, 4, 3, 0);\\n GraphTestsUtilz.ensurePathFromIndexes(vByIndex, 2, 1, 5, 3, 2);\\n\\n final Random random = new Random(SEED);\\n\\n for (int k = 0; k < 100; k++) {\\n @SuppressWarnings(\\\"unchecked\\\")\\n final List<InterfaceVertex> graph = (List<InterfaceVertex>) vByIndex.clone();\\n\\n // Result won't depend on vertices order in input collection.\\n shuffle(random, graph);\\n\\n if (DEBUG) {\\n GraphTestsUtilz.printGraph(graph);\\n }\\n\\n for (boolean mustUseRefAlgo : new boolean[]{false,true}) {\\n\\n if (DEBUG) {\\n System.out.println(\\\"mustUseRefAlgo = \\\" + mustUseRefAlgo);\\n }\\n\\n final MyCycleComputerVcp processor = new MyCycleComputerVcp();\\n if (mustUseRefAlgo) {\\n RefShortestCyclesComputer.computeShortestCycles(graph, -1, processor);\\n } else {\\n ShortestCyclesComputer.computeShortestCycles(graph, -1, processor);\\n }\\n\\n final List<List<InterfaceVertex>> expectedCycleList = new ArrayList<List<InterfaceVertex>>();\\n expectedCycleList.add(GraphTestsUtilz.asListFromIndexes(vByIndex, 0, 1, 4, 3));\\n expectedCycleList.add(GraphTestsUtilz.asListFromIndexes(vByIndex, 0, 1, 5, 3));\\n expectedCycleList.add(GraphTestsUtilz.asListFromIndexes(vByIndex, 1, 4, 3, 2));\\n if (false) {\\n /*\\n * This one is never computed by either algorithm.\\n * \\n * It's normal even for paper algorithm, because it just\\n * look for shortest cycles using all predecessors, not\\n * using all possible paths to these predecessors.\\n */\\n expectedCycleList.add(GraphTestsUtilz.asListFromIndexes(vByIndex, 1, 5, 3, 2));\\n }\\n\\n checkEqualAfterNormalization(expectedCycleList, processor.cycleList);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d3236797f366528d1ac8b6086ffffd3\",\n \"score\": \"0.53198594\",\n \"text\": \"public static void main(String[] args) \\r\\n\\t{\\n\\t\\tn=6; //Integer.parseInt(s[0]);\\r\\n\\t\\tint m=9; //Integer.parseInt(s[1]);\\r\\n\\t\\t \\r\\n\\t int s[][]={{1, 2, 3},{1, 4, 1},{2, 3, 1},{2, 4, 3},{3, 4, 1},{3, 5, 5},{3, 6, 4},{4, 5, 6},{5, 6, 2}} ;\\r\\n\\t \\r\\n\\t\\tfor(int i=0;i<m;i++)\\r\\n\\t\\t{\\r\\n\\t\\t //s=br.readLine().split(\\\" \\\");\\r\\n \\t\\tint a=s[i][0]; //Integer.parseInt(s[0]);\\r\\n \\t\\tint b=s[i][1]; //Integer.parseInt(s[1]);\\r\\n \\t\\tint c=s[i][2]; //Integer.parseInt(s[2]);\\r\\n \\t\\tlist.add(new Edge(a,b,c));\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tmst();\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.println(\\\"Weight of Minimum spanning tree : \\\"+ ans);\\r\\n\\t\\tSystem.out.println(\\\"\\\\nPath between vertices with weight are : \\\\n\\\");\\r\\n\\t\\t\\r\\n\\t\\tfor(Edge node:arr)\\r\\n\\t\\t{\\r\\n\\t\\t System.out.println(\\\"Node \\\"+node.edge1+\\\" to \\\"+node.edge2+\\\" with weight : \\\"+node.weight);\\r\\n\\t\\t}\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dbd02ba79e48ab8b9b249bb41e82719\",\n \"score\": \"0.5318891\",\n \"text\": \"public boolean connected(int n) {\\n return edges.hasConnects(n);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":1194,"cells":{"query_id":{"kind":"string","value":"66355dd04e89a1ed107561768d5847ab"},"query":{"kind":"string","value":"SliderWert hat sich geaendert"},"positive_passages":{"kind":"list like","value":[{"docid":"e441b545684b71ab715874d11f97b2ab","score":"0.0","text":"@Override\n\t\t\tpublic void changed(ObservableValue<? extends Number> v,//\n\t\t\t\t\tNumber oldValue, Number newValue) {\n\t\t\t\tnotifer.run();\n\t\t\t}","title":""}],"string":"[\n {\n \"docid\": \"e441b545684b71ab715874d11f97b2ab\",\n \"score\": \"0.0\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void changed(ObservableValue<? extends Number> v,//\\n\\t\\t\\t\\t\\tNumber oldValue, Number newValue) {\\n\\t\\t\\t\\tnotifer.run();\\n\\t\\t\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"4fe550d0cac5bcf020e6d918f1ddb44a","score":"0.70334727","text":"public void updateSlider() \n { \n /* [GNPP] you may comment out if not debugging. */\n //gnpp.updateSlider();\n }","title":""},{"docid":"d66dc769fe5df9b3c6bed256bbca55b0","score":"0.6729305","text":"private void setupSlider() {\n int mid = WIDTH / 2;\n detailSlider.setEnabled(false);\n detailSlider.setPaintTicks(true);\n detailSlider.setPaintLabels(true);\n detailSlider.setToolTipText(\"Choose a file to convert first!\");\n detailSlider.setSize(300, 50);\n detailSlider.setLocation(mid - detailSlider.getSize().width / 2, 700);\n detailSlider.addChangeListener(this);\n }","title":""},{"docid":"17babd48cacf9026451d8aec71c761a8","score":"0.6635283","text":"public void fenetreVisu(){\r\n\r\n\t\tfenetreVisu = new JFrame(\"M²B²T - Visualisation\");\r\n\t\tfenetreVisu.setDefaultCloseOperation(JFrame.DO_NOTHING_ON_CLOSE);\r\n\t\tfenetreVisu.setIconImage(Toolkit.getDefaultToolkit().getImage(\"images/myIcon.png\"));\r\n\t\tfenetreVisu.setResizable(false);\r\n\r\n\t\tJPanel panelSlider = new JPanel();\r\n\t\tpanelSlider.setLayout(new GridLayout(1,6));\r\n\r\n\t\tHashtable<Integer, JLabel> labelTable = new Hashtable<Integer, JLabel>();\r\n\t\tlabelTable.put( new Integer( 0 ), new JLabel(\"Sous-Sol\") );\r\n\t\tlabelTable.put( new Integer( 4 ), new JLabel(\"RDC\") );\r\n\t\tlabelTable.put( new Integer( SOMMET ), new JLabel(\"Sommet\") );\r\n\r\n\t\t/**\r\n\t\t * Ajout des sliders à la fenetre\r\n\t\t */\r\n\t\tslider0 = new JSlider(JSlider.VERTICAL, RDC, SOMMET, 0);\r\n\t\tslider0.setMajorTickSpacing(1);\r\n\t\tslider0.setPaintTicks(true);\r\n\t\tslider0.setLabelTable( labelTable );\r\n\t\tslider0.setPaintLabels(true);\r\n\t\tslider0.setBorder(new TitledBorder(\"Ascenseur A\"));\r\n\r\n\r\n\t\tslider1 = new JSlider(JSlider.VERTICAL, RDC, SOMMET, 0);\r\n\t\tslider1.setMajorTickSpacing(1);\r\n\t\tslider1.setPaintTicks(true);\r\n\t\tslider1.setLabelTable( labelTable );\r\n\t\tslider1.setPaintLabels(true);\r\n\t\tslider1.setBorder(new TitledBorder(\"Ascenseur B\"));\r\n\r\n\r\n\t\tslider2 = new JSlider(JSlider.VERTICAL, RDC, SOMMET, 0);\r\n\t\tslider2.setMajorTickSpacing(1);\r\n\t\tslider2.setPaintTicks(true);\r\n\t\tslider2.setLabelTable( labelTable );\r\n\t\tslider2.setPaintLabels(true);\r\n\t\tslider2.setBorder(new TitledBorder(\"Ascenseur C\"));\r\n\r\n\t\tslider3 = new JSlider(JSlider.VERTICAL, RDC, SOMMET, 0);\r\n\t\tslider3.setMajorTickSpacing(1);\r\n\t\tslider3.setPaintTicks(true);\r\n\t\tslider3.setLabelTable( labelTable );\r\n\t\tslider3.setPaintLabels(true);\r\n\t\tslider3.setBorder(new TitledBorder(\"Ascenseur D\"));\r\n\r\n\t\tslider4 = new JSlider(JSlider.VERTICAL, RDC, SOMMET, 0);\r\n\t\tslider4.setMajorTickSpacing(1);\r\n\t\tslider4.setPaintTicks(true);\r\n\t\tslider4.setLabelTable( labelTable );\r\n\t\tslider4.setPaintLabels(true);\r\n\t\tslider4.setBorder(new TitledBorder(\"Ascenseur E\"));\r\n\r\n\r\n\t\tslider5 = new JSlider(JSlider.VERTICAL, RDC, SOMMET, 0);\r\n\t\tslider5.setMajorTickSpacing(1);\r\n\t\tslider5.setPaintTicks(true);\r\n\t\tslider5.setLabelTable( labelTable );\r\n\t\tslider5.setPaintLabels(true);\r\n\t\tslider5.setBorder(new TitledBorder(\"Ascenseur F\"));\r\n\r\n\t\tpanelSlider.add(slider0);\r\n\t\tpanelSlider.add(slider1);\r\n\t\tpanelSlider.add(slider2);\r\n\t\tpanelSlider.add(slider3);\r\n\t\tpanelSlider.add(slider4);\r\n\t\tpanelSlider.add(slider5);\r\n\r\n\t\tfenetreVisu.add(panelSlider);\r\n\r\n\t\t/**\r\n\t\t * Fait disparaitre la fenetre de sliders au clic de la croix\r\n\t\t */\r\n\t\tfenetreVisu.addWindowListener(new WindowAdapter() {\r\n\t\t\tpublic void windowClosing(WindowEvent e) {\r\n\t\t\t\tfenetreVisu.setVisible(false);\r\n\t\t\t}\r\n\t\t});\r\n\r\n\t\tfenetreVisu.pack();\r\n\t\tfenetreVisu.setVisible(false);\r\n\t}","title":""},{"docid":"a6c4fb41f94f8d6a9d3327e4d1a26d94","score":"0.65629864","text":"@Override\n\t\tpublic final void mouseDragged(MouseEvent me)\n\t\t\t{\n\t\t\t\tint sliderIndex = 0;\n\t\t\t\tfor (TButton slider : sliders)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (slider.inUse)\n\t\t\t\t\t\t\tif (orientation == VERTICAL)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tslider.y = me.getY() - 12.5f;\n\t\t\t\t\t\t\t\t\tif (slider.y < y)\n\t\t\t\t\t\t\t\t\t\tslider.y = y;\n\t\t\t\t\t\t\t\t\telse if (slider.y > y + length - 25)\n\t\t\t\t\t\t\t\t\t\tslider.y = y + length - 25;\n\t\t\t\t\t\t\t\t\tsendTScrollEvent(new TScrollEvent(this, TScrollEvent.TSCROLLBARSCROLLED, getSliderPercent(sliderIndex), sliderIndex));\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if (orientation == HORIZONTAL)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tslider.x = me.getX() - 12.5f;\n\t\t\t\t\t\t\t\t\tif (slider.x < x)\n\t\t\t\t\t\t\t\t\t\tslider.x = x;\n\t\t\t\t\t\t\t\t\telse if (slider.x > x + length - 25)\n\t\t\t\t\t\t\t\t\t\tslider.x = x + length - 25;\n\t\t\t\t\t\t\t\t\tsendTScrollEvent(new TScrollEvent(this, TScrollEvent.TSCROLLBARSCROLLED, getSliderPercent(sliderIndex), sliderIndex));\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\tsliderIndex++;\n\t\t\t\t\t}\n\t\t\t}","title":""},{"docid":"b97a23284ef5cf7c6b9b957fc87036cf","score":"0.6516763","text":"@Override\n public void onSliderClick(BaseSliderView slider) {\n }","title":""},{"docid":"1640be68bd5958058879d07d8c95affe","score":"0.65061617","text":"void setCurrentSliderVal(int value);","title":""},{"docid":"e8dc35f6d1e2abe8f46300865e71829a","score":"0.64550966","text":"@Override\n public void onSlideChanged()\n {\n }","title":""},{"docid":"9f58819d1f2cac0c4b1786bbf10fafaa","score":"0.64473003","text":"@Override\n public void setCurrentSliderVal(int value) {\n return;\n }","title":""},{"docid":"eb72e3a36dcc60997df56094229dfbff","score":"0.64304495","text":"public void updatePowerSlider(){\n\t\tif(this.powerValue!=output.getPower()){\n\t\t\tpowerslider.setValue(output.getPower());\n\t\t}\t\t\n\t}","title":""},{"docid":"9d9d2708b809e8c67192415bc2063b42","score":"0.63867086","text":"@Override\n public void onSlideChanged() {\n }","title":""},{"docid":"9d9d2708b809e8c67192415bc2063b42","score":"0.63867086","text":"@Override\n public void onSlideChanged() {\n }","title":""},{"docid":"9d9d2708b809e8c67192415bc2063b42","score":"0.63867086","text":"@Override\n public void onSlideChanged() {\n }","title":""},{"docid":"f85cf8c3cc4e2687094c6d30cfbed314","score":"0.6385563","text":"private void updateGenomeSlider()\n {\n if (paused && triangleGenome != null && triangleGenome.getTribe(tribeIndex) != null)\n {\n genomeSlider.setMaximum(triangleGenome.getTribe(tribeIndex).getPopulationSize() - 1);\n }\n }","title":""},{"docid":"5dfcec2dc7864d48eda2c65820bbab47","score":"0.6366725","text":"private void setSliders() {\n aSlider.setMinimum(0);\n aSlider.setMaximum(100);\n aSlider.setMinorTickSpacing(10);\n aSlider.setPaintTicks(true);\n\n bSlider.setMinimum(0);\n bSlider.setMaximum(100);\n bSlider.setMinorTickSpacing(10);\n bSlider.setPaintTicks(true);\n\n alphaSlider.setMinimum(0);\n alphaSlider.setMaximum(100);\n alphaSlider.setMinorTickSpacing(10);\n alphaSlider.setPaintTicks(true);\n\n betaSlider.setMinimum(0);\n betaSlider.setMaximum(100);\n betaSlider.setMinorTickSpacing(10);\n betaSlider.setPaintTicks(true);\n\n herbSlider.setMinimum(1);\n herbSlider.setMaximum(100);\n herbSlider.setMinorTickSpacing(10);\n herbSlider.setPaintTicks(true);\n\n predSlider.setMinimum(1);\n predSlider.setMaximum(100);\n predSlider.setMinorTickSpacing(10);\n predSlider.setPaintTicks(true);\n\n }","title":""},{"docid":"08b8073b9114be2f3fd7c02ab494aede","score":"0.63476384","text":"void setTimeSlider() {\n\t\t// Create a new time slide\n timeSlider = new Slider();\n timeSlider.setMaxWidth((2*mpWidth)/3);\n HBox.setHgrow(timeSlider, Priority.ALWAYS);\n \n // Allow the user to drag and position the slider\n timeSlider.valueProperty().addListener(new InvalidationListener() {\n\n @Override\n public void invalidated(Observable ov) {\n \t// If the value is changing perform an action\n if (timeSlider.isValueChanging()) {\n \t// If the duration of video is not null, move to requested time\n if (duration != null) {\n \tmp.seek(duration.multiply(timeSlider.getValue()/ 100.0));\n }\n }\n }\n });\n \n // Allow the user to click on the slider to jump to the desired timing\n timeSlider.setOnMousePressed(new EventHandler<MouseEvent>() {\n @Override\n public void handle(MouseEvent mouseEvent) {\n mp.seek(duration.multiply(timeSlider.getValue()/ 100.0));\n }\n });\n \n // Create a new time slider for fullscreen mode\n timeSliderFS = new Slider();\n \ttimeSliderFS.setMinWidth(bounds.getWidth()-100); \t\n \ttimeSliderFS.valueProperty().addListener(new InvalidationListener() {\n\n @Override\n public void invalidated(Observable ov) {\n \t// If the value is changing perform an action\n if (timeSliderFS.isValueChanging()) {\n \t// If the duration of video is not null, move to requested time\n if (duration != null) {\n \tmp.seek(duration.multiply(timeSliderFS.getValue()/ 100.0));\n }\n }\n }\n });\n \n \t// If mouse enters time slider in fullscreen mode handle it\n timeSliderFS.setOnMousePressed(new EventHandler<MouseEvent>() {\n @Override\n public void handle(MouseEvent mouseEvent) {\n \t// Stop the fade transition and move to requested time\n \tfadeTransition.stop();\n \tmp.seek(duration.multiply(timeSliderFS.getValue()/ 100.0));\n }\n });\n \n // Add the time slider to MediaControl bar\n mediaBar.getChildren().add(timeSlider);\n\t}","title":""},{"docid":"3787f43c64e24a63c57b88b94b2ac15c","score":"0.6332391","text":"public void f() {\n GQuery g = $(\"<paper-slider>\").appendTo($(\"#slider-container\"));\n // Wrap the native element in a POJO\n PaperSlider slider = GQ.create(PaperSlider.class).load(g);\n // Use it as a java object\n slider.setValue(300).max(400).step(50).snaps(true).pin(true);\n }","title":""},{"docid":"80672495ec2d642a2d4ee8eaad204976","score":"0.6321406","text":"@Override\n public int getSliderValue() {\n return -1;\n }","title":""},{"docid":"fd52becafa2c7eb412c95a272b56280d","score":"0.6309875","text":"public void setSliderAction() {\n speedSlider.valueProperty().addListener(\n (observable, oldvalue, newvalue) -> {\n timeline.pause();\n updateTimeline(newvalue.doubleValue());\n timeline.play();\n });\n }","title":""},{"docid":"b10e6ad440f743290d62bb01d76bc1d0","score":"0.6280064","text":"private void slider1StateChanged(ChangeEvent e) {\n\t}","title":""},{"docid":"9781ea7696dcca1e6d8458935e15ace9","score":"0.62747353","text":"public void initSlider() {\n speedSlider = new Slider(SPEEDSLIDER_MIN, SPEEDSLIDER_MAX, SPEEDSLIDER_VALUE);\n speedSlider.setShowTickMarks(true);\n speedSlider.setShowTickLabels(true);\n }","title":""},{"docid":"ab729409638bc193a27371641a9f8a1d","score":"0.6244136","text":"@Override\r\n\t\t\tpublic void onClick(View arg0) {\n\t\t\t\tif (slider == 0) {\r\n\t\t\t\t\tMainActivityA.getInstance().showUnitConverterWeightFragment();\r\n\t\t\t\t}\r\n\t\t\t}","title":""},{"docid":"4f42e426931e7a4e77beae38288566bd","score":"0.6238234","text":"private void jSlider1StateChanged(javax.swing.event.ChangeEvent evt) {\n jLabelSlider.setText(Integer.toString(jSlider1.getValue()));\n }","title":""},{"docid":"9eaf32fe609a6d44f7288682fe10d4a3","score":"0.6237586","text":"public JSlider getSlider()\n\t{\n\t\treturn this.slider; \n\t}","title":""},{"docid":"129b43eab068e6129ac2faea9105b823","score":"0.62193924","text":"@Override\n public void actionPerformed(ActionEvent e) {\n //Sound.getWinter().setVolume(0.0001);\n volSlider.setValue(1);\n }","title":""},{"docid":"740495fc514a06687b6f64e7b819b37c","score":"0.62141925","text":"public GZoomSlider getSlider(){\r\n return slider;\r\n }","title":""},{"docid":"694122e7ffb4fe6195fd7d343caabf2e","score":"0.6212777","text":"protected void setupSlider() throws Exception\n\t{\n\t\treturn;\n\n\t}","title":""},{"docid":"b5e7f8e3a5b0557359b2c19d5c108e6a","score":"0.6209754","text":"public void sliderUpdater(WindowComponent win) {\n JSlider playBar = win.getPlayBarComponent().getView().getPlayBar();\n playBar.setMaximum(win.getApiMusic().getNumberOfFrame());\n while( PlayBarController.this.getModel().isPlaying() ) {\n playBar.setValue(win.getApiMusic().getCurrentFrame());\n }\n }","title":""},{"docid":"9d9b8e3652fc39eb44e51d523b7f4d99","score":"0.6207072","text":"private void addControls()\n\t{\n\t\tthis.labelDureeActuelle = new JLabel(\"00:00:00\");\n\t\tthis.labelDureeMax = new JLabel(\"00:00:00\");\n\n\t\tthis.boutonLecture = new JButton();\n\t\tthis.boutonLecture.setIcon(PlayerEventListener.IMG_ICON_LECTURE);\n\t\tthis.boutonLecture.addActionListener(this);\n\t\tthis.boutonLecture.setEnabled(true);\n\n\t\tthis.boutonStop = new JButton();\n\t\tthis.boutonStop.setIcon(PlayerEventListener.IMG_ICON_STOP);\n\t\tthis.boutonStop.addActionListener(this);\n\t\tthis.boutonStop.setEnabled(true);\n\n\t\tthis.slider = new JSlider(JSlider.HORIZONTAL);\n\t\tthis.slider.setPaintTicks(false);\n\t\tthis.slider.setPaintLabels(false);\n\t\tthis.slider.setMinimum(0);\n\t\tthis.slider.setValue(0);\n\t\tthis.slider.setMaximum(1);\n\n\t\tJSlider sliderVolume = new JSlider(JSlider.HORIZONTAL);\n\t\tsliderVolume.setPaintTicks(false);\n\t\tsliderVolume.setPaintLabels(false);\n\t\tsliderVolume.setMinimum(0);\n\t\tsliderVolume.setMaximum(VOLUME_MAX);\n\t\tsliderVolume.setValue(VOLUME_DEFAULT);\n\t\tsliderVolume.setToolTipText(\"Volume\");\n\t\tsliderVolume.setMinimumSize(SLIDER_VOLUME_DIMENSION);\n\t\tsliderVolume.setMaximumSize(SLIDER_VOLUME_DIMENSION);\n\t\tsliderVolume.setPreferredSize(SLIDER_VOLUME_DIMENSION);\n\t\tSliderVolumeListener volumeListener = new SliderVolumeListener(sliderVolume, this.mediaPlayer);\n\t\tsliderVolume.addMouseListener(volumeListener);\n\t\tsliderVolume.addMouseMotionListener(volumeListener);\n\n\t\tSliderPositionEventListener sliderListener = new SliderPositionEventListener(this.slider,\n\t\t\t\tthis.labelDureeActuelle, this.mediaPlayer);\n\t\tthis.slider.addMouseListener(sliderListener);\n\t\tthis.slider.addMouseMotionListener(sliderListener);\n\n\t\tJPanel panelDuree = new JPanel();\n\t\tpanelDuree.setLayout(new BoxLayout(panelDuree, BoxLayout.X_AXIS));\n\t\tpanelDuree.add(Box.createHorizontalStrut(PANEL_MARGIN));\n\t\tpanelDuree.add(labelDureeActuelle, BorderLayout.WEST);\n\t\tpanelDuree.add(Box.createHorizontalStrut(PANEL_MARGIN));\n\t\tpanelDuree.add(slider, BorderLayout.CENTER);\n\t\tpanelDuree.add(Box.createHorizontalStrut(PANEL_MARGIN));\n\t\tpanelDuree.add(labelDureeMax, BorderLayout.EAST);\n\t\tpanelDuree.add(Box.createHorizontalStrut(PANEL_MARGIN));\n\n\t\tJToolBar toolBar = new JToolBar();\n\t\ttoolBar.setLayout(new BoxLayout(toolBar, BoxLayout.X_AXIS));\n\t\ttoolBar.setFloatable(false);\n\t\ttoolBar.add(boutonLecture);\n\t\ttoolBar.add(boutonStop);\n\t\ttoolBar.add(Box.createHorizontalGlue());\n\t\ttoolBar.add(new JLabel(new ImageIcon(\"images/Volume.png\")));\n\t\ttoolBar.add(Box.createHorizontalStrut(PANEL_MARGIN));\n\t\ttoolBar.add(sliderVolume);\n\t\ttoolBar.add(Box.createHorizontalStrut(PANEL_MARGIN));\n\n\t\tthis.setLayout(new GridLayout(2, 1));\n\t\tthis.add(panelDuree);\n\t\tthis.add(toolBar);\n\n\t\tActionMap actionMap = this.getActionMap();\n\t\tInputMap inputMap = this.getInputMap(JComponent.WHEN_IN_FOCUSED_WINDOW);\n\n\t\tinputMap.put(KeyStroke.getKeyStroke(KeyEvent.VK_SPACE, 0), \"space bar\");\n\t\tactionMap.put(\"space bar\", new AbstractAction()\n\t\t{\n\t\t\tprivate static final long serialVersionUID = -7449791455625215682L;\n\n\t\t\t@Override\n\t\t\tpublic void actionPerformed(ActionEvent arg0)\n\t\t\t{\n\t\t\t\tif (mediaPlayer.isPlaying())\n\t\t\t\t{\n\t\t\t\t\tmediaPlayer.pause();\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tmediaPlayer.play();\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t}","title":""},{"docid":"82ef54b7e44e6cca584d5539ce5eff63","score":"0.6136706","text":"@Override\r\n\t\t\tpublic void onClick(View arg0) {\n\t\t\t\tif (slider == 0) {\r\n\t\t\t\t\tMainActivityA.getInstance().showUnitConverterSpeedFragment();\r\n\t\t\t\t}\r\n\t\t\t}","title":""},{"docid":"73461d58f63dd804495e99a42cf3d3fc","score":"0.61270505","text":"@Override\r\n\t\t\tpublic void onClick(View arg0) {\n\t\t\t\tif (slider == 0) {\r\n\t\t\t\t\tMainActivityA.getInstance().showUnitConverterLengthFragment();\r\n\t\t\t\t}\r\n\t\t\t}","title":""},{"docid":"888c8ad940362412f1867487c46a6270","score":"0.6109731","text":"void setVolumeSlider() {\n\t\t// Create a new volume slider\n\t\tvolumeSlider = new Slider();\n\t volumeSlider.setManaged(true);\n\t volumeSlider.setMaxWidth(mpWidth/6);\n\t volumeSlider.setMinWidth(20);\n\t \n\t // Detect the change in volume slider bar and sets the MediaPlayer's volume accordingly\n\t volumeSlider.valueProperty().addListener(new ChangeListener<Number>() {\n\t \n\t \t@Override\n\t public void changed(ObservableValue<? extends Number> observable, Number oldValue, Number newValue) {\n\t \t\tif (volumeSlider.isValueChanging()) {\n\t \t\t\t// If the slider is being dragged set volume to that requested\n\t \t\t\tmp.setVolume(volumeSlider.getValue() / 100.0);\n\t }\n\t \n\t \t\t// Update the text labels to display\n\t \t\tupdateValues();\n\t }\n\t });\n\t \n\t // Add the volume slider to MediaControl bar\n\t mediaBar.getChildren().add(volumeSlider);\n\t}","title":""},{"docid":"b8298ee5356e2eafea2af43fae83acca","score":"0.6103507","text":"@Override\n public void mousePressed(MouseEvent e) {\n System.out.println(\"---- Mouse pressed on Slider\");\n JSlider playBar = win.getPlayBarComponent().getView().getPlayBar();\n double p = e.getPoint().getX();\n double percent = p / ((double) playBar.getWidth());\n int range = playBar.getMaximum() - playBar.getMinimum();\n double newVal = range * percent;\n int result = (int)(playBar.getMinimum() + newVal);\n\n if ( !PlayBarController.this.getModel().isPlaying() ) {\n PlayBarController.this.getModel().setIsPlaying(true);\n Runnable r = new Runnable() {\n public void run() {\n PlayBarController.this.sliderUpdater(win);\n }\n };\n PlayBarController.this.startThread(r);\n }\n\n win.getApiMusic().playSongFromSpecificFrame(result);\n System.out.println(\"---- Result = \" + result +\"\\n\");\n }","title":""},{"docid":"7de60cb3e15efc5ded9fa975d0565a9b","score":"0.60954094","text":"private void init_slider()\r\n\t{\r\n\t\tstrokeSlider = new JSlider(JSlider.HORIZONTAL, 0, 19, 3);\r\n\t\tstrokeSlider.setBackground(BACKGROUND);\r\n\t\t\r\n\t\tfinal Map<Integer, Integer> zoomValues = new HashMap<Integer, Integer>();\r\n\t\tzoomValues.put(0, 1);\r\n\t\tzoomValues.put(1, 2);\r\n\t\tzoomValues.put(2, 3);\r\n\t\tzoomValues.put(3, 4);\r\n\t\tzoomValues.put(4, 5);\r\n\t\tzoomValues.put(5, 6);\r\n\t\tzoomValues.put(6, 7);\r\n\t\tzoomValues.put(7, 8);\r\n\t\tzoomValues.put(8, 9);\r\n\t\tzoomValues.put(9, 10);\r\n\t\t\r\n\t\tzoomValues.put(10, 11);\r\n\t\tzoomValues.put(11, 12);\r\n\t\tzoomValues.put(12, 13);\r\n\t\tzoomValues.put(13, 14);\r\n\t\tzoomValues.put(14, 15);\r\n\t\tzoomValues.put(15, 16);\r\n\t\tzoomValues.put(16, 17);\r\n\t\tzoomValues.put(17, 18);\r\n\t\tzoomValues.put(18, 19);\r\n\t\tzoomValues.put(19, 20);\r\n\t\t\r\n\t\tstrokeSlider.setValue(4);\r\n\r\n\r\n\t\tstrokeSlider.setMajorTickSpacing(1);\r\n\t\tstrokeSlider.setPaintTicks(true);\r\n\t\tstrokeSlider.setSnapToTicks(true);\r\n\t\t\r\n\t\tshowLabel(strokeSlider, zoomValues);\r\n\t\t// add Listener\r\n\t\tstrokeSlider.addChangeListener(new ChangeListener() \r\n\t\t{\r\n\t\t\t@Override\r\n\t\t\tpublic void stateChanged(ChangeEvent arg0) \r\n\t\t\t{\r\n\t\t\t\tshowLabel(strokeSlider, zoomValues);\r\n\t\t\t\tMainControl.stroke = zoomValues.get(strokeSlider.getValue());\r\n\t\t\t\tif (MainControl.selected != null && MainControl.selected instanceof ShapeDrawing) \r\n\t\t\t\t{\r\n\t\t\t\t\tShapeDrawing shape = (ShapeDrawing) MainControl.selected;\r\n\t\t\t\t\tshape.getStyle().setStroke(new BasicStroke(MainControl.stroke));\r\n\t\t\t\t\tMainControl.drawingArea.repaint();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t});\r\n\t\t\r\n\t\tp.setBorder(new TitledBorder(\"Stroke size\"));\r\n\t\tp.add(strokeSlider);\r\n\t}","title":""},{"docid":"b1fbb9072b80a6a51e013c9fe15ee06b","score":"0.6087797","text":"@Override\r\n\t\t\tpublic void onClick(View arg0) {\n\t\t\t\tif (slider == 0) {\r\n\t\t\t\t\tMainActivityA.getInstance().showUnitConverterPressureFragment();\r\n\t\t\t\t}\r\n\t\t\t}","title":""},{"docid":"036a36ec361122494f605c03d6060c6b","score":"0.607934","text":"@Override\r\n\t\t\tpublic void onClick(View arg0) {\n\t\t\t\tif (slider == 0) {\r\n\t\t\t\t\tMainActivityA.getInstance().showUnitConverterAreaFragment();\r\n\r\n\t\t\t\t}\r\n\t\t\t}","title":""},{"docid":"6c3bcd0d27be302f2e34a08887276c7b","score":"0.6057876","text":"@Override\r\n\t\t\tpublic void onClick(View arg0) {\n\t\t\t\tif (slider == 0) {\r\n\t\t\t\t\tMainActivityA.getInstance().showUnitConverterPowerFragment();\r\n\t\t\t\t}\r\n\t\t\t}","title":""},{"docid":"b5fd9a06e290426ad973a264f455e287","score":"0.60229284","text":"@Override\n public void onStart(SliderEvent e) {\n \tdurationBox.getElement().getStyle().setBackgroundColor(\"white\");\n }","title":""},{"docid":"67e5c2cb2373e62602e964fc5ee6e024","score":"0.60048056","text":"@SuppressWarnings(\"unchecked\")\n // <editor-fold defaultstate=\"collapsed\" desc=\"Generated Code\">//GEN-BEGIN:initComponents\n private void initComponents() {\n\n jPanel2 = new javax.swing.JPanel();\n jPanel3 = new javax.swing.JPanel();\n jPanel1 = new javax.swing.JPanel();\n jSlider1 = new javax.swing.JSlider();\n\n setDefaultCloseOperation(javax.swing.WindowConstants.EXIT_ON_CLOSE);\n getContentPane().setLayout(new java.awt.GridLayout());\n\n javax.swing.GroupLayout jPanel2Layout = new javax.swing.GroupLayout(jPanel2);\n jPanel2.setLayout(jPanel2Layout);\n jPanel2Layout.setHorizontalGroup(\n jPanel2Layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addGap(0, 220, Short.MAX_VALUE)\n );\n jPanel2Layout.setVerticalGroup(\n jPanel2Layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addGap(0, 300, Short.MAX_VALUE)\n );\n\n getContentPane().add(jPanel2);\n\n jPanel3.setBorder(javax.swing.BorderFactory.createEtchedBorder());\n jPanel3.addMouseMotionListener(new java.awt.event.MouseMotionAdapter() {\n public void mouseDragged(java.awt.event.MouseEvent evt) {\n jPanel3MouseDragged(evt);\n }\n });\n\n javax.swing.GroupLayout jPanel3Layout = new javax.swing.GroupLayout(jPanel3);\n jPanel3.setLayout(jPanel3Layout);\n jPanel3Layout.setHorizontalGroup(\n jPanel3Layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addGap(0, 216, Short.MAX_VALUE)\n );\n jPanel3Layout.setVerticalGroup(\n jPanel3Layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addGap(0, 296, Short.MAX_VALUE)\n );\n\n getContentPane().add(jPanel3);\n\n jSlider1.setMajorTickSpacing(50);\n jSlider1.setMaximum(255);\n jSlider1.setMinorTickSpacing(10);\n jSlider1.setPaintLabels(true);\n jSlider1.setPaintTicks(true);\n jSlider1.addChangeListener(new javax.swing.event.ChangeListener() {\n public void stateChanged(javax.swing.event.ChangeEvent evt) {\n jSlider1StateChanged(evt);\n }\n });\n\n javax.swing.GroupLayout jPanel1Layout = new javax.swing.GroupLayout(jPanel1);\n jPanel1.setLayout(jPanel1Layout);\n jPanel1Layout.setHorizontalGroup(\n jPanel1Layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addGroup(javax.swing.GroupLayout.Alignment.TRAILING, jPanel1Layout.createSequentialGroup()\n .addContainerGap(javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)\n .addComponent(jSlider1, javax.swing.GroupLayout.PREFERRED_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.PREFERRED_SIZE)\n .addContainerGap())\n );\n jPanel1Layout.setVerticalGroup(\n jPanel1Layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addGroup(javax.swing.GroupLayout.Alignment.TRAILING, jPanel1Layout.createSequentialGroup()\n .addContainerGap(125, Short.MAX_VALUE)\n .addComponent(jSlider1, javax.swing.GroupLayout.PREFERRED_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.PREFERRED_SIZE)\n .addGap(130, 130, 130))\n );\n\n getContentPane().add(jPanel1);\n\n pack();\n }","title":""},{"docid":"61f009adef6c7e9cf28a4d9d94929c49","score":"0.59991956","text":"private void iniSlider() {\n SliderPagerAdapterNew adapterslider = new SliderPagerAdapterNew(this,uploadsslider);\n adapterslider.setUserID(userName);\n\n\n\n\n\n sliderpager.setAdapter(adapterslider);\n adapterslider.notifyDataSetChanged();\n // setup timer\n Timer timer = new Timer();\n timer.scheduleAtFixedRate(new SliderTimer(),4000,6000);\n indicator.setupWithViewPager(sliderpager,true);\n\n }","title":""},{"docid":"905b33cb26939487639360a939335c35","score":"0.59958506","text":"@Override\r\n\t\t\tpublic void onClick(View arg0) {\n\t\t\t\tif (slider == 0) {\r\n\t\t\t\t\tMainActivityA.getInstance().showUnitConverterTempFragment();\r\n\t\t\t\t}\r\n\t\t\t}","title":""},{"docid":"4372c7f9c5d77b9a63f8eb4b267ac9b0","score":"0.599247","text":"@Override\r\n\t\t\tpublic void onClick(View arg0) {\n\t\t\t\tif (slider == 0) {\r\n\t\t\t\t\tMainActivityA.getInstance().showUnitConverterForceFragment();\r\n\t\t\t\t}\r\n\t\t\t}","title":""},{"docid":"b99f7bfd0aab4edf905754f8d8579894","score":"0.59920114","text":"JZmultiSlider createJZmultiSlider();","title":""},{"docid":"f59a0f5c734c1f4f655a59946f25640e","score":"0.59672153","text":"@Override\r\n\t\t\tpublic void onClick(View arg0) {\n\t\t\t\tif (slider == 0) {\r\n\t\t\t\t\tMainActivityA.getInstance().showUnitConverterEnergyFragment();\r\n\t\t\t\t}\r\n\t\t\t}","title":""},{"docid":"e8cd9c1911c460beae031a95a114f934","score":"0.5949461","text":"public void updateSlider(final List<Movie> newsList) {\n if (context != null) {\n for (final Movie item : newsList) {\n CustomSliderView textSliderView = new CustomSliderView(context, \"\");\n // initialize a SliderLayout\n textSliderView\n .description(item.getName())\n .image(context.getResources().getString(R.string.baseUrl) + \"movie/image/\" + item.getUniqueId())\n .setScaleType(BaseSliderView.ScaleType.Fit)\n .setOnSliderClickListener(new BaseSliderView.OnSliderClickListener() {\n @Override\n public void onSliderClick(BaseSliderView slider) {\n context.startActivity(new Intent(context, DetailsActivity.class).putExtra(\"movie\", item)\n .setFlags(Intent.FLAG_ACTIVITY_NEW_TASK));\n }\n });\n\n// ImageView iconView = (ImageView) textSliderView.getView().findViewById(R.id.sliderNewsSourceIcon);\n// Glide.with(context).load(item.getNewsSourceEntity().getIconUrl()).placeholder(R.mipmap.ic_launcher).into(iconView);\n this.sliderLayout.addSlider(textSliderView);\n }\n\n }\n\n // set visibility\n this.sliderLayout.setVisibility(View.VISIBLE);\n }","title":""},{"docid":"ebadc65e568836c08405e80317b630e2","score":"0.59453344","text":"@Override\r\n\t\t\tpublic void onClick(View arg0) {\n\t\t\t\tif (slider == 0) {\r\n\t\t\t\t\tMainActivityA.getInstance().showUnitConverterVolumeFragment();\r\n\t\t\t\t}\r\n\t\t\t}","title":""},{"docid":"d9b530f6fbc2390dd006cf7b361912aa","score":"0.5939251","text":"@Override\r\n\t\t\tpublic void onClick(View arg0) {\n\r\n\t\t\t\trl_slider_parent.startAnimation(outToRightAnimation());\r\n\t\t\t\tslider = 1;\r\n\r\n\t\t\t}","title":""},{"docid":"cd6188027f9fa1868edbbc6e110a8b83","score":"0.5930338","text":"public String SetSliderValue() {\n\t\tWebElement slider = driver.findElement(By.xpath(\"//*[@id=\\\"content\\\"]/div/div/input\"));\n \n\t\tint width = slider.getSize().getWidth(); //getting the width of the slider\n\t\tActions action = new Actions(driver); \n\t\taction.dragAndDropBy(slider, (width * 100)/100, 0).perform(); //perform drag and drop \n\t\tWebElement rangeValue = driver.findElement(By.id(\"range\")); \n\t\tString value = rangeValue.getText(); //getting the range value\n\n\t\treturn value;\n\t}","title":""},{"docid":"a4ee9290e72f7154d6369d9e15704b0f","score":"0.59178096","text":"Slider(int x, int y)\n\t{\n\t\tthis.x = x;\n\t\tthis.y = y;\n\t}","title":""},{"docid":"2b1a6ac9396ad215262cb6399cdf44d3","score":"0.591073","text":"@SuppressWarnings(\"unchecked\")\n // <editor-fold defaultstate=\"collapsed\" desc=\"Generated Code\">//GEN-BEGIN:initComponents\n private void initComponents() {\n\n PanelControl = new javax.swing.JPanel();\n PanelVela = new javax.swing.JPanel();\n SliderVela = new javax.swing.JSlider();\n PanelTimon = new javax.swing.JPanel();\n SliderTimon = new javax.swing.JSlider();\n PanelDibujo = new javax.swing.JPanel();\n panelGrafico1 = new PanelGrafico();\n Autor = new javax.swing.JLabel();\n\n setDefaultCloseOperation(javax.swing.WindowConstants.EXIT_ON_CLOSE);\n setTitle(\"BarquitoVelero\");\n setIconImage(new javax.swing.ImageIcon(\"src/barquitologo.png\").getImage());\n\n PanelControl.setBorder(javax.swing.BorderFactory.createTitledBorder(\"Control\"));\n\n PanelVela.setBorder(javax.swing.BorderFactory.createTitledBorder(\"Orientación Vela\"));\n\n SliderVela.setMaximum(90);\n SliderVela.setMinimum(-90);\n SliderVela.setToolTipText(\"Orientación de la Vela\");\n SliderVela.setValue(0);\n SliderVela.addChangeListener(new javax.swing.event.ChangeListener() {\n public void stateChanged(javax.swing.event.ChangeEvent evt) {\n SliderVelaStateChanged(evt);\n }\n });\n SliderVela.addMouseListener(new java.awt.event.MouseAdapter() {\n public void mouseEntered(java.awt.event.MouseEvent evt) {\n SliderVelaMouseEntered(evt);\n }\n public void mouseExited(java.awt.event.MouseEvent evt) {\n SliderVelaMouseExited(evt);\n }\n });\n\n javax.swing.GroupLayout PanelVelaLayout = new javax.swing.GroupLayout(PanelVela);\n PanelVela.setLayout(PanelVelaLayout);\n PanelVelaLayout.setHorizontalGroup(\n PanelVelaLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addComponent(SliderVela, javax.swing.GroupLayout.Alignment.TRAILING, javax.swing.GroupLayout.DEFAULT_SIZE, 220, Short.MAX_VALUE)\n );\n PanelVelaLayout.setVerticalGroup(\n PanelVelaLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addGroup(PanelVelaLayout.createSequentialGroup()\n .addComponent(SliderVela, javax.swing.GroupLayout.PREFERRED_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.PREFERRED_SIZE)\n .addGap(0, 22, Short.MAX_VALUE))\n );\n\n PanelTimon.setBorder(javax.swing.BorderFactory.createTitledBorder(\"Orientación Timón\"));\n\n SliderTimon.setMaximum(90);\n SliderTimon.setMinimum(-90);\n SliderTimon.setToolTipText(\"Orientación del timón\");\n SliderTimon.setValue(0);\n SliderTimon.addChangeListener(new javax.swing.event.ChangeListener() {\n public void stateChanged(javax.swing.event.ChangeEvent evt) {\n SliderTimonStateChanged(evt);\n }\n });\n SliderTimon.addMouseListener(new java.awt.event.MouseAdapter() {\n public void mouseEntered(java.awt.event.MouseEvent evt) {\n SliderTimonMouseEntered(evt);\n }\n public void mouseExited(java.awt.event.MouseEvent evt) {\n SliderTimonMouseExited(evt);\n }\n });\n\n javax.swing.GroupLayout PanelTimonLayout = new javax.swing.GroupLayout(PanelTimon);\n PanelTimon.setLayout(PanelTimonLayout);\n PanelTimonLayout.setHorizontalGroup(\n PanelTimonLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addComponent(SliderTimon, javax.swing.GroupLayout.Alignment.TRAILING, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)\n );\n PanelTimonLayout.setVerticalGroup(\n PanelTimonLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addGroup(PanelTimonLayout.createSequentialGroup()\n .addContainerGap()\n .addComponent(SliderTimon, javax.swing.GroupLayout.PREFERRED_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.PREFERRED_SIZE)\n .addContainerGap(javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE))\n );\n\n javax.swing.GroupLayout PanelControlLayout = new javax.swing.GroupLayout(PanelControl);\n PanelControl.setLayout(PanelControlLayout);\n PanelControlLayout.setHorizontalGroup(\n PanelControlLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addGroup(PanelControlLayout.createSequentialGroup()\n .addContainerGap()\n .addGroup(PanelControlLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addComponent(PanelVela, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)\n .addComponent(PanelTimon, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)))\n );\n PanelControlLayout.setVerticalGroup(\n PanelControlLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addGroup(PanelControlLayout.createSequentialGroup()\n .addContainerGap()\n .addComponent(PanelVela, javax.swing.GroupLayout.PREFERRED_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.PREFERRED_SIZE)\n .addPreferredGap(javax.swing.LayoutStyle.ComponentPlacement.RELATED)\n .addComponent(PanelTimon, javax.swing.GroupLayout.PREFERRED_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.PREFERRED_SIZE)\n .addContainerGap(javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE))\n );\n\n PanelDibujo.setBorder(javax.swing.BorderFactory.createEtchedBorder());\n\n panelGrafico1.setForeground(new java.awt.Color(0, 0, 204));\n\n javax.swing.GroupLayout panelGrafico1Layout = new javax.swing.GroupLayout(panelGrafico1);\n panelGrafico1.setLayout(panelGrafico1Layout);\n panelGrafico1Layout.setHorizontalGroup(\n panelGrafico1Layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addGap(0, 302, Short.MAX_VALUE)\n );\n panelGrafico1Layout.setVerticalGroup(\n panelGrafico1Layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addGap(0, 0, Short.MAX_VALUE)\n );\n\n javax.swing.GroupLayout PanelDibujoLayout = new javax.swing.GroupLayout(PanelDibujo);\n PanelDibujo.setLayout(PanelDibujoLayout);\n PanelDibujoLayout.setHorizontalGroup(\n PanelDibujoLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addComponent(panelGrafico1, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)\n );\n PanelDibujoLayout.setVerticalGroup(\n PanelDibujoLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addComponent(panelGrafico1, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)\n );\n\n Autor.setText(\"Héctor Garbisu DIU 2015\");\n\n javax.swing.GroupLayout layout = new javax.swing.GroupLayout(getContentPane());\n getContentPane().setLayout(layout);\n layout.setHorizontalGroup(\n layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addGroup(layout.createSequentialGroup()\n .addContainerGap()\n .addGroup(layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addComponent(PanelControl, javax.swing.GroupLayout.PREFERRED_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.PREFERRED_SIZE)\n .addComponent(Autor))\n .addPreferredGap(javax.swing.LayoutStyle.ComponentPlacement.RELATED)\n .addComponent(PanelDibujo, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)\n .addContainerGap())\n );\n layout.setVerticalGroup(\n layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addGroup(layout.createSequentialGroup()\n .addContainerGap()\n .addGroup(layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\n .addComponent(PanelDibujo, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)\n .addGroup(layout.createSequentialGroup()\n .addComponent(PanelControl, javax.swing.GroupLayout.PREFERRED_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.PREFERRED_SIZE)\n .addPreferredGap(javax.swing.LayoutStyle.ComponentPlacement.RELATED, 293, Short.MAX_VALUE)\n .addComponent(Autor)))\n .addContainerGap())\n );\n\n pack();\n }","title":""},{"docid":"4cee412ded5e8ca756319ed069a84ba7","score":"0.5909313","text":"private void sliderAutoChangePictures() {\n\n Timeline sliderTimer = new Timeline(new KeyFrame(Duration.ZERO, e -> {\n FadeTransition ft = new FadeTransition();\n ft.setNode(imgSlider);\n ft.setDuration(new Duration(4000));\n ft.setFromValue(1.0);\n ft.setToValue(0.3);\n ft.setCycleCount(0);\n ft.setAutoReverse(true);\n ft.play();\n imgSlider.setImage(new Image(\"com/houarizegai/fxtools/dashboard/model1/img/slider/\" + counter + \".png\"));\n if (++counter > NUMBER_IMAGE_SLIDER) {\n counter = 1;\n }\n }),\n new KeyFrame(Duration.seconds(4))\n );\n sliderTimer.setCycleCount(Animation.INDEFINITE);\n sliderTimer.play();\n\n }","title":""},{"docid":"1e0d28394185d276a4962115d4f96981","score":"0.5898833","text":"@Override\r\n\t\t\tpublic void onClick(View arg0) {\n\t\t\t\tif (slider == 0) {\r\n\t\t\t\t\tMainActivityA.getInstance().showUnitConverterTimeFragment();\r\n\t\t\t\t}\r\n\t\t\t}","title":""},{"docid":"42eb10004d4050fe1dcfa47e4a0d5740","score":"0.58841413","text":"private void createSlider(Composite parent){\n\t\tComposite container = new Composite(parent, SWT.NONE);\n\t\tcontainer.setLayout(new GridLayout(3,false));\n\t\tcontainer.setLayoutData(new GridData(GridData.FILL_BOTH));\n\t\tnew Label(container, SWT.NONE).setText(Messages.ColorDialog_transparencyLabel);\n\t\talphaSlider = new Scale(container, SWT.HORIZONTAL);\n\t\talphaSlider.setMaximum(0);\n\t\talphaSlider.setMaximum(255);\n\t\talphaSlider.setSelection(alpha);\n\t\talphaSlider.setLayoutData(new GridData(GridData.FILL_HORIZONTAL));\n\t\talphaText = new Spinner(container, SWT.BORDER);\n\t\talphaText.setMinimum(0);\n\t\talphaText.setMaximum(255);\n\t\talphaText.setSelection(alpha);\n\t\t//When the alpha slider change value update also the preview composite and the alpha textual value\n\t\talphaSlider.addSelectionListener(new SelectionAdapter() {\n\t\t\t@Override\n\t\t\tpublic void widgetSelected(SelectionEvent e) {\n\t\t\t\talphaText.setSelection(alphaSlider.getSelection());\n\t\t\t\talpha = alphaSlider.getSelection();\n\t\t\t\tupdatePreview();\n\t\t\t}\n\t\t});\n\t\t//When the alpha text field change value update also the preview composite and the alpha slider value\n\t\talphaText.addModifyListener(new ModifyListener() {\n\t\t\t@Override\n\t\t\tpublic void modifyText(ModifyEvent e) {\n\t\t\t\talphaSlider.setSelection(alphaText.getSelection());\n\t\t\t\talpha = alphaSlider.getSelection();\n\t\t\t\tupdatePreview();\n\t\t\t}\n\t\t});\n\t}","title":""},{"docid":"e679ef499a699190f4d1624c660d2c69","score":"0.58670485","text":"private void setSeekBar(){\n // Option sliders listeners\n bar1 = sliderBars.findViewById(R.id.seekBar1);\n bar2 = sliderBars.findViewById(R.id.seekBar2);\n bar3 = sliderBars.findViewById(R.id.seekBar3);\n isSliding = false;\n\n bar1.setOnSeekBarChangeListener(new SeekBar.OnSeekBarChangeListener() {\n @Override\n public void onProgressChanged(SeekBar seekBar, int progress, boolean fromUser) {\n if (isSliding)\n applyProcessings();\n }\n\n @Override\n public void onStartTrackingTouch(SeekBar seekBar) {\n isSliding = true;\n }\n\n @Override\n public void onStopTrackingTouch(SeekBar seekBar) {\n isSliding = false;\n }\n });\n bar2.setOnSeekBarChangeListener(new SeekBar.OnSeekBarChangeListener() {\n @Override\n public void onProgressChanged(SeekBar seekBar, int progress, boolean fromUser) {\n if (isSliding)\n applyProcessings();\n }\n\n @Override\n public void onStartTrackingTouch(SeekBar seekBar) {\n isSliding = true;\n }\n\n @Override\n public void onStopTrackingTouch(SeekBar seekBar) {\n isSliding = false;\n }\n });\n bar3.setOnSeekBarChangeListener(new SeekBar.OnSeekBarChangeListener() {\n @Override\n public void onProgressChanged(SeekBar seekBar, int progress, boolean fromUser) {\n if (isSliding)\n applyProcessings();\n }\n\n @Override\n public void onStartTrackingTouch(SeekBar seekBar) {\n isSliding = true;\n }\n\n @Override\n public void onStopTrackingTouch(SeekBar seekBar) {\n isSliding = false;\n }\n });\n }","title":""},{"docid":"72fc41c6fb8193b9cf280a35cbfb6579","score":"0.5843064","text":"private void setSliderModels() {\n\n // Taken from https://stackoverflow.com/questions/31835586/set-jslider-limits\n attack.setModel(\n new DefaultBoundedRangeModel() {\n @Override\n public void setValue(int n) {\n if (n > decay.getValue()) {\n n = decay.getValue();\n }\n super.setValue(n);\n }\n }\n );\n\n decay.setModel(\n new DefaultBoundedRangeModel() {\n @Override\n public void setValue(int n) {\n if (n < attack.getValue()) {\n n = attack.getValue();\n }\n super.setValue(n);\n }\n }\n );\n }","title":""},{"docid":"271ee99d5d33009d3c95caedb245343a","score":"0.58408344","text":"@Override\n protected void onStop() {\n mDemoSlider.stopAutoCycle();\n super.onStop();\n }","title":""},{"docid":"e5caa35176dd2abc46d032165d380b6b","score":"0.5840439","text":"@Override\n public void onPanelSlide(View arg0, float arg1) {\n }","title":""},{"docid":"9ad668ec71eb3b886bc54d199641c0a6","score":"0.5819453","text":"public void setSliders () {\n\n SBR.setProgress(RedBar);\n SBG.setProgress(GreenBar);\n SBB.setProgress(BlueBar);\n SBVal.setProgress(ValBar);\n SBCon.setProgress(ConBar);\n SBHue.setProgress(HueBar);\n\n if (grayScale) {\n SBSat.setProgress(160);\n SBSat.setEnabled(false);\n } else {\n SBSat.setProgress(SatBar);\n SBSat.setEnabled(true);\n }\n\n }","title":""},{"docid":"d71560bab9fb1417c047073257194e60","score":"0.58165896","text":"@Override\r\n\t\t\tpublic void onClick(View arg0) {\n\t\t\t\tif (slider == 0) {\r\n\t\t\t\t\tMainActivityA.getInstance().showUnitConverterDataSizeFragment();\r\n\t\t\t\t}\r\n\t\t\t}","title":""},{"docid":"8c69517f080ba670e1cfc7b14a3adb2f","score":"0.57971096","text":"@Override\n\t\tpublic void stateChanged(ChangeEvent e) {\n\t\t\tJSlider slider = (JSlider) e.getSource();\n\t\t\tif (slider == sliderR) {\n\t\t\t\tint x = slider.getValue();\n\t\t\t\tprocessSliderR(x);\n\t\t\t} else if (slider == sliderG) {\n\t\t\t\tint x = slider.getValue();\n\t\t\t\tprocessSliderG(x);\n\t\t\t} else if (slider == sliderB) {\n\t\t\t\tint x = slider.getValue();\n\t\t\t\tprocessSliderB(x);\n\t\t\t} else if (slider == sliderBr) {\n\t\t\t\tint x = slider.getValue();\n\t\t\t\tprocessSliderBr(x);\n\t\t\t} else if (slider == sliderCon) {\n\t\t\t\tint x = slider.getValue();\n\t\t\t\tprocessSliderCon(x);\n\t\t\t}\n\n\t\t}","title":""},{"docid":"5dfe37b8714c797fbdafbecf1bdc86b8","score":"0.5792447","text":"private void updateSlider(StreamControl sc, boolean forceReloadIcon) {\n updateSliderProgress(sc, -1);\n final boolean muted = isMuted(sc.streamType);\n if (forceReloadIcon) {\n sc.icon.setImageDrawable(null);\n }\n updateSliderIcon(sc, muted);\n updateSliderEnabled(sc, muted, false);\n updateSliderSuppressor(sc);\n }","title":""},{"docid":"0beb0b17d21cd342411ae866488b107b","score":"0.57809776","text":"@Override\r\n protected void onStop() {\n imageSlider.stopAutoCycle();\r\n super.onStop();\r\n }","title":""},{"docid":"1c367042b69b12066077307c28f496df","score":"0.5776128","text":"private void sliderValueChanged( Slider whichSlider ) {\n\n String str;\n if ( whichSlider == slider1 )\n str = String.format( \"First slider value is now %1.2f\", slider1.getValue() );\n else if ( whichSlider == slider2 )\n str = String.format( \"Second slider value is now %1.2f\", slider2.getValue() );\n else\n str = String.format( \"Third slider value is now %1.2f\", slider3.getValue() );\n label.setText( str );\n }","title":""},{"docid":"ce65146988ed1dea6acc74fb1ec3efc4","score":"0.5768515","text":"@Override\r\n protected void onStop() {\n mDemoSlider.stopAutoCycle();\r\n super.onStop();\r\n }","title":""},{"docid":"10ab3420814e17230e851cd22fe51244","score":"0.57672304","text":"public void addMusicVolumeSliderListener(Slider slider) {\n slider.setValue(preferences.getFloat(\"musicVolume\") * 100);\n slider.addListener(new ChangeListener() {\n @Override\n public void changed(ChangeEvent event, Actor actor) {\n preferences.putFloat(\"musicVolume\", slider.getValue() / 100f);\n }\n });\n }","title":""},{"docid":"372e22f5c391b2ca80fd9df1265bd584","score":"0.576115","text":"@Override\n public void setSliderMax(int value) {\n return;\n }","title":""},{"docid":"cd0aed1510e2f1ea5ed60fc9143ace00","score":"0.5755306","text":"@Override\n protected void onRestart() {\n super.onRestart();\n\n if (slider.isOpened()) {\n slider.toggle();\n }\n }","title":""},{"docid":"580c81e63d6d7466ab227f87dad7b961","score":"0.5751453","text":"private void initComponents() {\n\n jLabel1 = new javax.swing.JLabel();\n frameNumberTextField = new javax.swing.JTextField();\n jPanel1 = new javax.swing.JPanel();\n frameViewSlider = new javax.swing.JSlider();\n\n jLabel1.setText(\"Frame\");\n jLabel1.setFocusable(false);\n\n frameNumberTextField.setText(\"1\");\n frameNumberTextField.addActionListener(new java.awt.event.ActionListener() {\n public void actionPerformed(java.awt.event.ActionEvent evt) {\n frameNumberTextFieldActionPerformed(evt);\n }\n });\n\n jPanel1.setBorder(javax.swing.BorderFactory.createEtchedBorder());\n\n frameViewSlider.setMinimum(1);\n frameViewSlider.setSnapToTicks(true);\n frameViewSlider.setMaximum(totalFrame);\n frameViewSlider.setValue(1);\n frameViewSlider.addChangeListener(new javax.swing.event.ChangeListener() {\n public void stateChanged(javax.swing.event.ChangeEvent evt) {\n frameViewSliderStateChanged(evt);\n }\n });\n frameViewSlider.addKeyListener(new java.awt.event.KeyAdapter() {\n public void keyPressed(java.awt.event.KeyEvent evt) {\n frameViewSliderKeyPressed(evt);\n }\n });\n frameViewSlider.addMouseWheelListener(new java.awt.event.MouseWheelListener() {\n public void mouseWheelMoved(java.awt.event.MouseWheelEvent evt) {\n frameViewSliderMouseWheelMoved(evt);\n }\n });\n\n org.jdesktop.layout.GroupLayout jPanel1Layout = new org.jdesktop.layout.GroupLayout(jPanel1);\n jPanel1.setLayout(jPanel1Layout);\n jPanel1Layout.setHorizontalGroup(\n jPanel1Layout.createParallelGroup(org.jdesktop.layout.GroupLayout.LEADING)\n .add(frameViewSlider, org.jdesktop.layout.GroupLayout.DEFAULT_SIZE, 419, Short.MAX_VALUE)\n );\n jPanel1Layout.setVerticalGroup(\n jPanel1Layout.createParallelGroup(org.jdesktop.layout.GroupLayout.LEADING)\n .add(frameViewSlider, org.jdesktop.layout.GroupLayout.PREFERRED_SIZE, org.jdesktop.layout.GroupLayout.DEFAULT_SIZE, org.jdesktop.layout.GroupLayout.PREFERRED_SIZE)\n );\n\n org.jdesktop.layout.GroupLayout layout = new org.jdesktop.layout.GroupLayout(this);\n this.setLayout(layout);\n layout.setHorizontalGroup(\n layout.createParallelGroup(org.jdesktop.layout.GroupLayout.LEADING)\n .add(layout.createSequentialGroup()\n .add(jLabel1)\n .addPreferredGap(org.jdesktop.layout.LayoutStyle.RELATED)\n .add(frameNumberTextField, org.jdesktop.layout.GroupLayout.PREFERRED_SIZE, 54, org.jdesktop.layout.GroupLayout.PREFERRED_SIZE)\n .addPreferredGap(org.jdesktop.layout.LayoutStyle.RELATED)\n .add(jPanel1, org.jdesktop.layout.GroupLayout.DEFAULT_SIZE, org.jdesktop.layout.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE))\n );\n layout.setVerticalGroup(\n layout.createParallelGroup(org.jdesktop.layout.GroupLayout.LEADING)\n .add(layout.createParallelGroup(org.jdesktop.layout.GroupLayout.CENTER)\n .add(jLabel1)\n .add(frameNumberTextField, org.jdesktop.layout.GroupLayout.PREFERRED_SIZE, 23, org.jdesktop.layout.GroupLayout.PREFERRED_SIZE)\n .add(jPanel1, org.jdesktop.layout.GroupLayout.PREFERRED_SIZE, org.jdesktop.layout.GroupLayout.DEFAULT_SIZE, org.jdesktop.layout.GroupLayout.PREFERRED_SIZE))\n );\n }","title":""},{"docid":"b1c3555feab3f3c31d20741240f79b6a","score":"0.57315195","text":"public void initSliderBox() {\n initSlider();\n sliderBox = new HBox(SLIDERBOX_SPACING, speedSlider);\n sliderBox.setAlignment(Pos.CENTER);\n }","title":""},{"docid":"819a01bd63bbab0b61b260cb99ebedb5","score":"0.57293844","text":"public void lowThumbReleased(MouseEvent e) {\r\n final RangeSlider rangeSlider = getControl();\r\n rangeSlider.setLowValueChanging(false);\r\n // RT-15207 When snapToTicks is true, slider value calculated in drag\r\n // is then snapped to the nearest tick on mouse release.\r\n if (rangeSlider.isSnapToTicks()) {\r\n rangeSlider.setLowValue(snapValueToTicks(rangeSlider.getLowValue()));\r\n }\r\n }","title":""},{"docid":"193f5a1bb836b8041d7e1c25a5dc8e57","score":"0.572284","text":"@Override\n\tpublic boolean xSliderMoved(Controller controller, int sliderCode,\n\t\t\tboolean value) {\n\t\treturn false;\n\t}","title":""},{"docid":"a62d5b59d2573e72d782727a78596f5c","score":"0.5709085","text":"private void arrivalEvent(){//PENDENTE\n //implementar fluxo do slide 50\n }","title":""},{"docid":"b0bc7c2108dd0c86e365302eb80b62e9","score":"0.57076705","text":"private JSlider klDivSlider(String paramLabel, int min, int max, String name) {\n\t\tJSlider filterSlider = new JSlider(JSlider.HORIZONTAL, min, max, Parameters.parameters.integerParameter(paramLabel));\n\n\t\tHashtable<Integer,JLabel> labels = new Hashtable<>();\n\n\t\tfilterSlider.setMinorTickSpacing(1);\n\t\tfilterSlider.setPaintTicks(true);\n\t\tlabels.put((min+max)/2, new JLabel(name));\n\t\tfilterSlider.setLabelTable(labels);\n\t\tfilterSlider.setPaintLabels(true);\n\t\tfilterSlider.setPreferredSize(new Dimension(200, 40));\n\n\t\tfilterSlider.addChangeListener(new ChangeListener() {\n\n\t\t\t@Override\n\t\t\tpublic void stateChanged(ChangeEvent e) {\n\t\t\t\tJSlider source = (JSlider)e.getSource();\n\t\t\t\tParameters.parameters.setInteger(paramLabel, source.getValue());\n\t\t\t}\n\n\t\t});\n\t\treturn filterSlider;\n\t}","title":""},{"docid":"12736bd273b9f4d86ea805cd02beaef4","score":"0.5706721","text":"void setSliderMax(int value);","title":""},{"docid":"37e3154c3e103ec6d2bdef6a28371a57","score":"0.56873465","text":"private void slider_hMouseReleased(java.awt.event.MouseEvent evt) {\n if (opened)\r\n h = Process.hsvThres(lbl_h_val, lbl_h1_val, slider_h, slider_h1, img_hsv, lbl_img_h_thres,0);\r\n }","title":""},{"docid":"1e3dd5cdaff42c27a316243b6ac3e201","score":"0.56763107","text":"public void slideForward() {\n RobotMap.hatchSliderPiston.set(true);\n }","title":""},{"docid":"1df7356f204d3e53ec278d31a7369a35","score":"0.5671565","text":"@Override\r\n\t\t\tpublic void onAnimationStart(Animation arg0) {\n\t\t\t\trl_slider.setVisibility(View.VISIBLE);\r\n\r\n\t\t\t}","title":""},{"docid":"4c56b1f03c234a54d7ef6f16ff40a814","score":"0.56428385","text":"public VolumeGUI(){\n setLayout(new GridLayout(2,1));\n add(VolumeText);add(VolumeSlider);\n setSize(400, 200);\n VolumeText.setFont(new Font(\"Arial\", Font.BOLD, 18));\n //Adding all the properties for the slider\n VolumeSlider.setPaintTicks(true);\n VolumeSlider.setPaintLabels(true);\n VolumeSlider.setMinorTickSpacing(1);\n VolumeSlider.setMajorTickSpacing(5); \n VolumeSlider.addChangeListener(this);\n setVisible(true);\n }","title":""},{"docid":"4fd0e377e1015a70fbae5ef1bced6ec0","score":"0.5635741","text":"private void geometrie()\r\n\t\t{\r\n\t\tboutonStart = new JButton(\"BoutonStart\");\r\n\t\tboutonStop = new JButton(\"BoutonStop\");\r\n\t\tsliderAlpha = new JSlider(SwingConstants.HORIZONTAL, (int)intervalleSlider.getiStart(), (int)intervalleSlider.getiStop(), (int)intervalleSlider.getMilieu());\r\n\r\n\t\tsetLayout(new FlowLayout(FlowLayout.CENTER));\r\n\r\n\t\tadd(boutonStart);\r\n\t\tadd(boutonStop);\r\n\t\tadd(sliderAlpha);\r\n\t\t}","title":""},{"docid":"4f7569b94a3a239fee02f66848521053","score":"0.5623106","text":"private JPanel getSliderPanel () {\n\t\t// Initializes the panel and the layout\n\t\tJPanel panel = new JPanel();\n\t\tGridLayout layout = new GridLayout(2, 1, 0, 0);\n\t\tpanel.setLayout(layout);\n\n\t\t// Initializes the slider label value\n\t\tsliderValue = new JLabel(TRANSPARENCY_INIT + \" %\", SwingConstants.CENTER);\n\n\t\t// Initializes the slider\n\t\tslider = new JSlider(SwingConstants.HORIZONTAL, TRANSPARENCY_MIN, TRANSPARENCY_MAX, TRANSPARENCY_INIT);\n\t\tslider.addChangeListener(new ChangeListener() {\n\t\t\t@Override\n\t\t\tpublic void stateChanged(ChangeEvent e) {\n\t\t\t\tJSlider source = (JSlider)e.getSource();\n\t\t\t\tint transparency = source.getValue();\n\t\t\t\tsliderValue.setText(transparency + \" %\");\n\t\t\t}\n\t\t});\n\t\tslider.setMajorTickSpacing(10);\n\t\tslider.setMinorTickSpacing(1);\n\n\t\t// Adds label and slider to the panel\n\t\tpanel.add(sliderValue);\n\t\tpanel.add(slider);\n\n\t\t// Returns the panel\n\t\treturn panel;\n\t}","title":""},{"docid":"5ae7af354fce36d448f7a607f004ebc3","score":"0.56139654","text":"private void sliderEvent(Slider input, Label labelToChange){\n labelToChange.setText(Double.toString(Math.round(input.getValue())));\n }","title":""},{"docid":"8d108757ee611ca7ef7bba374a9f5f26","score":"0.5612414","text":"private SliderListener getDateSliderListener() {\n\t\tSliderListener listener = new SliderListener() {\n\t\t\t//helper function\n\t\t\tprivate void setDateInput(int min, int max) {\n\t\t\t\tif( min == max ) {\n\t\t\t\t\t//if values are equal just write one value\n\t\t\t\t\tdateBox.setValue( Integer.toString(min) );\n\t\t\t\t} else {\n\t\t\t\t\t//if values are different write both\n\t\t\t\t\tdateBox.setValue( Integer.toString(min) + \"-\" + Integer.toString(max) );\n\t\t\t\t}\n\t\t\t}\n \t\n @Override\n public void onStart(SliderEvent e) {\n \t//reset input field in case it was changed due to an error\n \tdateBox.getElement().getStyle().setBackgroundColor(\"white\");\n }\n \n @Override\n public boolean onSlide(SliderEvent e) {\n \tdateBox.removeStyleName(defaultInputCSSRule);\n \t\n int max = dateSlider.getValueMax();\n int min = dateSlider.getValueMin();\n\n setDateInput(min, max);\n return true;\n }\n\n @Override\n public void onChange(SliderEvent e) {\n int max = dateSlider.getValueMax();\n int min = dateSlider.getValueMin();\n \n setDateInput(min, max);\n }\n\n @Override\n public void onStop(SliderEvent e) {\n }\n\t\t};\n\t\t\n\t\treturn listener;\n\t}","title":""},{"docid":"f697ea847778c729871a6fab3b65dfab","score":"0.56123304","text":"public void run()\n {\n timeSlider.setValue(mediaPlayer.getCurrentTime().toMillis()/mediaPlayer.getTotalDuration().toMillis() * 100);\n timeLabel.setText(getTime(mediaPlayer.getCurrentTime()) + \"/\" + getTime(mediaPlayer.getTotalDuration()));\n if(controlBar.isVisible() && mediaPlayer.getCurrentTime().toSeconds() - lastAction > 10){\n controlBar.setVisible(false);\n goBackButton.setVisible(false);\n }\n }","title":""},{"docid":"c8daa1d06227cc1873e06ace0e9536c5","score":"0.5606986","text":"JPanel guiPanel() {\r\n JPanel panel = new JPanel();\r\n panel.setLayout(new GridLayout(0, 1));\r\n\r\n // Human_r_shoulder rotation\r\n panel.add(new JLabel(\"Right Shoulder rotation\"));\r\n rShoulderSlider = new JSlider(JSlider.HORIZONTAL, 0, 180, rShoulderRot);\r\n rShoulderSlider.addChangeListener(this);\r\n rShoulderSliderLabel = new JLabel(Integer.toString(rShoulderRot));\r\n panel.add(rShoulderSlider);\r\n panel.add(rShoulderSliderLabel);\r\n\r\n // Human_r_elbow rotation\r\n panel.add(new JLabel(\"Right Elbow rotation\"));\r\n rElbowSlider = new JSlider(JSlider.HORIZONTAL, 0, 180, rElbowRot);\r\n rElbowSlider.addChangeListener(this);\r\n rElbowSliderLabel = new JLabel(Integer.toString(rElbowRot));\r\n panel.add(rElbowSlider);\r\n panel.add(rElbowSliderLabel);\r\n\r\n // Human_l_shoulder rotation\r\n panel.add(new JLabel(\"Left Shoulder rotation\"));\r\n lShoulderSlider = new JSlider(JSlider.HORIZONTAL, 0, 180, lShoulderRot);\r\n lShoulderSlider.addChangeListener(this);\r\n lShoulderSliderLabel = new JLabel(Integer.toString(lShoulderRot));\r\n panel.add(lShoulderSlider);\r\n panel.add(lShoulderSliderLabel);\r\n\r\n // Human_l_elbow rotation\r\n panel.add(new JLabel(\"Left Elbow rotation\"));\r\n lElbowSlider = new JSlider(JSlider.HORIZONTAL, 0, 180, lElbowRot);\r\n lElbowSlider.addChangeListener(this);\r\n lElbowSliderLabel = new JLabel(Integer.toString(lElbowRot));\r\n panel.add(lElbowSlider);\r\n panel.add(rElbowSliderLabel);\r\n\r\n if (isApplication) {\r\n JButton snapButton = new JButton(snapImageString);\r\n snapButton.setActionCommand(snapImageString);\r\n snapButton.addActionListener(this);\r\n panel.add(snapButton);\r\n }\r\n\r\n return panel;\r\n }","title":""},{"docid":"1d551ba6f4afe61a2bce4b5666b1446e","score":"0.55992866","text":"@Override\n protected void onStop() {\n mDemoSlider.setPresetTransformer(SliderLayout.Transformer.Accordion);\n mDemoSlider.setPresetIndicator(SliderLayout.PresetIndicators.Center_Bottom);\n mDemoSlider.setCustomAnimation(new DescriptionAnimation());\n mDemoSlider.setDuration(4000);\n // mDemoSlider.stopAutoCycle();\n super.onStop();\n }","title":""},{"docid":"0ca0ffb2ae7662b2bb2d0fb1639f9a63","score":"0.559471","text":"@Test\n\tpublic void testHorizontalSlider() {\n\t\t//arrange\n\t\tString expectedSpanValue = \"5\";\n\t\t\n\t\t//act\n\t\tString actualSpanValue = new SliderPageObject(driver,baseUrl)\n\t\t\t\t.OpenSliderPage()\n\t\t\t\t.MoveSlider()\n\t\t\t\t.getSpanInfo();\n\t\t\n\t\t//assert\n\t\tAssert.assertEquals(actualSpanValue, expectedSpanValue, \"The Slider Doesnot work\");\n\t}","title":""},{"docid":"36269cc76580c72e276c8dd561d4798d","score":"0.5594549","text":"@Override\r\n\t\t\tpublic void onAnimationEnd(Animation arg0) {\n\t\t\t\tslider = 0;\r\n\t\t\t}","title":""},{"docid":"da347a44f585c8777e6e36ea7178b4c0","score":"0.559372","text":"public void initialize() {\n musicSlider.setValue(AssetManager.mediaPlayer.getVolume()*100);\n musicLabel.setText(\"%\" + Integer.toString((int)musicSlider.getValue()));\n musicSlider.valueProperty().addListener(new InvalidationListener() {\n @Override\n public void invalidated(Observable observable) {\n AssetManager.mediaPlayer.setVolume(musicSlider.getValue()/100);\n musicLabel.setText(\"%\" + Integer.toString((int)musicSlider.getValue()));\n }\n });\n\n effectsSlider.valueProperty().addListener((observable, oldValue, newValue) -> {\n\n effectsLabel.setText(\"%\" + Integer.toString((int) newValue.intValue()));\n\n\n });\n\n }","title":""},{"docid":"5d50f8a0503d64373584582f41c4f09b","score":"0.5565163","text":"public void initializeSliders(){\n \n leaseDuration_S.setMin(0);\n leaseDuration_S.setMax(24);\n leaseDuration_S.setShowTickLabels(true);\n leaseDuration_S.setShowTickMarks(true);\n leaseDuration_S.setMajorTickUnit(12);\n leaseDuration_S.setMinorTickCount(11);\n leaseDuration_S.setBlockIncrement(1);\n leaseDuration_S.setSnapToTicks(true);\n }","title":""},{"docid":"4bc716a85d44cffc2544d0550d84cf31","score":"0.5560357","text":"@Override\n public void onStart(SliderEvent e) {\n \tdateBox.getElement().getStyle().setBackgroundColor(\"white\");\n }","title":""},{"docid":"2d88b62f4ce76d96e0922b3701faae54","score":"0.55562174","text":"private SliderListener getDurationSliderListener() {\n\t\tSliderListener listener = new SliderListener() {\n\t\t\t//helper function\n\t\t\tprivate void setDurationInput(int min, int max) {\n\t\t\t\tif( min == max ) {\n\t\t\t\t\t//if values are equal just write one value\n\t\t\t\t\tdurationBox.setValue( Integer.toString(min) );\n\t\t\t\t} else {\n\t\t\t\t\t//if values are different write both\n\t\t\t\t\tdurationBox.setValue( Integer.toString(min) + \"-\" + Integer.toString(max) );\n\t\t\t\t}\n\t\t\t}\n \t\n @Override\n public void onStart(SliderEvent e) {\n \t//reset input field in case it was changed due to an error\n \tdurationBox.getElement().getStyle().setBackgroundColor(\"white\");\n }\n @Override\n public boolean onSlide(SliderEvent e) {\n \tdurationBox.removeStyleName(defaultInputCSSRule);\n \t\n int max = durationSlider.getValueMax();\n int min = durationSlider.getValueMin();\n \n setDurationInput(min, max);\n return true;\n }\n\n @Override\n public void onChange(SliderEvent e) {\n int max = durationSlider.getValueMax();\n int min = durationSlider.getValueMin();\n\n setDurationInput(min, max);\n }\n\n @Override\n public void onStop(SliderEvent e) {\n }\n\t\t};\n\t\t\n\t\treturn listener;\n\t}","title":""},{"docid":"7b0115b6645e2be86f1b874df6a7dd6f","score":"0.55556613","text":"private void setUpSlider(Dictionary<Integer, JComponent> modes, JSlider slider,\n Model model, ScaleType scaleType) {\n slider.setMajorTickSpacing(1);\n slider.setSnapToTicks(true);\n slider.setLabelTable(modes);\n slider.setPaintLabels(true);\n slider.addChangeListener(new SliderController(model, slider, scaleType));\n }","title":""},{"docid":"1ec28341226db1231d9308f425eebfb5","score":"0.55524486","text":"private void tribeFieldAction(ActionEvent e)\n {\n try\n {\n int tribeNo = Integer.parseInt(tribeCountField.getText());\n if (tribeNo >= 0 && tribeNo < tribeCount)\n {\n tribeSlider.setValue(tribeNo);\n }\n else if (tribeNo < 0)\n {\n tribeSlider.setValue(0);\n }\n else\n {\n tribeSlider.setValue(tribeCount - 1);\n }\n }\n catch (NumberFormatException e1)\n {\n tribeCountField.setText(0 + \"\");\n tribeSlider.setValue(0);\n }\n }","title":""},{"docid":"91496be245071686eb247b6f7053b5d8","score":"0.5540308","text":"private void createArchitectureSliders() {\n JSlider numberOfFloors = createSlider(new JSlider(JSlider.HORIZONTAL, 1, 3, model.getNumberOfFloors()), \"Number of floors: \");\n numberOfFloors.addChangeListener(e -> controller.changeNumberOfFloors( ((JSlider) e.getSource()).getValue() ));\n\n JSlider numberOfRows = createSlider(new JSlider(JSlider.HORIZONTAL, 1, 6, model.getNumberOfRows()), \"Number of rows: \");\n numberOfRows.addChangeListener(e -> controller.changeNumberOfRows( ((JSlider) e.getSource()).getValue() ));\n\n JSlider numberOfPlaces = createSlider(new JSlider(JSlider.HORIZONTAL, 1, 41, model.getNumberOfPlaces()), \"Number of places: \");\n numberOfPlaces.addChangeListener(e -> controller.changeNumberOfPlaces( ((JSlider) e.getSource()).getValue() ));\n }","title":""},{"docid":"d9800bcb0b2430cfafb5e5e798e91d51","score":"0.55375266","text":"@Override\r\n\t\t\tpublic void onClick(View arg0) {\n\t\t\t\trl_slider_parent.startAnimation(inFromRightAnimation());\r\n\r\n\t\t\t}","title":""},{"docid":"e8d90d571ac082b0ccdab9dd4af95e4f","score":"0.55326897","text":"@FXML private void sliderChanged() {\r\n int value = (int) profileRam.getValue();\r\n profileRamAssignateLabel.setText(String.valueOf(value) + \" MB\");\r\n }","title":""},{"docid":"592c6063cdbb4d114ef9b40e797c97d4","score":"0.55300283","text":"@Override\n public void stateChanged(ChangeEvent e) {\n float volume = scale(volSlider.getValue(), 1, 10, 0.0001f, 2);\n Sound.getWinter().setVolume(volume);\n Sound.getFall().setVolume(volume);\n Sound.getSpring().setVolume(volume);\n\n Sound.getPain().setVolume(volume);\n Sound.getNom().setVolume(volume);\n Sound.getSmash().setVolume(volume);\n Sound.getDing().setVolume(volume);\n }","title":""},{"docid":"e975c14c4bb02839e174e990148cf8b7","score":"0.5504309","text":"public void addSoundEffectsVolumeSliderListener(Slider slider) {\n slider.setValue(preferences.getFloat(\"soundEffectsVolume\") * 100);\n slider.addListener(new ChangeListener() {\n @Override\n public void changed(ChangeEvent event, Actor actor) {\n preferences.putFloat(\"soundEffectsVolume\", slider.getValue() / 100f);\n }\n });\n }","title":""},{"docid":"2fc6333a7a15055fa1700e1f7f6ef143","score":"0.55041534","text":"@FXML\n void updateAudioOffset(MouseEvent event) {\n audioOffsetValue.textProperty().bindBidirectional(slider.valueProperty(),NumberFormat.getNumberInstance());\n }","title":""},{"docid":"dcbf58cbc7a7a66523f85e37385a2419","score":"0.5501927","text":"public Atdl4jWidget<?> createSliderT(SliderT control, ParameterT parameter)\n\t{\n\t Atdl4jWidget<?> atdl4jWidgetForSliderT = Atdl4jConfig.getConfig().createAtdl4jWidgetForSliderT();\n\t atdl4jWidgetForSliderT.init( control, parameter, getAtdl4jOptions() );\n\t return atdl4jWidgetForSliderT;\n\t}","title":""},{"docid":"f6c1de1fba2e17d75c4132930705843a","score":"0.5499209","text":"private void setSliderBasedPosition() {\n if(!mediaPlayer.isSeekable()) {\n return;\n }\n float positionValue = positionSlider.getValue() / 1000.0f;\n // Avoid end of file freeze-up\n if(positionValue > 0.99f) {\n positionValue = 0.99f;\n }\n mediaPlayer.setPosition(positionValue);\n }","title":""},{"docid":"e0458bb78380318e140e4cd0af3cef99","score":"0.54971075","text":"public AutomationSlider getSliderByName(int index) {\n return new AutomationSlider(this.getControlByControlType(index, ControlType.Slider), this.automation);\n }","title":""}],"string":"[\n {\n \"docid\": \"4fe550d0cac5bcf020e6d918f1ddb44a\",\n \"score\": \"0.70334727\",\n \"text\": \"public void updateSlider() \\n { \\n /* [GNPP] you may comment out if not debugging. */\\n //gnpp.updateSlider();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d66dc769fe5df9b3c6bed256bbca55b0\",\n \"score\": \"0.6729305\",\n \"text\": \"private void setupSlider() {\\n int mid = WIDTH / 2;\\n detailSlider.setEnabled(false);\\n detailSlider.setPaintTicks(true);\\n detailSlider.setPaintLabels(true);\\n detailSlider.setToolTipText(\\\"Choose a file to convert first!\\\");\\n detailSlider.setSize(300, 50);\\n detailSlider.setLocation(mid - detailSlider.getSize().width / 2, 700);\\n detailSlider.addChangeListener(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17babd48cacf9026451d8aec71c761a8\",\n \"score\": \"0.6635283\",\n \"text\": \"public void fenetreVisu(){\\r\\n\\r\\n\\t\\tfenetreVisu = new JFrame(\\\"M²B²T - Visualisation\\\");\\r\\n\\t\\tfenetreVisu.setDefaultCloseOperation(JFrame.DO_NOTHING_ON_CLOSE);\\r\\n\\t\\tfenetreVisu.setIconImage(Toolkit.getDefaultToolkit().getImage(\\\"images/myIcon.png\\\"));\\r\\n\\t\\tfenetreVisu.setResizable(false);\\r\\n\\r\\n\\t\\tJPanel panelSlider = new JPanel();\\r\\n\\t\\tpanelSlider.setLayout(new GridLayout(1,6));\\r\\n\\r\\n\\t\\tHashtable<Integer, JLabel> labelTable = new Hashtable<Integer, JLabel>();\\r\\n\\t\\tlabelTable.put( new Integer( 0 ), new JLabel(\\\"Sous-Sol\\\") );\\r\\n\\t\\tlabelTable.put( new Integer( 4 ), new JLabel(\\\"RDC\\\") );\\r\\n\\t\\tlabelTable.put( new Integer( SOMMET ), new JLabel(\\\"Sommet\\\") );\\r\\n\\r\\n\\t\\t/**\\r\\n\\t\\t * Ajout des sliders à la fenetre\\r\\n\\t\\t */\\r\\n\\t\\tslider0 = new JSlider(JSlider.VERTICAL, RDC, SOMMET, 0);\\r\\n\\t\\tslider0.setMajorTickSpacing(1);\\r\\n\\t\\tslider0.setPaintTicks(true);\\r\\n\\t\\tslider0.setLabelTable( labelTable );\\r\\n\\t\\tslider0.setPaintLabels(true);\\r\\n\\t\\tslider0.setBorder(new TitledBorder(\\\"Ascenseur A\\\"));\\r\\n\\r\\n\\r\\n\\t\\tslider1 = new JSlider(JSlider.VERTICAL, RDC, SOMMET, 0);\\r\\n\\t\\tslider1.setMajorTickSpacing(1);\\r\\n\\t\\tslider1.setPaintTicks(true);\\r\\n\\t\\tslider1.setLabelTable( labelTable );\\r\\n\\t\\tslider1.setPaintLabels(true);\\r\\n\\t\\tslider1.setBorder(new TitledBorder(\\\"Ascenseur B\\\"));\\r\\n\\r\\n\\r\\n\\t\\tslider2 = new JSlider(JSlider.VERTICAL, RDC, SOMMET, 0);\\r\\n\\t\\tslider2.setMajorTickSpacing(1);\\r\\n\\t\\tslider2.setPaintTicks(true);\\r\\n\\t\\tslider2.setLabelTable( labelTable );\\r\\n\\t\\tslider2.setPaintLabels(true);\\r\\n\\t\\tslider2.setBorder(new TitledBorder(\\\"Ascenseur C\\\"));\\r\\n\\r\\n\\t\\tslider3 = new JSlider(JSlider.VERTICAL, RDC, SOMMET, 0);\\r\\n\\t\\tslider3.setMajorTickSpacing(1);\\r\\n\\t\\tslider3.setPaintTicks(true);\\r\\n\\t\\tslider3.setLabelTable( labelTable );\\r\\n\\t\\tslider3.setPaintLabels(true);\\r\\n\\t\\tslider3.setBorder(new TitledBorder(\\\"Ascenseur D\\\"));\\r\\n\\r\\n\\t\\tslider4 = new JSlider(JSlider.VERTICAL, RDC, SOMMET, 0);\\r\\n\\t\\tslider4.setMajorTickSpacing(1);\\r\\n\\t\\tslider4.setPaintTicks(true);\\r\\n\\t\\tslider4.setLabelTable( labelTable );\\r\\n\\t\\tslider4.setPaintLabels(true);\\r\\n\\t\\tslider4.setBorder(new TitledBorder(\\\"Ascenseur E\\\"));\\r\\n\\r\\n\\r\\n\\t\\tslider5 = new JSlider(JSlider.VERTICAL, RDC, SOMMET, 0);\\r\\n\\t\\tslider5.setMajorTickSpacing(1);\\r\\n\\t\\tslider5.setPaintTicks(true);\\r\\n\\t\\tslider5.setLabelTable( labelTable );\\r\\n\\t\\tslider5.setPaintLabels(true);\\r\\n\\t\\tslider5.setBorder(new TitledBorder(\\\"Ascenseur F\\\"));\\r\\n\\r\\n\\t\\tpanelSlider.add(slider0);\\r\\n\\t\\tpanelSlider.add(slider1);\\r\\n\\t\\tpanelSlider.add(slider2);\\r\\n\\t\\tpanelSlider.add(slider3);\\r\\n\\t\\tpanelSlider.add(slider4);\\r\\n\\t\\tpanelSlider.add(slider5);\\r\\n\\r\\n\\t\\tfenetreVisu.add(panelSlider);\\r\\n\\r\\n\\t\\t/**\\r\\n\\t\\t * Fait disparaitre la fenetre de sliders au clic de la croix\\r\\n\\t\\t */\\r\\n\\t\\tfenetreVisu.addWindowListener(new WindowAdapter() {\\r\\n\\t\\t\\tpublic void windowClosing(WindowEvent e) {\\r\\n\\t\\t\\t\\tfenetreVisu.setVisible(false);\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\r\\n\\t\\tfenetreVisu.pack();\\r\\n\\t\\tfenetreVisu.setVisible(false);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6c4fb41f94f8d6a9d3327e4d1a26d94\",\n \"score\": \"0.65629864\",\n \"text\": \"@Override\\n\\t\\tpublic final void mouseDragged(MouseEvent me)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint sliderIndex = 0;\\n\\t\\t\\t\\tfor (TButton slider : sliders)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif (slider.inUse)\\n\\t\\t\\t\\t\\t\\t\\tif (orientation == VERTICAL)\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tslider.y = me.getY() - 12.5f;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (slider.y < y)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tslider.y = y;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse if (slider.y > y + length - 25)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tslider.y = y + length - 25;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tsendTScrollEvent(new TScrollEvent(this, TScrollEvent.TSCROLLBARSCROLLED, getSliderPercent(sliderIndex), sliderIndex));\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse if (orientation == HORIZONTAL)\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tslider.x = me.getX() - 12.5f;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (slider.x < x)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tslider.x = x;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse if (slider.x > x + length - 25)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tslider.x = x + length - 25;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tsendTScrollEvent(new TScrollEvent(this, TScrollEvent.TSCROLLBARSCROLLED, getSliderPercent(sliderIndex), sliderIndex));\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tsliderIndex++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b97a23284ef5cf7c6b9b957fc87036cf\",\n \"score\": \"0.6516763\",\n \"text\": \"@Override\\n public void onSliderClick(BaseSliderView slider) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1640be68bd5958058879d07d8c95affe\",\n \"score\": \"0.65061617\",\n \"text\": \"void setCurrentSliderVal(int value);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8dc35f6d1e2abe8f46300865e71829a\",\n \"score\": \"0.64550966\",\n \"text\": \"@Override\\n public void onSlideChanged()\\n {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f58819d1f2cac0c4b1786bbf10fafaa\",\n \"score\": \"0.64473003\",\n \"text\": \"@Override\\n public void setCurrentSliderVal(int value) {\\n return;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb72e3a36dcc60997df56094229dfbff\",\n \"score\": \"0.64304495\",\n \"text\": \"public void updatePowerSlider(){\\n\\t\\tif(this.powerValue!=output.getPower()){\\n\\t\\t\\tpowerslider.setValue(output.getPower());\\n\\t\\t}\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d9d2708b809e8c67192415bc2063b42\",\n \"score\": \"0.63867086\",\n \"text\": \"@Override\\n public void onSlideChanged() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d9d2708b809e8c67192415bc2063b42\",\n \"score\": \"0.63867086\",\n \"text\": \"@Override\\n public void onSlideChanged() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d9d2708b809e8c67192415bc2063b42\",\n \"score\": \"0.63867086\",\n \"text\": \"@Override\\n public void onSlideChanged() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f85cf8c3cc4e2687094c6d30cfbed314\",\n \"score\": \"0.6385563\",\n \"text\": \"private void updateGenomeSlider()\\n {\\n if (paused && triangleGenome != null && triangleGenome.getTribe(tribeIndex) != null)\\n {\\n genomeSlider.setMaximum(triangleGenome.getTribe(tribeIndex).getPopulationSize() - 1);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5dfcec2dc7864d48eda2c65820bbab47\",\n \"score\": \"0.6366725\",\n \"text\": \"private void setSliders() {\\n aSlider.setMinimum(0);\\n aSlider.setMaximum(100);\\n aSlider.setMinorTickSpacing(10);\\n aSlider.setPaintTicks(true);\\n\\n bSlider.setMinimum(0);\\n bSlider.setMaximum(100);\\n bSlider.setMinorTickSpacing(10);\\n bSlider.setPaintTicks(true);\\n\\n alphaSlider.setMinimum(0);\\n alphaSlider.setMaximum(100);\\n alphaSlider.setMinorTickSpacing(10);\\n alphaSlider.setPaintTicks(true);\\n\\n betaSlider.setMinimum(0);\\n betaSlider.setMaximum(100);\\n betaSlider.setMinorTickSpacing(10);\\n betaSlider.setPaintTicks(true);\\n\\n herbSlider.setMinimum(1);\\n herbSlider.setMaximum(100);\\n herbSlider.setMinorTickSpacing(10);\\n herbSlider.setPaintTicks(true);\\n\\n predSlider.setMinimum(1);\\n predSlider.setMaximum(100);\\n predSlider.setMinorTickSpacing(10);\\n predSlider.setPaintTicks(true);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08b8073b9114be2f3fd7c02ab494aede\",\n \"score\": \"0.63476384\",\n \"text\": \"void setTimeSlider() {\\n\\t\\t// Create a new time slide\\n timeSlider = new Slider();\\n timeSlider.setMaxWidth((2*mpWidth)/3);\\n HBox.setHgrow(timeSlider, Priority.ALWAYS);\\n \\n // Allow the user to drag and position the slider\\n timeSlider.valueProperty().addListener(new InvalidationListener() {\\n\\n @Override\\n public void invalidated(Observable ov) {\\n \\t// If the value is changing perform an action\\n if (timeSlider.isValueChanging()) {\\n \\t// If the duration of video is not null, move to requested time\\n if (duration != null) {\\n \\tmp.seek(duration.multiply(timeSlider.getValue()/ 100.0));\\n }\\n }\\n }\\n });\\n \\n // Allow the user to click on the slider to jump to the desired timing\\n timeSlider.setOnMousePressed(new EventHandler<MouseEvent>() {\\n @Override\\n public void handle(MouseEvent mouseEvent) {\\n mp.seek(duration.multiply(timeSlider.getValue()/ 100.0));\\n }\\n });\\n \\n // Create a new time slider for fullscreen mode\\n timeSliderFS = new Slider();\\n \\ttimeSliderFS.setMinWidth(bounds.getWidth()-100); \\t\\n \\ttimeSliderFS.valueProperty().addListener(new InvalidationListener() {\\n\\n @Override\\n public void invalidated(Observable ov) {\\n \\t// If the value is changing perform an action\\n if (timeSliderFS.isValueChanging()) {\\n \\t// If the duration of video is not null, move to requested time\\n if (duration != null) {\\n \\tmp.seek(duration.multiply(timeSliderFS.getValue()/ 100.0));\\n }\\n }\\n }\\n });\\n \\n \\t// If mouse enters time slider in fullscreen mode handle it\\n timeSliderFS.setOnMousePressed(new EventHandler<MouseEvent>() {\\n @Override\\n public void handle(MouseEvent mouseEvent) {\\n \\t// Stop the fade transition and move to requested time\\n \\tfadeTransition.stop();\\n \\tmp.seek(duration.multiply(timeSliderFS.getValue()/ 100.0));\\n }\\n });\\n \\n // Add the time slider to MediaControl bar\\n mediaBar.getChildren().add(timeSlider);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3787f43c64e24a63c57b88b94b2ac15c\",\n \"score\": \"0.6332391\",\n \"text\": \"public void f() {\\n GQuery g = $(\\\"<paper-slider>\\\").appendTo($(\\\"#slider-container\\\"));\\n // Wrap the native element in a POJO\\n PaperSlider slider = GQ.create(PaperSlider.class).load(g);\\n // Use it as a java object\\n slider.setValue(300).max(400).step(50).snaps(true).pin(true);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80672495ec2d642a2d4ee8eaad204976\",\n \"score\": \"0.6321406\",\n \"text\": \"@Override\\n public int getSliderValue() {\\n return -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd52becafa2c7eb412c95a272b56280d\",\n \"score\": \"0.6309875\",\n \"text\": \"public void setSliderAction() {\\n speedSlider.valueProperty().addListener(\\n (observable, oldvalue, newvalue) -> {\\n timeline.pause();\\n updateTimeline(newvalue.doubleValue());\\n timeline.play();\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b10e6ad440f743290d62bb01d76bc1d0\",\n \"score\": \"0.6280064\",\n \"text\": \"private void slider1StateChanged(ChangeEvent e) {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9781ea7696dcca1e6d8458935e15ace9\",\n \"score\": \"0.62747353\",\n \"text\": \"public void initSlider() {\\n speedSlider = new Slider(SPEEDSLIDER_MIN, SPEEDSLIDER_MAX, SPEEDSLIDER_VALUE);\\n speedSlider.setShowTickMarks(true);\\n speedSlider.setShowTickLabels(true);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab729409638bc193a27371641a9f8a1d\",\n \"score\": \"0.6244136\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onClick(View arg0) {\\n\\t\\t\\t\\tif (slider == 0) {\\r\\n\\t\\t\\t\\t\\tMainActivityA.getInstance().showUnitConverterWeightFragment();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f42e426931e7a4e77beae38288566bd\",\n \"score\": \"0.6238234\",\n \"text\": \"private void jSlider1StateChanged(javax.swing.event.ChangeEvent evt) {\\n jLabelSlider.setText(Integer.toString(jSlider1.getValue()));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eaf32fe609a6d44f7288682fe10d4a3\",\n \"score\": \"0.6237586\",\n \"text\": \"public JSlider getSlider()\\n\\t{\\n\\t\\treturn this.slider; \\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"129b43eab068e6129ac2faea9105b823\",\n \"score\": \"0.62193924\",\n \"text\": \"@Override\\n public void actionPerformed(ActionEvent e) {\\n //Sound.getWinter().setVolume(0.0001);\\n volSlider.setValue(1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"740495fc514a06687b6f64e7b819b37c\",\n \"score\": \"0.62141925\",\n \"text\": \"public GZoomSlider getSlider(){\\r\\n return slider;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"694122e7ffb4fe6195fd7d343caabf2e\",\n \"score\": \"0.6212777\",\n \"text\": \"protected void setupSlider() throws Exception\\n\\t{\\n\\t\\treturn;\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5e7f8e3a5b0557359b2c19d5c108e6a\",\n \"score\": \"0.6209754\",\n \"text\": \"public void sliderUpdater(WindowComponent win) {\\n JSlider playBar = win.getPlayBarComponent().getView().getPlayBar();\\n playBar.setMaximum(win.getApiMusic().getNumberOfFrame());\\n while( PlayBarController.this.getModel().isPlaying() ) {\\n playBar.setValue(win.getApiMusic().getCurrentFrame());\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d9b8e3652fc39eb44e51d523b7f4d99\",\n \"score\": \"0.6207072\",\n \"text\": \"private void addControls()\\n\\t{\\n\\t\\tthis.labelDureeActuelle = new JLabel(\\\"00:00:00\\\");\\n\\t\\tthis.labelDureeMax = new JLabel(\\\"00:00:00\\\");\\n\\n\\t\\tthis.boutonLecture = new JButton();\\n\\t\\tthis.boutonLecture.setIcon(PlayerEventListener.IMG_ICON_LECTURE);\\n\\t\\tthis.boutonLecture.addActionListener(this);\\n\\t\\tthis.boutonLecture.setEnabled(true);\\n\\n\\t\\tthis.boutonStop = new JButton();\\n\\t\\tthis.boutonStop.setIcon(PlayerEventListener.IMG_ICON_STOP);\\n\\t\\tthis.boutonStop.addActionListener(this);\\n\\t\\tthis.boutonStop.setEnabled(true);\\n\\n\\t\\tthis.slider = new JSlider(JSlider.HORIZONTAL);\\n\\t\\tthis.slider.setPaintTicks(false);\\n\\t\\tthis.slider.setPaintLabels(false);\\n\\t\\tthis.slider.setMinimum(0);\\n\\t\\tthis.slider.setValue(0);\\n\\t\\tthis.slider.setMaximum(1);\\n\\n\\t\\tJSlider sliderVolume = new JSlider(JSlider.HORIZONTAL);\\n\\t\\tsliderVolume.setPaintTicks(false);\\n\\t\\tsliderVolume.setPaintLabels(false);\\n\\t\\tsliderVolume.setMinimum(0);\\n\\t\\tsliderVolume.setMaximum(VOLUME_MAX);\\n\\t\\tsliderVolume.setValue(VOLUME_DEFAULT);\\n\\t\\tsliderVolume.setToolTipText(\\\"Volume\\\");\\n\\t\\tsliderVolume.setMinimumSize(SLIDER_VOLUME_DIMENSION);\\n\\t\\tsliderVolume.setMaximumSize(SLIDER_VOLUME_DIMENSION);\\n\\t\\tsliderVolume.setPreferredSize(SLIDER_VOLUME_DIMENSION);\\n\\t\\tSliderVolumeListener volumeListener = new SliderVolumeListener(sliderVolume, this.mediaPlayer);\\n\\t\\tsliderVolume.addMouseListener(volumeListener);\\n\\t\\tsliderVolume.addMouseMotionListener(volumeListener);\\n\\n\\t\\tSliderPositionEventListener sliderListener = new SliderPositionEventListener(this.slider,\\n\\t\\t\\t\\tthis.labelDureeActuelle, this.mediaPlayer);\\n\\t\\tthis.slider.addMouseListener(sliderListener);\\n\\t\\tthis.slider.addMouseMotionListener(sliderListener);\\n\\n\\t\\tJPanel panelDuree = new JPanel();\\n\\t\\tpanelDuree.setLayout(new BoxLayout(panelDuree, BoxLayout.X_AXIS));\\n\\t\\tpanelDuree.add(Box.createHorizontalStrut(PANEL_MARGIN));\\n\\t\\tpanelDuree.add(labelDureeActuelle, BorderLayout.WEST);\\n\\t\\tpanelDuree.add(Box.createHorizontalStrut(PANEL_MARGIN));\\n\\t\\tpanelDuree.add(slider, BorderLayout.CENTER);\\n\\t\\tpanelDuree.add(Box.createHorizontalStrut(PANEL_MARGIN));\\n\\t\\tpanelDuree.add(labelDureeMax, BorderLayout.EAST);\\n\\t\\tpanelDuree.add(Box.createHorizontalStrut(PANEL_MARGIN));\\n\\n\\t\\tJToolBar toolBar = new JToolBar();\\n\\t\\ttoolBar.setLayout(new BoxLayout(toolBar, BoxLayout.X_AXIS));\\n\\t\\ttoolBar.setFloatable(false);\\n\\t\\ttoolBar.add(boutonLecture);\\n\\t\\ttoolBar.add(boutonStop);\\n\\t\\ttoolBar.add(Box.createHorizontalGlue());\\n\\t\\ttoolBar.add(new JLabel(new ImageIcon(\\\"images/Volume.png\\\")));\\n\\t\\ttoolBar.add(Box.createHorizontalStrut(PANEL_MARGIN));\\n\\t\\ttoolBar.add(sliderVolume);\\n\\t\\ttoolBar.add(Box.createHorizontalStrut(PANEL_MARGIN));\\n\\n\\t\\tthis.setLayout(new GridLayout(2, 1));\\n\\t\\tthis.add(panelDuree);\\n\\t\\tthis.add(toolBar);\\n\\n\\t\\tActionMap actionMap = this.getActionMap();\\n\\t\\tInputMap inputMap = this.getInputMap(JComponent.WHEN_IN_FOCUSED_WINDOW);\\n\\n\\t\\tinputMap.put(KeyStroke.getKeyStroke(KeyEvent.VK_SPACE, 0), \\\"space bar\\\");\\n\\t\\tactionMap.put(\\\"space bar\\\", new AbstractAction()\\n\\t\\t{\\n\\t\\t\\tprivate static final long serialVersionUID = -7449791455625215682L;\\n\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent arg0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (mediaPlayer.isPlaying())\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tmediaPlayer.pause();\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tmediaPlayer.play();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82ef54b7e44e6cca584d5539ce5eff63\",\n \"score\": \"0.6136706\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onClick(View arg0) {\\n\\t\\t\\t\\tif (slider == 0) {\\r\\n\\t\\t\\t\\t\\tMainActivityA.getInstance().showUnitConverterSpeedFragment();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73461d58f63dd804495e99a42cf3d3fc\",\n \"score\": \"0.61270505\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onClick(View arg0) {\\n\\t\\t\\t\\tif (slider == 0) {\\r\\n\\t\\t\\t\\t\\tMainActivityA.getInstance().showUnitConverterLengthFragment();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"888c8ad940362412f1867487c46a6270\",\n \"score\": \"0.6109731\",\n \"text\": \"void setVolumeSlider() {\\n\\t\\t// Create a new volume slider\\n\\t\\tvolumeSlider = new Slider();\\n\\t volumeSlider.setManaged(true);\\n\\t volumeSlider.setMaxWidth(mpWidth/6);\\n\\t volumeSlider.setMinWidth(20);\\n\\t \\n\\t // Detect the change in volume slider bar and sets the MediaPlayer's volume accordingly\\n\\t volumeSlider.valueProperty().addListener(new ChangeListener<Number>() {\\n\\t \\n\\t \\t@Override\\n\\t public void changed(ObservableValue<? extends Number> observable, Number oldValue, Number newValue) {\\n\\t \\t\\tif (volumeSlider.isValueChanging()) {\\n\\t \\t\\t\\t// If the slider is being dragged set volume to that requested\\n\\t \\t\\t\\tmp.setVolume(volumeSlider.getValue() / 100.0);\\n\\t }\\n\\t \\n\\t \\t\\t// Update the text labels to display\\n\\t \\t\\tupdateValues();\\n\\t }\\n\\t });\\n\\t \\n\\t // Add the volume slider to MediaControl bar\\n\\t mediaBar.getChildren().add(volumeSlider);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8298ee5356e2eafea2af43fae83acca\",\n \"score\": \"0.6103507\",\n \"text\": \"@Override\\n public void mousePressed(MouseEvent e) {\\n System.out.println(\\\"---- Mouse pressed on Slider\\\");\\n JSlider playBar = win.getPlayBarComponent().getView().getPlayBar();\\n double p = e.getPoint().getX();\\n double percent = p / ((double) playBar.getWidth());\\n int range = playBar.getMaximum() - playBar.getMinimum();\\n double newVal = range * percent;\\n int result = (int)(playBar.getMinimum() + newVal);\\n\\n if ( !PlayBarController.this.getModel().isPlaying() ) {\\n PlayBarController.this.getModel().setIsPlaying(true);\\n Runnable r = new Runnable() {\\n public void run() {\\n PlayBarController.this.sliderUpdater(win);\\n }\\n };\\n PlayBarController.this.startThread(r);\\n }\\n\\n win.getApiMusic().playSongFromSpecificFrame(result);\\n System.out.println(\\\"---- Result = \\\" + result +\\\"\\\\n\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7de60cb3e15efc5ded9fa975d0565a9b\",\n \"score\": \"0.60954094\",\n \"text\": \"private void init_slider()\\r\\n\\t{\\r\\n\\t\\tstrokeSlider = new JSlider(JSlider.HORIZONTAL, 0, 19, 3);\\r\\n\\t\\tstrokeSlider.setBackground(BACKGROUND);\\r\\n\\t\\t\\r\\n\\t\\tfinal Map<Integer, Integer> zoomValues = new HashMap<Integer, Integer>();\\r\\n\\t\\tzoomValues.put(0, 1);\\r\\n\\t\\tzoomValues.put(1, 2);\\r\\n\\t\\tzoomValues.put(2, 3);\\r\\n\\t\\tzoomValues.put(3, 4);\\r\\n\\t\\tzoomValues.put(4, 5);\\r\\n\\t\\tzoomValues.put(5, 6);\\r\\n\\t\\tzoomValues.put(6, 7);\\r\\n\\t\\tzoomValues.put(7, 8);\\r\\n\\t\\tzoomValues.put(8, 9);\\r\\n\\t\\tzoomValues.put(9, 10);\\r\\n\\t\\t\\r\\n\\t\\tzoomValues.put(10, 11);\\r\\n\\t\\tzoomValues.put(11, 12);\\r\\n\\t\\tzoomValues.put(12, 13);\\r\\n\\t\\tzoomValues.put(13, 14);\\r\\n\\t\\tzoomValues.put(14, 15);\\r\\n\\t\\tzoomValues.put(15, 16);\\r\\n\\t\\tzoomValues.put(16, 17);\\r\\n\\t\\tzoomValues.put(17, 18);\\r\\n\\t\\tzoomValues.put(18, 19);\\r\\n\\t\\tzoomValues.put(19, 20);\\r\\n\\t\\t\\r\\n\\t\\tstrokeSlider.setValue(4);\\r\\n\\r\\n\\r\\n\\t\\tstrokeSlider.setMajorTickSpacing(1);\\r\\n\\t\\tstrokeSlider.setPaintTicks(true);\\r\\n\\t\\tstrokeSlider.setSnapToTicks(true);\\r\\n\\t\\t\\r\\n\\t\\tshowLabel(strokeSlider, zoomValues);\\r\\n\\t\\t// add Listener\\r\\n\\t\\tstrokeSlider.addChangeListener(new ChangeListener() \\r\\n\\t\\t{\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic void stateChanged(ChangeEvent arg0) \\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tshowLabel(strokeSlider, zoomValues);\\r\\n\\t\\t\\t\\tMainControl.stroke = zoomValues.get(strokeSlider.getValue());\\r\\n\\t\\t\\t\\tif (MainControl.selected != null && MainControl.selected instanceof ShapeDrawing) \\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tShapeDrawing shape = (ShapeDrawing) MainControl.selected;\\r\\n\\t\\t\\t\\t\\tshape.getStyle().setStroke(new BasicStroke(MainControl.stroke));\\r\\n\\t\\t\\t\\t\\tMainControl.drawingArea.repaint();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t\\t\\r\\n\\t\\tp.setBorder(new TitledBorder(\\\"Stroke size\\\"));\\r\\n\\t\\tp.add(strokeSlider);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1fbb9072b80a6a51e013c9fe15ee06b\",\n \"score\": \"0.6087797\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onClick(View arg0) {\\n\\t\\t\\t\\tif (slider == 0) {\\r\\n\\t\\t\\t\\t\\tMainActivityA.getInstance().showUnitConverterPressureFragment();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"036a36ec361122494f605c03d6060c6b\",\n \"score\": \"0.607934\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onClick(View arg0) {\\n\\t\\t\\t\\tif (slider == 0) {\\r\\n\\t\\t\\t\\t\\tMainActivityA.getInstance().showUnitConverterAreaFragment();\\r\\n\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c3bcd0d27be302f2e34a08887276c7b\",\n \"score\": \"0.6057876\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onClick(View arg0) {\\n\\t\\t\\t\\tif (slider == 0) {\\r\\n\\t\\t\\t\\t\\tMainActivityA.getInstance().showUnitConverterPowerFragment();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5fd9a06e290426ad973a264f455e287\",\n \"score\": \"0.60229284\",\n \"text\": \"@Override\\n public void onStart(SliderEvent e) {\\n \\tdurationBox.getElement().getStyle().setBackgroundColor(\\\"white\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67e5c2cb2373e62602e964fc5ee6e024\",\n \"score\": \"0.60048056\",\n \"text\": \"@SuppressWarnings(\\\"unchecked\\\")\\n // <editor-fold defaultstate=\\\"collapsed\\\" desc=\\\"Generated Code\\\">//GEN-BEGIN:initComponents\\n private void initComponents() {\\n\\n jPanel2 = new javax.swing.JPanel();\\n jPanel3 = new javax.swing.JPanel();\\n jPanel1 = new javax.swing.JPanel();\\n jSlider1 = new javax.swing.JSlider();\\n\\n setDefaultCloseOperation(javax.swing.WindowConstants.EXIT_ON_CLOSE);\\n getContentPane().setLayout(new java.awt.GridLayout());\\n\\n javax.swing.GroupLayout jPanel2Layout = new javax.swing.GroupLayout(jPanel2);\\n jPanel2.setLayout(jPanel2Layout);\\n jPanel2Layout.setHorizontalGroup(\\n jPanel2Layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGap(0, 220, Short.MAX_VALUE)\\n );\\n jPanel2Layout.setVerticalGroup(\\n jPanel2Layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGap(0, 300, Short.MAX_VALUE)\\n );\\n\\n getContentPane().add(jPanel2);\\n\\n jPanel3.setBorder(javax.swing.BorderFactory.createEtchedBorder());\\n jPanel3.addMouseMotionListener(new java.awt.event.MouseMotionAdapter() {\\n public void mouseDragged(java.awt.event.MouseEvent evt) {\\n jPanel3MouseDragged(evt);\\n }\\n });\\n\\n javax.swing.GroupLayout jPanel3Layout = new javax.swing.GroupLayout(jPanel3);\\n jPanel3.setLayout(jPanel3Layout);\\n jPanel3Layout.setHorizontalGroup(\\n jPanel3Layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGap(0, 216, Short.MAX_VALUE)\\n );\\n jPanel3Layout.setVerticalGroup(\\n jPanel3Layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGap(0, 296, Short.MAX_VALUE)\\n );\\n\\n getContentPane().add(jPanel3);\\n\\n jSlider1.setMajorTickSpacing(50);\\n jSlider1.setMaximum(255);\\n jSlider1.setMinorTickSpacing(10);\\n jSlider1.setPaintLabels(true);\\n jSlider1.setPaintTicks(true);\\n jSlider1.addChangeListener(new javax.swing.event.ChangeListener() {\\n public void stateChanged(javax.swing.event.ChangeEvent evt) {\\n jSlider1StateChanged(evt);\\n }\\n });\\n\\n javax.swing.GroupLayout jPanel1Layout = new javax.swing.GroupLayout(jPanel1);\\n jPanel1.setLayout(jPanel1Layout);\\n jPanel1Layout.setHorizontalGroup(\\n jPanel1Layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGroup(javax.swing.GroupLayout.Alignment.TRAILING, jPanel1Layout.createSequentialGroup()\\n .addContainerGap(javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)\\n .addComponent(jSlider1, javax.swing.GroupLayout.PREFERRED_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addContainerGap())\\n );\\n jPanel1Layout.setVerticalGroup(\\n jPanel1Layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGroup(javax.swing.GroupLayout.Alignment.TRAILING, jPanel1Layout.createSequentialGroup()\\n .addContainerGap(125, Short.MAX_VALUE)\\n .addComponent(jSlider1, javax.swing.GroupLayout.PREFERRED_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addGap(130, 130, 130))\\n );\\n\\n getContentPane().add(jPanel1);\\n\\n pack();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"61f009adef6c7e9cf28a4d9d94929c49\",\n \"score\": \"0.59991956\",\n \"text\": \"private void iniSlider() {\\n SliderPagerAdapterNew adapterslider = new SliderPagerAdapterNew(this,uploadsslider);\\n adapterslider.setUserID(userName);\\n\\n\\n\\n\\n\\n sliderpager.setAdapter(adapterslider);\\n adapterslider.notifyDataSetChanged();\\n // setup timer\\n Timer timer = new Timer();\\n timer.scheduleAtFixedRate(new SliderTimer(),4000,6000);\\n indicator.setupWithViewPager(sliderpager,true);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"905b33cb26939487639360a939335c35\",\n \"score\": \"0.59958506\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onClick(View arg0) {\\n\\t\\t\\t\\tif (slider == 0) {\\r\\n\\t\\t\\t\\t\\tMainActivityA.getInstance().showUnitConverterTempFragment();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4372c7f9c5d77b9a63f8eb4b267ac9b0\",\n \"score\": \"0.599247\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onClick(View arg0) {\\n\\t\\t\\t\\tif (slider == 0) {\\r\\n\\t\\t\\t\\t\\tMainActivityA.getInstance().showUnitConverterForceFragment();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b99f7bfd0aab4edf905754f8d8579894\",\n \"score\": \"0.59920114\",\n \"text\": \"JZmultiSlider createJZmultiSlider();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f59a0f5c734c1f4f655a59946f25640e\",\n \"score\": \"0.59672153\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onClick(View arg0) {\\n\\t\\t\\t\\tif (slider == 0) {\\r\\n\\t\\t\\t\\t\\tMainActivityA.getInstance().showUnitConverterEnergyFragment();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8cd9c1911c460beae031a95a114f934\",\n \"score\": \"0.5949461\",\n \"text\": \"public void updateSlider(final List<Movie> newsList) {\\n if (context != null) {\\n for (final Movie item : newsList) {\\n CustomSliderView textSliderView = new CustomSliderView(context, \\\"\\\");\\n // initialize a SliderLayout\\n textSliderView\\n .description(item.getName())\\n .image(context.getResources().getString(R.string.baseUrl) + \\\"movie/image/\\\" + item.getUniqueId())\\n .setScaleType(BaseSliderView.ScaleType.Fit)\\n .setOnSliderClickListener(new BaseSliderView.OnSliderClickListener() {\\n @Override\\n public void onSliderClick(BaseSliderView slider) {\\n context.startActivity(new Intent(context, DetailsActivity.class).putExtra(\\\"movie\\\", item)\\n .setFlags(Intent.FLAG_ACTIVITY_NEW_TASK));\\n }\\n });\\n\\n// ImageView iconView = (ImageView) textSliderView.getView().findViewById(R.id.sliderNewsSourceIcon);\\n// Glide.with(context).load(item.getNewsSourceEntity().getIconUrl()).placeholder(R.mipmap.ic_launcher).into(iconView);\\n this.sliderLayout.addSlider(textSliderView);\\n }\\n\\n }\\n\\n // set visibility\\n this.sliderLayout.setVisibility(View.VISIBLE);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebadc65e568836c08405e80317b630e2\",\n \"score\": \"0.59453344\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onClick(View arg0) {\\n\\t\\t\\t\\tif (slider == 0) {\\r\\n\\t\\t\\t\\t\\tMainActivityA.getInstance().showUnitConverterVolumeFragment();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d9b530f6fbc2390dd006cf7b361912aa\",\n \"score\": \"0.5939251\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onClick(View arg0) {\\n\\r\\n\\t\\t\\t\\trl_slider_parent.startAnimation(outToRightAnimation());\\r\\n\\t\\t\\t\\tslider = 1;\\r\\n\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd6188027f9fa1868edbbc6e110a8b83\",\n \"score\": \"0.5930338\",\n \"text\": \"public String SetSliderValue() {\\n\\t\\tWebElement slider = driver.findElement(By.xpath(\\\"//*[@id=\\\\\\\"content\\\\\\\"]/div/div/input\\\"));\\n \\n\\t\\tint width = slider.getSize().getWidth(); //getting the width of the slider\\n\\t\\tActions action = new Actions(driver); \\n\\t\\taction.dragAndDropBy(slider, (width * 100)/100, 0).perform(); //perform drag and drop \\n\\t\\tWebElement rangeValue = driver.findElement(By.id(\\\"range\\\")); \\n\\t\\tString value = rangeValue.getText(); //getting the range value\\n\\n\\t\\treturn value;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4ee9290e72f7154d6369d9e15704b0f\",\n \"score\": \"0.59178096\",\n \"text\": \"Slider(int x, int y)\\n\\t{\\n\\t\\tthis.x = x;\\n\\t\\tthis.y = y;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b1a6ac9396ad215262cb6399cdf44d3\",\n \"score\": \"0.591073\",\n \"text\": \"@SuppressWarnings(\\\"unchecked\\\")\\n // <editor-fold defaultstate=\\\"collapsed\\\" desc=\\\"Generated Code\\\">//GEN-BEGIN:initComponents\\n private void initComponents() {\\n\\n PanelControl = new javax.swing.JPanel();\\n PanelVela = new javax.swing.JPanel();\\n SliderVela = new javax.swing.JSlider();\\n PanelTimon = new javax.swing.JPanel();\\n SliderTimon = new javax.swing.JSlider();\\n PanelDibujo = new javax.swing.JPanel();\\n panelGrafico1 = new PanelGrafico();\\n Autor = new javax.swing.JLabel();\\n\\n setDefaultCloseOperation(javax.swing.WindowConstants.EXIT_ON_CLOSE);\\n setTitle(\\\"BarquitoVelero\\\");\\n setIconImage(new javax.swing.ImageIcon(\\\"src/barquitologo.png\\\").getImage());\\n\\n PanelControl.setBorder(javax.swing.BorderFactory.createTitledBorder(\\\"Control\\\"));\\n\\n PanelVela.setBorder(javax.swing.BorderFactory.createTitledBorder(\\\"Orientación Vela\\\"));\\n\\n SliderVela.setMaximum(90);\\n SliderVela.setMinimum(-90);\\n SliderVela.setToolTipText(\\\"Orientación de la Vela\\\");\\n SliderVela.setValue(0);\\n SliderVela.addChangeListener(new javax.swing.event.ChangeListener() {\\n public void stateChanged(javax.swing.event.ChangeEvent evt) {\\n SliderVelaStateChanged(evt);\\n }\\n });\\n SliderVela.addMouseListener(new java.awt.event.MouseAdapter() {\\n public void mouseEntered(java.awt.event.MouseEvent evt) {\\n SliderVelaMouseEntered(evt);\\n }\\n public void mouseExited(java.awt.event.MouseEvent evt) {\\n SliderVelaMouseExited(evt);\\n }\\n });\\n\\n javax.swing.GroupLayout PanelVelaLayout = new javax.swing.GroupLayout(PanelVela);\\n PanelVela.setLayout(PanelVelaLayout);\\n PanelVelaLayout.setHorizontalGroup(\\n PanelVelaLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addComponent(SliderVela, javax.swing.GroupLayout.Alignment.TRAILING, javax.swing.GroupLayout.DEFAULT_SIZE, 220, Short.MAX_VALUE)\\n );\\n PanelVelaLayout.setVerticalGroup(\\n PanelVelaLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGroup(PanelVelaLayout.createSequentialGroup()\\n .addComponent(SliderVela, javax.swing.GroupLayout.PREFERRED_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addGap(0, 22, Short.MAX_VALUE))\\n );\\n\\n PanelTimon.setBorder(javax.swing.BorderFactory.createTitledBorder(\\\"Orientación Timón\\\"));\\n\\n SliderTimon.setMaximum(90);\\n SliderTimon.setMinimum(-90);\\n SliderTimon.setToolTipText(\\\"Orientación del timón\\\");\\n SliderTimon.setValue(0);\\n SliderTimon.addChangeListener(new javax.swing.event.ChangeListener() {\\n public void stateChanged(javax.swing.event.ChangeEvent evt) {\\n SliderTimonStateChanged(evt);\\n }\\n });\\n SliderTimon.addMouseListener(new java.awt.event.MouseAdapter() {\\n public void mouseEntered(java.awt.event.MouseEvent evt) {\\n SliderTimonMouseEntered(evt);\\n }\\n public void mouseExited(java.awt.event.MouseEvent evt) {\\n SliderTimonMouseExited(evt);\\n }\\n });\\n\\n javax.swing.GroupLayout PanelTimonLayout = new javax.swing.GroupLayout(PanelTimon);\\n PanelTimon.setLayout(PanelTimonLayout);\\n PanelTimonLayout.setHorizontalGroup(\\n PanelTimonLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addComponent(SliderTimon, javax.swing.GroupLayout.Alignment.TRAILING, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)\\n );\\n PanelTimonLayout.setVerticalGroup(\\n PanelTimonLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGroup(PanelTimonLayout.createSequentialGroup()\\n .addContainerGap()\\n .addComponent(SliderTimon, javax.swing.GroupLayout.PREFERRED_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addContainerGap(javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE))\\n );\\n\\n javax.swing.GroupLayout PanelControlLayout = new javax.swing.GroupLayout(PanelControl);\\n PanelControl.setLayout(PanelControlLayout);\\n PanelControlLayout.setHorizontalGroup(\\n PanelControlLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGroup(PanelControlLayout.createSequentialGroup()\\n .addContainerGap()\\n .addGroup(PanelControlLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addComponent(PanelVela, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)\\n .addComponent(PanelTimon, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)))\\n );\\n PanelControlLayout.setVerticalGroup(\\n PanelControlLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGroup(PanelControlLayout.createSequentialGroup()\\n .addContainerGap()\\n .addComponent(PanelVela, javax.swing.GroupLayout.PREFERRED_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addPreferredGap(javax.swing.LayoutStyle.ComponentPlacement.RELATED)\\n .addComponent(PanelTimon, javax.swing.GroupLayout.PREFERRED_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addContainerGap(javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE))\\n );\\n\\n PanelDibujo.setBorder(javax.swing.BorderFactory.createEtchedBorder());\\n\\n panelGrafico1.setForeground(new java.awt.Color(0, 0, 204));\\n\\n javax.swing.GroupLayout panelGrafico1Layout = new javax.swing.GroupLayout(panelGrafico1);\\n panelGrafico1.setLayout(panelGrafico1Layout);\\n panelGrafico1Layout.setHorizontalGroup(\\n panelGrafico1Layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGap(0, 302, Short.MAX_VALUE)\\n );\\n panelGrafico1Layout.setVerticalGroup(\\n panelGrafico1Layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGap(0, 0, Short.MAX_VALUE)\\n );\\n\\n javax.swing.GroupLayout PanelDibujoLayout = new javax.swing.GroupLayout(PanelDibujo);\\n PanelDibujo.setLayout(PanelDibujoLayout);\\n PanelDibujoLayout.setHorizontalGroup(\\n PanelDibujoLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addComponent(panelGrafico1, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)\\n );\\n PanelDibujoLayout.setVerticalGroup(\\n PanelDibujoLayout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addComponent(panelGrafico1, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)\\n );\\n\\n Autor.setText(\\\"Héctor Garbisu DIU 2015\\\");\\n\\n javax.swing.GroupLayout layout = new javax.swing.GroupLayout(getContentPane());\\n getContentPane().setLayout(layout);\\n layout.setHorizontalGroup(\\n layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGroup(layout.createSequentialGroup()\\n .addContainerGap()\\n .addGroup(layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addComponent(PanelControl, javax.swing.GroupLayout.PREFERRED_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addComponent(Autor))\\n .addPreferredGap(javax.swing.LayoutStyle.ComponentPlacement.RELATED)\\n .addComponent(PanelDibujo, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)\\n .addContainerGap())\\n );\\n layout.setVerticalGroup(\\n layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGroup(layout.createSequentialGroup()\\n .addContainerGap()\\n .addGroup(layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addComponent(PanelDibujo, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)\\n .addGroup(layout.createSequentialGroup()\\n .addComponent(PanelControl, javax.swing.GroupLayout.PREFERRED_SIZE, javax.swing.GroupLayout.DEFAULT_SIZE, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addPreferredGap(javax.swing.LayoutStyle.ComponentPlacement.RELATED, 293, Short.MAX_VALUE)\\n .addComponent(Autor)))\\n .addContainerGap())\\n );\\n\\n pack();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4cee412ded5e8ca756319ed069a84ba7\",\n \"score\": \"0.5909313\",\n \"text\": \"private void sliderAutoChangePictures() {\\n\\n Timeline sliderTimer = new Timeline(new KeyFrame(Duration.ZERO, e -> {\\n FadeTransition ft = new FadeTransition();\\n ft.setNode(imgSlider);\\n ft.setDuration(new Duration(4000));\\n ft.setFromValue(1.0);\\n ft.setToValue(0.3);\\n ft.setCycleCount(0);\\n ft.setAutoReverse(true);\\n ft.play();\\n imgSlider.setImage(new Image(\\\"com/houarizegai/fxtools/dashboard/model1/img/slider/\\\" + counter + \\\".png\\\"));\\n if (++counter > NUMBER_IMAGE_SLIDER) {\\n counter = 1;\\n }\\n }),\\n new KeyFrame(Duration.seconds(4))\\n );\\n sliderTimer.setCycleCount(Animation.INDEFINITE);\\n sliderTimer.play();\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e0d28394185d276a4962115d4f96981\",\n \"score\": \"0.5898833\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onClick(View arg0) {\\n\\t\\t\\t\\tif (slider == 0) {\\r\\n\\t\\t\\t\\t\\tMainActivityA.getInstance().showUnitConverterTimeFragment();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42eb10004d4050fe1dcfa47e4a0d5740\",\n \"score\": \"0.58841413\",\n \"text\": \"private void createSlider(Composite parent){\\n\\t\\tComposite container = new Composite(parent, SWT.NONE);\\n\\t\\tcontainer.setLayout(new GridLayout(3,false));\\n\\t\\tcontainer.setLayoutData(new GridData(GridData.FILL_BOTH));\\n\\t\\tnew Label(container, SWT.NONE).setText(Messages.ColorDialog_transparencyLabel);\\n\\t\\talphaSlider = new Scale(container, SWT.HORIZONTAL);\\n\\t\\talphaSlider.setMaximum(0);\\n\\t\\talphaSlider.setMaximum(255);\\n\\t\\talphaSlider.setSelection(alpha);\\n\\t\\talphaSlider.setLayoutData(new GridData(GridData.FILL_HORIZONTAL));\\n\\t\\talphaText = new Spinner(container, SWT.BORDER);\\n\\t\\talphaText.setMinimum(0);\\n\\t\\talphaText.setMaximum(255);\\n\\t\\talphaText.setSelection(alpha);\\n\\t\\t//When the alpha slider change value update also the preview composite and the alpha textual value\\n\\t\\talphaSlider.addSelectionListener(new SelectionAdapter() {\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void widgetSelected(SelectionEvent e) {\\n\\t\\t\\t\\talphaText.setSelection(alphaSlider.getSelection());\\n\\t\\t\\t\\talpha = alphaSlider.getSelection();\\n\\t\\t\\t\\tupdatePreview();\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\t//When the alpha text field change value update also the preview composite and the alpha slider value\\n\\t\\talphaText.addModifyListener(new ModifyListener() {\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void modifyText(ModifyEvent e) {\\n\\t\\t\\t\\talphaSlider.setSelection(alphaText.getSelection());\\n\\t\\t\\t\\talpha = alphaSlider.getSelection();\\n\\t\\t\\t\\tupdatePreview();\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e679ef499a699190f4d1624c660d2c69\",\n \"score\": \"0.58670485\",\n \"text\": \"private void setSeekBar(){\\n // Option sliders listeners\\n bar1 = sliderBars.findViewById(R.id.seekBar1);\\n bar2 = sliderBars.findViewById(R.id.seekBar2);\\n bar3 = sliderBars.findViewById(R.id.seekBar3);\\n isSliding = false;\\n\\n bar1.setOnSeekBarChangeListener(new SeekBar.OnSeekBarChangeListener() {\\n @Override\\n public void onProgressChanged(SeekBar seekBar, int progress, boolean fromUser) {\\n if (isSliding)\\n applyProcessings();\\n }\\n\\n @Override\\n public void onStartTrackingTouch(SeekBar seekBar) {\\n isSliding = true;\\n }\\n\\n @Override\\n public void onStopTrackingTouch(SeekBar seekBar) {\\n isSliding = false;\\n }\\n });\\n bar2.setOnSeekBarChangeListener(new SeekBar.OnSeekBarChangeListener() {\\n @Override\\n public void onProgressChanged(SeekBar seekBar, int progress, boolean fromUser) {\\n if (isSliding)\\n applyProcessings();\\n }\\n\\n @Override\\n public void onStartTrackingTouch(SeekBar seekBar) {\\n isSliding = true;\\n }\\n\\n @Override\\n public void onStopTrackingTouch(SeekBar seekBar) {\\n isSliding = false;\\n }\\n });\\n bar3.setOnSeekBarChangeListener(new SeekBar.OnSeekBarChangeListener() {\\n @Override\\n public void onProgressChanged(SeekBar seekBar, int progress, boolean fromUser) {\\n if (isSliding)\\n applyProcessings();\\n }\\n\\n @Override\\n public void onStartTrackingTouch(SeekBar seekBar) {\\n isSliding = true;\\n }\\n\\n @Override\\n public void onStopTrackingTouch(SeekBar seekBar) {\\n isSliding = false;\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72fc41c6fb8193b9cf280a35cbfb6579\",\n \"score\": \"0.5843064\",\n \"text\": \"private void setSliderModels() {\\n\\n // Taken from https://stackoverflow.com/questions/31835586/set-jslider-limits\\n attack.setModel(\\n new DefaultBoundedRangeModel() {\\n @Override\\n public void setValue(int n) {\\n if (n > decay.getValue()) {\\n n = decay.getValue();\\n }\\n super.setValue(n);\\n }\\n }\\n );\\n\\n decay.setModel(\\n new DefaultBoundedRangeModel() {\\n @Override\\n public void setValue(int n) {\\n if (n < attack.getValue()) {\\n n = attack.getValue();\\n }\\n super.setValue(n);\\n }\\n }\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"271ee99d5d33009d3c95caedb245343a\",\n \"score\": \"0.58408344\",\n \"text\": \"@Override\\n protected void onStop() {\\n mDemoSlider.stopAutoCycle();\\n super.onStop();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5caa35176dd2abc46d032165d380b6b\",\n \"score\": \"0.5840439\",\n \"text\": \"@Override\\n public void onPanelSlide(View arg0, float arg1) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ad668ec71eb3b886bc54d199641c0a6\",\n \"score\": \"0.5819453\",\n \"text\": \"public void setSliders () {\\n\\n SBR.setProgress(RedBar);\\n SBG.setProgress(GreenBar);\\n SBB.setProgress(BlueBar);\\n SBVal.setProgress(ValBar);\\n SBCon.setProgress(ConBar);\\n SBHue.setProgress(HueBar);\\n\\n if (grayScale) {\\n SBSat.setProgress(160);\\n SBSat.setEnabled(false);\\n } else {\\n SBSat.setProgress(SatBar);\\n SBSat.setEnabled(true);\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d71560bab9fb1417c047073257194e60\",\n \"score\": \"0.58165896\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onClick(View arg0) {\\n\\t\\t\\t\\tif (slider == 0) {\\r\\n\\t\\t\\t\\t\\tMainActivityA.getInstance().showUnitConverterDataSizeFragment();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c69517f080ba670e1cfc7b14a3adb2f\",\n \"score\": \"0.57971096\",\n \"text\": \"@Override\\n\\t\\tpublic void stateChanged(ChangeEvent e) {\\n\\t\\t\\tJSlider slider = (JSlider) e.getSource();\\n\\t\\t\\tif (slider == sliderR) {\\n\\t\\t\\t\\tint x = slider.getValue();\\n\\t\\t\\t\\tprocessSliderR(x);\\n\\t\\t\\t} else if (slider == sliderG) {\\n\\t\\t\\t\\tint x = slider.getValue();\\n\\t\\t\\t\\tprocessSliderG(x);\\n\\t\\t\\t} else if (slider == sliderB) {\\n\\t\\t\\t\\tint x = slider.getValue();\\n\\t\\t\\t\\tprocessSliderB(x);\\n\\t\\t\\t} else if (slider == sliderBr) {\\n\\t\\t\\t\\tint x = slider.getValue();\\n\\t\\t\\t\\tprocessSliderBr(x);\\n\\t\\t\\t} else if (slider == sliderCon) {\\n\\t\\t\\t\\tint x = slider.getValue();\\n\\t\\t\\t\\tprocessSliderCon(x);\\n\\t\\t\\t}\\n\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5dfe37b8714c797fbdafbecf1bdc86b8\",\n \"score\": \"0.5792447\",\n \"text\": \"private void updateSlider(StreamControl sc, boolean forceReloadIcon) {\\n updateSliderProgress(sc, -1);\\n final boolean muted = isMuted(sc.streamType);\\n if (forceReloadIcon) {\\n sc.icon.setImageDrawable(null);\\n }\\n updateSliderIcon(sc, muted);\\n updateSliderEnabled(sc, muted, false);\\n updateSliderSuppressor(sc);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0beb0b17d21cd342411ae866488b107b\",\n \"score\": \"0.57809776\",\n \"text\": \"@Override\\r\\n protected void onStop() {\\n imageSlider.stopAutoCycle();\\r\\n super.onStop();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c367042b69b12066077307c28f496df\",\n \"score\": \"0.5776128\",\n \"text\": \"private void sliderValueChanged( Slider whichSlider ) {\\n\\n String str;\\n if ( whichSlider == slider1 )\\n str = String.format( \\\"First slider value is now %1.2f\\\", slider1.getValue() );\\n else if ( whichSlider == slider2 )\\n str = String.format( \\\"Second slider value is now %1.2f\\\", slider2.getValue() );\\n else\\n str = String.format( \\\"Third slider value is now %1.2f\\\", slider3.getValue() );\\n label.setText( str );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce65146988ed1dea6acc74fb1ec3efc4\",\n \"score\": \"0.5768515\",\n \"text\": \"@Override\\r\\n protected void onStop() {\\n mDemoSlider.stopAutoCycle();\\r\\n super.onStop();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10ab3420814e17230e851cd22fe51244\",\n \"score\": \"0.57672304\",\n \"text\": \"public void addMusicVolumeSliderListener(Slider slider) {\\n slider.setValue(preferences.getFloat(\\\"musicVolume\\\") * 100);\\n slider.addListener(new ChangeListener() {\\n @Override\\n public void changed(ChangeEvent event, Actor actor) {\\n preferences.putFloat(\\\"musicVolume\\\", slider.getValue() / 100f);\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"372e22f5c391b2ca80fd9df1265bd584\",\n \"score\": \"0.576115\",\n \"text\": \"@Override\\n public void setSliderMax(int value) {\\n return;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd0aed1510e2f1ea5ed60fc9143ace00\",\n \"score\": \"0.5755306\",\n \"text\": \"@Override\\n protected void onRestart() {\\n super.onRestart();\\n\\n if (slider.isOpened()) {\\n slider.toggle();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"580c81e63d6d7466ab227f87dad7b961\",\n \"score\": \"0.5751453\",\n \"text\": \"private void initComponents() {\\n\\n jLabel1 = new javax.swing.JLabel();\\n frameNumberTextField = new javax.swing.JTextField();\\n jPanel1 = new javax.swing.JPanel();\\n frameViewSlider = new javax.swing.JSlider();\\n\\n jLabel1.setText(\\\"Frame\\\");\\n jLabel1.setFocusable(false);\\n\\n frameNumberTextField.setText(\\\"1\\\");\\n frameNumberTextField.addActionListener(new java.awt.event.ActionListener() {\\n public void actionPerformed(java.awt.event.ActionEvent evt) {\\n frameNumberTextFieldActionPerformed(evt);\\n }\\n });\\n\\n jPanel1.setBorder(javax.swing.BorderFactory.createEtchedBorder());\\n\\n frameViewSlider.setMinimum(1);\\n frameViewSlider.setSnapToTicks(true);\\n frameViewSlider.setMaximum(totalFrame);\\n frameViewSlider.setValue(1);\\n frameViewSlider.addChangeListener(new javax.swing.event.ChangeListener() {\\n public void stateChanged(javax.swing.event.ChangeEvent evt) {\\n frameViewSliderStateChanged(evt);\\n }\\n });\\n frameViewSlider.addKeyListener(new java.awt.event.KeyAdapter() {\\n public void keyPressed(java.awt.event.KeyEvent evt) {\\n frameViewSliderKeyPressed(evt);\\n }\\n });\\n frameViewSlider.addMouseWheelListener(new java.awt.event.MouseWheelListener() {\\n public void mouseWheelMoved(java.awt.event.MouseWheelEvent evt) {\\n frameViewSliderMouseWheelMoved(evt);\\n }\\n });\\n\\n org.jdesktop.layout.GroupLayout jPanel1Layout = new org.jdesktop.layout.GroupLayout(jPanel1);\\n jPanel1.setLayout(jPanel1Layout);\\n jPanel1Layout.setHorizontalGroup(\\n jPanel1Layout.createParallelGroup(org.jdesktop.layout.GroupLayout.LEADING)\\n .add(frameViewSlider, org.jdesktop.layout.GroupLayout.DEFAULT_SIZE, 419, Short.MAX_VALUE)\\n );\\n jPanel1Layout.setVerticalGroup(\\n jPanel1Layout.createParallelGroup(org.jdesktop.layout.GroupLayout.LEADING)\\n .add(frameViewSlider, org.jdesktop.layout.GroupLayout.PREFERRED_SIZE, org.jdesktop.layout.GroupLayout.DEFAULT_SIZE, org.jdesktop.layout.GroupLayout.PREFERRED_SIZE)\\n );\\n\\n org.jdesktop.layout.GroupLayout layout = new org.jdesktop.layout.GroupLayout(this);\\n this.setLayout(layout);\\n layout.setHorizontalGroup(\\n layout.createParallelGroup(org.jdesktop.layout.GroupLayout.LEADING)\\n .add(layout.createSequentialGroup()\\n .add(jLabel1)\\n .addPreferredGap(org.jdesktop.layout.LayoutStyle.RELATED)\\n .add(frameNumberTextField, org.jdesktop.layout.GroupLayout.PREFERRED_SIZE, 54, org.jdesktop.layout.GroupLayout.PREFERRED_SIZE)\\n .addPreferredGap(org.jdesktop.layout.LayoutStyle.RELATED)\\n .add(jPanel1, org.jdesktop.layout.GroupLayout.DEFAULT_SIZE, org.jdesktop.layout.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE))\\n );\\n layout.setVerticalGroup(\\n layout.createParallelGroup(org.jdesktop.layout.GroupLayout.LEADING)\\n .add(layout.createParallelGroup(org.jdesktop.layout.GroupLayout.CENTER)\\n .add(jLabel1)\\n .add(frameNumberTextField, org.jdesktop.layout.GroupLayout.PREFERRED_SIZE, 23, org.jdesktop.layout.GroupLayout.PREFERRED_SIZE)\\n .add(jPanel1, org.jdesktop.layout.GroupLayout.PREFERRED_SIZE, org.jdesktop.layout.GroupLayout.DEFAULT_SIZE, org.jdesktop.layout.GroupLayout.PREFERRED_SIZE))\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1c3555feab3f3c31d20741240f79b6a\",\n \"score\": \"0.57315195\",\n \"text\": \"public void initSliderBox() {\\n initSlider();\\n sliderBox = new HBox(SLIDERBOX_SPACING, speedSlider);\\n sliderBox.setAlignment(Pos.CENTER);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"819a01bd63bbab0b61b260cb99ebedb5\",\n \"score\": \"0.57293844\",\n \"text\": \"public void lowThumbReleased(MouseEvent e) {\\r\\n final RangeSlider rangeSlider = getControl();\\r\\n rangeSlider.setLowValueChanging(false);\\r\\n // RT-15207 When snapToTicks is true, slider value calculated in drag\\r\\n // is then snapped to the nearest tick on mouse release.\\r\\n if (rangeSlider.isSnapToTicks()) {\\r\\n rangeSlider.setLowValue(snapValueToTicks(rangeSlider.getLowValue()));\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"193f5a1bb836b8041d7e1c25a5dc8e57\",\n \"score\": \"0.572284\",\n \"text\": \"@Override\\n\\tpublic boolean xSliderMoved(Controller controller, int sliderCode,\\n\\t\\t\\tboolean value) {\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a62d5b59d2573e72d782727a78596f5c\",\n \"score\": \"0.5709085\",\n \"text\": \"private void arrivalEvent(){//PENDENTE\\n //implementar fluxo do slide 50\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0bc7c2108dd0c86e365302eb80b62e9\",\n \"score\": \"0.57076705\",\n \"text\": \"private JSlider klDivSlider(String paramLabel, int min, int max, String name) {\\n\\t\\tJSlider filterSlider = new JSlider(JSlider.HORIZONTAL, min, max, Parameters.parameters.integerParameter(paramLabel));\\n\\n\\t\\tHashtable<Integer,JLabel> labels = new Hashtable<>();\\n\\n\\t\\tfilterSlider.setMinorTickSpacing(1);\\n\\t\\tfilterSlider.setPaintTicks(true);\\n\\t\\tlabels.put((min+max)/2, new JLabel(name));\\n\\t\\tfilterSlider.setLabelTable(labels);\\n\\t\\tfilterSlider.setPaintLabels(true);\\n\\t\\tfilterSlider.setPreferredSize(new Dimension(200, 40));\\n\\n\\t\\tfilterSlider.addChangeListener(new ChangeListener() {\\n\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void stateChanged(ChangeEvent e) {\\n\\t\\t\\t\\tJSlider source = (JSlider)e.getSource();\\n\\t\\t\\t\\tParameters.parameters.setInteger(paramLabel, source.getValue());\\n\\t\\t\\t}\\n\\n\\t\\t});\\n\\t\\treturn filterSlider;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"12736bd273b9f4d86ea805cd02beaef4\",\n \"score\": \"0.5706721\",\n \"text\": \"void setSliderMax(int value);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37e3154c3e103ec6d2bdef6a28371a57\",\n \"score\": \"0.56873465\",\n \"text\": \"private void slider_hMouseReleased(java.awt.event.MouseEvent evt) {\\n if (opened)\\r\\n h = Process.hsvThres(lbl_h_val, lbl_h1_val, slider_h, slider_h1, img_hsv, lbl_img_h_thres,0);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e3dd5cdaff42c27a316243b6ac3e201\",\n \"score\": \"0.56763107\",\n \"text\": \"public void slideForward() {\\n RobotMap.hatchSliderPiston.set(true);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1df7356f204d3e53ec278d31a7369a35\",\n \"score\": \"0.5671565\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onAnimationStart(Animation arg0) {\\n\\t\\t\\t\\trl_slider.setVisibility(View.VISIBLE);\\r\\n\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c56b1f03c234a54d7ef6f16ff40a814\",\n \"score\": \"0.56428385\",\n \"text\": \"public VolumeGUI(){\\n setLayout(new GridLayout(2,1));\\n add(VolumeText);add(VolumeSlider);\\n setSize(400, 200);\\n VolumeText.setFont(new Font(\\\"Arial\\\", Font.BOLD, 18));\\n //Adding all the properties for the slider\\n VolumeSlider.setPaintTicks(true);\\n VolumeSlider.setPaintLabels(true);\\n VolumeSlider.setMinorTickSpacing(1);\\n VolumeSlider.setMajorTickSpacing(5); \\n VolumeSlider.addChangeListener(this);\\n setVisible(true);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4fd0e377e1015a70fbae5ef1bced6ec0\",\n \"score\": \"0.5635741\",\n \"text\": \"private void geometrie()\\r\\n\\t\\t{\\r\\n\\t\\tboutonStart = new JButton(\\\"BoutonStart\\\");\\r\\n\\t\\tboutonStop = new JButton(\\\"BoutonStop\\\");\\r\\n\\t\\tsliderAlpha = new JSlider(SwingConstants.HORIZONTAL, (int)intervalleSlider.getiStart(), (int)intervalleSlider.getiStop(), (int)intervalleSlider.getMilieu());\\r\\n\\r\\n\\t\\tsetLayout(new FlowLayout(FlowLayout.CENTER));\\r\\n\\r\\n\\t\\tadd(boutonStart);\\r\\n\\t\\tadd(boutonStop);\\r\\n\\t\\tadd(sliderAlpha);\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f7569b94a3a239fee02f66848521053\",\n \"score\": \"0.5623106\",\n \"text\": \"private JPanel getSliderPanel () {\\n\\t\\t// Initializes the panel and the layout\\n\\t\\tJPanel panel = new JPanel();\\n\\t\\tGridLayout layout = new GridLayout(2, 1, 0, 0);\\n\\t\\tpanel.setLayout(layout);\\n\\n\\t\\t// Initializes the slider label value\\n\\t\\tsliderValue = new JLabel(TRANSPARENCY_INIT + \\\" %\\\", SwingConstants.CENTER);\\n\\n\\t\\t// Initializes the slider\\n\\t\\tslider = new JSlider(SwingConstants.HORIZONTAL, TRANSPARENCY_MIN, TRANSPARENCY_MAX, TRANSPARENCY_INIT);\\n\\t\\tslider.addChangeListener(new ChangeListener() {\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void stateChanged(ChangeEvent e) {\\n\\t\\t\\t\\tJSlider source = (JSlider)e.getSource();\\n\\t\\t\\t\\tint transparency = source.getValue();\\n\\t\\t\\t\\tsliderValue.setText(transparency + \\\" %\\\");\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\tslider.setMajorTickSpacing(10);\\n\\t\\tslider.setMinorTickSpacing(1);\\n\\n\\t\\t// Adds label and slider to the panel\\n\\t\\tpanel.add(sliderValue);\\n\\t\\tpanel.add(slider);\\n\\n\\t\\t// Returns the panel\\n\\t\\treturn panel;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ae7af354fce36d448f7a607f004ebc3\",\n \"score\": \"0.56139654\",\n \"text\": \"private void sliderEvent(Slider input, Label labelToChange){\\n labelToChange.setText(Double.toString(Math.round(input.getValue())));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d108757ee611ca7ef7bba374a9f5f26\",\n \"score\": \"0.5612414\",\n \"text\": \"private SliderListener getDateSliderListener() {\\n\\t\\tSliderListener listener = new SliderListener() {\\n\\t\\t\\t//helper function\\n\\t\\t\\tprivate void setDateInput(int min, int max) {\\n\\t\\t\\t\\tif( min == max ) {\\n\\t\\t\\t\\t\\t//if values are equal just write one value\\n\\t\\t\\t\\t\\tdateBox.setValue( Integer.toString(min) );\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t//if values are different write both\\n\\t\\t\\t\\t\\tdateBox.setValue( Integer.toString(min) + \\\"-\\\" + Integer.toString(max) );\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n \\t\\n @Override\\n public void onStart(SliderEvent e) {\\n \\t//reset input field in case it was changed due to an error\\n \\tdateBox.getElement().getStyle().setBackgroundColor(\\\"white\\\");\\n }\\n \\n @Override\\n public boolean onSlide(SliderEvent e) {\\n \\tdateBox.removeStyleName(defaultInputCSSRule);\\n \\t\\n int max = dateSlider.getValueMax();\\n int min = dateSlider.getValueMin();\\n\\n setDateInput(min, max);\\n return true;\\n }\\n\\n @Override\\n public void onChange(SliderEvent e) {\\n int max = dateSlider.getValueMax();\\n int min = dateSlider.getValueMin();\\n \\n setDateInput(min, max);\\n }\\n\\n @Override\\n public void onStop(SliderEvent e) {\\n }\\n\\t\\t};\\n\\t\\t\\n\\t\\treturn listener;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f697ea847778c729871a6fab3b65dfab\",\n \"score\": \"0.56123304\",\n \"text\": \"public void run()\\n {\\n timeSlider.setValue(mediaPlayer.getCurrentTime().toMillis()/mediaPlayer.getTotalDuration().toMillis() * 100);\\n timeLabel.setText(getTime(mediaPlayer.getCurrentTime()) + \\\"/\\\" + getTime(mediaPlayer.getTotalDuration()));\\n if(controlBar.isVisible() && mediaPlayer.getCurrentTime().toSeconds() - lastAction > 10){\\n controlBar.setVisible(false);\\n goBackButton.setVisible(false);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c8daa1d06227cc1873e06ace0e9536c5\",\n \"score\": \"0.5606986\",\n \"text\": \"JPanel guiPanel() {\\r\\n JPanel panel = new JPanel();\\r\\n panel.setLayout(new GridLayout(0, 1));\\r\\n\\r\\n // Human_r_shoulder rotation\\r\\n panel.add(new JLabel(\\\"Right Shoulder rotation\\\"));\\r\\n rShoulderSlider = new JSlider(JSlider.HORIZONTAL, 0, 180, rShoulderRot);\\r\\n rShoulderSlider.addChangeListener(this);\\r\\n rShoulderSliderLabel = new JLabel(Integer.toString(rShoulderRot));\\r\\n panel.add(rShoulderSlider);\\r\\n panel.add(rShoulderSliderLabel);\\r\\n\\r\\n // Human_r_elbow rotation\\r\\n panel.add(new JLabel(\\\"Right Elbow rotation\\\"));\\r\\n rElbowSlider = new JSlider(JSlider.HORIZONTAL, 0, 180, rElbowRot);\\r\\n rElbowSlider.addChangeListener(this);\\r\\n rElbowSliderLabel = new JLabel(Integer.toString(rElbowRot));\\r\\n panel.add(rElbowSlider);\\r\\n panel.add(rElbowSliderLabel);\\r\\n\\r\\n // Human_l_shoulder rotation\\r\\n panel.add(new JLabel(\\\"Left Shoulder rotation\\\"));\\r\\n lShoulderSlider = new JSlider(JSlider.HORIZONTAL, 0, 180, lShoulderRot);\\r\\n lShoulderSlider.addChangeListener(this);\\r\\n lShoulderSliderLabel = new JLabel(Integer.toString(lShoulderRot));\\r\\n panel.add(lShoulderSlider);\\r\\n panel.add(lShoulderSliderLabel);\\r\\n\\r\\n // Human_l_elbow rotation\\r\\n panel.add(new JLabel(\\\"Left Elbow rotation\\\"));\\r\\n lElbowSlider = new JSlider(JSlider.HORIZONTAL, 0, 180, lElbowRot);\\r\\n lElbowSlider.addChangeListener(this);\\r\\n lElbowSliderLabel = new JLabel(Integer.toString(lElbowRot));\\r\\n panel.add(lElbowSlider);\\r\\n panel.add(rElbowSliderLabel);\\r\\n\\r\\n if (isApplication) {\\r\\n JButton snapButton = new JButton(snapImageString);\\r\\n snapButton.setActionCommand(snapImageString);\\r\\n snapButton.addActionListener(this);\\r\\n panel.add(snapButton);\\r\\n }\\r\\n\\r\\n return panel;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d551ba6f4afe61a2bce4b5666b1446e\",\n \"score\": \"0.55992866\",\n \"text\": \"@Override\\n protected void onStop() {\\n mDemoSlider.setPresetTransformer(SliderLayout.Transformer.Accordion);\\n mDemoSlider.setPresetIndicator(SliderLayout.PresetIndicators.Center_Bottom);\\n mDemoSlider.setCustomAnimation(new DescriptionAnimation());\\n mDemoSlider.setDuration(4000);\\n // mDemoSlider.stopAutoCycle();\\n super.onStop();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0ca0ffb2ae7662b2bb2d0fb1639f9a63\",\n \"score\": \"0.559471\",\n \"text\": \"@Test\\n\\tpublic void testHorizontalSlider() {\\n\\t\\t//arrange\\n\\t\\tString expectedSpanValue = \\\"5\\\";\\n\\t\\t\\n\\t\\t//act\\n\\t\\tString actualSpanValue = new SliderPageObject(driver,baseUrl)\\n\\t\\t\\t\\t.OpenSliderPage()\\n\\t\\t\\t\\t.MoveSlider()\\n\\t\\t\\t\\t.getSpanInfo();\\n\\t\\t\\n\\t\\t//assert\\n\\t\\tAssert.assertEquals(actualSpanValue, expectedSpanValue, \\\"The Slider Doesnot work\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36269cc76580c72e276c8dd561d4798d\",\n \"score\": \"0.5594549\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onAnimationEnd(Animation arg0) {\\n\\t\\t\\t\\tslider = 0;\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da347a44f585c8777e6e36ea7178b4c0\",\n \"score\": \"0.559372\",\n \"text\": \"public void initialize() {\\n musicSlider.setValue(AssetManager.mediaPlayer.getVolume()*100);\\n musicLabel.setText(\\\"%\\\" + Integer.toString((int)musicSlider.getValue()));\\n musicSlider.valueProperty().addListener(new InvalidationListener() {\\n @Override\\n public void invalidated(Observable observable) {\\n AssetManager.mediaPlayer.setVolume(musicSlider.getValue()/100);\\n musicLabel.setText(\\\"%\\\" + Integer.toString((int)musicSlider.getValue()));\\n }\\n });\\n\\n effectsSlider.valueProperty().addListener((observable, oldValue, newValue) -> {\\n\\n effectsLabel.setText(\\\"%\\\" + Integer.toString((int) newValue.intValue()));\\n\\n\\n });\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d50f8a0503d64373584582f41c4f09b\",\n \"score\": \"0.5565163\",\n \"text\": \"public void initializeSliders(){\\n \\n leaseDuration_S.setMin(0);\\n leaseDuration_S.setMax(24);\\n leaseDuration_S.setShowTickLabels(true);\\n leaseDuration_S.setShowTickMarks(true);\\n leaseDuration_S.setMajorTickUnit(12);\\n leaseDuration_S.setMinorTickCount(11);\\n leaseDuration_S.setBlockIncrement(1);\\n leaseDuration_S.setSnapToTicks(true);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4bc716a85d44cffc2544d0550d84cf31\",\n \"score\": \"0.5560357\",\n \"text\": \"@Override\\n public void onStart(SliderEvent e) {\\n \\tdateBox.getElement().getStyle().setBackgroundColor(\\\"white\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d88b62f4ce76d96e0922b3701faae54\",\n \"score\": \"0.55562174\",\n \"text\": \"private SliderListener getDurationSliderListener() {\\n\\t\\tSliderListener listener = new SliderListener() {\\n\\t\\t\\t//helper function\\n\\t\\t\\tprivate void setDurationInput(int min, int max) {\\n\\t\\t\\t\\tif( min == max ) {\\n\\t\\t\\t\\t\\t//if values are equal just write one value\\n\\t\\t\\t\\t\\tdurationBox.setValue( Integer.toString(min) );\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t//if values are different write both\\n\\t\\t\\t\\t\\tdurationBox.setValue( Integer.toString(min) + \\\"-\\\" + Integer.toString(max) );\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n \\t\\n @Override\\n public void onStart(SliderEvent e) {\\n \\t//reset input field in case it was changed due to an error\\n \\tdurationBox.getElement().getStyle().setBackgroundColor(\\\"white\\\");\\n }\\n @Override\\n public boolean onSlide(SliderEvent e) {\\n \\tdurationBox.removeStyleName(defaultInputCSSRule);\\n \\t\\n int max = durationSlider.getValueMax();\\n int min = durationSlider.getValueMin();\\n \\n setDurationInput(min, max);\\n return true;\\n }\\n\\n @Override\\n public void onChange(SliderEvent e) {\\n int max = durationSlider.getValueMax();\\n int min = durationSlider.getValueMin();\\n\\n setDurationInput(min, max);\\n }\\n\\n @Override\\n public void onStop(SliderEvent e) {\\n }\\n\\t\\t};\\n\\t\\t\\n\\t\\treturn listener;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b0115b6645e2be86f1b874df6a7dd6f\",\n \"score\": \"0.55556613\",\n \"text\": \"private void setUpSlider(Dictionary<Integer, JComponent> modes, JSlider slider,\\n Model model, ScaleType scaleType) {\\n slider.setMajorTickSpacing(1);\\n slider.setSnapToTicks(true);\\n slider.setLabelTable(modes);\\n slider.setPaintLabels(true);\\n slider.addChangeListener(new SliderController(model, slider, scaleType));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ec28341226db1231d9308f425eebfb5\",\n \"score\": \"0.55524486\",\n \"text\": \"private void tribeFieldAction(ActionEvent e)\\n {\\n try\\n {\\n int tribeNo = Integer.parseInt(tribeCountField.getText());\\n if (tribeNo >= 0 && tribeNo < tribeCount)\\n {\\n tribeSlider.setValue(tribeNo);\\n }\\n else if (tribeNo < 0)\\n {\\n tribeSlider.setValue(0);\\n }\\n else\\n {\\n tribeSlider.setValue(tribeCount - 1);\\n }\\n }\\n catch (NumberFormatException e1)\\n {\\n tribeCountField.setText(0 + \\\"\\\");\\n tribeSlider.setValue(0);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91496be245071686eb247b6f7053b5d8\",\n \"score\": \"0.5540308\",\n \"text\": \"private void createArchitectureSliders() {\\n JSlider numberOfFloors = createSlider(new JSlider(JSlider.HORIZONTAL, 1, 3, model.getNumberOfFloors()), \\\"Number of floors: \\\");\\n numberOfFloors.addChangeListener(e -> controller.changeNumberOfFloors( ((JSlider) e.getSource()).getValue() ));\\n\\n JSlider numberOfRows = createSlider(new JSlider(JSlider.HORIZONTAL, 1, 6, model.getNumberOfRows()), \\\"Number of rows: \\\");\\n numberOfRows.addChangeListener(e -> controller.changeNumberOfRows( ((JSlider) e.getSource()).getValue() ));\\n\\n JSlider numberOfPlaces = createSlider(new JSlider(JSlider.HORIZONTAL, 1, 41, model.getNumberOfPlaces()), \\\"Number of places: \\\");\\n numberOfPlaces.addChangeListener(e -> controller.changeNumberOfPlaces( ((JSlider) e.getSource()).getValue() ));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d9800bcb0b2430cfafb5e5e798e91d51\",\n \"score\": \"0.55375266\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onClick(View arg0) {\\n\\t\\t\\t\\trl_slider_parent.startAnimation(inFromRightAnimation());\\r\\n\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8d90d571ac082b0ccdab9dd4af95e4f\",\n \"score\": \"0.55326897\",\n \"text\": \"@FXML private void sliderChanged() {\\r\\n int value = (int) profileRam.getValue();\\r\\n profileRamAssignateLabel.setText(String.valueOf(value) + \\\" MB\\\");\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"592c6063cdbb4d114ef9b40e797c97d4\",\n \"score\": \"0.55300283\",\n \"text\": \"@Override\\n public void stateChanged(ChangeEvent e) {\\n float volume = scale(volSlider.getValue(), 1, 10, 0.0001f, 2);\\n Sound.getWinter().setVolume(volume);\\n Sound.getFall().setVolume(volume);\\n Sound.getSpring().setVolume(volume);\\n\\n Sound.getPain().setVolume(volume);\\n Sound.getNom().setVolume(volume);\\n Sound.getSmash().setVolume(volume);\\n Sound.getDing().setVolume(volume);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e975c14c4bb02839e174e990148cf8b7\",\n \"score\": \"0.5504309\",\n \"text\": \"public void addSoundEffectsVolumeSliderListener(Slider slider) {\\n slider.setValue(preferences.getFloat(\\\"soundEffectsVolume\\\") * 100);\\n slider.addListener(new ChangeListener() {\\n @Override\\n public void changed(ChangeEvent event, Actor actor) {\\n preferences.putFloat(\\\"soundEffectsVolume\\\", slider.getValue() / 100f);\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fc6333a7a15055fa1700e1f7f6ef143\",\n \"score\": \"0.55041534\",\n \"text\": \"@FXML\\n void updateAudioOffset(MouseEvent event) {\\n audioOffsetValue.textProperty().bindBidirectional(slider.valueProperty(),NumberFormat.getNumberInstance());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dcbf58cbc7a7a66523f85e37385a2419\",\n \"score\": \"0.5501927\",\n \"text\": \"public Atdl4jWidget<?> createSliderT(SliderT control, ParameterT parameter)\\n\\t{\\n\\t Atdl4jWidget<?> atdl4jWidgetForSliderT = Atdl4jConfig.getConfig().createAtdl4jWidgetForSliderT();\\n\\t atdl4jWidgetForSliderT.init( control, parameter, getAtdl4jOptions() );\\n\\t return atdl4jWidgetForSliderT;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f6c1de1fba2e17d75c4132930705843a\",\n \"score\": \"0.5499209\",\n \"text\": \"private void setSliderBasedPosition() {\\n if(!mediaPlayer.isSeekable()) {\\n return;\\n }\\n float positionValue = positionSlider.getValue() / 1000.0f;\\n // Avoid end of file freeze-up\\n if(positionValue > 0.99f) {\\n positionValue = 0.99f;\\n }\\n mediaPlayer.setPosition(positionValue);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0458bb78380318e140e4cd0af3cef99\",\n \"score\": \"0.54971075\",\n \"text\": \"public AutomationSlider getSliderByName(int index) {\\n return new AutomationSlider(this.getControlByControlType(index, ControlType.Slider), this.automation);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":1195,"cells":{"query_id":{"kind":"string","value":"65af2e8880dd53911dc076278997338d"},"query":{"kind":"string","value":"/ Since the superclass is not abstract, this requires an explicit binding to the subclass config class else Guice will create a new instance of config"},"positive_passages":{"kind":"list like","value":[{"docid":"6138ef66a5734db7278cc6a04256ba62","score":"0.5992532","text":"@Override\n protected void configure() {\n bind(ThirdEyeConfiguration.class).to(ThirdEyeDashboardConfiguration.class);\n bind(ThirdEyeDashboardConfiguration.class).toInstance(config);\n bind(TimeSeriesLoader.class).to(DefaultTimeSeriesLoader.class);\n bind(MetricRegistry.class).toInstance(environment.metrics());\n\n /*\n * TODO spyne Refactor DAO_REGISTRY bindings\n *\n * These bindings added here are a temporary hack. The goal is to leverage the DataSourceModule\n * module directly to inject these classes. That way, all dependencies can be injected by Guice.\n * This will be done in subsequent phases of refactoring.\n */\n bind(ConfigManager.class).toInstance(DAO_REGISTRY.getConfigDAO());\n bind(EventManager.class).toInstance(DAO_REGISTRY.getEventDAO());\n bind(MergedAnomalyResultManager.class).toInstance(DAO_REGISTRY.getMergedAnomalyResultDAO());\n bind(DatasetConfigManager.class).toInstance(DAO_REGISTRY.getDatasetConfigDAO());\n bind(MetricConfigManager.class).toInstance(DAO_REGISTRY.getMetricConfigDAO());\n bind(DetectionConfigManager.class).toInstance(DAO_REGISTRY.getDetectionConfigManager());\n bind(RootcauseSessionManager.class).toInstance(DAO_REGISTRY.getRootcauseSessionDAO());\n bind(SessionManager.class).toInstance(DAO_REGISTRY.getSessionDAO());\n bind(DetectionAlertConfigManager.class)\n .toInstance(DAO_REGISTRY.getDetectionAlertConfigManager());\n bind(ApplicationManager.class).toInstance(DAO_REGISTRY.getApplicationDAO());\n bind(QueryCache.class).toInstance(ThirdEyeCacheRegistry.getInstance().getQueryCache());\n bind(TimeSeriesCache.class)\n .toInstance(ThirdEyeCacheRegistry.getInstance().getTimeSeriesCache());\n bind(RootCauseResource.class)\n .toProvider(new RootCauseResourceProvider(config))\n .in(Scopes.SINGLETON);\n }","title":""}],"string":"[\n {\n \"docid\": \"6138ef66a5734db7278cc6a04256ba62\",\n \"score\": \"0.5992532\",\n \"text\": \"@Override\\n protected void configure() {\\n bind(ThirdEyeConfiguration.class).to(ThirdEyeDashboardConfiguration.class);\\n bind(ThirdEyeDashboardConfiguration.class).toInstance(config);\\n bind(TimeSeriesLoader.class).to(DefaultTimeSeriesLoader.class);\\n bind(MetricRegistry.class).toInstance(environment.metrics());\\n\\n /*\\n * TODO spyne Refactor DAO_REGISTRY bindings\\n *\\n * These bindings added here are a temporary hack. The goal is to leverage the DataSourceModule\\n * module directly to inject these classes. That way, all dependencies can be injected by Guice.\\n * This will be done in subsequent phases of refactoring.\\n */\\n bind(ConfigManager.class).toInstance(DAO_REGISTRY.getConfigDAO());\\n bind(EventManager.class).toInstance(DAO_REGISTRY.getEventDAO());\\n bind(MergedAnomalyResultManager.class).toInstance(DAO_REGISTRY.getMergedAnomalyResultDAO());\\n bind(DatasetConfigManager.class).toInstance(DAO_REGISTRY.getDatasetConfigDAO());\\n bind(MetricConfigManager.class).toInstance(DAO_REGISTRY.getMetricConfigDAO());\\n bind(DetectionConfigManager.class).toInstance(DAO_REGISTRY.getDetectionConfigManager());\\n bind(RootcauseSessionManager.class).toInstance(DAO_REGISTRY.getRootcauseSessionDAO());\\n bind(SessionManager.class).toInstance(DAO_REGISTRY.getSessionDAO());\\n bind(DetectionAlertConfigManager.class)\\n .toInstance(DAO_REGISTRY.getDetectionAlertConfigManager());\\n bind(ApplicationManager.class).toInstance(DAO_REGISTRY.getApplicationDAO());\\n bind(QueryCache.class).toInstance(ThirdEyeCacheRegistry.getInstance().getQueryCache());\\n bind(TimeSeriesCache.class)\\n .toInstance(ThirdEyeCacheRegistry.getInstance().getTimeSeriesCache());\\n bind(RootCauseResource.class)\\n .toProvider(new RootCauseResourceProvider(config))\\n .in(Scopes.SINGLETON);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"f8c1b80e443ae3f177288556b826c6f4","score":"0.660099","text":"@Override\n protected void configure() {\n bind(GenerationConfigSource.class).toInstance(generationConfigSource);\n\n // Bind providers - used to retrieve implementations based on user input\n bind(DecisionTreeWalker.class).toProvider(DecisionTreeWalkerProvider.class);\n bind(AbstractDataGeneratorMonitor.class).toProvider(MonitorProvider.class).in(Singleton.class);\n bind(CombinationStrategy.class).toProvider(CombinationStrategyProvider.class);\n bind(OptionPicker.class).toProvider(OptionPickerProvider.class);\n\n // bind config directly\n bind(DataGenerationType.class).toInstance(generationConfigSource.getGenerationType());\n bind(CombinationStrategyType.class).toInstance(generationConfigSource.getCombinationStrategyType());\n\n bind(Long.class)\n .annotatedWith(Names.named(\"config:maxRows\"))\n .toProvider(Providers.of(getMaxRows(generationConfigSource)));\n\n bind(MonitorType.class)\n .toInstance(generationConfigSource.getMonitorType());\n\n // Bind known implementations - no user input required\n bind(DataGeneratorMonitor.class).to(AbstractDataGeneratorMonitor.class);\n bind(DataGenerator.class).toProvider(DataGeneratorProvider.class);\n\n bind(JavaUtilRandomNumberGenerator.class)\n .toInstance(new JavaUtilRandomNumberGenerator(OffsetDateTime.now().getNano()));\n bind(int.class)\n .annotatedWith(Names.named(\"config:internalRandomRowSpecStorage\"))\n .toInstance(256);\n }","title":""},{"docid":"34cc10d16e33b6a297fc3619d6958895","score":"0.6593943","text":"@Override\n\tprotected void configure()\n\t{\n\t\t\n\t\tbind(SubServiceC.class)\n\t\t.annotatedWith(Ugly.class)\n\t\t.to(SubServiceCUglyImpl.class);\n\t\t\n\t\tbind(SubServiceC.class)\n\t\t.annotatedWith(Pretty.class)\n\t\t.to(SubServiceCPrettyImpl.class);\n\t\t\n\t\tbind(SubServiceB.class)\n\t\t.annotatedWith(Ugly.class)\n\t\t.to(SubServiceBUglyImpl.class);\n\t\t\n\t\tbind(SubServiceB.class)\n\t\t.annotatedWith(Pretty.class)\n\t\t.to(SubServiceBPrettyImpl.class);\n\t\t\n\t\t\n\t}","title":""},{"docid":"ae7762e78b3c5e7ea8226d3a38ff5e9f","score":"0.65871215","text":"private Config(){\n\t\tsuper();\n\t}","title":""},{"docid":"04bf32a4e866067754d5cda3e10adf44","score":"0.63641137","text":"@Override\n protected void configure() {\n\n bind(DefaultTransportClientFactory.class).to(TransportClientFactory.class);\n bind(EnvElasticSearchConfigurator.class).to(ElasticSearchConfigurator.class);\n bind(DefaultElasticSearchService.class).to(InternalElasticSearchService.class).to(ElasticSearchService.class).in(Singleton.class);\n bind(DefaultElasticSearchAdminService.class).to(InternalElasticSearchAdminService.class).to(ElasticSearchAdminService.class).in(Singleton.class);\n\n }","title":""},{"docid":"cee2ff13925018ea9a5f910912d5dda2","score":"0.63397366","text":"@Override\n protected void configure()\n {\n bind(CustomerResource.class).in(Singleton.class);\n bind(CategoryResource.class).in(Singleton.class);\n bind(TaxDetailsResource.class).in(Singleton.class);\n bind(ProductResource.class).in(Singleton.class);\n bind(CartResource.class).in(Singleton.class);\n bind(OrderResource.class).in(Singleton.class);\n\n //Binding other singleton classes needed\n bind(HibernateUtil.class).in(Singleton.class);\n }","title":""},{"docid":"ed64b298e3757bbea7aa0cceb29d46c7","score":"0.6323358","text":"@Override\r\n public void configure() {\n }","title":""},{"docid":"d3cb7c961771b593046c21e68cd9a399","score":"0.62797123","text":"@Override\n protected void configure() {\n }","title":""},{"docid":"80804dded757aa3966d7dd303de71c02","score":"0.6262424","text":"@Override\n\tprotected void configure() {\n\t}","title":""},{"docid":"80804dded757aa3966d7dd303de71c02","score":"0.6262424","text":"@Override\n\tprotected void configure() {\n\t}","title":""},{"docid":"96c5ab5c3a57d9665c40420c172cf26f","score":"0.62261564","text":"@Override\n\tprotected void configure() {\n\n\t}","title":""},{"docid":"52b8ce8c349f7b86a56041a992182940","score":"0.6174929","text":"public BaseConfig(BaseConfig parent) {\n\t\tcopy(parent);\n\t\tbaseRate = parent.baseRate;\n\t\tbiomeMultipliers = new HashMap<Biome, Double>(parent.biomeMultipliers);\n\t}","title":""},{"docid":"24f075a08beb563bdf0f22c87666ee2b","score":"0.61709553","text":"public AutoPilotSubclass() throws ConfigurationException {\n super();\n }","title":""},{"docid":"adbe44432549fabeec435bb9374cd73a","score":"0.61677235","text":"protected void configure() {\n\t}","title":""},{"docid":"7c44176a6a4384c014deb0b7b6de1dbe","score":"0.6135802","text":"protected void configure() {\n \t}","title":""},{"docid":"74fd2e990014a8c7673189a367d86bec","score":"0.61215353","text":"@Override\n\tprotected void config() {\n\n\t}","title":""},{"docid":"10e76bb0fb27cec22cf0ef0b2b43e235","score":"0.61134857","text":"@Override\n protected void configure()\n {\n bind( GuiceImmutablePhrasesBuilder.class ).toInstance( phraseBuilder );\n injectBinding();\n }","title":""},{"docid":"6c3fe80f41b9cd5443e483c07ec097df","score":"0.6080497","text":"@Override\n protected void configure() {\n install(new GuiceZooKeeperBinder());\n\n // Promise bindings\n bind(WhenConfiguratorHelper.class).to(DefaultWhenConfiguratorHelper.class).in(Singleton.class);\n bind(WhenZooKeeperClient.class).to(DefaultWhenZooKeeperClient.class).in(Singleton.class);\n\n }","title":""},{"docid":"577df53fb1de73db917b08081cd2a315","score":"0.6070247","text":"@Override\n public void configure(Binder binder) {\n }","title":""},{"docid":"e0f215d7ff3dcd6fa908653aab3e679e","score":"0.6066196","text":"public configClass(){\n \tload();\n }","title":""},{"docid":"61934645156964fa4ab765743f1e6f99","score":"0.6052308","text":"@Override\n protected void configure() {\n }","title":""},{"docid":"6a08e5250b0680ce5b38d32d13f43838","score":"0.59910285","text":"@Override\n\tprotected void configure() {\n\t\tbind(TransactionLog.class).to(DatabaseTransactionLog.class);\n//\t\tbind(DatabaseTransactionLog.class).to(MySqlDatabaseTransactionLog.class);\n\t\t/*\n\t\t * Similarly, this binding tells Guice that when CreditCardProcessor is\n\t\t * used in a dependency, that should be satisfied with a\n\t\t * PaypalCreditCardProcessor.\n\t\t */\n\t\tbind(CreditCardProcessor.class).to(PaypalCreditCardProcessor.class);\n\t}","title":""},{"docid":"7f86401cf17e4f730df056c1f49f697a","score":"0.59905714","text":"public void configure()\n\t{\n\t\t\n\t}","title":""},{"docid":"1a75b27de9651187d203542a865bc48b","score":"0.59656817","text":"@Override\n\tpublic void config() {\n\t}","title":""},{"docid":"a482ae5ff43cd08e56315daaa7e4c2d5","score":"0.59075975","text":"protected AbstractFeignConfigurationBuilder(Class<B> self) {\n this.self = self.cast(this);\n }","title":""},{"docid":"715d582fb2b3e6b21eb3561fd78f94dd","score":"0.58912754","text":"public PoolConfig() {\n super();\n }","title":""},{"docid":"6511412f687d14d366ae769b691c52af","score":"0.58862936","text":"public Petrinet2ConfigurationFactoryImpl() {\n\t\tsuper();\n\t}","title":""},{"docid":"0e3350d337f3309676eaf4e81ed776ea","score":"0.5877535","text":"@Override\n\tprotected void configure() {\n\t\tbind(TransactionLog.class).to(DatabaseTransactionLog.class);\n\n\t\t/*\n\t\t * Similarly, this binding tells Salta that when CreditCardProcessor is used in\n\t\t * a dependency, that should be satisfied with a PaypalCreditCardProcessor.\n\t\t */\n\t\tbind(CreditCardProcessor.class).annotatedWith(PayPal.class).to(PaypalCreditCardProcessor.class);\n\t}","title":""},{"docid":"f592908fc279f155eb52fcae17cb2842","score":"0.58674514","text":"@Override\r\n\tprotected void configure() {\n\r\n\t bind(ReachtodayView.class).to(ReachtodayTabletView.class).in(Singleton.class);\r\n\t bind(ReachtodayActivity.class);\r\n\r\n\r\n\t}","title":""},{"docid":"c9304760eeb74fe3565d15b167fdba1f","score":"0.5831663","text":"protected void configure() {\n\tbind(HelloGuiceService.class).to(HelloGuiceServiceImpl.class);\n }","title":""},{"docid":"abca51bcd4d8f8292a129d42e8f6a5fb","score":"0.5815034","text":"@Override\n public void configure() {\n install(new FactoryModuleBuilder()\n .implement(IEntityTracker.class, NMSEntityTracker.class)\n .build(IEntityTracker.Factory.class)\n );\n\n bind(IEntityPacketManipulator.class).to(EntityPacketManipulator.class);\n bind(EntityTrackingManager.class).to(NoUpdateEntityTrackingManager.class);\n\n }","title":""},{"docid":"02d21f64e915ee698a33da25a776412e","score":"0.5798337","text":"AbstractionConfiguration createAbstractionConfiguration();","title":""},{"docid":"017aa0579782d2208c15e9a5268029f7","score":"0.57711977","text":"public BaseConfig(BaseConfig parent, ConfigurationSection config, HashMap<String, List<Biome>> biomeAliases) {\n\t\tcopy(parent);\n\t\tif (config.isSet(\"base_rate\"))\n\t\t\tbaseRate = config.getDouble(\"base_rate\");\n\t\tif (config.isSet(\"biomes\"))\n\t\t\tloadBiomes(config.getConfigurationSection(\"biomes\"), biomeAliases);\n\t}","title":""},{"docid":"a62c7c18ddd1ff2ed1220d2015053aaf","score":"0.5767904","text":"@Override\n protected void configure() {\n // Entity manager\n this.bind(EntityManager.class).toInstance(this.entityManager);\n \n // Service implementations\n this.bind(ActivityService.class).to(ActivityServiceDb.class).in(Scopes.SINGLETON);\n this.bind(AppDataService.class).to(AppDataServiceDb.class).in(Scopes.SINGLETON);\n this.bind(PersonService.class).to(PersonServiceDb.class).in(Scopes.SINGLETON);\n \n // Entities\n this.bind(Activity.class).to(ActivityDb.class);\n this.bind(Account.class).to(AccountDb.class);\n this.bind(Address.class).to(AddressDb.class);\n this.bind(BodyType.class).to(BodyTypeDb.class);\n this.bind(ListField.class).to(ListFieldDb.class);\n this.bind(MediaItem.class).to(MediaItemDb.class);\n this.bind(Message.class).to(MessageDb.class);\n this.bind(Name.class).to(NameDb.class);\n this.bind(Organization.class).to(OrganizationDb.class);\n this.bind(Person.class).to(PersonDb.class);\n this.bind(Url.class).to(UrlDb.class);\n this.bind(ContainerConf.class).to(JsonContainerConf.class);\n \n }","title":""},{"docid":"afcec588c27c03f38cdd1790995fad0e","score":"0.57597035","text":"@Override\n public void configure(Map<String, ?> configs) {\n }","title":""},{"docid":"b2ddd469bd96c4f29bfd722ea28d9ebd","score":"0.5745388","text":"protected abstract Class<CFG> getConfigClass();","title":""},{"docid":"5b1152af08ecd80e376dd3b6055898c5","score":"0.5737619","text":"Config(String name) {\n this.name = name;\n }","title":""},{"docid":"2a08e19b5ec039920243213345697836","score":"0.57352006","text":"public interface SparrowNotifierConfig\r\n extends SparrowConfig {\r\n public abstract String getClassName();\r\n\r\n public abstract String getType();\r\n}","title":""},{"docid":"60fc07250561d835bc06dd229c9bdb11","score":"0.57319105","text":"@Override\r\n\tprotected void configure() {\n\t\tbind(FileUtilService.class).to(MD5UtilService.class);\r\n\t}","title":""},{"docid":"4ca2970cf492bc3028d3beaad50a5309","score":"0.5730212","text":"@Override\n protected void configure() {\n bindService(RxcStreamService.class, RxcStreamServiceImpl.class);\n // Bind the RxcService client\n bindClient(RxcService.class);\n // Bind the subscriber eagerly to ensure it starts up\n bind(RxcStreamSubscriber.class).asEagerSingleton();\n }","title":""},{"docid":"381ca20a4c580afe67db4b38047875e3","score":"0.56990725","text":"@Override\n public void configure(Binder binder)\n {\n binder.bind(Animal.class).to(Key.get(Animal.class, Tigerr.class));\n\n binder.bind(Liquid.class).to(Water.class);\n }","title":""},{"docid":"ff156576209e345526cb8f8654cfec1e","score":"0.56875443","text":"public interface GlobalConfig {\n}","title":""},{"docid":"d33e830a349f70399cb3edb41f6c0c90","score":"0.5680853","text":"TwitterFactoryBase(Configuration conf) {\n this.conf = conf;\n }","title":""},{"docid":"e7e5ed692a67a21c4f7778a9d527f9d3","score":"0.5664676","text":"public BaseConfiguration()\n {\n try {\n prop=new Properties();\n FileInputStream ip = new FileInputStream(\"./src/main/resources/config.properties\");\n prop.load(ip);\n }catch (FileNotFoundException e) {\n e.printStackTrace();\n }catch (IOException e) {\n e.printStackTrace();\n }\n }","title":""},{"docid":"d74923e44f98dc3dd9e135be262d3307","score":"0.56578124","text":"@Override\n protected void configure() {\n bind(ZdDatabase.class).toInstance(ZdDatabase.initialize());\n bind(ZdOrganizationSearch.class).toInstance(new ZdOrganizationSearch());\n bind(ZdUserSearch.class).toInstance(new ZdUserSearch());\n bind(ZdTicketSearch.class).toInstance(new ZdTicketSearch());\n bind(DisplayOrganizationResults.class).toInstance(new DisplayOrganizationResults());\n bind(DisplayTicketResults.class).toInstance(new DisplayTicketResults());\n bind(DisplayUserResults.class).toInstance(new DisplayUserResults());\n bind(SearchFactory.class).toInstance(new SearchFactory());\n bind(DisplayFactory.class).toInstance(new DisplayFactory());\n }","title":""},{"docid":"d37fb470438414540f4a401ec929af35","score":"0.5648713","text":"@Override\n protected void configure() {\n bindService(YoutubeStreamService.class, YoutubeStreamServiceImpl.class);\n // Bind the YoutubeService client\n bindClient(YoutubeService.class);\n // Bind the subscriber eagerly to ensure it starts up\n bind(YoutubeStreamSubscriber.class).asEagerSingleton();\n }","title":""},{"docid":"8170018b7ab3c94a0e3fea7a08462dca","score":"0.5644463","text":"@Override\n public void refreshConfiguration(BoundedBean inputBean){\n super.refreshConfiguration(inputBean);\n }","title":""},{"docid":"f1dca37e65f9e34abf05fbf18db83e10","score":"0.5639468","text":"public abstract void initialConfiguration();","title":""},{"docid":"03b13965148d595c679b6461ac7318c9","score":"0.56237864","text":"public interface ConfigSource {\n\n}","title":""},{"docid":"3b53563a299f41895be5a96dd2ae3acc","score":"0.56217086","text":"@Override\n\tpublic void configure(Map arg0, boolean arg1) {\n\t\t\n\t}","title":""},{"docid":"524b5e7e196290a4ffd6695b68031ff1","score":"0.56104326","text":"public BaseConfig() {\n\t\tbaseRate = 1.0;\n\t\tbiomeMultipliers = new HashMap<Biome, Double>();\n\t}","title":""},{"docid":"165e501ddd461513e79712fec40f39d9","score":"0.55936515","text":"public static AbstractBinder binderForResourceConfig() {\n\t\treturn new AbstractBinder() {\n\t\t\t@Override\n\t\t\tprotected void configure() {\n\t\t\t\tbindFactory(MockECRequestContextHandlerFactory.class)\n\t\t\t\t\t\t.to(ERXECRequestContextHandler.class)\n\t\t\t\t\t\t.in(Singleton.class)\n\t\t\t\t\t\t.ranked(100);\n\t\t\t}\n\t\t};\n\t}","title":""},{"docid":"738ef51183e799add7ca0747e06bbeef","score":"0.5588955","text":"protected TwitterFactoryBase(String configTreePath) {\n this.conf = ConfigurationContext.getInstance(configTreePath);\n }","title":""},{"docid":"ed4d85517540649262f08e90d1b2920c","score":"0.557443","text":"@Override\r\n\tpublic void configure() {\n\t\tbind().in(MyAPP.class).id(\"myAPP\").scope(Scope.SINGLETON);\r\n\t}","title":""},{"docid":"9369d58afe3df78f6fe0d99d50a5bdb1","score":"0.55703366","text":"private void configureAbstractPlace() {\n typeEngine = new TypeEngine(configG);\n NON_PROPAGATING_METADATA_VALS = configG.findEntriesAsSet(\"NON_PROPAGATING_METADATA\");\n }","title":""},{"docid":"a8c81c7017f0358e0cb78e180ba70e9d","score":"0.55554086","text":"@Override\n\tpublic void configure(ConfigParams config) throws ConfigException{\n\t\t_persister.configure(config);\n\t}","title":""},{"docid":"aa35bad108d281c1cb6c4639c246f825","score":"0.55301934","text":"@Override\r\n\tpublic void configure() throws Exception {\n\t}","title":""},{"docid":"a4b87be9ab5f82e3947a8c0ea8b13cd8","score":"0.5508694","text":"public EnvironmentConfig() {\n super();\n }","title":""},{"docid":"73036ba6bafc9051734b4a94d62c7fd6","score":"0.54725194","text":"public FESConfiguration() {\n super(FES.getInstance());\n \n addDependency(new OWSConfiguration());\n addDependency(new GMLConfiguration());\n }","title":""},{"docid":"227a097ef88c41d8d0471e6e6272d323","score":"0.5437119","text":"@Override\n public Config config() {\n return config;\n }","title":""},{"docid":"edc00947e01863abc1f77ac7e4b9a5c3","score":"0.54324883","text":"@Override\r\n public void onConfigurationChanged(Configuration newConfig){\r\n super.onConfigurationChanged(newConfig);\r\n }","title":""},{"docid":"6afc971279a6a59593da7acce02e1bae","score":"0.5427377","text":"@Override\n public void configure(@Nonnull AbstractConfigNode node) throws ConfigurationException {\n super.configure(node);\n try {\n requestUrl = URLDecoder.decode(requestUrl, GlobalConstants.defaultCharset().name());\n if (node instanceof ConfigPathNode) {\n if (((ConfigPathNode) node).parmeters() != null) {\n ConfigParametersNode params = ((ConfigPathNode) node).parmeters();\n if (!params.getKeyValues().isEmpty()) {\n Map<String, String> values = new HashMap<>();\n for (String key : params.getKeyValues().keySet()) {\n ConfigValueNode vn = params.getValue(key);\n values.put(key, vn.getValue());\n }\n if (!values.isEmpty()) {\n requestUrl = UrlUtils.replaceParams(requestUrl, values);\n }\n }\n }\n }\n LogUtils.debug(getClass(), String.format(\"Request URL [%s]\", requestUrl));\n if (responseHandlerClass != null) {\n responseHandler = responseHandlerClass.newInstance();\n responseHandler.configure(node);\n }\n if (requestBuilderClass != null) {\n requestBuilder = requestBuilderClass.newInstance();\n }\n } catch (Exception ex) {\n throw new ConfigurationException(ex);\n }\n }","title":""},{"docid":"44083372de29e7294eb0ee0c84e77614","score":"0.54187834","text":"public static AbstractBinder binderForResourceConfig() {\n\t\treturn new AbstractBinder() {\n\t\t\t@Override\n\t\t\tprotected void configure() {\n\t\t\t\tbindFactory(ERXECFactory.class).to(ERXEC.class).in(RequestScoped.class);\n\t\t\t}\n\t\t};\n\t}","title":""},{"docid":"720f1814175eb2d9b95ebf1bea2544ea","score":"0.5418448","text":"ExtendConfiguration createExtendConfiguration();","title":""},{"docid":"a70c3c98fbd41bfc31234696564faed5","score":"0.54175323","text":"@Override\n public void onConfigurationChanged(Configuration newConfig) {\n super.onConfigurationChanged(newConfig);\n }","title":""},{"docid":"1167a60ff5910e8d56c27bf27196cc8d","score":"0.5413753","text":"@Override\n \tpublic void onConfigurationChanged(Configuration newConfig)\n \t{\n \t\tsuper.onConfigurationChanged(newConfig);\n \t}","title":""},{"docid":"3d08357804a6ed37c01107c4fb87b65b","score":"0.54119307","text":"UBOCutConfig() { super(1); }","title":""},{"docid":"3705ad01453d9caba714a6d887c07ad8","score":"0.5406033","text":"@Override\n protected ResourceConfig configure() {\n OpenSilex.setup(new HashMap<String, String>() {\n {\n put(OpenSilex.PROFILE_ID_ARG_KEY, OpenSilex.TEST_PROFILE_ID);\n }\n });\n\n ResourceConfig resourceConfig = new RestApplication(OpenSilex.getInstance());\n\n // create a mock for HttpServletRequest which is not available with grizzly\n final HttpServletRequest request = Mockito.mock(HttpServletRequest.class);\n resourceConfig.register(new AbstractBinder() {\n @Override\n protected void configure() {\n bind(request).to(HttpServletRequest.class);\n }\n });\n\n return resourceConfig;\n }","title":""},{"docid":"db0a4679367ff00a638d444d27d15d6a","score":"0.53977036","text":"@Override\n\tpublic void configure() throws ConfigurationException {\n\t\tsuper.configure();\n\t\tappConstants = AppConstants.getInstance(getConfigurationClassLoader());\n\t\tif (StringUtils.isNotEmpty(getFilename()) && !isLookupAtRuntime()) {\n\t\t\tURL resource = null;\n\t\t\ttry {\n\t\t\t\tresource = ClassUtils.getResourceURL(this, getFilename());\n\t\t\t} catch (Throwable e) {\n\t\t\t\tthrow new ConfigurationException(\"got exception searching for [\"+getFilename()+\"]\", e);\n\t\t\t}\n\t\t\tif (resource==null) {\n\t\t\t\tthrow new ConfigurationException(\"cannot find resource [\"+getFilename()+\"]\");\n\t\t\t}\n try {\n\t\t\t\treturnString = Misc.resourceToString(resource, Misc.LINE_SEPARATOR);\n } catch (Throwable e) {\n throw new ConfigurationException(\"got exception loading [\"+getFilename()+\"]\", e);\n }\n }\n if ((StringUtils.isEmpty(getFilename())) && (StringUtils.isEmpty(getFilenameSessionKey())) && returnString==null) { // allow an empty returnString to be specified\n throw new ConfigurationException(\"has neither filename nor filenameSessionKey nor returnString specified\");\n }\n\t\tif (StringUtils.isNotEmpty(replaceFrom)) {\n\t\t\treturnString = replace(returnString, replaceFrom, replaceTo );\n\t\t}\n }","title":""},{"docid":"3f3775eecfbcfa3c355037a9fd205442","score":"0.5396573","text":"@Override\n\tpublic void setConf(Configuration arg0) {\n\t\t\n\t}","title":""},{"docid":"d55508d349939b91dd26cc3f54b61e63","score":"0.53951204","text":"public interface Configuration {\r\n\t\r\n\t/**\r\n\t * Should return the value configured for key \"string.value\"\r\n\t * @return\r\n\t */\r\n\t@Bind(\"string.value\")\r\n\tString getStringValue();\r\n\r\n\t/**\r\n\t * Should return the value configured for key \"integer.value\"\r\n\t * @return\r\n\t */\r\n\t@Bind(\"integer.value\")\r\n\tInteger getIntegerValue();\r\n\r\n\t/**\r\n\t * Should return the value configured for key \"boolean.value\"\r\n\t * @return\r\n\t */\r\n\t@Bind(\"boolean.value\")\r\n\tBoolean getBooleanValue();\r\n\r\n\t/**\r\n\t * Should return the value configured for key \"float.value\"\r\n\t * @return\r\n\t */\r\n\t@Bind(\"float.value\")\r\n\tFloat getFloatValue();\r\n\t\r\n\t/**\r\n\t * Should return the value configured for key \"long.value\"\r\n\t * @return\r\n\t */\r\n\t@Bind(\"long.value\")\r\n\tLong getLongValue();\r\n\t\r\n\t/**\r\n\t * Should return the value configured for key \"p.int.value\"\r\n\t * @return\r\n\t */\r\n\t@Bind(\"p.int.value\")\r\n\tint getIntValue();\r\n\t\r\n}","title":""},{"docid":"64bb55b5597987566ecd418a8c81afe1","score":"0.53923184","text":"private CloneConfig() {\n }","title":""},{"docid":"e88334810215840b929eaa44a9f296b1","score":"0.5384285","text":"@Override public void onConfigurationChanged(Configuration newConfig) {\n\n super.onConfigurationChanged(newConfig);\n }","title":""},{"docid":"ecf321e2bdf9900551f3614dc8abdfa2","score":"0.53803205","text":"@Override\r\n\tpublic void configuration() {\n\r\n\t}","title":""},{"docid":"16a49d75bb9e8bfefa1b4b8ba15d9fff","score":"0.5367917","text":"protected void configure() {\n bindConstant().annotatedWith(JpaUnit.class).to(\"testUnit\");\r\n }","title":""},{"docid":"c5b1a0caa4ccb2c8115705f71ac27015","score":"0.5361695","text":"@Override\n\t\tpublic void configure(Binder binder) {\n\t\t\t\n\t\t\tbinder.bind(RemoteService.class).toInstance(mockRemote); //see above comment on the field mockRemote\n\t\t}","title":""},{"docid":"97bbc38833ab6d58b6a0a6cebe20d222","score":"0.5359885","text":"@Override\n\t\tpublic void configure(Binder binder) {\n\t\t\tbinder.bind(IFoodService.class).to(PizzaService.class);\n\t\t}","title":""},{"docid":"d098334a2e99fecb7de25053e462b6ae","score":"0.5323433","text":"public Config() {}","title":""},{"docid":"025f2ecfc07163eb41b8ddf72c48139f","score":"0.5323332","text":"public void configure(Binder binder)\n {\n binder.bind(Add.class).to(SimpleAdd.class);\n }","title":""},{"docid":"f74df7fd65117921dcd42e66156239de","score":"0.5320623","text":"@Override\n public void onConfigurationChanged(final Configuration newConfig) {\n super.onConfigurationChanged(newConfig);\n }","title":""},{"docid":"e8c28471b2672a8a53f1328c01940a45","score":"0.5315308","text":"@Override\n protected void configure() {\n IntrospectingBinder introspectingBinder =\n IntrospectingBinder.newIntrospectingBinder(binder());\n introspectingBinder.bindIntrospectively(\n IntrospectionTarget.class,\n TestScoped.class,\n OUT_OF_SCOPE_PROVIDER);\n\n bindScope(TestScoped.class, testScope);\n }","title":""},{"docid":"fe3049b42ead386a2140d5bb60f1a526","score":"0.5315272","text":"public void configure(AppRegistry registry) throws ConfigurationException;","title":""},{"docid":"e60119e6f3baec253a2d27641e40e32e","score":"0.52992576","text":"@Override\r\n\tprotected void configure() {\n\t\tbind(MessageService.class).to(EmailService.class);\r\n\t\t\r\n\t\tbind(MessageService.class).annotatedWith(Names.named(\"smsService\"))\r\n\t\t .to(SMSService.class);\r\n\t}","title":""},{"docid":"02302533fe9c347fe380b9f55f774d65","score":"0.52814376","text":"@Override\r\n\tpublic void configure(Binder arg0) {\n\t\targ0.bind(Hello.class).annotatedWith(Names.named(\"impl1\")).to(HelloImpl1111.class);\r\n\t\targ0.bind(Hello.class).annotatedWith(Names.named(\"impl2\")).to(HelloImpl2222.class);\r\n\t}","title":""},{"docid":"c74632e97255937a6dc68e5e65276333","score":"0.5265644","text":"public interface ConfigService {\n\n Config getConfig();\n\n}","title":""},{"docid":"0b73ba5fe678f5b4027b4ef7b38bbd0a","score":"0.52645445","text":"private ConfigManager35(){\n\n }","title":""},{"docid":"9dd2fa24502de56178916e2850ac5fae","score":"0.5260456","text":"public interface Configured {\n\n public void configure(Configuration cfg) throws ConfigurationException;\n\n}","title":""},{"docid":"2fe98a56c53346987b8dcd1ca0121d5e","score":"0.5259128","text":"@Override\n\tpublic void onConfigurationChanged(Configuration newConfig) {\n\t\tsuper.onConfigurationChanged(newConfig);\n\t}","title":""},{"docid":"2fe98a56c53346987b8dcd1ca0121d5e","score":"0.5259128","text":"@Override\n\tpublic void onConfigurationChanged(Configuration newConfig) {\n\t\tsuper.onConfigurationChanged(newConfig);\n\t}","title":""},{"docid":"2fe98a56c53346987b8dcd1ca0121d5e","score":"0.5259128","text":"@Override\n\tpublic void onConfigurationChanged(Configuration newConfig) {\n\t\tsuper.onConfigurationChanged(newConfig);\n\t}","title":""},{"docid":"8a3fbdbfe0f61cb0302c8427b8a9cb5e","score":"0.5253836","text":"public void configure(Map parameters);","title":""},{"docid":"61182a18333c5b4e21a0d65bc9d77d69","score":"0.5251441","text":"protected void configure(final JsonObject config) {\n\n }","title":""},{"docid":"585a777472655f19f0552332e9de5ef3","score":"0.5250147","text":"@Override\n\tpublic void configure(Map<String, String> arg0) {\n\n\t}","title":""},{"docid":"e9d9b7fc649eec22e942a35bc4dd2722","score":"0.52480024","text":"private void configureDagger(){\n AndroidSupportInjection.inject(this);\n }","title":""},{"docid":"6756c481f876139c434648b0ad0416b8","score":"0.5244296","text":"public INIConfiguration()\n {\n super();\n }","title":""},{"docid":"f50e0400a429ef870c54b6f1f984bfc7","score":"0.5244054","text":"@SuppressWarnings(\"unchecked\")\r\n\tpublic static <T extends Configurable> T createProxy(Class<T> targetClass,\r\n\t\t\tClass<?>[] argsType, Object[] args) {\r\n\r\n\t\tEnhancer enhancer = new Enhancer();\r\n\t\tenhancer.setSuperclass(targetClass);\r\n\t\tenhancer.setInterfaces(new Class[] { ConfigModule.class });\r\n\t\t// Kiểm tra interface cài đặt\r\n\t\tSet<Class<?>> interfaceList = ReflectUtils.getAllInterfaces(\r\n\t\t\t\ttargetClass, true);\r\n\t\tif (AbstractConfig.class.isAssignableFrom(targetClass)) {\r\n\t\t\tinterfaceList.remove(SystemConfig.class);\r\n\t\t}\r\n\t\tHashMap<String, Object> optionsList = new HashMap<String, Object>();\r\n\t\tHashMap<Class<?>, Object> configObjList = new HashMap<Class<?>, Object>();\r\n\t\tfor (Class<?> interfaze : interfaceList) {\r\n\t\t\tif (JGentle.containsConfigClass(interfaze)) {\r\n\t\t\t\tClass<?> clazz = JGentle.getConfigClass(interfaze);\r\n\t\t\t\tObject obj = null;\r\n\t\t\t\tobj = ReflectUtils.createInstance(clazz);\r\n\t\t\t\t// Nếu config class extends từ AbstractConfigModule\r\n\t\t\t\tif (AbstractConfigModule.class.isAssignableFrom(clazz)) {\r\n\t\t\t\t\ttry {\r\n\t\t\t\t\t\t((AbstractConfigModule) obj).setOptionsList(\r\n\t\t\t\t\t\t\t\toptionsList, ReflectUtils.getSupportedMethod(\r\n\t\t\t\t\t\t\t\t\t\ttargetClass, \"configure\", null));\r\n\t\t\t\t\t}\r\n\t\t\t\t\tcatch (NoSuchMethodException e) {\r\n\t\t\t\t\t\tif (log.isFatalEnabled()) {\r\n\t\t\t\t\t\t\tlog.fatal(\r\n\t\t\t\t\t\t\t\t\t\"Could not found 'configure' method on configurable class [\"\r\n\t\t\t\t\t\t\t\t\t\t\t+ targetClass + \"]\", e);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tconfigObjList.put(interfaze, obj);\r\n\t\t\t}\r\n\t\t}\r\n\t\tenhancer.setCallback(new ConfigurationProxy(targetClass, optionsList,\r\n\t\t\t\tconfigObjList));\r\n\t\tObject result = null;\r\n\t\tif (argsType != null && args != null) {\r\n\t\t\tresult = enhancer.create(argsType, args);\r\n\t\t}\r\n\t\telse {\r\n\t\t\tresult = enhancer.create();\r\n\t\t}\r\n\t\t// thiết lập optionsList trong trường hợp targetClass kế thừa từ\r\n\t\t// AbstractConfig\r\n\t\tif (AbstractConfig.class.isAssignableFrom(targetClass)) {\r\n\t\t\ttry {\r\n\t\t\t\t((AbstractConfig) result).setOptionsList(optionsList,\r\n\t\t\t\t\t\tReflectUtils.getSupportedMethod(targetClass,\r\n\t\t\t\t\t\t\t\t\"configure\", null));\r\n\t\t\t}\r\n\t\t\tcatch (NoSuchMethodException e) {\r\n\t\t\t\tif (log.isFatalEnabled()) {\r\n\t\t\t\t\tlog.fatal(\r\n\t\t\t\t\t\t\t\"Could not found 'configure' method on configurable class [\"\r\n\t\t\t\t\t\t\t\t\t+ targetClass + \"]\", e);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn (T) result;\r\n\t}","title":""},{"docid":"5cc8ee057a619ff4b5ba770f6f0c94c9","score":"0.522917","text":"public void configure() throws Exception;","title":""},{"docid":"bafd921916c1c91fe535bb408e761c36","score":"0.5225257","text":"public interface ConfigInterface {\n\t\n\t/**\n\t * Restituisce una voce di configurazione. La voce è un elemento di testo\n\t * che può essere complesso (es. XML). I valori restituiti sono relativi\n\t * alla versione di configurazione con cui è stato avviato il sistema.\n\t * @param name Il codice della voce da restituire.\n\t * @return Il testo della voce di configurazione.\n\t */\n\tpublic String getConfigItem(String name);\n\t\n\t/**\n\t * Aggiorna una voce di configurazione. La voce è un elemento di testo\n\t * che può essere complesso (es. XML). \n\t * @param name Il codice della voceda aggiornare.\n\t * @param config Il testo della voce di configurazione da aggiornare.\n\t * @throws ApsSystemException In caso di errore nell'aggiornamento\n\t */\n\tpublic void updateConfigItem(String name, String config) throws ApsSystemException;\n\t\n\t/**\n\t * Restituisce un parametro di configurazione. \n\t * Un parametro è una stringa semplice.\n\t * @param name Il nome del parametro\n\t * @return Il valore del parametro\n\t */\n\tpublic String getParam(String name);\n\t\n}","title":""},{"docid":"dab2b864348908c4ee22f87c34f78361","score":"0.5217674","text":"public interface Configurable {\n\tvoid setConf(Configuration conf);\n\tConfiguration getConf();\n}","title":""},{"docid":"431f1c3aa84d0dd522fe66f097634189","score":"0.52162796","text":"public interface ConfigurationProvider {\n\n /** Get simulation settings. */\n Configuration getConfiguration();\n}","title":""},{"docid":"07cc008ac808a81b10575e47058339a5","score":"0.52140445","text":"@SuppressWarnings(\"unchecked\")\n public <T extends Annotation> ConfigBean<T> getConfAnnotation(Class<T> baseVannitationClass, String annotatedClassFQN, String annotationClassFQN) {\n String name = baseVannitationClass.getSimpleName();\n HashSet<String> val = supportedAnnotationTypes.get(VannitationType.valueOf(name));\n if (!val.contains(annotationClassFQN)) {\n logger.fine(\"Annotation [\" + annotatedClassFQN + \"] is not supported. We support: \" + val);\n return null;\n }\n KeyPair k = new KeyPair(annotatedClassFQN, annotationClassFQN);\n if (configAnnotations.containsKey(k)) {\n return configAnnotations.get(k);\n } else {\n Annotation[] annotationsOnTheClass = getAnnotationsFromFQN(annotatedClassFQN);\n for (Annotation a : annotationsOnTheClass) {\n if (a.annotationType().getName().equals(annotationClassFQN)) {\n ConfigBean<T> configBean = AnnotationConfigMerger.merge(baseVannitationClass, a);\n configAnnotations.put(k, configBean);\n return configBean;\n }\n }\n logger.fine(\"[\" + annotatedClassFQN + \"] appears not to be annotated with [\" + annotationClassFQN + \"] (hint: Have you set the retention policy of the annotation to RUNTIME ? @Retention(RetentionPolicy.RUNTIME))\");\n return null;\n }\n }","title":""}],"string":"[\n {\n \"docid\": \"f8c1b80e443ae3f177288556b826c6f4\",\n \"score\": \"0.660099\",\n \"text\": \"@Override\\n protected void configure() {\\n bind(GenerationConfigSource.class).toInstance(generationConfigSource);\\n\\n // Bind providers - used to retrieve implementations based on user input\\n bind(DecisionTreeWalker.class).toProvider(DecisionTreeWalkerProvider.class);\\n bind(AbstractDataGeneratorMonitor.class).toProvider(MonitorProvider.class).in(Singleton.class);\\n bind(CombinationStrategy.class).toProvider(CombinationStrategyProvider.class);\\n bind(OptionPicker.class).toProvider(OptionPickerProvider.class);\\n\\n // bind config directly\\n bind(DataGenerationType.class).toInstance(generationConfigSource.getGenerationType());\\n bind(CombinationStrategyType.class).toInstance(generationConfigSource.getCombinationStrategyType());\\n\\n bind(Long.class)\\n .annotatedWith(Names.named(\\\"config:maxRows\\\"))\\n .toProvider(Providers.of(getMaxRows(generationConfigSource)));\\n\\n bind(MonitorType.class)\\n .toInstance(generationConfigSource.getMonitorType());\\n\\n // Bind known implementations - no user input required\\n bind(DataGeneratorMonitor.class).to(AbstractDataGeneratorMonitor.class);\\n bind(DataGenerator.class).toProvider(DataGeneratorProvider.class);\\n\\n bind(JavaUtilRandomNumberGenerator.class)\\n .toInstance(new JavaUtilRandomNumberGenerator(OffsetDateTime.now().getNano()));\\n bind(int.class)\\n .annotatedWith(Names.named(\\\"config:internalRandomRowSpecStorage\\\"))\\n .toInstance(256);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34cc10d16e33b6a297fc3619d6958895\",\n \"score\": \"0.6593943\",\n \"text\": \"@Override\\n\\tprotected void configure()\\n\\t{\\n\\t\\t\\n\\t\\tbind(SubServiceC.class)\\n\\t\\t.annotatedWith(Ugly.class)\\n\\t\\t.to(SubServiceCUglyImpl.class);\\n\\t\\t\\n\\t\\tbind(SubServiceC.class)\\n\\t\\t.annotatedWith(Pretty.class)\\n\\t\\t.to(SubServiceCPrettyImpl.class);\\n\\t\\t\\n\\t\\tbind(SubServiceB.class)\\n\\t\\t.annotatedWith(Ugly.class)\\n\\t\\t.to(SubServiceBUglyImpl.class);\\n\\t\\t\\n\\t\\tbind(SubServiceB.class)\\n\\t\\t.annotatedWith(Pretty.class)\\n\\t\\t.to(SubServiceBPrettyImpl.class);\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae7762e78b3c5e7ea8226d3a38ff5e9f\",\n \"score\": \"0.65871215\",\n \"text\": \"private Config(){\\n\\t\\tsuper();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04bf32a4e866067754d5cda3e10adf44\",\n \"score\": \"0.63641137\",\n \"text\": \"@Override\\n protected void configure() {\\n\\n bind(DefaultTransportClientFactory.class).to(TransportClientFactory.class);\\n bind(EnvElasticSearchConfigurator.class).to(ElasticSearchConfigurator.class);\\n bind(DefaultElasticSearchService.class).to(InternalElasticSearchService.class).to(ElasticSearchService.class).in(Singleton.class);\\n bind(DefaultElasticSearchAdminService.class).to(InternalElasticSearchAdminService.class).to(ElasticSearchAdminService.class).in(Singleton.class);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cee2ff13925018ea9a5f910912d5dda2\",\n \"score\": \"0.63397366\",\n \"text\": \"@Override\\n protected void configure()\\n {\\n bind(CustomerResource.class).in(Singleton.class);\\n bind(CategoryResource.class).in(Singleton.class);\\n bind(TaxDetailsResource.class).in(Singleton.class);\\n bind(ProductResource.class).in(Singleton.class);\\n bind(CartResource.class).in(Singleton.class);\\n bind(OrderResource.class).in(Singleton.class);\\n\\n //Binding other singleton classes needed\\n bind(HibernateUtil.class).in(Singleton.class);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed64b298e3757bbea7aa0cceb29d46c7\",\n \"score\": \"0.6323358\",\n \"text\": \"@Override\\r\\n public void configure() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3cb7c961771b593046c21e68cd9a399\",\n \"score\": \"0.62797123\",\n \"text\": \"@Override\\n protected void configure() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80804dded757aa3966d7dd303de71c02\",\n \"score\": \"0.6262424\",\n \"text\": \"@Override\\n\\tprotected void configure() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80804dded757aa3966d7dd303de71c02\",\n \"score\": \"0.6262424\",\n \"text\": \"@Override\\n\\tprotected void configure() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96c5ab5c3a57d9665c40420c172cf26f\",\n \"score\": \"0.62261564\",\n \"text\": \"@Override\\n\\tprotected void configure() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52b8ce8c349f7b86a56041a992182940\",\n \"score\": \"0.6174929\",\n \"text\": \"public BaseConfig(BaseConfig parent) {\\n\\t\\tcopy(parent);\\n\\t\\tbaseRate = parent.baseRate;\\n\\t\\tbiomeMultipliers = new HashMap<Biome, Double>(parent.biomeMultipliers);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24f075a08beb563bdf0f22c87666ee2b\",\n \"score\": \"0.61709553\",\n \"text\": \"public AutoPilotSubclass() throws ConfigurationException {\\n super();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"adbe44432549fabeec435bb9374cd73a\",\n \"score\": \"0.61677235\",\n \"text\": \"protected void configure() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c44176a6a4384c014deb0b7b6de1dbe\",\n \"score\": \"0.6135802\",\n \"text\": \"protected void configure() {\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74fd2e990014a8c7673189a367d86bec\",\n \"score\": \"0.61215353\",\n \"text\": \"@Override\\n\\tprotected void config() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10e76bb0fb27cec22cf0ef0b2b43e235\",\n \"score\": \"0.61134857\",\n \"text\": \"@Override\\n protected void configure()\\n {\\n bind( GuiceImmutablePhrasesBuilder.class ).toInstance( phraseBuilder );\\n injectBinding();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c3fe80f41b9cd5443e483c07ec097df\",\n \"score\": \"0.6080497\",\n \"text\": \"@Override\\n protected void configure() {\\n install(new GuiceZooKeeperBinder());\\n\\n // Promise bindings\\n bind(WhenConfiguratorHelper.class).to(DefaultWhenConfiguratorHelper.class).in(Singleton.class);\\n bind(WhenZooKeeperClient.class).to(DefaultWhenZooKeeperClient.class).in(Singleton.class);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"577df53fb1de73db917b08081cd2a315\",\n \"score\": \"0.6070247\",\n \"text\": \"@Override\\n public void configure(Binder binder) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0f215d7ff3dcd6fa908653aab3e679e\",\n \"score\": \"0.6066196\",\n \"text\": \"public configClass(){\\n \\tload();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"61934645156964fa4ab765743f1e6f99\",\n \"score\": \"0.6052308\",\n \"text\": \"@Override\\n protected void configure() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a08e5250b0680ce5b38d32d13f43838\",\n \"score\": \"0.59910285\",\n \"text\": \"@Override\\n\\tprotected void configure() {\\n\\t\\tbind(TransactionLog.class).to(DatabaseTransactionLog.class);\\n//\\t\\tbind(DatabaseTransactionLog.class).to(MySqlDatabaseTransactionLog.class);\\n\\t\\t/*\\n\\t\\t * Similarly, this binding tells Guice that when CreditCardProcessor is\\n\\t\\t * used in a dependency, that should be satisfied with a\\n\\t\\t * PaypalCreditCardProcessor.\\n\\t\\t */\\n\\t\\tbind(CreditCardProcessor.class).to(PaypalCreditCardProcessor.class);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f86401cf17e4f730df056c1f49f697a\",\n \"score\": \"0.59905714\",\n \"text\": \"public void configure()\\n\\t{\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a75b27de9651187d203542a865bc48b\",\n \"score\": \"0.59656817\",\n \"text\": \"@Override\\n\\tpublic void config() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a482ae5ff43cd08e56315daaa7e4c2d5\",\n \"score\": \"0.59075975\",\n \"text\": \"protected AbstractFeignConfigurationBuilder(Class<B> self) {\\n this.self = self.cast(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"715d582fb2b3e6b21eb3561fd78f94dd\",\n \"score\": \"0.58912754\",\n \"text\": \"public PoolConfig() {\\n super();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6511412f687d14d366ae769b691c52af\",\n \"score\": \"0.58862936\",\n \"text\": \"public Petrinet2ConfigurationFactoryImpl() {\\n\\t\\tsuper();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e3350d337f3309676eaf4e81ed776ea\",\n \"score\": \"0.5877535\",\n \"text\": \"@Override\\n\\tprotected void configure() {\\n\\t\\tbind(TransactionLog.class).to(DatabaseTransactionLog.class);\\n\\n\\t\\t/*\\n\\t\\t * Similarly, this binding tells Salta that when CreditCardProcessor is used in\\n\\t\\t * a dependency, that should be satisfied with a PaypalCreditCardProcessor.\\n\\t\\t */\\n\\t\\tbind(CreditCardProcessor.class).annotatedWith(PayPal.class).to(PaypalCreditCardProcessor.class);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f592908fc279f155eb52fcae17cb2842\",\n \"score\": \"0.58674514\",\n \"text\": \"@Override\\r\\n\\tprotected void configure() {\\n\\r\\n\\t bind(ReachtodayView.class).to(ReachtodayTabletView.class).in(Singleton.class);\\r\\n\\t bind(ReachtodayActivity.class);\\r\\n\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9304760eeb74fe3565d15b167fdba1f\",\n \"score\": \"0.5831663\",\n \"text\": \"protected void configure() {\\n\\tbind(HelloGuiceService.class).to(HelloGuiceServiceImpl.class);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"abca51bcd4d8f8292a129d42e8f6a5fb\",\n \"score\": \"0.5815034\",\n \"text\": \"@Override\\n public void configure() {\\n install(new FactoryModuleBuilder()\\n .implement(IEntityTracker.class, NMSEntityTracker.class)\\n .build(IEntityTracker.Factory.class)\\n );\\n\\n bind(IEntityPacketManipulator.class).to(EntityPacketManipulator.class);\\n bind(EntityTrackingManager.class).to(NoUpdateEntityTrackingManager.class);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02d21f64e915ee698a33da25a776412e\",\n \"score\": \"0.5798337\",\n \"text\": \"AbstractionConfiguration createAbstractionConfiguration();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"017aa0579782d2208c15e9a5268029f7\",\n \"score\": \"0.57711977\",\n \"text\": \"public BaseConfig(BaseConfig parent, ConfigurationSection config, HashMap<String, List<Biome>> biomeAliases) {\\n\\t\\tcopy(parent);\\n\\t\\tif (config.isSet(\\\"base_rate\\\"))\\n\\t\\t\\tbaseRate = config.getDouble(\\\"base_rate\\\");\\n\\t\\tif (config.isSet(\\\"biomes\\\"))\\n\\t\\t\\tloadBiomes(config.getConfigurationSection(\\\"biomes\\\"), biomeAliases);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a62c7c18ddd1ff2ed1220d2015053aaf\",\n \"score\": \"0.5767904\",\n \"text\": \"@Override\\n protected void configure() {\\n // Entity manager\\n this.bind(EntityManager.class).toInstance(this.entityManager);\\n \\n // Service implementations\\n this.bind(ActivityService.class).to(ActivityServiceDb.class).in(Scopes.SINGLETON);\\n this.bind(AppDataService.class).to(AppDataServiceDb.class).in(Scopes.SINGLETON);\\n this.bind(PersonService.class).to(PersonServiceDb.class).in(Scopes.SINGLETON);\\n \\n // Entities\\n this.bind(Activity.class).to(ActivityDb.class);\\n this.bind(Account.class).to(AccountDb.class);\\n this.bind(Address.class).to(AddressDb.class);\\n this.bind(BodyType.class).to(BodyTypeDb.class);\\n this.bind(ListField.class).to(ListFieldDb.class);\\n this.bind(MediaItem.class).to(MediaItemDb.class);\\n this.bind(Message.class).to(MessageDb.class);\\n this.bind(Name.class).to(NameDb.class);\\n this.bind(Organization.class).to(OrganizationDb.class);\\n this.bind(Person.class).to(PersonDb.class);\\n this.bind(Url.class).to(UrlDb.class);\\n this.bind(ContainerConf.class).to(JsonContainerConf.class);\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"afcec588c27c03f38cdd1790995fad0e\",\n \"score\": \"0.57597035\",\n \"text\": \"@Override\\n public void configure(Map<String, ?> configs) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2ddd469bd96c4f29bfd722ea28d9ebd\",\n \"score\": \"0.5745388\",\n \"text\": \"protected abstract Class<CFG> getConfigClass();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b1152af08ecd80e376dd3b6055898c5\",\n \"score\": \"0.5737619\",\n \"text\": \"Config(String name) {\\n this.name = name;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a08e19b5ec039920243213345697836\",\n \"score\": \"0.57352006\",\n \"text\": \"public interface SparrowNotifierConfig\\r\\n extends SparrowConfig {\\r\\n public abstract String getClassName();\\r\\n\\r\\n public abstract String getType();\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60fc07250561d835bc06dd229c9bdb11\",\n \"score\": \"0.57319105\",\n \"text\": \"@Override\\r\\n\\tprotected void configure() {\\n\\t\\tbind(FileUtilService.class).to(MD5UtilService.class);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ca2970cf492bc3028d3beaad50a5309\",\n \"score\": \"0.5730212\",\n \"text\": \"@Override\\n protected void configure() {\\n bindService(RxcStreamService.class, RxcStreamServiceImpl.class);\\n // Bind the RxcService client\\n bindClient(RxcService.class);\\n // Bind the subscriber eagerly to ensure it starts up\\n bind(RxcStreamSubscriber.class).asEagerSingleton();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"381ca20a4c580afe67db4b38047875e3\",\n \"score\": \"0.56990725\",\n \"text\": \"@Override\\n public void configure(Binder binder)\\n {\\n binder.bind(Animal.class).to(Key.get(Animal.class, Tigerr.class));\\n\\n binder.bind(Liquid.class).to(Water.class);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff156576209e345526cb8f8654cfec1e\",\n \"score\": \"0.56875443\",\n \"text\": \"public interface GlobalConfig {\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d33e830a349f70399cb3edb41f6c0c90\",\n \"score\": \"0.5680853\",\n \"text\": \"TwitterFactoryBase(Configuration conf) {\\n this.conf = conf;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e7e5ed692a67a21c4f7778a9d527f9d3\",\n \"score\": \"0.5664676\",\n \"text\": \"public BaseConfiguration()\\n {\\n try {\\n prop=new Properties();\\n FileInputStream ip = new FileInputStream(\\\"./src/main/resources/config.properties\\\");\\n prop.load(ip);\\n }catch (FileNotFoundException e) {\\n e.printStackTrace();\\n }catch (IOException e) {\\n e.printStackTrace();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d74923e44f98dc3dd9e135be262d3307\",\n \"score\": \"0.56578124\",\n \"text\": \"@Override\\n protected void configure() {\\n bind(ZdDatabase.class).toInstance(ZdDatabase.initialize());\\n bind(ZdOrganizationSearch.class).toInstance(new ZdOrganizationSearch());\\n bind(ZdUserSearch.class).toInstance(new ZdUserSearch());\\n bind(ZdTicketSearch.class).toInstance(new ZdTicketSearch());\\n bind(DisplayOrganizationResults.class).toInstance(new DisplayOrganizationResults());\\n bind(DisplayTicketResults.class).toInstance(new DisplayTicketResults());\\n bind(DisplayUserResults.class).toInstance(new DisplayUserResults());\\n bind(SearchFactory.class).toInstance(new SearchFactory());\\n bind(DisplayFactory.class).toInstance(new DisplayFactory());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d37fb470438414540f4a401ec929af35\",\n \"score\": \"0.5648713\",\n \"text\": \"@Override\\n protected void configure() {\\n bindService(YoutubeStreamService.class, YoutubeStreamServiceImpl.class);\\n // Bind the YoutubeService client\\n bindClient(YoutubeService.class);\\n // Bind the subscriber eagerly to ensure it starts up\\n bind(YoutubeStreamSubscriber.class).asEagerSingleton();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8170018b7ab3c94a0e3fea7a08462dca\",\n \"score\": \"0.5644463\",\n \"text\": \"@Override\\n public void refreshConfiguration(BoundedBean inputBean){\\n super.refreshConfiguration(inputBean);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f1dca37e65f9e34abf05fbf18db83e10\",\n \"score\": \"0.5639468\",\n \"text\": \"public abstract void initialConfiguration();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03b13965148d595c679b6461ac7318c9\",\n \"score\": \"0.56237864\",\n \"text\": \"public interface ConfigSource {\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b53563a299f41895be5a96dd2ae3acc\",\n \"score\": \"0.56217086\",\n \"text\": \"@Override\\n\\tpublic void configure(Map arg0, boolean arg1) {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"524b5e7e196290a4ffd6695b68031ff1\",\n \"score\": \"0.56104326\",\n \"text\": \"public BaseConfig() {\\n\\t\\tbaseRate = 1.0;\\n\\t\\tbiomeMultipliers = new HashMap<Biome, Double>();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"165e501ddd461513e79712fec40f39d9\",\n \"score\": \"0.55936515\",\n \"text\": \"public static AbstractBinder binderForResourceConfig() {\\n\\t\\treturn new AbstractBinder() {\\n\\t\\t\\t@Override\\n\\t\\t\\tprotected void configure() {\\n\\t\\t\\t\\tbindFactory(MockECRequestContextHandlerFactory.class)\\n\\t\\t\\t\\t\\t\\t.to(ERXECRequestContextHandler.class)\\n\\t\\t\\t\\t\\t\\t.in(Singleton.class)\\n\\t\\t\\t\\t\\t\\t.ranked(100);\\n\\t\\t\\t}\\n\\t\\t};\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"738ef51183e799add7ca0747e06bbeef\",\n \"score\": \"0.5588955\",\n \"text\": \"protected TwitterFactoryBase(String configTreePath) {\\n this.conf = ConfigurationContext.getInstance(configTreePath);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed4d85517540649262f08e90d1b2920c\",\n \"score\": \"0.557443\",\n \"text\": \"@Override\\r\\n\\tpublic void configure() {\\n\\t\\tbind().in(MyAPP.class).id(\\\"myAPP\\\").scope(Scope.SINGLETON);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9369d58afe3df78f6fe0d99d50a5bdb1\",\n \"score\": \"0.55703366\",\n \"text\": \"private void configureAbstractPlace() {\\n typeEngine = new TypeEngine(configG);\\n NON_PROPAGATING_METADATA_VALS = configG.findEntriesAsSet(\\\"NON_PROPAGATING_METADATA\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8c81c7017f0358e0cb78e180ba70e9d\",\n \"score\": \"0.55554086\",\n \"text\": \"@Override\\n\\tpublic void configure(ConfigParams config) throws ConfigException{\\n\\t\\t_persister.configure(config);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa35bad108d281c1cb6c4639c246f825\",\n \"score\": \"0.55301934\",\n \"text\": \"@Override\\r\\n\\tpublic void configure() throws Exception {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4b87be9ab5f82e3947a8c0ea8b13cd8\",\n \"score\": \"0.5508694\",\n \"text\": \"public EnvironmentConfig() {\\n super();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73036ba6bafc9051734b4a94d62c7fd6\",\n \"score\": \"0.54725194\",\n \"text\": \"public FESConfiguration() {\\n super(FES.getInstance());\\n \\n addDependency(new OWSConfiguration());\\n addDependency(new GMLConfiguration());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"227a097ef88c41d8d0471e6e6272d323\",\n \"score\": \"0.5437119\",\n \"text\": \"@Override\\n public Config config() {\\n return config;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"edc00947e01863abc1f77ac7e4b9a5c3\",\n \"score\": \"0.54324883\",\n \"text\": \"@Override\\r\\n public void onConfigurationChanged(Configuration newConfig){\\r\\n super.onConfigurationChanged(newConfig);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6afc971279a6a59593da7acce02e1bae\",\n \"score\": \"0.5427377\",\n \"text\": \"@Override\\n public void configure(@Nonnull AbstractConfigNode node) throws ConfigurationException {\\n super.configure(node);\\n try {\\n requestUrl = URLDecoder.decode(requestUrl, GlobalConstants.defaultCharset().name());\\n if (node instanceof ConfigPathNode) {\\n if (((ConfigPathNode) node).parmeters() != null) {\\n ConfigParametersNode params = ((ConfigPathNode) node).parmeters();\\n if (!params.getKeyValues().isEmpty()) {\\n Map<String, String> values = new HashMap<>();\\n for (String key : params.getKeyValues().keySet()) {\\n ConfigValueNode vn = params.getValue(key);\\n values.put(key, vn.getValue());\\n }\\n if (!values.isEmpty()) {\\n requestUrl = UrlUtils.replaceParams(requestUrl, values);\\n }\\n }\\n }\\n }\\n LogUtils.debug(getClass(), String.format(\\\"Request URL [%s]\\\", requestUrl));\\n if (responseHandlerClass != null) {\\n responseHandler = responseHandlerClass.newInstance();\\n responseHandler.configure(node);\\n }\\n if (requestBuilderClass != null) {\\n requestBuilder = requestBuilderClass.newInstance();\\n }\\n } catch (Exception ex) {\\n throw new ConfigurationException(ex);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44083372de29e7294eb0ee0c84e77614\",\n \"score\": \"0.54187834\",\n \"text\": \"public static AbstractBinder binderForResourceConfig() {\\n\\t\\treturn new AbstractBinder() {\\n\\t\\t\\t@Override\\n\\t\\t\\tprotected void configure() {\\n\\t\\t\\t\\tbindFactory(ERXECFactory.class).to(ERXEC.class).in(RequestScoped.class);\\n\\t\\t\\t}\\n\\t\\t};\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"720f1814175eb2d9b95ebf1bea2544ea\",\n \"score\": \"0.5418448\",\n \"text\": \"ExtendConfiguration createExtendConfiguration();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a70c3c98fbd41bfc31234696564faed5\",\n \"score\": \"0.54175323\",\n \"text\": \"@Override\\n public void onConfigurationChanged(Configuration newConfig) {\\n super.onConfigurationChanged(newConfig);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1167a60ff5910e8d56c27bf27196cc8d\",\n \"score\": \"0.5413753\",\n \"text\": \"@Override\\n \\tpublic void onConfigurationChanged(Configuration newConfig)\\n \\t{\\n \\t\\tsuper.onConfigurationChanged(newConfig);\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d08357804a6ed37c01107c4fb87b65b\",\n \"score\": \"0.54119307\",\n \"text\": \"UBOCutConfig() { super(1); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3705ad01453d9caba714a6d887c07ad8\",\n \"score\": \"0.5406033\",\n \"text\": \"@Override\\n protected ResourceConfig configure() {\\n OpenSilex.setup(new HashMap<String, String>() {\\n {\\n put(OpenSilex.PROFILE_ID_ARG_KEY, OpenSilex.TEST_PROFILE_ID);\\n }\\n });\\n\\n ResourceConfig resourceConfig = new RestApplication(OpenSilex.getInstance());\\n\\n // create a mock for HttpServletRequest which is not available with grizzly\\n final HttpServletRequest request = Mockito.mock(HttpServletRequest.class);\\n resourceConfig.register(new AbstractBinder() {\\n @Override\\n protected void configure() {\\n bind(request).to(HttpServletRequest.class);\\n }\\n });\\n\\n return resourceConfig;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db0a4679367ff00a638d444d27d15d6a\",\n \"score\": \"0.53977036\",\n \"text\": \"@Override\\n\\tpublic void configure() throws ConfigurationException {\\n\\t\\tsuper.configure();\\n\\t\\tappConstants = AppConstants.getInstance(getConfigurationClassLoader());\\n\\t\\tif (StringUtils.isNotEmpty(getFilename()) && !isLookupAtRuntime()) {\\n\\t\\t\\tURL resource = null;\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tresource = ClassUtils.getResourceURL(this, getFilename());\\n\\t\\t\\t} catch (Throwable e) {\\n\\t\\t\\t\\tthrow new ConfigurationException(\\\"got exception searching for [\\\"+getFilename()+\\\"]\\\", e);\\n\\t\\t\\t}\\n\\t\\t\\tif (resource==null) {\\n\\t\\t\\t\\tthrow new ConfigurationException(\\\"cannot find resource [\\\"+getFilename()+\\\"]\\\");\\n\\t\\t\\t}\\n try {\\n\\t\\t\\t\\treturnString = Misc.resourceToString(resource, Misc.LINE_SEPARATOR);\\n } catch (Throwable e) {\\n throw new ConfigurationException(\\\"got exception loading [\\\"+getFilename()+\\\"]\\\", e);\\n }\\n }\\n if ((StringUtils.isEmpty(getFilename())) && (StringUtils.isEmpty(getFilenameSessionKey())) && returnString==null) { // allow an empty returnString to be specified\\n throw new ConfigurationException(\\\"has neither filename nor filenameSessionKey nor returnString specified\\\");\\n }\\n\\t\\tif (StringUtils.isNotEmpty(replaceFrom)) {\\n\\t\\t\\treturnString = replace(returnString, replaceFrom, replaceTo );\\n\\t\\t}\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f3775eecfbcfa3c355037a9fd205442\",\n \"score\": \"0.5396573\",\n \"text\": \"@Override\\n\\tpublic void setConf(Configuration arg0) {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d55508d349939b91dd26cc3f54b61e63\",\n \"score\": \"0.53951204\",\n \"text\": \"public interface Configuration {\\r\\n\\t\\r\\n\\t/**\\r\\n\\t * Should return the value configured for key \\\"string.value\\\"\\r\\n\\t * @return\\r\\n\\t */\\r\\n\\t@Bind(\\\"string.value\\\")\\r\\n\\tString getStringValue();\\r\\n\\r\\n\\t/**\\r\\n\\t * Should return the value configured for key \\\"integer.value\\\"\\r\\n\\t * @return\\r\\n\\t */\\r\\n\\t@Bind(\\\"integer.value\\\")\\r\\n\\tInteger getIntegerValue();\\r\\n\\r\\n\\t/**\\r\\n\\t * Should return the value configured for key \\\"boolean.value\\\"\\r\\n\\t * @return\\r\\n\\t */\\r\\n\\t@Bind(\\\"boolean.value\\\")\\r\\n\\tBoolean getBooleanValue();\\r\\n\\r\\n\\t/**\\r\\n\\t * Should return the value configured for key \\\"float.value\\\"\\r\\n\\t * @return\\r\\n\\t */\\r\\n\\t@Bind(\\\"float.value\\\")\\r\\n\\tFloat getFloatValue();\\r\\n\\t\\r\\n\\t/**\\r\\n\\t * Should return the value configured for key \\\"long.value\\\"\\r\\n\\t * @return\\r\\n\\t */\\r\\n\\t@Bind(\\\"long.value\\\")\\r\\n\\tLong getLongValue();\\r\\n\\t\\r\\n\\t/**\\r\\n\\t * Should return the value configured for key \\\"p.int.value\\\"\\r\\n\\t * @return\\r\\n\\t */\\r\\n\\t@Bind(\\\"p.int.value\\\")\\r\\n\\tint getIntValue();\\r\\n\\t\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64bb55b5597987566ecd418a8c81afe1\",\n \"score\": \"0.53923184\",\n \"text\": \"private CloneConfig() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e88334810215840b929eaa44a9f296b1\",\n \"score\": \"0.5384285\",\n \"text\": \"@Override public void onConfigurationChanged(Configuration newConfig) {\\n\\n super.onConfigurationChanged(newConfig);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ecf321e2bdf9900551f3614dc8abdfa2\",\n \"score\": \"0.53803205\",\n \"text\": \"@Override\\r\\n\\tpublic void configuration() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16a49d75bb9e8bfefa1b4b8ba15d9fff\",\n \"score\": \"0.5367917\",\n \"text\": \"protected void configure() {\\n bindConstant().annotatedWith(JpaUnit.class).to(\\\"testUnit\\\");\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5b1a0caa4ccb2c8115705f71ac27015\",\n \"score\": \"0.5361695\",\n \"text\": \"@Override\\n\\t\\tpublic void configure(Binder binder) {\\n\\t\\t\\t\\n\\t\\t\\tbinder.bind(RemoteService.class).toInstance(mockRemote); //see above comment on the field mockRemote\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"97bbc38833ab6d58b6a0a6cebe20d222\",\n \"score\": \"0.5359885\",\n \"text\": \"@Override\\n\\t\\tpublic void configure(Binder binder) {\\n\\t\\t\\tbinder.bind(IFoodService.class).to(PizzaService.class);\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d098334a2e99fecb7de25053e462b6ae\",\n \"score\": \"0.5323433\",\n \"text\": \"public Config() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"025f2ecfc07163eb41b8ddf72c48139f\",\n \"score\": \"0.5323332\",\n \"text\": \"public void configure(Binder binder)\\n {\\n binder.bind(Add.class).to(SimpleAdd.class);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f74df7fd65117921dcd42e66156239de\",\n \"score\": \"0.5320623\",\n \"text\": \"@Override\\n public void onConfigurationChanged(final Configuration newConfig) {\\n super.onConfigurationChanged(newConfig);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8c28471b2672a8a53f1328c01940a45\",\n \"score\": \"0.5315308\",\n \"text\": \"@Override\\n protected void configure() {\\n IntrospectingBinder introspectingBinder =\\n IntrospectingBinder.newIntrospectingBinder(binder());\\n introspectingBinder.bindIntrospectively(\\n IntrospectionTarget.class,\\n TestScoped.class,\\n OUT_OF_SCOPE_PROVIDER);\\n\\n bindScope(TestScoped.class, testScope);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe3049b42ead386a2140d5bb60f1a526\",\n \"score\": \"0.5315272\",\n \"text\": \"public void configure(AppRegistry registry) throws ConfigurationException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e60119e6f3baec253a2d27641e40e32e\",\n \"score\": \"0.52992576\",\n \"text\": \"@Override\\r\\n\\tprotected void configure() {\\n\\t\\tbind(MessageService.class).to(EmailService.class);\\r\\n\\t\\t\\r\\n\\t\\tbind(MessageService.class).annotatedWith(Names.named(\\\"smsService\\\"))\\r\\n\\t\\t .to(SMSService.class);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02302533fe9c347fe380b9f55f774d65\",\n \"score\": \"0.52814376\",\n \"text\": \"@Override\\r\\n\\tpublic void configure(Binder arg0) {\\n\\t\\targ0.bind(Hello.class).annotatedWith(Names.named(\\\"impl1\\\")).to(HelloImpl1111.class);\\r\\n\\t\\targ0.bind(Hello.class).annotatedWith(Names.named(\\\"impl2\\\")).to(HelloImpl2222.class);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c74632e97255937a6dc68e5e65276333\",\n \"score\": \"0.5265644\",\n \"text\": \"public interface ConfigService {\\n\\n Config getConfig();\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b73ba5fe678f5b4027b4ef7b38bbd0a\",\n \"score\": \"0.52645445\",\n \"text\": \"private ConfigManager35(){\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dd2fa24502de56178916e2850ac5fae\",\n \"score\": \"0.5260456\",\n \"text\": \"public interface Configured {\\n\\n public void configure(Configuration cfg) throws ConfigurationException;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fe98a56c53346987b8dcd1ca0121d5e\",\n \"score\": \"0.5259128\",\n \"text\": \"@Override\\n\\tpublic void onConfigurationChanged(Configuration newConfig) {\\n\\t\\tsuper.onConfigurationChanged(newConfig);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fe98a56c53346987b8dcd1ca0121d5e\",\n \"score\": \"0.5259128\",\n \"text\": \"@Override\\n\\tpublic void onConfigurationChanged(Configuration newConfig) {\\n\\t\\tsuper.onConfigurationChanged(newConfig);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fe98a56c53346987b8dcd1ca0121d5e\",\n \"score\": \"0.5259128\",\n \"text\": \"@Override\\n\\tpublic void onConfigurationChanged(Configuration newConfig) {\\n\\t\\tsuper.onConfigurationChanged(newConfig);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a3fbdbfe0f61cb0302c8427b8a9cb5e\",\n \"score\": \"0.5253836\",\n \"text\": \"public void configure(Map parameters);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"61182a18333c5b4e21a0d65bc9d77d69\",\n \"score\": \"0.5251441\",\n \"text\": \"protected void configure(final JsonObject config) {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"585a777472655f19f0552332e9de5ef3\",\n \"score\": \"0.5250147\",\n \"text\": \"@Override\\n\\tpublic void configure(Map<String, String> arg0) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9d9b7fc649eec22e942a35bc4dd2722\",\n \"score\": \"0.52480024\",\n \"text\": \"private void configureDagger(){\\n AndroidSupportInjection.inject(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6756c481f876139c434648b0ad0416b8\",\n \"score\": \"0.5244296\",\n \"text\": \"public INIConfiguration()\\n {\\n super();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f50e0400a429ef870c54b6f1f984bfc7\",\n \"score\": \"0.5244054\",\n \"text\": \"@SuppressWarnings(\\\"unchecked\\\")\\r\\n\\tpublic static <T extends Configurable> T createProxy(Class<T> targetClass,\\r\\n\\t\\t\\tClass<?>[] argsType, Object[] args) {\\r\\n\\r\\n\\t\\tEnhancer enhancer = new Enhancer();\\r\\n\\t\\tenhancer.setSuperclass(targetClass);\\r\\n\\t\\tenhancer.setInterfaces(new Class[] { ConfigModule.class });\\r\\n\\t\\t// Kiểm tra interface cài đặt\\r\\n\\t\\tSet<Class<?>> interfaceList = ReflectUtils.getAllInterfaces(\\r\\n\\t\\t\\t\\ttargetClass, true);\\r\\n\\t\\tif (AbstractConfig.class.isAssignableFrom(targetClass)) {\\r\\n\\t\\t\\tinterfaceList.remove(SystemConfig.class);\\r\\n\\t\\t}\\r\\n\\t\\tHashMap<String, Object> optionsList = new HashMap<String, Object>();\\r\\n\\t\\tHashMap<Class<?>, Object> configObjList = new HashMap<Class<?>, Object>();\\r\\n\\t\\tfor (Class<?> interfaze : interfaceList) {\\r\\n\\t\\t\\tif (JGentle.containsConfigClass(interfaze)) {\\r\\n\\t\\t\\t\\tClass<?> clazz = JGentle.getConfigClass(interfaze);\\r\\n\\t\\t\\t\\tObject obj = null;\\r\\n\\t\\t\\t\\tobj = ReflectUtils.createInstance(clazz);\\r\\n\\t\\t\\t\\t// Nếu config class extends từ AbstractConfigModule\\r\\n\\t\\t\\t\\tif (AbstractConfigModule.class.isAssignableFrom(clazz)) {\\r\\n\\t\\t\\t\\t\\ttry {\\r\\n\\t\\t\\t\\t\\t\\t((AbstractConfigModule) obj).setOptionsList(\\r\\n\\t\\t\\t\\t\\t\\t\\t\\toptionsList, ReflectUtils.getSupportedMethod(\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\ttargetClass, \\\"configure\\\", null));\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tcatch (NoSuchMethodException e) {\\r\\n\\t\\t\\t\\t\\t\\tif (log.isFatalEnabled()) {\\r\\n\\t\\t\\t\\t\\t\\t\\tlog.fatal(\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\\"Could not found 'configure' method on configurable class [\\\"\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ targetClass + \\\"]\\\", e);\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tconfigObjList.put(interfaze, obj);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tenhancer.setCallback(new ConfigurationProxy(targetClass, optionsList,\\r\\n\\t\\t\\t\\tconfigObjList));\\r\\n\\t\\tObject result = null;\\r\\n\\t\\tif (argsType != null && args != null) {\\r\\n\\t\\t\\tresult = enhancer.create(argsType, args);\\r\\n\\t\\t}\\r\\n\\t\\telse {\\r\\n\\t\\t\\tresult = enhancer.create();\\r\\n\\t\\t}\\r\\n\\t\\t// thiết lập optionsList trong trường hợp targetClass kế thừa từ\\r\\n\\t\\t// AbstractConfig\\r\\n\\t\\tif (AbstractConfig.class.isAssignableFrom(targetClass)) {\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\t((AbstractConfig) result).setOptionsList(optionsList,\\r\\n\\t\\t\\t\\t\\t\\tReflectUtils.getSupportedMethod(targetClass,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\\"configure\\\", null));\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tcatch (NoSuchMethodException e) {\\r\\n\\t\\t\\t\\tif (log.isFatalEnabled()) {\\r\\n\\t\\t\\t\\t\\tlog.fatal(\\r\\n\\t\\t\\t\\t\\t\\t\\t\\\"Could not found 'configure' method on configurable class [\\\"\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ targetClass + \\\"]\\\", e);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn (T) result;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5cc8ee057a619ff4b5ba770f6f0c94c9\",\n \"score\": \"0.522917\",\n \"text\": \"public void configure() throws Exception;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bafd921916c1c91fe535bb408e761c36\",\n \"score\": \"0.5225257\",\n \"text\": \"public interface ConfigInterface {\\n\\t\\n\\t/**\\n\\t * Restituisce una voce di configurazione. La voce è un elemento di testo\\n\\t * che può essere complesso (es. XML). I valori restituiti sono relativi\\n\\t * alla versione di configurazione con cui è stato avviato il sistema.\\n\\t * @param name Il codice della voce da restituire.\\n\\t * @return Il testo della voce di configurazione.\\n\\t */\\n\\tpublic String getConfigItem(String name);\\n\\t\\n\\t/**\\n\\t * Aggiorna una voce di configurazione. La voce è un elemento di testo\\n\\t * che può essere complesso (es. XML). \\n\\t * @param name Il codice della voceda aggiornare.\\n\\t * @param config Il testo della voce di configurazione da aggiornare.\\n\\t * @throws ApsSystemException In caso di errore nell'aggiornamento\\n\\t */\\n\\tpublic void updateConfigItem(String name, String config) throws ApsSystemException;\\n\\t\\n\\t/**\\n\\t * Restituisce un parametro di configurazione. \\n\\t * Un parametro è una stringa semplice.\\n\\t * @param name Il nome del parametro\\n\\t * @return Il valore del parametro\\n\\t */\\n\\tpublic String getParam(String name);\\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dab2b864348908c4ee22f87c34f78361\",\n \"score\": \"0.5217674\",\n \"text\": \"public interface Configurable {\\n\\tvoid setConf(Configuration conf);\\n\\tConfiguration getConf();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"431f1c3aa84d0dd522fe66f097634189\",\n \"score\": \"0.52162796\",\n \"text\": \"public interface ConfigurationProvider {\\n\\n /** Get simulation settings. */\\n Configuration getConfiguration();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07cc008ac808a81b10575e47058339a5\",\n \"score\": \"0.52140445\",\n \"text\": \"@SuppressWarnings(\\\"unchecked\\\")\\n public <T extends Annotation> ConfigBean<T> getConfAnnotation(Class<T> baseVannitationClass, String annotatedClassFQN, String annotationClassFQN) {\\n String name = baseVannitationClass.getSimpleName();\\n HashSet<String> val = supportedAnnotationTypes.get(VannitationType.valueOf(name));\\n if (!val.contains(annotationClassFQN)) {\\n logger.fine(\\\"Annotation [\\\" + annotatedClassFQN + \\\"] is not supported. We support: \\\" + val);\\n return null;\\n }\\n KeyPair k = new KeyPair(annotatedClassFQN, annotationClassFQN);\\n if (configAnnotations.containsKey(k)) {\\n return configAnnotations.get(k);\\n } else {\\n Annotation[] annotationsOnTheClass = getAnnotationsFromFQN(annotatedClassFQN);\\n for (Annotation a : annotationsOnTheClass) {\\n if (a.annotationType().getName().equals(annotationClassFQN)) {\\n ConfigBean<T> configBean = AnnotationConfigMerger.merge(baseVannitationClass, a);\\n configAnnotations.put(k, configBean);\\n return configBean;\\n }\\n }\\n logger.fine(\\\"[\\\" + annotatedClassFQN + \\\"] appears not to be annotated with [\\\" + annotationClassFQN + \\\"] (hint: Have you set the retention policy of the annotation to RUNTIME ? @Retention(RetentionPolicy.RUNTIME))\\\");\\n return null;\\n }\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":1196,"cells":{"query_id":{"kind":"string","value":"8682b3f64df9756f53e2f8913e46fbc1"},"query":{"kind":"string","value":"Return the number of elements currently in the queue."},"positive_passages":{"kind":"list like","value":[{"docid":"3b931dd8c9b2d6a264414a47064a8ca0","score":"0.0","text":"public int size();","title":""}],"string":"[\n {\n \"docid\": \"3b931dd8c9b2d6a264414a47064a8ca0\",\n \"score\": \"0.0\",\n \"text\": \"public int size();\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"9caf871036aedac15409b1d6943480fe","score":"0.8363061","text":"public int size() {\n return queue.size();\n }","title":""},{"docid":"114824896030a049bbd1e1b3b8a75723","score":"0.83550394","text":"public int size() {\n\t\treturn queue.size();\n\t}","title":""},{"docid":"02c40e5bbdae74df81b16aa3433e25fe","score":"0.8312843","text":"public int size(){\r\n\t\treturn queue.size();\r\n\t}","title":""},{"docid":"3c3005a8e294d7bfb35804c8bb2b2b11","score":"0.83027464","text":"public int getCount() {\n return queue.size();\n }","title":""},{"docid":"116ba2a3e8e12089b429616aa2cd8291","score":"0.828576","text":"public int size() {\n return this.queue.size();\n }","title":""},{"docid":"8100034db1bdda3357669b8256891dd0","score":"0.8266784","text":"public int size() {\n return _queue.size();\n }","title":""},{"docid":"f15dd853b54d8a2c3fbff241eaaa2830","score":"0.79548216","text":"public int queueSize() {\n\t\treturn queue.size();\t\n\t}","title":""},{"docid":"bddec0fee9646422fd190096454daca5","score":"0.78513473","text":"public int size() \r\n {\r\n if(measurementQueue==null) return 0;\r\n \r\n return measurementQueue.size();\r\n }","title":""},{"docid":"66d7bb77992868ba05e39369316227d6","score":"0.78471047","text":"public static int size() {\n System.out.println();\n System.out.println(\"The size of the queue is: \" + queue.size());\t \n return queue.size();\n }","title":""},{"docid":"798245fbe2e0a77c03f9c4a7eedd6c81","score":"0.7698604","text":"int getQueueSize();","title":""},{"docid":"7c7b7bae0522f72a1c9530ff6b78723f","score":"0.7695969","text":"public int size() {\n processQueue();\n return weakCache.size();\n }","title":""},{"docid":"c066457416d74c699cf631321a224d4d","score":"0.7694315","text":"public int size() {\n\t\t//Because we're the only consumer, we know nothing will be removed while\n\t\t//we're computing the size, so we know there are at least (rear - front)\n\t\t//elements already added.\n\t\treturn (int)(rear.get() - front.get());\n\t}","title":""},{"docid":"3fe4d89e5ddfcc434784a13c2a672131","score":"0.76852775","text":"public int inputQueueSize() {\n\t\tsynchronized (inputQueue) {\n\t\t\treturn inputQueue.size();\n\t\t}\n\t}","title":""},{"docid":"443331b7a8e5d2982dc45784423a16ab","score":"0.7684611","text":"public int size()\n\t{\n\t\tif(isEmpty())\n\t\t\treturn 0;\n\t\tif(isFull())\n\t\t\treturn queueArray.length;\n\t\t\n\t\tint i=front;\n\t\tint sz=0;\n\t\tif(front<=rear)\n\t\t\twhile(i<=rear)\n\t\t\t{\n\t\t\t\tsz++;\n\t\t\t\ti++;\n\t\t\t}\n\t\telse\n\t\t{\n\t\t\twhile(i<=queueArray.length-1)\n\t\t\t{\n\t\t\t\tsz++;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\ti=0;\n\t\t\twhile(i<=rear)\n\t\t\t{\n\t\t\t\tsz++;\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t\treturn sz;\n\t}","title":""},{"docid":"5a494e55b9510a270255e2df5b5931dd","score":"0.7605173","text":"int getNumEvents() {\n int cnt = eventCount;\n for (Entry entry : queue) {\n cnt += entry.eventCount;\n }\n return cnt;\n }","title":""},{"docid":"972e98824f339d82bf8531bcb0b8369f","score":"0.75597","text":"public int getQueueSize() {\r\n\t\treturn this.queue.size();\r\n\t}","title":""},{"docid":"02b1e7d734abaaae43d4c9d7b274affd","score":"0.7555043","text":"public long getQueueSize(){\n return queue.size();\n }","title":""},{"docid":"8a06cd85dd7b72159993dca3a288f0d3","score":"0.7550924","text":"public int numVehiclesInQueue() {\r\n\t\treturn vehiclesInQueue.size();\r\n\t}","title":""},{"docid":"0f1d6660c21db863df709cee6a847453","score":"0.7453111","text":"public int getRunnableCount() {\n return queue.size();\n }","title":""},{"docid":"0c20129e415714ba99a771c626df5657","score":"0.7425351","text":"public abstract int getQueueLength();","title":""},{"docid":"b11fead2b76df9469ec1d5e18232af01","score":"0.74243677","text":"public int size()\n\t{\n\t\treturn requestQueue != null ? requestQueue.size() : 0;\n\t}","title":""},{"docid":"23f1d9e432c1e0035415aa3437b29c8e","score":"0.7416424","text":"public int size() {\r\n\t\treturn q.size();\r\n\t}","title":""},{"docid":"e19528108c763b4811044bb57dc2451c","score":"0.72666514","text":"public int size() {\r\n if (NumItems > Integer.MAX_VALUE) {\r\n return Integer.MAX_VALUE;\r\n }\r\n return NumItems;\r\n }","title":""},{"docid":"e660c611fcc13b6c227773f56bdac31c","score":"0.72418004","text":"public int queueArrayLength(){\n\t\treturn queueArray.length;\n\t}","title":""},{"docid":"da9bd438223f081fb2ce7eeac36004f1","score":"0.7230721","text":"public synchronized int size() {\n return count;\n }","title":""},{"docid":"0b2a81ab923b11105b1c90f03e78f898","score":"0.7206644","text":"public int size() {\n \t\n \tint i = 0;\n \t\n \twhile(this.front != null) {\n \t\ti = i+1;\n \t\tthis.front = this.front.next; \n \t}\n \t\n \treturn i;\n \t\n }","title":""},{"docid":"ba91344250898ab984848317cccc1784","score":"0.7199739","text":"final int getQueueSize() {\n // suppress momentarily negative values\n return Math.max(0, sp - base);\n }","title":""},{"docid":"a302460a5732d471b6a98383ffd16da4","score":"0.7198489","text":"public int size() {\n\t\t// DO NOT CHANGE THIS METHOD\n\t\treturn numElements;\n\t}","title":""},{"docid":"9c18a200318bf90ab56c398b0dda630a","score":"0.7178178","text":"public int size() {\n\t\treturn this.elements.size();\n\t}","title":""},{"docid":"84720fb66dd7e3c69aa154cfb0cf5ba3","score":"0.71674484","text":"public int getQueueSize() {\n return queue.getQueueSize();\n }","title":""},{"docid":"01e055cbe8d3ea4758469f05512890e8","score":"0.71348286","text":"public int size() {\n\t\treturn elements.size();\n\t}","title":""},{"docid":"ff174edc1c328647d2bd8b5c15fe4b1f","score":"0.7131808","text":"Long getNumberOfElement();","title":""},{"docid":"a09b850ad1027fdd41ede9e78bb86e8f","score":"0.71224356","text":"public int size() {\r\n\t\treturn elements.size();\r\n\t}","title":""},{"docid":"2b12a79aa9214945e8bd74182e996d22","score":"0.710011","text":"public int size() {\n return numOfElements;\n }","title":""},{"docid":"268c6bcd285e9ac0bcf52c916e9ee2e3","score":"0.70930123","text":"public int size() {\n\n return elements.size();\n }","title":""},{"docid":"201bc462947333747f0958c0a7e399c9","score":"0.7092319","text":"public int getNumQueues() {\n return queues.size();\n }","title":""},{"docid":"e1f7e94f9a53bc7528a6d455c214f117","score":"0.7087996","text":"public int size() \r\n\t{\r\n\t\treturn getCounter();\r\n\t}","title":""},{"docid":"4985f41dac659d6c48a20475dad9532a","score":"0.7084904","text":"public int size(){\n\t\tListUtilities start = this.returnToStart();\n\t\tint count = 1;\n\t\twhile(start.nextNum != null){\n\t\t\tcount++;\n\t\t\tstart = start.nextNum;\n\t\t}\n\t\treturn count;\n\t}","title":""},{"docid":"275d2e0a364739b10945e181db277a06","score":"0.70772254","text":"public final int size() {\n int size = 0;\n final Iterator iterator = this.iterator();\n while (iterator.hasNext()) {\n size++;\n iterator.next();\n }\n return size;\n }","title":""},{"docid":"b12217bb645196ca6b2a39b86d2751a6","score":"0.7061176","text":"public int queueSize() {\n return executor.getQueue().size();\n }","title":""},{"docid":"e2b2f1da3d068af1331657624fdb946a","score":"0.7060402","text":"public int getSize() {\n\t\treturn numElements;\n\t}","title":""},{"docid":"028a4b3c72b9f098f858a93dbe90a5eb","score":"0.70569503","text":"public int size() {\n return elements.size();\n }","title":""},{"docid":"c8399ae0111642731b36ab681634a627","score":"0.70562583","text":"public int size() {\r\n int temp = 0;\r\n for (int i = 0; i < elem.length; i++) {\r\n if (elem[i] != null) {\r\n temp++;\r\n }\r\n }\r\n return temp;\r\n }","title":""},{"docid":"f6330ef1831154e7a0b07e0f91e0bf65","score":"0.70525116","text":"public int size() {\r\n assert numElements >= 0 : numElements;\r\n assert numElements <= capacity : numElements;\r\n assert numElements >= elementsByFitness.size() : numElements;\r\n return numElements;\r\n }","title":""},{"docid":"6c2de4264b1eb6030a98f96bd893d40d","score":"0.70521","text":"public final int size()\n {\n return m_count;\n }","title":""},{"docid":"a345cba904ac2a22df659fef212f8091","score":"0.7051663","text":"public int size() {\n\t\treturn elements;\n\t}","title":""},{"docid":"e43343d4c04fcc1176f389aeef4ce4f7","score":"0.7046314","text":"public int size() {\n int found = 0;\n Node<T> it = head.get();\n // Do a raw count.\n for (int i = 0; i < capacity; i++) {\n if (!it.free.get()) {\n found += 1;\n }\n it = it.next;\n }\n return found;\n }","title":""},{"docid":"5fcb069826257600841d3455a03c899f","score":"0.7044597","text":"public int size() {\r\n\t\treturn elements;\r\n\t}","title":""},{"docid":"c142163ad0f133ce700c6ee4eddf17ac","score":"0.7044095","text":"public static int size() \r\n\t{\r\n\t\treturn m_count;\r\n }","title":""},{"docid":"db74b99a5f102a37351dd34eb827a3a3","score":"0.70253694","text":"public int size()\r\n {\r\n return count;\r\n }","title":""},{"docid":"b09d9bee6578ca4980392888010778ad","score":"0.7010485","text":"public int size() {\n\t\treturn count;\n\t}","title":""},{"docid":"b09d9bee6578ca4980392888010778ad","score":"0.7010485","text":"public int size() {\n\t\treturn count;\n\t}","title":""},{"docid":"b09d9bee6578ca4980392888010778ad","score":"0.7010485","text":"public int size() {\n\t\treturn count;\n\t}","title":""},{"docid":"6380e3475d5525f3961c5964ea9770c6","score":"0.70094955","text":"public int size()\n\t{\n\t\treturn m_elements.size();\n\t}","title":""},{"docid":"d5558311e10c8e2759a985d2f1b42bfd","score":"0.70091474","text":"public int size()\r\n\t{\r\n\t\treturn count;\r\n\t}","title":""},{"docid":"c210228ebdfb8bda4e7c397037a962f0","score":"0.7000224","text":"@Override\n public int queueLength() {\n return this.job_queue.size();\n }","title":""},{"docid":"459824cf167f45e04456b58a2b712a22","score":"0.6997246","text":"@Override\n\tpublic int size() {\n\n\t\treturn this.numOfItems;\n\t}","title":""},{"docid":"a6a2bab08a002f52d5a33c04023e2610","score":"0.6992774","text":"public int size() {\n return count;\n }","title":""},{"docid":"dd5b24a47eaf7c003424285c07e2e3fe","score":"0.698845","text":"public int size() {\n\t\tint numElements = 0;\n\t\tfor (int i = 0; i < this.size; i++) {\n\t\t\tif (list[i] != null) {\n\t\t\t\tnumElements++;\n\t\t\t}\n\t\t}\n\t\treturn numElements;\n\t}","title":""},{"docid":"7acd4251c6f6e9d04ba306460e450c07","score":"0.6978139","text":"public int size() {\n return elements;\n }","title":""},{"docid":"ab1cfcc6275c6b2f38b7e0c4ca04b4b4","score":"0.6976907","text":"public int size()\n {\n return count;\n }","title":""},{"docid":"cb55f7ae411b272aece5420ca783260d","score":"0.6974407","text":"public int getNumOfElements() {\n return numOfElements;\n }","title":""},{"docid":"da978dd18858f8b0eb3de9b153b57803","score":"0.69679123","text":"public int getNumElements()\n {\n return numElements;\n }","title":""},{"docid":"a99bade54b165c97113343a59f4d0bfb","score":"0.6964067","text":"public int size() {\n\t\treturn N;\n\t}","title":""},{"docid":"a99bade54b165c97113343a59f4d0bfb","score":"0.6964067","text":"public int size() {\n\t\treturn N;\n\t}","title":""},{"docid":"a99bade54b165c97113343a59f4d0bfb","score":"0.6964067","text":"public int size() {\n\t\treturn N;\n\t}","title":""},{"docid":"a99bade54b165c97113343a59f4d0bfb","score":"0.6964067","text":"public int size() {\n\t\treturn N;\n\t}","title":""},{"docid":"a99bade54b165c97113343a59f4d0bfb","score":"0.6964067","text":"public int size() {\n\t\treturn N;\n\t}","title":""},{"docid":"8170a7bacef127e910fb51f9f6562121","score":"0.6949579","text":"public void incTotalOfQueueEntries() {\n totalOfQueueEntries++;\n }","title":""},{"docid":"62991bf63eebe989a22679b0d2559b9b","score":"0.69456923","text":"public final int size()\r\n/* 41: */ {\r\n/* 42:215 */ long after = lvConsumerIndex();\r\n/* 43: */ for (;;)\r\n/* 44: */ {\r\n/* 45:219 */ long before = after;\r\n/* 46:220 */ long currentProducerIndex = lvProducerIndex();\r\n/* 47:221 */ after = lvConsumerIndex();\r\n/* 48:222 */ if (before == after)\r\n/* 49: */ {\r\n/* 50:224 */ long size = currentProducerIndex - after >> 1;\r\n/* 51:225 */ break;\r\n/* 52: */ }\r\n/* 53: */ }\r\n/* 54: */ long size;\r\n/* 55:230 */ if (size > 2147483647L) {\r\n/* 56:232 */ return 2147483647;\r\n/* 57: */ }\r\n/* 58:236 */ return (int)size;\r\n/* 59: */ }","title":""},{"docid":"66115ac831778e1051fc68fbd1fb790e","score":"0.69308406","text":"public synchronized int getSize() {\r\n\t\treturn queueManagers.size();\r\n\t}","title":""},{"docid":"40f02aae413dd4cedd27666a27fd812a","score":"0.692803","text":"public int numIncoming() {\r\n int result = incoming.size();\r\n return result;\r\n }","title":""},{"docid":"8f40e6df93db096d2ad3dd74f259e608","score":"0.6918851","text":"public int size() {\n return qSize;\n }","title":""},{"docid":"5d7417bd21cfcda19d9bedd7fb3a6286","score":"0.6918396","text":"public int getDequeueCount() {\n\t\treturn m_DequeueCount;\n\t}","title":""},{"docid":"f4d77000a692df53b1e6f0b55c34edf6","score":"0.6913163","text":"@Override\n public int size() {\n // Returns the number of elements stored in the heap\n return nelems;\n }","title":""},{"docid":"4e31e27bfbb6fd41f6e5d14a3dfe82d8","score":"0.6911638","text":"public int getNrOfElements() {\n return this.nrOfElements;\n }","title":""},{"docid":"bddf91613c495ff0c31ddb7381081ec9","score":"0.69067305","text":"public int size() {\n\t\treturn heap.size();\n\t}","title":""},{"docid":"16f197de58e0df6ba5b1d9deeb476c45","score":"0.69054765","text":"public int size()\r\n\t{\r\n\t\treturn numItems;\r\n\r\n\t}","title":""},{"docid":"4c43d9153d32d6358185f9054df28174","score":"0.690355","text":"public int getNumElements() {\n return numElements;\n }","title":""},{"docid":"4c43d9153d32d6358185f9054df28174","score":"0.690355","text":"public int getNumElements() {\n return numElements;\n }","title":""},{"docid":"ba5d708d6caeccc6133199e3a1c6b2a0","score":"0.69025123","text":"public int size()\n {\n return N;\n }","title":""},{"docid":"4116aa536a276a92b036b786d7acdc68","score":"0.6897951","text":"public int size() {\n\t\tint result = 0;\n\t\tfor (E val: this)\n\t\t\tresult++;\n\t\treturn result;\n\t}","title":""},{"docid":"6f5aa9ea7e514b58ca8df603e400dcd2","score":"0.68964005","text":"public int size() {\n return N;\n }","title":""},{"docid":"6f5aa9ea7e514b58ca8df603e400dcd2","score":"0.68964005","text":"public int size() {\n return N;\n }","title":""},{"docid":"6f5aa9ea7e514b58ca8df603e400dcd2","score":"0.68964005","text":"public int size() {\n return N;\n }","title":""},{"docid":"6f5aa9ea7e514b58ca8df603e400dcd2","score":"0.68964005","text":"public int size() {\n return N;\n }","title":""},{"docid":"6f5aa9ea7e514b58ca8df603e400dcd2","score":"0.68964005","text":"public int size() {\n return N;\n }","title":""},{"docid":"6f5aa9ea7e514b58ca8df603e400dcd2","score":"0.68964005","text":"public int size() {\n return N;\n }","title":""},{"docid":"6f5aa9ea7e514b58ca8df603e400dcd2","score":"0.68964005","text":"public int size() {\n return N;\n }","title":""},{"docid":"0b240f4ec2604f4a41b8e521c2e20d2a","score":"0.6894637","text":"public int getNumElements() {\n\t\treturn numElements;\n\t}","title":""},{"docid":"738faf8ae31c5fa75dc91b54cb8a35d6","score":"0.6893682","text":"public int size() {\n return numItems;\n }","title":""},{"docid":"1b6d8c01599066b5db8b8e84ea619502","score":"0.6887644","text":"public int size() {\r\n return N;\r\n }","title":""},{"docid":"e2e29057e911938b28ae51be16e09b8a","score":"0.68826175","text":"public int size()\r\n\t{\r\n\t\treturn heap.size();\r\n\t}","title":""},{"docid":"1620d12f213633ffa241f2688904b721","score":"0.6879665","text":"public int size() {\n\t\tint count = 0;\n\t\tListNode current = front;\n\t\twhile (current != null) {\n\t\t\tcurrent = current.next;\n\t\t\tcount++;\n\t\t}\n\t\treturn count;\n\t}","title":""},{"docid":"0b2822ce115d5f004593770a53943a1e","score":"0.68678325","text":"public int getNumberOfElements();","title":""},{"docid":"ea22aef3b43ad71ebb94d126f309786a","score":"0.68677384","text":"public int size()\n\t\t{\n\t\treturn N;\n\t\t}","title":""},{"docid":"24c32e5f23b85c54756a8c6b4f346eba","score":"0.6867729","text":"public int size() { return dequeSize; }","title":""},{"docid":"41db71d8c25b561fe3049bca5de07cde","score":"0.68672484","text":"public int size()\n { \t\n \t//initialize a counter to measure the size of the list\n int sizeVar = 0;\n //create local node variable to update in while loop\n LinkedListNode<T> localNode = getFirstNode();\n \n //update counter while there are still nodes\n while(localNode != null)\n {\n sizeVar += 1;\n localNode = localNode.getNext();\n }\n \n return sizeVar;\n }","title":""},{"docid":"485289b42c0daa94a7d901f6f9d03cae","score":"0.6864032","text":"@Override\n\tpublic int size() {\n\t\treturn this.numberOfElements;\n\t}","title":""},{"docid":"b849b3624cbc2abb068276073959d90c","score":"0.6859345","text":"int size() {\n if (this.next.equals(this)) {\n return 0;\n }\n return this.next.size(this);\n }","title":""},{"docid":"41ca9f367bcf8993cac116ef75a88d10","score":"0.68590283","text":"public int size() {\n // DO NOT MODIFY THIS METHOD!\n return size;\n }","title":""}],"string":"[\n {\n \"docid\": \"9caf871036aedac15409b1d6943480fe\",\n \"score\": \"0.8363061\",\n \"text\": \"public int size() {\\n return queue.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"114824896030a049bbd1e1b3b8a75723\",\n \"score\": \"0.83550394\",\n \"text\": \"public int size() {\\n\\t\\treturn queue.size();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02c40e5bbdae74df81b16aa3433e25fe\",\n \"score\": \"0.8312843\",\n \"text\": \"public int size(){\\r\\n\\t\\treturn queue.size();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c3005a8e294d7bfb35804c8bb2b2b11\",\n \"score\": \"0.83027464\",\n \"text\": \"public int getCount() {\\n return queue.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"116ba2a3e8e12089b429616aa2cd8291\",\n \"score\": \"0.828576\",\n \"text\": \"public int size() {\\n return this.queue.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8100034db1bdda3357669b8256891dd0\",\n \"score\": \"0.8266784\",\n \"text\": \"public int size() {\\n return _queue.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f15dd853b54d8a2c3fbff241eaaa2830\",\n \"score\": \"0.79548216\",\n \"text\": \"public int queueSize() {\\n\\t\\treturn queue.size();\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bddec0fee9646422fd190096454daca5\",\n \"score\": \"0.78513473\",\n \"text\": \"public int size() \\r\\n {\\r\\n if(measurementQueue==null) return 0;\\r\\n \\r\\n return measurementQueue.size();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66d7bb77992868ba05e39369316227d6\",\n \"score\": \"0.78471047\",\n \"text\": \"public static int size() {\\n System.out.println();\\n System.out.println(\\\"The size of the queue is: \\\" + queue.size());\\t \\n return queue.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"798245fbe2e0a77c03f9c4a7eedd6c81\",\n \"score\": \"0.7698604\",\n \"text\": \"int getQueueSize();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c7b7bae0522f72a1c9530ff6b78723f\",\n \"score\": \"0.7695969\",\n \"text\": \"public int size() {\\n processQueue();\\n return weakCache.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c066457416d74c699cf631321a224d4d\",\n \"score\": \"0.7694315\",\n \"text\": \"public int size() {\\n\\t\\t//Because we're the only consumer, we know nothing will be removed while\\n\\t\\t//we're computing the size, so we know there are at least (rear - front)\\n\\t\\t//elements already added.\\n\\t\\treturn (int)(rear.get() - front.get());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3fe4d89e5ddfcc434784a13c2a672131\",\n \"score\": \"0.76852775\",\n \"text\": \"public int inputQueueSize() {\\n\\t\\tsynchronized (inputQueue) {\\n\\t\\t\\treturn inputQueue.size();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"443331b7a8e5d2982dc45784423a16ab\",\n \"score\": \"0.7684611\",\n \"text\": \"public int size()\\n\\t{\\n\\t\\tif(isEmpty())\\n\\t\\t\\treturn 0;\\n\\t\\tif(isFull())\\n\\t\\t\\treturn queueArray.length;\\n\\t\\t\\n\\t\\tint i=front;\\n\\t\\tint sz=0;\\n\\t\\tif(front<=rear)\\n\\t\\t\\twhile(i<=rear)\\n\\t\\t\\t{\\n\\t\\t\\t\\tsz++;\\n\\t\\t\\t\\ti++;\\n\\t\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\twhile(i<=queueArray.length-1)\\n\\t\\t\\t{\\n\\t\\t\\t\\tsz++;\\n\\t\\t\\t\\ti++;\\n\\t\\t\\t}\\n\\t\\t\\ti=0;\\n\\t\\t\\twhile(i<=rear)\\n\\t\\t\\t{\\n\\t\\t\\t\\tsz++;\\n\\t\\t\\t\\ti++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn sz;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a494e55b9510a270255e2df5b5931dd\",\n \"score\": \"0.7605173\",\n \"text\": \"int getNumEvents() {\\n int cnt = eventCount;\\n for (Entry entry : queue) {\\n cnt += entry.eventCount;\\n }\\n return cnt;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"972e98824f339d82bf8531bcb0b8369f\",\n \"score\": \"0.75597\",\n \"text\": \"public int getQueueSize() {\\r\\n\\t\\treturn this.queue.size();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02b1e7d734abaaae43d4c9d7b274affd\",\n \"score\": \"0.7555043\",\n \"text\": \"public long getQueueSize(){\\n return queue.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a06cd85dd7b72159993dca3a288f0d3\",\n \"score\": \"0.7550924\",\n \"text\": \"public int numVehiclesInQueue() {\\r\\n\\t\\treturn vehiclesInQueue.size();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f1d6660c21db863df709cee6a847453\",\n \"score\": \"0.7453111\",\n \"text\": \"public int getRunnableCount() {\\n return queue.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c20129e415714ba99a771c626df5657\",\n \"score\": \"0.7425351\",\n \"text\": \"public abstract int getQueueLength();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b11fead2b76df9469ec1d5e18232af01\",\n \"score\": \"0.74243677\",\n \"text\": \"public int size()\\n\\t{\\n\\t\\treturn requestQueue != null ? requestQueue.size() : 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"23f1d9e432c1e0035415aa3437b29c8e\",\n \"score\": \"0.7416424\",\n \"text\": \"public int size() {\\r\\n\\t\\treturn q.size();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e19528108c763b4811044bb57dc2451c\",\n \"score\": \"0.72666514\",\n \"text\": \"public int size() {\\r\\n if (NumItems > Integer.MAX_VALUE) {\\r\\n return Integer.MAX_VALUE;\\r\\n }\\r\\n return NumItems;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e660c611fcc13b6c227773f56bdac31c\",\n \"score\": \"0.72418004\",\n \"text\": \"public int queueArrayLength(){\\n\\t\\treturn queueArray.length;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da9bd438223f081fb2ce7eeac36004f1\",\n \"score\": \"0.7230721\",\n \"text\": \"public synchronized int size() {\\n return count;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b2a81ab923b11105b1c90f03e78f898\",\n \"score\": \"0.7206644\",\n \"text\": \"public int size() {\\n \\t\\n \\tint i = 0;\\n \\t\\n \\twhile(this.front != null) {\\n \\t\\ti = i+1;\\n \\t\\tthis.front = this.front.next; \\n \\t}\\n \\t\\n \\treturn i;\\n \\t\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba91344250898ab984848317cccc1784\",\n \"score\": \"0.7199739\",\n \"text\": \"final int getQueueSize() {\\n // suppress momentarily negative values\\n return Math.max(0, sp - base);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a302460a5732d471b6a98383ffd16da4\",\n \"score\": \"0.7198489\",\n \"text\": \"public int size() {\\n\\t\\t// DO NOT CHANGE THIS METHOD\\n\\t\\treturn numElements;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c18a200318bf90ab56c398b0dda630a\",\n \"score\": \"0.7178178\",\n \"text\": \"public int size() {\\n\\t\\treturn this.elements.size();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84720fb66dd7e3c69aa154cfb0cf5ba3\",\n \"score\": \"0.71674484\",\n \"text\": \"public int getQueueSize() {\\n return queue.getQueueSize();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01e055cbe8d3ea4758469f05512890e8\",\n \"score\": \"0.71348286\",\n \"text\": \"public int size() {\\n\\t\\treturn elements.size();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff174edc1c328647d2bd8b5c15fe4b1f\",\n \"score\": \"0.7131808\",\n \"text\": \"Long getNumberOfElement();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a09b850ad1027fdd41ede9e78bb86e8f\",\n \"score\": \"0.71224356\",\n \"text\": \"public int size() {\\r\\n\\t\\treturn elements.size();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b12a79aa9214945e8bd74182e996d22\",\n \"score\": \"0.710011\",\n \"text\": \"public int size() {\\n return numOfElements;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"268c6bcd285e9ac0bcf52c916e9ee2e3\",\n \"score\": \"0.70930123\",\n \"text\": \"public int size() {\\n\\n return elements.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"201bc462947333747f0958c0a7e399c9\",\n \"score\": \"0.7092319\",\n \"text\": \"public int getNumQueues() {\\n return queues.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1f7e94f9a53bc7528a6d455c214f117\",\n \"score\": \"0.7087996\",\n \"text\": \"public int size() \\r\\n\\t{\\r\\n\\t\\treturn getCounter();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4985f41dac659d6c48a20475dad9532a\",\n \"score\": \"0.7084904\",\n \"text\": \"public int size(){\\n\\t\\tListUtilities start = this.returnToStart();\\n\\t\\tint count = 1;\\n\\t\\twhile(start.nextNum != null){\\n\\t\\t\\tcount++;\\n\\t\\t\\tstart = start.nextNum;\\n\\t\\t}\\n\\t\\treturn count;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"275d2e0a364739b10945e181db277a06\",\n \"score\": \"0.70772254\",\n \"text\": \"public final int size() {\\n int size = 0;\\n final Iterator iterator = this.iterator();\\n while (iterator.hasNext()) {\\n size++;\\n iterator.next();\\n }\\n return size;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b12217bb645196ca6b2a39b86d2751a6\",\n \"score\": \"0.7061176\",\n \"text\": \"public int queueSize() {\\n return executor.getQueue().size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2b2f1da3d068af1331657624fdb946a\",\n \"score\": \"0.7060402\",\n \"text\": \"public int getSize() {\\n\\t\\treturn numElements;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"028a4b3c72b9f098f858a93dbe90a5eb\",\n \"score\": \"0.70569503\",\n \"text\": \"public int size() {\\n return elements.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c8399ae0111642731b36ab681634a627\",\n \"score\": \"0.70562583\",\n \"text\": \"public int size() {\\r\\n int temp = 0;\\r\\n for (int i = 0; i < elem.length; i++) {\\r\\n if (elem[i] != null) {\\r\\n temp++;\\r\\n }\\r\\n }\\r\\n return temp;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f6330ef1831154e7a0b07e0f91e0bf65\",\n \"score\": \"0.70525116\",\n \"text\": \"public int size() {\\r\\n assert numElements >= 0 : numElements;\\r\\n assert numElements <= capacity : numElements;\\r\\n assert numElements >= elementsByFitness.size() : numElements;\\r\\n return numElements;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c2de4264b1eb6030a98f96bd893d40d\",\n \"score\": \"0.70521\",\n \"text\": \"public final int size()\\n {\\n return m_count;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a345cba904ac2a22df659fef212f8091\",\n \"score\": \"0.7051663\",\n \"text\": \"public int size() {\\n\\t\\treturn elements;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e43343d4c04fcc1176f389aeef4ce4f7\",\n \"score\": \"0.7046314\",\n \"text\": \"public int size() {\\n int found = 0;\\n Node<T> it = head.get();\\n // Do a raw count.\\n for (int i = 0; i < capacity; i++) {\\n if (!it.free.get()) {\\n found += 1;\\n }\\n it = it.next;\\n }\\n return found;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5fcb069826257600841d3455a03c899f\",\n \"score\": \"0.7044597\",\n \"text\": \"public int size() {\\r\\n\\t\\treturn elements;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c142163ad0f133ce700c6ee4eddf17ac\",\n \"score\": \"0.7044095\",\n \"text\": \"public static int size() \\r\\n\\t{\\r\\n\\t\\treturn m_count;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db74b99a5f102a37351dd34eb827a3a3\",\n \"score\": \"0.70253694\",\n \"text\": \"public int size()\\r\\n {\\r\\n return count;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b09d9bee6578ca4980392888010778ad\",\n \"score\": \"0.7010485\",\n \"text\": \"public int size() {\\n\\t\\treturn count;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b09d9bee6578ca4980392888010778ad\",\n \"score\": \"0.7010485\",\n \"text\": \"public int size() {\\n\\t\\treturn count;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b09d9bee6578ca4980392888010778ad\",\n \"score\": \"0.7010485\",\n \"text\": \"public int size() {\\n\\t\\treturn count;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6380e3475d5525f3961c5964ea9770c6\",\n \"score\": \"0.70094955\",\n \"text\": \"public int size()\\n\\t{\\n\\t\\treturn m_elements.size();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d5558311e10c8e2759a985d2f1b42bfd\",\n \"score\": \"0.70091474\",\n \"text\": \"public int size()\\r\\n\\t{\\r\\n\\t\\treturn count;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c210228ebdfb8bda4e7c397037a962f0\",\n \"score\": \"0.7000224\",\n \"text\": \"@Override\\n public int queueLength() {\\n return this.job_queue.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"459824cf167f45e04456b58a2b712a22\",\n \"score\": \"0.6997246\",\n \"text\": \"@Override\\n\\tpublic int size() {\\n\\n\\t\\treturn this.numOfItems;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6a2bab08a002f52d5a33c04023e2610\",\n \"score\": \"0.6992774\",\n \"text\": \"public int size() {\\n return count;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dd5b24a47eaf7c003424285c07e2e3fe\",\n \"score\": \"0.698845\",\n \"text\": \"public int size() {\\n\\t\\tint numElements = 0;\\n\\t\\tfor (int i = 0; i < this.size; i++) {\\n\\t\\t\\tif (list[i] != null) {\\n\\t\\t\\t\\tnumElements++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn numElements;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7acd4251c6f6e9d04ba306460e450c07\",\n \"score\": \"0.6978139\",\n \"text\": \"public int size() {\\n return elements;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab1cfcc6275c6b2f38b7e0c4ca04b4b4\",\n \"score\": \"0.6976907\",\n \"text\": \"public int size()\\n {\\n return count;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb55f7ae411b272aece5420ca783260d\",\n \"score\": \"0.6974407\",\n \"text\": \"public int getNumOfElements() {\\n return numOfElements;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da978dd18858f8b0eb3de9b153b57803\",\n \"score\": \"0.69679123\",\n \"text\": \"public int getNumElements()\\n {\\n return numElements;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a99bade54b165c97113343a59f4d0bfb\",\n \"score\": \"0.6964067\",\n \"text\": \"public int size() {\\n\\t\\treturn N;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a99bade54b165c97113343a59f4d0bfb\",\n \"score\": \"0.6964067\",\n \"text\": \"public int size() {\\n\\t\\treturn N;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a99bade54b165c97113343a59f4d0bfb\",\n \"score\": \"0.6964067\",\n \"text\": \"public int size() {\\n\\t\\treturn N;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a99bade54b165c97113343a59f4d0bfb\",\n \"score\": \"0.6964067\",\n \"text\": \"public int size() {\\n\\t\\treturn N;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a99bade54b165c97113343a59f4d0bfb\",\n \"score\": \"0.6964067\",\n \"text\": \"public int size() {\\n\\t\\treturn N;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8170a7bacef127e910fb51f9f6562121\",\n \"score\": \"0.6949579\",\n \"text\": \"public void incTotalOfQueueEntries() {\\n totalOfQueueEntries++;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"62991bf63eebe989a22679b0d2559b9b\",\n \"score\": \"0.69456923\",\n \"text\": \"public final int size()\\r\\n/* 41: */ {\\r\\n/* 42:215 */ long after = lvConsumerIndex();\\r\\n/* 43: */ for (;;)\\r\\n/* 44: */ {\\r\\n/* 45:219 */ long before = after;\\r\\n/* 46:220 */ long currentProducerIndex = lvProducerIndex();\\r\\n/* 47:221 */ after = lvConsumerIndex();\\r\\n/* 48:222 */ if (before == after)\\r\\n/* 49: */ {\\r\\n/* 50:224 */ long size = currentProducerIndex - after >> 1;\\r\\n/* 51:225 */ break;\\r\\n/* 52: */ }\\r\\n/* 53: */ }\\r\\n/* 54: */ long size;\\r\\n/* 55:230 */ if (size > 2147483647L) {\\r\\n/* 56:232 */ return 2147483647;\\r\\n/* 57: */ }\\r\\n/* 58:236 */ return (int)size;\\r\\n/* 59: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66115ac831778e1051fc68fbd1fb790e\",\n \"score\": \"0.69308406\",\n \"text\": \"public synchronized int getSize() {\\r\\n\\t\\treturn queueManagers.size();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40f02aae413dd4cedd27666a27fd812a\",\n \"score\": \"0.692803\",\n \"text\": \"public int numIncoming() {\\r\\n int result = incoming.size();\\r\\n return result;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8f40e6df93db096d2ad3dd74f259e608\",\n \"score\": \"0.6918851\",\n \"text\": \"public int size() {\\n return qSize;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d7417bd21cfcda19d9bedd7fb3a6286\",\n \"score\": \"0.6918396\",\n \"text\": \"public int getDequeueCount() {\\n\\t\\treturn m_DequeueCount;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f4d77000a692df53b1e6f0b55c34edf6\",\n \"score\": \"0.6913163\",\n \"text\": \"@Override\\n public int size() {\\n // Returns the number of elements stored in the heap\\n return nelems;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e31e27bfbb6fd41f6e5d14a3dfe82d8\",\n \"score\": \"0.6911638\",\n \"text\": \"public int getNrOfElements() {\\n return this.nrOfElements;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bddf91613c495ff0c31ddb7381081ec9\",\n \"score\": \"0.69067305\",\n \"text\": \"public int size() {\\n\\t\\treturn heap.size();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16f197de58e0df6ba5b1d9deeb476c45\",\n \"score\": \"0.69054765\",\n \"text\": \"public int size()\\r\\n\\t{\\r\\n\\t\\treturn numItems;\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c43d9153d32d6358185f9054df28174\",\n \"score\": \"0.690355\",\n \"text\": \"public int getNumElements() {\\n return numElements;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c43d9153d32d6358185f9054df28174\",\n \"score\": \"0.690355\",\n \"text\": \"public int getNumElements() {\\n return numElements;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba5d708d6caeccc6133199e3a1c6b2a0\",\n \"score\": \"0.69025123\",\n \"text\": \"public int size()\\n {\\n return N;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4116aa536a276a92b036b786d7acdc68\",\n \"score\": \"0.6897951\",\n \"text\": \"public int size() {\\n\\t\\tint result = 0;\\n\\t\\tfor (E val: this)\\n\\t\\t\\tresult++;\\n\\t\\treturn result;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f5aa9ea7e514b58ca8df603e400dcd2\",\n \"score\": \"0.68964005\",\n \"text\": \"public int size() {\\n return N;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f5aa9ea7e514b58ca8df603e400dcd2\",\n \"score\": \"0.68964005\",\n \"text\": \"public int size() {\\n return N;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f5aa9ea7e514b58ca8df603e400dcd2\",\n \"score\": \"0.68964005\",\n \"text\": \"public int size() {\\n return N;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f5aa9ea7e514b58ca8df603e400dcd2\",\n \"score\": \"0.68964005\",\n \"text\": \"public int size() {\\n return N;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f5aa9ea7e514b58ca8df603e400dcd2\",\n \"score\": \"0.68964005\",\n \"text\": \"public int size() {\\n return N;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f5aa9ea7e514b58ca8df603e400dcd2\",\n \"score\": \"0.68964005\",\n \"text\": \"public int size() {\\n return N;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f5aa9ea7e514b58ca8df603e400dcd2\",\n \"score\": \"0.68964005\",\n \"text\": \"public int size() {\\n return N;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b240f4ec2604f4a41b8e521c2e20d2a\",\n \"score\": \"0.6894637\",\n \"text\": \"public int getNumElements() {\\n\\t\\treturn numElements;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"738faf8ae31c5fa75dc91b54cb8a35d6\",\n \"score\": \"0.6893682\",\n \"text\": \"public int size() {\\n return numItems;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b6d8c01599066b5db8b8e84ea619502\",\n \"score\": \"0.6887644\",\n \"text\": \"public int size() {\\r\\n return N;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2e29057e911938b28ae51be16e09b8a\",\n \"score\": \"0.68826175\",\n \"text\": \"public int size()\\r\\n\\t{\\r\\n\\t\\treturn heap.size();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1620d12f213633ffa241f2688904b721\",\n \"score\": \"0.6879665\",\n \"text\": \"public int size() {\\n\\t\\tint count = 0;\\n\\t\\tListNode current = front;\\n\\t\\twhile (current != null) {\\n\\t\\t\\tcurrent = current.next;\\n\\t\\t\\tcount++;\\n\\t\\t}\\n\\t\\treturn count;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b2822ce115d5f004593770a53943a1e\",\n \"score\": \"0.68678325\",\n \"text\": \"public int getNumberOfElements();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea22aef3b43ad71ebb94d126f309786a\",\n \"score\": \"0.68677384\",\n \"text\": \"public int size()\\n\\t\\t{\\n\\t\\treturn N;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24c32e5f23b85c54756a8c6b4f346eba\",\n \"score\": \"0.6867729\",\n \"text\": \"public int size() { return dequeSize; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41db71d8c25b561fe3049bca5de07cde\",\n \"score\": \"0.68672484\",\n \"text\": \"public int size()\\n { \\t\\n \\t//initialize a counter to measure the size of the list\\n int sizeVar = 0;\\n //create local node variable to update in while loop\\n LinkedListNode<T> localNode = getFirstNode();\\n \\n //update counter while there are still nodes\\n while(localNode != null)\\n {\\n sizeVar += 1;\\n localNode = localNode.getNext();\\n }\\n \\n return sizeVar;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"485289b42c0daa94a7d901f6f9d03cae\",\n \"score\": \"0.6864032\",\n \"text\": \"@Override\\n\\tpublic int size() {\\n\\t\\treturn this.numberOfElements;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b849b3624cbc2abb068276073959d90c\",\n \"score\": \"0.6859345\",\n \"text\": \"int size() {\\n if (this.next.equals(this)) {\\n return 0;\\n }\\n return this.next.size(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41ca9f367bcf8993cac116ef75a88d10\",\n \"score\": \"0.68590283\",\n \"text\": \"public int size() {\\n // DO NOT MODIFY THIS METHOD!\\n return size;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":1197,"cells":{"query_id":{"kind":"string","value":"ff8b8a1d6d8486364f1f8e3c87b98c41"},"query":{"kind":"string","value":"backtrack. for given combination, if number of ) > (, then discard the it"},"positive_passages":{"kind":"list like","value":[{"docid":"6d834e6a023b3146dd25dcd10426ac95","score":"0.0","text":"public List<String> generateParenthesis(int n) {\n backTrack(0,0,\"\",n);\n return ans;\n }","title":""}],"string":"[\n {\n \"docid\": \"6d834e6a023b3146dd25dcd10426ac95\",\n \"score\": \"0.0\",\n \"text\": \"public List<String> generateParenthesis(int n) {\\n backTrack(0,0,\\\"\\\",n);\\n return ans;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"484aff52d60275dd5a712d8610def3d3","score":"0.5677479","text":"Set<Set<T>> getAllBarelyPassingCombinations();","title":""},{"docid":"99a2e95f037bf436db3ee3d25af7e336","score":"0.5429457","text":"public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n char s[] = scanner.nextLine().toCharArray();\n \n // Count chars\n Map<Character, Integer> countMap = new TreeMap<>();\n for (int i=0; i<s.length; i++) {\n Integer count = countMap.get(s[i]);\n if (count == null) {\n count = 1;\n } else {\n count = count+1;\n }\n countMap.put(s[i], count);\n }\n \n // Create discard map (Max allowed a char can be discarded)\n // Create select map (Max char to add)\n Map<Character, Integer> discardMap = new TreeMap<>();\n Map<Character, Integer> selectMap = new TreeMap<>();\n for (Character c : countMap.keySet()) {\n discardMap.put(c, countMap.get(c)/2);\n selectMap.put(c, countMap.get(c)/2);\n }\n \n // Find lowest lexy\n List<Character> lexy = new ArrayList<Character>();\n for (int i=s.length-1; i>=0; i--) {\n \n // append char only if select allowed is not exhausted\n if (selectMap.get(s[i]) > 0) {\n int cutAt = -1;\n \n // check current lexy where to put char best\n for (int j=lexy.size()-1; j>=0; j--) {\n \n // only if the char is lexy lower than on current lexy and that can still be discarded\n if (s[i] < lexy.get(j) && discardMap.get(lexy.get(j)) > 0) {\n cutAt=j;\n // reduce discard allowed\n discardMap.put(lexy.get(j), discardMap.get(lexy.get(j))-1);\n\n // increase back select allowed if necessary\n if (selectMap.get(lexy.get(j)) < countMap.get(lexy.get(j))/2) {\n selectMap.put(lexy.get(j), selectMap.get(lexy.get(j))+1);\n }\n } else {\n \n break;\n }\n }\n if (cutAt != -1) {\n lexy = lexy.subList(0, cutAt);\n } \n lexy.add(s[i]);\n selectMap.put(s[i], selectMap.get(s[i])-1);\n \n } else {\n // discard char\n discardMap.put(s[i], discardMap.get(s[i])-1);\n }\n \n }\n \n StringBuilder sb = new StringBuilder(); \n for (Character c : lexy) {\n sb.append(c);\n }\n \n System.out.println(sb.toString()); \n }","title":""},{"docid":"5c985df3c0f5051e9d0ce7cc97a6f040","score":"0.52293086","text":"public static void main(String[] args) throws IOException {\n Scanner sc = new Scanner(System.in);\r\n String line = sc.nextLine();\r\n\r\n String[] tokens = line.split(\",\");\r\n int len = tokens.length;\r\n\r\n int[] tanks = new int[len - 1];\r\n for (int i = 0; i < len - 1; i++) {\r\n String curr = tokens[i];\r\n if (i == 0) {\r\n if (len == 2) // means there is only single element like -> (xy)\r\n curr = curr.substring(1, curr.length() - 1);\r\n else\r\n curr = curr.substring(1);\r\n tanks[i] = Integer.parseInt(curr);\r\n continue;\r\n }\r\n if (i == len - 2) {\r\n curr = curr.substring(0, curr.length() - 1);\r\n tanks[i] = Integer.parseInt(curr);\r\n continue;\r\n }\r\n tanks[i] = Integer.parseInt(curr);\r\n }\r\n int qty = Integer.parseInt(tokens[len - 1].substring(1)); // removal of space\r\n\r\n // tanks array contains individual quantity (sorted manner), qty contains final qty to be filled\r\n // Lets find if any solution exists or not, if Not min qty to be added we need to output\r\n // we are doing this as it will lead to better performance result in case solution does not exist\r\n boolean flag = dpWays(tanks, qty);\r\n if (!flag) {\r\n // means no solution exists\r\n int add1 = tanks[0] * 2 - qty;\r\n int add2 = tanks[0] + tanks[1] - qty;\r\n\r\n System.out.println(add1 < add2 ? add1 : add2);\r\n }\r\n\r\n // Here now we are sure that solution exists and hence we need to give solution\r\n\r\n Map<Integer, Integer> map = new HashMap<>(); // used to store index to be used while building result\r\n for (int i = 0; i < tanks.length; i++)\r\n map.put(tanks[i], i);\r\n\r\n List<ListUtil> result = new ArrayList<>();\r\n ListUtil each = new ListUtil(tanks.length, 0);\r\n \r\n getAllWays(tanks, qty, 0, each, result, map);\r\n\r\n //We need to sort result lists and hence made ListUtil class\r\n Collections.sort(result);\r\n\r\n System.out.println(listToString(result));\r\n\r\n sc.close();\r\n }","title":""},{"docid":"00017f04c73074c4c5243f635bbe2604","score":"0.52217966","text":"private static boolean isValidItemSet(String itemset, int pair_size) {\r\n itemset.replace(\"[\", \"\");\r\n itemset.replace(\"]\", \"\");\r\n String[] arr = itemset.split(\",\");\r\n ArrayList<String> items = new ArrayList<>();\r\n for (int i = 0; i < arr.length; i++) {\r\n arr[i] = arr[i].trim().replace(\"[\", \"\").replace(\"]\", \"\");\r\n items.add(arr[i]);\r\n }\r\n\r\n ArrayList<String> temp = new ArrayList<>();\r\n ArrayList<String> subset_of_itemset = new ArrayList<>();\r\n makeCombination(items, items.size(), 0, pair_size - 1, temp, subset_of_itemset);\r\n\r\n for (int i = 0; i < subset_of_itemset.size(); i++) {\r\n if (!previousItemSet.contains(subset_of_itemset.get(i))) {\r\n // System.out.println(\"fails\");\r\n return false;\r\n }\r\n }\r\n // System.out.println(\"pass\");\r\n subset_of_itemset.clear();\r\n temp.clear();\r\n return true;\r\n }","title":""},{"docid":"54864941655bfa4ddacac54ec2146007","score":"0.5089","text":"private Set<Integer> findThree(StringBuffer line, boolean first) {\n\t\tSet<Integer> retVal = new HashSet<>();\n\t\tif (line.length() <= 5)\n\t\t\treturn retVal;\n\t\t\n\t\tint selfCnt = 0, empCnt = 0;\n\t\tchar selfCh = first ? '3' : '2';\n\t\tchar oppCh = first ? '2' : '3';\n\t\tchar empty = '0';\n\n\t\t// Keep track of the set of empty locations\n\t\tSet<Integer> empLocSet = new HashSet<>();\n\t\tfor (int i = 0; i < 6; i++) {\n\t\t\tchar ch = line.charAt(i);\n\t\t\tif (ch == selfCh)\n\t\t\t\tselfCnt ++;\n\t\t\telse if (ch == empty) {\n\t\t\t\tempLocSet.add(i);\n\t\t\t\tempCnt ++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (selfCnt == 3 && empCnt == 3 && empLocSet.contains(0) && empLocSet.contains(5)) {\n\t\t\tif (empLocSet.contains(1)) {\n\t\t\t\tretVal.add(1);\n\t\t\t\tretVal.add(5);\n\t\t\t} else {\n\t\t\t\tretVal.addAll(empLocSet);\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (int i = 0, j = 6; j < line.length(); i++, j++) {\n\t\t\tchar front = line.charAt(j);\n\t\t\tchar back = line.charAt(i);\n\t\t\tif (back == selfCh)\n\t\t\t\tselfCnt --;\n\t\t\telse if (back == empty) {\n\t\t\t\tempCnt --;\n\t\t\t\tempLocSet.remove(i);\n\t\t\t}\n\t\t\t\n\t\t\tif (front == selfCh)\n\t\t\t\tselfCnt ++;\n\t\t\telse if (front == empty) {\n\t\t\t\tempCnt ++;\n\t\t\t\tempLocSet.add(j);\n\t\t\t}\n\n\t\t\t// Two ends empty; meets criteria\n\t\t\tif (selfCnt == 3 && empCnt == 3 && empLocSet.contains(i + 1) && empLocSet.contains(j)) {\n\t\t\t\t// First check the boundary\n\t\t\t\tif (j == line.length() - 1) {\n\t\t\t\t\tif (empLocSet.contains(j - 1)) {\n\t\t\t\t\t\tretVal.add(i + 1);\n\t\t\t\t\t\tretVal.add(j - 1);\n\t\t\t\t\t} else retVal.addAll(empLocSet);\n\t\t\t\t} else if (line.charAt(i) == oppCh) { // blocked in the front\n\t\t\t\t\tif (line.charAt(j + 1) == oppCh) {\n\t\t\t\t\t\t// two sides blocked, add all;\n\t\t\t\t\t\tretVal.addAll(empLocSet);\n\t\t\t\t\t} else if (empLocSet.contains(i + 2)) {\n\t\t\t\t\t\tretVal.add(i + 2);\n\t\t\t\t\t\tretVal.add(j);\n\t\t\t\t\t} else if (empLocSet.contains(j - 1)) {\n\t\t\t\t\t retVal.addAll(empLocSet);\n } else retVal.addAll(empLocSet);\n\t\t\t\t} else if (line.charAt(j + 1) == oppCh) { // blocked in the back but open in the front\n\t\t\t\t\tif (empLocSet.contains(j - 1)) {\n\t\t\t\t\t\tretVal.add(j - 1);\n\t\t\t\t\t\tretVal.add(i + 1);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tretVal.addAll(empLocSet);\n\t\t\t\t\t}\n\t\t\t\t} else { // open on both sides\n\t\t\t\t\tif (empLocSet.contains(i + 2)) {\n\t\t\t\t\t\tretVal.add(i + 2);\n\t\t\t\t\t\tretVal.add(j);\n\t\t\t\t\t} else if (empLocSet.contains(j - 1)) {\n\t\t\t\t\t\tretVal.add(j - 1);\n\t\t\t\t\t\tretVal.add(i + 1);\n\t\t\t\t\t} else retVal.addAll(empLocSet);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn retVal;\n\t}","title":""},{"docid":"db369fee6737f5da14ab57eac5ec4726","score":"0.5074884","text":"static int eggDrop(int n, int k)\n {\n // Your code here\n int dp[][] = new int[n+1][k+1];\n for(int i=0;i<dp.length;i++){\n Arrays.fill(dp[i],Integer.MAX_VALUE);\n }\n //For 1 egg answer is number of floors\n for(int j=1;j<=k;j++){\n dp[1][j] = j;\n }\n //For 1 floor answer is always 1 and for 0 floors answer is always 0\n for(int i=1;i<=n;i++){\n dp[i][0] = 0;\n dp[i][1] = 1;\n }\n\n for(int i=2;i<=n;i++){\n for(int j=2;j<=k;j++){\n //Assume egg is dropped from xth floor\n for(int x=1;x<=j;x++){\n //Worst case is either egg is broken on xth floor i.e dp[i-1][x-1] or egg is not broken on xth floor i.e dp[i][j-x]\n dp[i][j] = Math.min(dp[i][j],1+Math.max(dp[i-1][x-1],dp[i][j-x]));\n }\n }\n }\n return dp[n][k];\n }","title":""},{"docid":"bf0aefb4a76ab7b2e697abe1c2ecea30","score":"0.50586575","text":"private void removeOnePair() {\n String tag = (String) T.remove(T.size() - 1);\n if (tag.equals(\"B\") || tag.equals(\"C\") || tag.equals(\"I\")\n || tag.equals(\"S\") || tag.equals(\"Z\")) {\n caseI_KI.remove(caseI_KI.size() - 1);\n } else if (tag.equals(\"D\")) {\n caseD_KD.remove(caseD_KD.size() - 1);\n } else if (tag.equals(\"F\")) {\n caseF_KF.remove(caseF_KF.size() - 1);\n } else if (tag.equals(\"J\")) {\n caseJ_KJ.remove(caseJ_KJ.size() - 1);\n } else if (tag.equals(\"C\")) {\n casec_RS.remove(casec_RS.size() - 1);\n } else if (tag.equals(\"e\")) {\n caseet_RS.remove(caseet_RS.size() - 1);\n caseec_RU.remove(caseet_RS.size() - 1);\n } else if (tag.equals(\"s\")) {\n cases_RU.remove(cases_RU.size() - 1);\n } else if (tag.equals(\"[\")) {\n int arraySize = casearray_N.remove(casearray_N.size() - 1);\n numBackwardsCalls -= arraySize;\n for (int k = 0; k < arraySize; k++) {\n removeOnePair();\n }\n } else if (tag.equals(\"@\")) {\n nesttype_RS.remove(nesttype_RS.size() - 1);\n int numPairs = nestpair_N.remove(nestpair_N.size() - 1);\n numBackwardsCalls -= numPairs;\n for (int i = 0; i < numPairs; i++) {\n removeOnePair();\n }\n }\n }","title":""},{"docid":"5c27a4e35269c9e1d1cfb7dd7c1d9afb","score":"0.50495744","text":"public int findComposedCombination()\n {\n // Get the combinations count\n int combinationsCount = Core.getInstance().getPreSetCombinations().getComposedCombinationsCount();\n // Don't allow redundant combinations\n int combinationId;\n do\n {\n // Find a random movement (different from 0 as its the default static movement)\n combinationId = MathUtils.random(0, combinationsCount - 1);\n } while(combinationId == lastComposedCombinationId);\n // Return the composed combination\n return (lastComposedCombinationId = combinationId);\n }","title":""},{"docid":"07eb139813e322f133db4646a81b8687","score":"0.50376993","text":"public boolean prune() {\n\n boolean ret = false;\n int red = 0;\n\n Set<Character> alphabet = I.next.keySet();\n int n = 0;\n for (Character c : alphabet) {\n n += I.next(c).getTimes();\n }\n\n double K = (2 * alphabet.size() + 4) * (Math.log(n) / Math.log(2)) * ratio;\n double sum = 0;\n\n Set<State> terminal = I.getTerminal();\n\n for (State t : terminal) {\n sum = 0;\n String u = t.getFullName();\n String w = u.substring(1, u.length());\n for (Character c : alphabet) {\n\n\n double uc = condProb(u + c);\n double wc = condProb(w + c);\n if ((uc > 0) && (wc > 0)) {\n sum += uc * (Math.log(uc / wc) / Math.log(2)) * times(u);\n }\n }\n\n // si l'estat es irrelevant l'eliminem\n if (sum < K) {\n t.delete();\n ret = true;\n red++;\n }\n }\n\n return ret;\n }","title":""},{"docid":"6522bd9733423c65ba47c15d8bd72538","score":"0.502112","text":"public void backtrack(List<String> combinations, Map<Character, String> phoneMap, String digits, int index, StringBuffer combination) {\n if (index == digits.length()) {\n combinations.add(combination.toString());\n } else {\n char digit = digits.charAt(index);\n String letters = phoneMap.get(digit);\n int lettersCount = letters.length();\n for (int i = 0; i < lettersCount; i++) {\n combination.append(letters.charAt(i));\n System.out.println(\"当前字符串:\"+letters.charAt(i)+\" combination:\"+combination.toString());\n backtrack(combinations, phoneMap, digits, index + 1, combination);\n System.out.println(\"删除\"+combination.charAt(index)+\" index\"+index);\n combination.deleteCharAt(index);\n }\n }\n }","title":""},{"docid":"b5a36d4f758973f1c007a09bbf200f97","score":"0.499863","text":"boolean remaining(TreeSet<Integer> avail){\n\t\t\n\t\tfor (int i : avail){\n\t\t\tfor (int j : avail){\n\t\t\t\tif (i == j){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif ((i > j) && (i % j == 0)){\n\t\t\t\t\t//we have found a valid choice\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\t\n\t\t//there are no remaining valid choices\n\t\treturn false;\n\t}","title":""},{"docid":"c99432c2994fdb53c0cb668590fe2598","score":"0.49844334","text":"private void determinePermutations(final int currentLevel,\r\n final And and,\r\n And combination,\r\n final Or or) {\r\n final Object entry = and.getChildren().get( currentLevel );\r\n if ( entry instanceof Or ) {\r\n // Only OR nodes need to be iterated over\r\n final Or childOr = (Or) entry;\r\n for ( final Iterator it = childOr.getChildren().iterator(); it.hasNext(); ) {\r\n // Make a temp copy of combinations+new entry which will be\r\n // sent forward\r\n final And temp = new And();\r\n if ( currentLevel == 0 ) {\r\n // Always start with a clean combination\r\n combination = new And();\r\n } else {\r\n temp.getChildren().addAll( combination.getChildren() );\r\n }\r\n \r\n // now check for and remove duplicates\r\n final Object object = it.next();\r\n if ( object instanceof And ) {\r\n // Can't have duplicate Ands so move up the children\r\n final And childAnd = (And) object;\r\n for ( final Iterator childIter = childAnd.getChildren().iterator(); childIter.hasNext(); ) {\r\n temp.addChild( childIter.next() );\r\n }\r\n } else {\r\n // no duplicates so just add\r\n temp.addChild( object );\r\n }\r\n \r\n if ( currentLevel < and.getChildren().size() - 1 ) {\r\n // keep recursing to build up the combination until we\r\n // are at the end where it will be added to or\r\n determinePermutations( currentLevel + 1,\r\n and,\r\n temp,\r\n or );\r\n } else {\r\n // we are at the end so just attach the combination to\r\n // the or node\r\n or.addChild( temp );\r\n }\r\n }\r\n } else {\r\n // Make a temp copy of combinations+new entry which will be sent\r\n // forward\r\n final And temp = new And();\r\n if ( currentLevel == 0 ) {\r\n // Always start with a clean combination\r\n combination = new And();\r\n } else {\r\n temp.getChildren().addAll( combination.getChildren() );\r\n }\r\n temp.addChild( entry );\r\n \r\n if ( currentLevel < and.getChildren().size() - 1 ) {\r\n // keep recursing to build up the combination until we are\r\n // at the end where it will be added to or\r\n determinePermutations( currentLevel + 1,\r\n and,\r\n temp,\r\n or );\r\n } else {\r\n // we are at the end so just attach the combination to the\r\n // or node\r\n or.addChild( temp );\r\n }\r\n }\r\n }","title":""},{"docid":"b649ae0b72fcb86270804b9c97830e07","score":"0.49716857","text":"public void reduceOptions(Puzzle p) {\r\n\t\tint pSize = p.getSize();\r\n\t\tABQueue<Integer> newOptions = new ABQueue<Integer>(pSize);\r\n\t\tfor (int i = 1; i <= (pSize); i++) {\r\n\t\t\tnewOptions.enqueue(i);\r\n\t\t} // end for\r\n\r\n\t\tint temp[] = p.getRow(row);\r\n\t\tint OptLen = newOptions.length();\r\n\t\tboolean dup;\r\n\t\tfor (int i = 0; i < OptLen; i++) {\r\n\t\t\tdup = false;\r\n\t\t\tint option = newOptions.dequeue();\r\n\t\t\tfor (int j = 0; j < pSize; j++) {\r\n\t\t\t\tif (option == temp[j]) {\r\n\t\t\t\t\tdup = true;\r\n\t\t\t\t\tj = (j + 2) * pSize;\r\n\t\t\t\t} // end if\r\n\t\t\t} // end for\r\n\t\t\tif (!dup) {\r\n\t\t\t\tnewOptions.enqueue(option);\r\n\t\t\t} // end if\r\n\t\t} // end for\r\n\r\n\t\ttemp = p.getColumn(col);\r\n\t\tOptLen = newOptions.length();\r\n\t\tfor (int i = 0; i < OptLen; i++) {\r\n\t\t\tdup = false;\r\n\t\t\tint option = newOptions.dequeue();\r\n\t\t\tfor (int j = 0; j < pSize; j++) {\r\n\t\t\t\tif (option == temp[j]) {\r\n\t\t\t\t\tdup = true;\r\n\t\t\t\t\tj = (j + 2) * pSize;\r\n\t\t\t\t} // end if\r\n\t\t\t} // end for\r\n\t\t\tif (!dup) {\r\n\t\t\t\tnewOptions.enqueue(option);\r\n\t\t\t} // end if\r\n\t\t} // end for\r\n\r\n\t\ttemp = p.getBlock(col, row);\r\n\t\tOptLen = newOptions.length();\r\n\t\tfor (int i = 0; i < OptLen; i++) {\r\n\t\t\tdup = false;\r\n\t\t\tint option = newOptions.dequeue();\r\n\t\t\tfor (int j = 0; j < pSize; j++) {\r\n\t\t\t\tif (option == temp[j]) {\r\n\t\t\t\t\tdup = true;\r\n\t\t\t\t\tj = (j + 2) * pSize;\r\n\t\t\t\t} // end if\r\n\t\t\t} // end for\r\n\t\t\tif (!dup) {\r\n\t\t\t\tnewOptions.enqueue(option);\r\n\t\t\t} // end if\r\n\t\t} // end for\r\n\t\toptions = newOptions;\r\n\r\n\t}","title":""},{"docid":"15bd3e153f7c397c60d660b3da0ef461","score":"0.49531338","text":"public List<GenPolynomial<C>> \n minimalGB(List<GenPolynomial<C>> Gp) { \n if ( Gp == null || Gp.size() <= 1 ) {\n return Gp;\n }\n // remove zero polynomials\n List<GenPolynomial<C>> G\n = new ArrayList<GenPolynomial<C>>( Gp.size() );\n for ( GenPolynomial<C> a : Gp ) { \n if ( a != null && !a.isZERO() ) { // always true in GB()\n // already positive a = a.abs();\n G.add( a );\n }\n }\n if ( G.size() <= 1 ) {\n //wg monic do not return G;\n }\n // remove top reducible polynomials\n GenPolynomial<C> a, b;\n List<GenPolynomial<C>> F;\n List<GenPolynomial<C>> bcH;\n F = new ArrayList<GenPolynomial<C>>( G.size() );\n while ( G.size() > 0 ) {\n a = G.remove(0); b = a;\n if ( red.isTopReducible(G,a) || red.isTopReducible(F,a) ) {\n // drop polynomial \n if ( true || debug ) {\n List<GenPolynomial<C>> ff;\n ff = new ArrayList<GenPolynomial<C>>( G );\n ff.addAll(F);\n a = red.normalform( ff, a );\n if ( !a.isZERO() ) {\n //System.out.println(\"minGB nf(a) != 0 \" + a);\n bcH = red.reducedBooleanClosure(G,a);\n if ( bcH.size() > 1 ) { // never happend so far\n System.out.println(\"minGB not bc: bcH size = \" + bcH.size());\n F.add(b); // do not replace, stay with b\n } else {\n //System.out.println(\"minGB add bc(a): a = \" + a + \", bc(a) = \" + bcH.get(0));\n F.addAll( bcH );\n }\n } else {\n //System.out.println(\"minGB dropped \" + b);\n }\n }\n } else {\n F.add(a);\n }\n }\n G = F;\n if ( G.size() <= 1 ) {\n // wg monic return G;\n }\n // reduce remaining polynomials\n int len = G.size();\n int el = 0;\n while ( el < len ) {\n a = G.remove(0); b = a;\n //System.out.println(\"doing \" + a.length());\n a = red.normalform( G, a );\n //a = red.normalform( F, a );\n bcH = red.reducedBooleanClosure(G,a);\n if ( bcH.size() > 1 ) {\n System.out.println(\"minGB not bc: bcH size = \" + bcH.size());\n G.add( b ); // do not reduce\n } else {\n G.addAll( bcH );\n }\n el++;\n }\n // make monic if possible\n F = new ArrayList<GenPolynomial<C>>( G.size() );\n for ( GenPolynomial<C> p : G ) {\n a = p.monic().abs();\n if ( p.length() != a.length() ) {\n System.out.println(\"minGB not bc: #p != #a: a = \" + a + \", p = \" + p);\n a = p; // dont make monic for now\n }\n F.add( a );\n }\n G = F;\n \n /* stratify: collect polynomials with equal leading terms */\n ExpVector e, f;\n F = new ArrayList<GenPolynomial<C>>( G.size() );\n for ( int i = 0; i < G.size(); i++ ) {\n a = G.get(i);\n if ( a == null || a.isZERO() ) {\n continue;\n }\n e = a.leadingExpVector();\n for ( int j = i+1; j < G.size(); j++ ) {\n b = G.get(j);\n if ( b == null || b.isZERO() ) {\n continue;\n }\n f = b.leadingExpVector();\n if ( e.equals(f) ) {\n //System.out.println(\"minGB e == f: \" + a + \", \" + b);\n a = a.sum(b);\n G.set(j,null);\n }\n }\n F.add( a );\n }\n G = F;\n \n /* info on boolean algebra element blocks \n Map<C,List<GenPolynomial<C>>> bd = new TreeMap<C,List<GenPolynomial<C>>>();\n for ( GenPolynomial<C> p : G ) { \n C cf = p.leadingBaseCoefficient();\n cf = cf.idempotent();\n List<GenPolynomial<C>> block = bd.get( cf );\n if ( block == null ) {\n block = new ArrayList<GenPolynomial<C>>();\n }\n block.add( p ); \n bd.put( cf, block );\n }\n System.out.println(\"\\nminGB bd:\");\n for( C k: bd.keySet() ) {\n System.out.println(\"\\nkey = \" + k + \":\");\n System.out.println(\"val = \" + bd.get(k));\n }\n System.out.println();\n */\n return G;\n }","title":""},{"docid":"a40060098e67fae17415d91e876aab16","score":"0.49366426","text":"private void removeShortEdges(Vertex v){\n for(Edge vw :v){\n Vertex w=vw.getEndVertex();\n int numIter=0;\n //w.sortEdges();\n for(Edge wx : w){\n Vertex x=wx.getEndVertex();\n numIter++;\n if(mark(x)!=Mark.INPLAY){\n continue;\n }\n if(numIter==1){\n \tcount2++;\n \tmark(x,Mark.ELIMINATED);\n }\n else if(wx.length()<FUZZ){\n \tcount2++;\n \tmark(x,Mark.ELIMINATED);\n }\n else if (wx.length()>=FUZZ){\n break;\n }\n }\n }\n\t}","title":""},{"docid":"947f3986b4075bed192b2f7eb2bc55e5","score":"0.49319765","text":"private boolean isValidCombinationPossibleInner(SwccgGame game, Collection<PhysicalCard> cardsInPile, List<PhysicalCard> currentCombination) {\n if (isSelectionValid(game, currentCombination)) {\n return true;\n }\n\n Collection<PhysicalCard> selectableCards = Filters.filter(cardsInPile, game, Filters.and(getValidToSelectFilter(game, currentCombination), Filters.not(Filters.in(currentCombination))));\n for (PhysicalCard selectableCard : selectableCards) {\n currentCombination.add(selectableCard);\n if (isValidCombinationPossibleInner(game, cardsInPile, currentCombination)) {\n return true;\n }\n currentCombination.remove(selectableCard);\n }\n\n return false;\n }","title":""},{"docid":"4ee17d8fa95cd2eab40c3640c0fd4369","score":"0.4930462","text":"static void minimumBribesMySolution(int[] q) {\n int bribeCount = 0;\n boolean isChaotic = false;\n\n for(int i = 0 ; i < q.length; i++){\n int queueIndex = i+1;\n if(q[i] - queueIndex > 2 ){\n isChaotic = true;\n break;\n }\n for(int j=Math.max(0, q[i] -2); j < i;j++){\n if(q[i] < q[j]){\n bribeCount++;\n }\n }\n }\n\n if(isChaotic){\n System.out.println(\"Too chaotic\");\n }else{\n System.out.println(bribeCount);\n }\n }","title":""},{"docid":"defed4bacdd756f7de6ddd40546d12c6","score":"0.49161157","text":"public String minRemoveToMakeValid(String s) {\n StringBuilder sb = new StringBuilder();\n char[] str = s.toCharArray();\n\n int oppPar = 0;\n /*\n scan the string from left to right marking closing parenthesis that need to be deleted. When an open parenthesis\n is encountered, we increase the count of opposite Parenthesis needed to make s valid. When a closing Parenthesis\n is encountered, if the count is greater than 0, decrease the count since we found a pair, otherwise, there is\n no open for the close so mark it for deletion\n */\n for (int i = 0; i < str.length; i++) {\n if (str[i] == '(') {\n oppPar++;\n } else if (str[i] == ')') {\n if (oppPar > 0) {\n oppPar--;\n } else {\n str[i] = 0;\n }\n }\n }\n\n oppPar = 0;\n //scan string from right to left and perform the same operations as before but for closing parenthesis\n for (int i = str.length - 1; i >= 0; i--) {\n if (str[i] == ')') {\n oppPar++;\n } else if (str[i] == '(') {\n if (oppPar > 0) {\n oppPar--;\n } else {\n str[i] = 0;\n }\n }\n }\n\n //generate the new string now that all invalid parenthesis are marked\n for (char c : str) {\n if (c != 0) {\n sb.append(c);\n }\n }\n return sb.toString();\n }","title":""},{"docid":"813d27c4c734bb76979fe9d99840c21f","score":"0.48924944","text":"final private void prune(TransRecords tr, float minSup, byte itemsetSize){\n\t\tArrayList matches;\n\t\tint incCount = 0;\n\t\tString[] trans;\n\t\tint[] can;\n\t\tint t1, t2, c1, c2, n1, m1;\n\t\tc1 = candidates.size();\n\t\tcCounters = new int[c1];\n\t\tcSupports = new float[c1];\n\t\tcTransList = new Object[c1];\n\t\tfor (int i = 0; i < c1; i++){\n\t\t\tcCounters[i] = 0;\n\t\t}\n\t\t//Determine candidate frequency...\n\t\tObject[] temp = tr.getRec();\n\t\tString[] name = tr.getNames();\n\t\tint[] ids = tr.getIDs();\n\t\tt1 = temp.length;\n\t\tn1 = name.length;\n\t\t//Check all transactions...\n\t\tfor (int i = 0; i < t1; i++){\n\t\t\ttrans = (String[])temp[i];\n\t\t\tt2 = trans.length;\n\t\t\t//Check all candidates...\n\t\t\tfor (int j = 0; j < c1; j++){\n\t\t\t\tcan = (int[])candidates.get(j);\n\t\t\t\tc2 = can.length;\n\t\t\t\t//Check all items are present in this transaction...\n\t\t\t\tfor (int k = 0; k < c2; k++){\n\t\t\t\t\tmatches = tr.getMatches(can[k]);\n\t\t\t\t\tm1 = matches.size();\n\t\t\t\t\tfor (int l = 0; l < m1; l++){\n\t\t\t\t\t\tif (((Integer)matches.get(l) < t2) && (trans[(Integer)matches.get(l)].equals(\"1\"))){\n\t\t\t\t\t\t\tincCount++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (incCount == c2){\n\t\t\t\t\t//All candidates present, increase counter...\n\t\t\t\t\tcCounters[j] = cCounters[j] + 1;\n\t\t\t\t}\n\t\t\t\tincCount = 0;\n\t\t\t}\n\t\t}\n\n\t\t//Determine frequent itemset...\n\t\tfrequent = new ArrayList();\n\t\tfCounters = new ArrayList();\n\t\tfSupport = new ArrayList();\n\t\tfTransList = new ArrayList();\n\t\tint transCount = tr.getNumberRecs();\n\t\tfloat support;\n\t\t//For each candidate...\n\t\tfor (int i = 0; i < c1; i++){\n\t\t\tbfi.messageBox(\"Generating \" + itemsetSize + \" item list (Evaluating Candidate \" + (i + 1) + \" of \" + c1);\n\t\t\t//Determine the support level...\n\t\t\tif (minSupMode == 1 || minSupMode == 2){\n\t\t\t\tsupport = (float)cCounters[i] / (float)transCount;\n\t\t\t\tcSupports[i] = support;\n\t\t\t\tif (support >= minSup){\n\t\t\t\t\t//Candidate support high enough to be frequent item...\n\t\t\t\t\tfrequent.add((int[])candidates.get(i));\n\t\t\t\t\tfCounters.add(cCounters[i]);\n\t\t\t\t\tfSupport.add(support);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tsupport = (float)cCounters[i] / (float)transCount;\n\t\t\t\tcSupports[i] = support;\n\t\t\t\tif ((float)cCounters[i] >= minSup){\n\t\t\t\t\t//Candidate support/frequency high enough to be frequent item...\n\t\t\t\t\tfrequent.add((int[])candidates.get(i));\n\t\t\t\t\tfCounters.add(cCounters[i]);\n\t\t\t\t\tfSupport.add(support);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (c1 > 0){\n\t\t\tcl.addEntryCollapse(itemsetSize, candidates, cCounters, cSupports, cTransList);\n\t\t}\n\t\tif (frequent.size() > 0){\n\t\t\tfl.addEntryCollapse(itemsetSize, frequent, fCounters, fSupport, fTransList);\n\t\t}\n\t}","title":""},{"docid":"65582fa001bbccefc982bf1cb0676e29","score":"0.4891539","text":"static int combinations(int powerup_count) {\n return (1 << powerup_count);\n }","title":""},{"docid":"23729e90e8853e41ccaa5ce4a64bfafd","score":"0.48901716","text":"private ArrayList<int[]> setPossibleNumsNoOperator() {\n\t\tArrayList<int[]> AllResults = new ArrayList<>();\n\n\t\t// Single cell cages can only contain the value of the single cell.\n\t\tif (mCells.size() == 1) {\n\t\t\tint number[] = { mResult };\n\t\t\tAllResults.add(number);\n\t\t\treturn AllResults;\n\t\t}\n\n\t\t// Cages of size two can contain any operation\n\t\tint gridSize = mGrid.getGridSize();\n\t\tif (mCells.size() == 2) {\n\t\t\tfor (int i1 = 1; i1 <= gridSize; i1++) {\n\t\t\t\tfor (int i2 = i1 + 1; i2 <= gridSize; i2++) {\n\t\t\t\t\tif (i2 - i1 == mResult || i1 - i2 == mResult\n\t\t\t\t\t\t\t|| mResult * i1 == i2 || mResult * i2 == i1\n\t\t\t\t\t\t\t|| i1 + i2 == mResult || i1 * i2 == mResult) {\n\t\t\t\t\t\tint numbers[] = { i1, i2 };\n\t\t\t\t\t\tAllResults.add(numbers);\n\t\t\t\t\t\tnumbers = new int[] { i2, i1 };\n\t\t\t\t\t\tAllResults.add(numbers);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn AllResults;\n\t\t}\n\n\t\t// Cages of size two and above can only contain an add or a multiply\n\t\t// operation\n\t\tAllResults = getAllAddCombos(gridSize, mResult, mCells.size());\n\t\tArrayList<int[]> multResults = getAllMultiplyCombos(gridSize, mResult,\n\t\t\t\tmCells.size());\n\n\t\t// Combine Add & Multiply result sets\n\t\tfor (int[] possibleset : multResults) {\n\t\t\tboolean foundset = false;\n\t\t\tfor (int[] currentset : AllResults) {\n\t\t\t\tif (Arrays.equals(possibleset, currentset)) {\n\t\t\t\t\tfoundset = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!foundset) {\n\t\t\t\tAllResults.add(possibleset);\n\t\t\t}\n\t\t}\n\n\t\treturn AllResults;\n\t}","title":""},{"docid":"3ff9e885b5daf0c4a81cc1a52e5fb9cc","score":"0.4885721","text":"public int findPartedCombination()\n {\n // Get the combinations count\n int combinationsCount = Core.getInstance().getPreSetCombinations().getPartedCombinationsCount();\n // Don't allow redundant combinations\n int combinationId;\n do\n {\n // Find a random movement\n combinationId = MathUtils.random(0, combinationsCount - 1);\n } while(combinationId == lastPartedCombinationId);\n // Return the parted combination\n return (lastPartedCombinationId = combinationId);\n }","title":""},{"docid":"fbff0158c824604540e0af5311f25cf0","score":"0.48833323","text":"private ArrayList<Sequence> prune(ArrayList<Sequence> candidates,ArrayList<Sequence> ofSize) {\n\t\tArrayList<Sequence> prunedSeq = new ArrayList<Sequence>();\n \tArrayList<Sequence> subSeq = new ArrayList<Sequence>(); \t\n \t\n \tint size = 0;\n \t\n \tif(ofSize.size() > 0){\n \t\tsize = ofSize.get(0).getSequence().size();\n \t}\n \t\n \tfor(Sequence seq : candidates){\n \t\t \t\t\n \t\tif(seq.getDistinctItemsinSequence().contains(this.totalItems.get(0))){\n \t\t\t\n \t\t\tArrayList<ItemSet> seeds = getsubSequences(seq); \t\t\t\n \t\t\t\n \t\t\tfor(int i=0; i < seeds.size(); i++){\n \t\t\t\t\n \t\t\t\tint top = 0;\n \t\t\t\t\n \t\t\t\tif(i != top){\n \t\t\t\t\n\t \t\t\t\tSequence newseq = new Sequence();\n\t \t\t\t\t\n\t \t\t\t\twhile(newseq.getItemsinSequence().size() < size && top < seeds.size()){\n\t \t\t\t\t\t\n\t \t\t\t\t\tItemSet is = new ItemSet();\n\t \t\t\t\t\tis.setItemSet(new ArrayList<Integer>(seeds.get(top).getItemSet()));\n\t \t\t\t\t\tnewseq.addItemSet(is); \n\t \t\t\t\t\t\n\t \t\t\t\t\ttop = top + 1;\n\t \t\t\t\t\t\n\t \t\t\t\t\tif(newseq.getItemsinSequence().size() == size){\n\t \t\t\t\t\t\tsubSeq.add(newseq);\n\t \t\t\t\t\t}\n\t \t\t\t\t} \n \t\t\t\t}\n \t\t\t}\n\n \t\t\tint count = 0;\n \t\t\t\n \t\t\tfor(int j=0; j<subSeq.size() ; j++){\n \t\t\t\t\n \t\t\t\tif(ListContains(ofSize, subSeq.get(j))){ \t\t\t\t\n \t\t\t\t\tcount = count++;\n \t\t\t\t} \t\t\t\t\n \t\t\t}\n \t\t\t\n \t\t\tif(count == subSeq.size()){\n \t\t\t\tif(!ListHas(prunedSeq, seq))\n \t\t\t\t\tprunedSeq.add(seq);\n \t\t\t}\n \t\t}\n \t\telse{\n \t\t\tif(!ListHas(prunedSeq, seq))\n \t\t\t\tprunedSeq.add(seq);\n \t\t} \t\t\n \t}\n \t\n\t\treturn prunedSeq;\n\t}","title":""},{"docid":"e385d1fa31cec57b9e674983f3885585","score":"0.4875365","text":"private static void cutGrid() {\n\n int tCount = isTomato(0, 0) ? 1 : 0;\n Cell currCell = new Cell(0, 0, tCount, tCount ^= 1);\n\n if (isMaxPossibleSlice(currCell)){\n ++nCuts;\n //mark result grid\n //reset curr cell, always try to move down first, if not possible then right\n }\n }","title":""},{"docid":"4cfdb856c1144fd5a5bd18ffee1952b0","score":"0.48683217","text":"private static Set<Set<Cover>> getCoverCombinations(List<Cover> groupSize, int k) {\n Set<Set<Cover>> allCombos = new HashSet<>();\n // base cases for recursion\n if (k == 0) {\n // There is only one combination of size 0, the empty team.\n allCombos.add(new HashSet<Cover>());\n return allCombos;\n }\n if (k > groupSize.size()) {\n // There can be no teams with size larger than the group size,\n // so return allCombos without putting any teams in it.\n return allCombos;\n }\n\n // Create a copy of the group with one item removed.\n List<Cover> groupWithoutX = new ArrayList<>(groupSize);\n Cover x = groupWithoutX.remove(groupWithoutX.size() - 1);\n\n Set<Set<Cover>> combosWithoutX = getCoverCombinations(groupWithoutX, k);\n Set<Set<Cover>> combosWithX = getCoverCombinations(groupWithoutX, k - 1);\n for (Set<Cover> combo : combosWithX) {\n combo.add(x);\n }\n allCombos.addAll(combosWithoutX);\n allCombos.addAll(combosWithX);\n return allCombos;\n }","title":""},{"docid":"cd9bf5628434c59c82d06d79c0873699","score":"0.48660406","text":"private static List<String> selectOptions(List<String> optKeys) throws IOException\n\t{\n\n\t\tint numNEval = 20;\n\t\tMap<String, Double> optList = new HashMap<String, Double>();\n\t\tValueComparator bvcAux = new ValueComparator(optList);\n\t\tTreeMap<String, Double> sorted_opt = new TreeMap<String, Double>(bvcAux);\n\n\t\tint numNodes;\n\t\t// Identify repeated patterns in top categories\n\t\tString newoption;\n\t\tString[] pair = new String[2];\n\t\tfor (int n = 0; n < optKeys.size(); n++)\n\t\t{\n\t\t\tfor (int m = 0; m < n; m++)\n\t\t\t{\n\t\t\t\tpair[0] = optKeys.get(n);\n\t\t\t\tpair[1] = optKeys.get(m);\n\t\t\t\tnewoption = catUtils.longestAncestor(pair);\n\t\t\t\tif (optList.containsKey(newoption))\n\t\t\t\t{\n\t\t\t\t\toptList.put(newoption, ((Double) optList.get(newoption)) + 1.0);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\toptList.put(newoption, new Double(1));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tsorted_opt.putAll(optList);\n\n\t\t// Filter out just relevant patterns\n\t\tMap<String, Double> optList2 = new HashMap<String, Double>();\n\t\tValueComparator bvcAux2 = new ValueComparator(optList2);\n\t\tTreeMap<String, Double> sorted_opt2 = new TreeMap<String, Double>(bvcAux2);\n\t\tDouble numrepeat;\n\t\tSet<String> optKeys2 = sorted_opt.keySet();\n\t\tfor (String optKey : optKeys2)\n\t\t{\n\t\t\tnumNodes = catUtils.nodes(optKey);\n\t\t\tnumrepeat = optList.get(optKey);\n\t\t\tif (numNodes >= 4 && numrepeat > 3)\n\t\t\t{\n\t\t\t\tif (catUtils.last(optKey).length() > 1)\n\t\t\t\t{\n\t\t\t\t\tif (!optList2.containsKey(catUtils.take(optKey, numNEval)))\n\t\t\t\t\t{\n\t\t\t\t\t\toptList2.put(catUtils.take(optKey, numNEval), new Double(numNodes));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tsorted_opt2.putAll(optList2);\n\t\t// Present sorted pattern form most relevant to less relevant\n\t\tSet<String> sorted_optKeys2 = sorted_opt2.keySet();\n\t\tList<String> arrayOpt = new ArrayList<String>();\n\t\t// Add top 3\n\t\tint numtop;\n\t\tif (sorted_optKeys2.size() < 5)\n\t\t{\n\t\t\tnumtop = 5;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tnumtop = 4;\n\t\t}\n\t\tint numresults = 0;\n\t\tfor (int i = 0; i < optKeys.size(); i++)\n\t\t{\n\t\t\tif (numresults >= numtop)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t// String key = catUtils.init(optKeys.get(i));\n\t\t\tString key = optKeys.get(i);\n\t\t\tif (!arrayOpt.contains(key))\n\t\t\t{\n\t\t\t\tarrayOpt.add(key);\n\t\t\t\tnumresults++;\n\t\t\t}\n\t\t}\n\t\t// Add rest of the patterns\n\t\tfor (String key : sorted_optKeys2)\n\t\t{\n\t\t\tif (!arrayOpt.contains(key))\n\t\t\t{\n\t\t\t\tarrayOpt.add(key);\n\t\t\t}\n\t\t}\n\n\t\treturn arrayOpt;\n\n\t}","title":""},{"docid":"1819309927d5eb2a94407a613179d95b","score":"0.48567906","text":"private void filterCandidateSet(ArrayList<ArrayList<Integer>> candidateSet ) {\n ArrayList<ArrayList<Integer>> tempFrequentItemSet1 = new ArrayList<ArrayList<Integer>>();\n /* A temporary array to store all combination one by one */\n for (ArrayList<Integer> candidate : candidateSet) {\n ArrayList<ArrayList<Integer>> combinationList = new ArrayList<ArrayList<Integer>>();\n findSubsets(candidate, candidate.size(), candidate.size() - 1, 0, new int[candidate.size() - 1], 0, combinationList);\n if ( allSubsetPresent(combinationList, frequentItemSet1)) {\n\n /* check the bucket list.\n for each bucket check if the combination is present */\n int count = 0;\n for (ArrayList<Integer> basket : baskets) {\n if(basket.containsAll(candidate)) {\n count++;\n if(count >= minSupport) {\n String data = \"\";\n ArrayList<Integer> tempFrequentItem = new ArrayList<>();\n for(int item = 0; item < candidate.size();item++) {\n tempFrequentItem.add(candidate.get(item));\n data +=map.get(candidate.get(item));\n if(item != (candidate.size() - 1)) {\n data += \",\";\n }\n }\n if(!tempFrequentItemSet1.contains(tempFrequentItem)) {\n tempFrequentItemSet1.add(tempFrequentItem);\n System.out.println(data);\n itemSet.add(data);\n }\n }\n }\n }\n }\n }\n frequentItemSet1 = new ArrayList<ArrayList<Integer>> (tempFrequentItemSet1);\n tempFrequentItemSet1.clear();\n\n }","title":""},{"docid":"fd167426a06d21f5476f83ab4ece4215","score":"0.4850351","text":"private void dfs (Set<String> ans, String build, int le, int re, int balance, int index, String s) {\n if (le == 0 && re == 0 && balance == 0 && index == s.length()) {\n ans.add(build);\n }\n\n if (le < 0 || re < 0 || index >= s.length() || balance < 0) return;\n\n char c = s.charAt(index);\n\n if (c == '(') {\n dfs (ans, build, le - 1, re, balance, index + 1, s); // delete this\n dfs (ans, build + \"(\", le, re, balance + 1, index + 1, s); // add this\n }\n else if (c == ')') {\n dfs (ans, build, le, re - 1, balance, index + 1, s); // delete this\n dfs (ans, build + \")\", le, re, balance - 1, index + 1, s); // add this\n } else {\n //situation of other string\n dfs (ans, build + c, le, re, balance, index + 1, s);\n }\n }","title":""},{"docid":"bf402a0b66958075ac631086b9d84c85","score":"0.48332748","text":"private void degenerate() {\n final double worst = Double.MIN_VALUE;//min possible value to test\n \n if (supply.length + demand.length - 1 != toList().size()) {\n \n for (int r = 0; r < supply.length; r++)\n for (int c = 0; c < demand.length; c++) {\n if (cellPath[r][c] == null) {\n Transport tmp = new Transport(worst, costs[r][c], r, c);\n if (pathFinder(tmp).length == 0) {\n \tcellPath[r][c] = tmp;\n return;//should work\n }\n }\n }\n }\n }","title":""},{"docid":"19b528e4208b73b51e4ad510a21ba88f","score":"0.48190096","text":"private void looser(int n) {\n\t\tfor(String key:lost_to.keySet()) {\n\t\t\tif(lost_to.get(key).size() == n-1) {\n\t\t\t\tlooser = key;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"15ee5dd8cfaf89fba8cefcb764f43051","score":"0.48144624","text":"private boolean noSet() {\n\t\tint[] have = new int[256];\n\t\tfor (Card card : currentCards) {\n\t\t\thave[card.getBits()] = currentCards.indexOf(card);\n\t\t}\n\t\tfor (int i=0; i<currentCards.size(); i++) {\n\t\t\tfor (int j=i+1; j<currentCards.size(); j++) {\n\t\t\t\tint k = have[thirdCardBits(currentCards.get(i), currentCards.get(j))];\n\t\t\t\tif (k > j) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}","title":""},{"docid":"9913b4790d4c5e6193bb925b7b3cf629","score":"0.48140326","text":"private static void comboCounter() {\n\t\tif (preHit && !sunkShip) // if the previous attack was a hit and not\n\t\t\t\t\t\t\t\t\t// sunk\n\t\t\tcombo *= THREE;\n\t\telse if (preHit && sunkShip) // if the previous attack sunk the ship\n\t\t\tcombo *= FIVE;\n\t\telse\n\t\t\tcombo = ONE; // if the current attack was a SUNK but the previous\n\t\t\t\t\t\t\t// attack was a MISS\n\t\t\t\t\t\t\t// or the current attack was a hit but the previous\n\t\t\t\t\t\t\t// was a MISS\n\t}","title":""},{"docid":"ad1e13e0d9e2297a362e40e0736ffca6","score":"0.4807406","text":"private boolean r3() // Rule for testing for best practices\n {\n int c = 0 ;\n \n if(sq[0][0] == this.userSymbol)\n {\n c++ ;\n }\n \n if(sq[0][2] == this.userSymbol)\n {\n c++ ;\n }\n \n if(sq[2][0] == this.userSymbol)\n {\n c++ ;\n }\n \n if(sq[2][2] == this.userSymbol)\n {\n c++ ;\n }\n \n if(c > 1 && sq[1][1] == this.compSymbol)\n {\n if(sq[0][1] == -1)\n {\n sq[0][1] = this.compSymbol ;\n return true ;\n }\n else if(sq[1][0] == -1)\n {\n sq[1][0] = this.compSymbol ;\n return true ;\n }\n else if(sq[1][2] == -1)\n {\n sq[1][2] = this.compSymbol ;\n return true ;\n }\n else if(sq[2][1] == -1)\n {\n sq[2][1] = this.compSymbol ;\n return true ;\n }\n }\n \n // Two crosses at specific position to opponent and our in middle scenario\n \n if(sq[0][0] == this.userSymbol && sq[2][1] == this.userSymbol && sq[1][1] == this.compSymbol && sq[1][2] == -1)\n {\n sq[1][2] = this.compSymbol ;\n return true ;\n }\n else if(sq[2][0] == this.userSymbol && sq[1][2] == this.userSymbol && sq[1][1] == this.compSymbol && sq[0][1] == -1)\n {\n sq[0][1] = this.compSymbol ;\n return true ;\n }\n else if(sq[0][2] == this.userSymbol && sq[1][0] == this.userSymbol && sq[1][1] == this.compSymbol && sq[2][1] == -1)\n {\n sq[2][1] = this.compSymbol ;\n return true ;\n }\n else if(sq[2][2] == this.userSymbol && sq[0][1] == this.userSymbol && sq[1][1] == this.compSymbol && sq[1][0] == -1)\n {\n sq[1][0] = this.compSymbol ;\n return true ;\n }\n \n return false ;\n }","title":""},{"docid":"5b3f104721fc9790274402a6b8e16a15","score":"0.4806415","text":"private String construccStringWithKDistinctApart(int[] nums, int k) {\n\n StringBuilder sb = new StringBuilder();\n\n HashMap<Character, Integer> map = new HashMap<>();\n\n map.put('a', nums[0]);\n map.put('b', nums[1]);\n map.put('c', nums[2]);\n\n PriorityQueue<Map.Entry<Character, Integer>> pq\n = new PriorityQueue<>(11, (a, b) -> (b.getValue() - a.getValue()));\n\n pq.addAll(map.entrySet());\n\n int len = nums[0] + nums[1] + nums[2];\n\n Map.Entry<Character, Integer> onHold = null;\n\n while (!pq.isEmpty()) {\n Map.Entry<Character, Integer> cur = pq.poll();\n\n sb.append(cur.getKey());\n\n\n if (onHold != null) {\n pq.add(onHold);\n onHold = null;\n }\n\n if (cur.getValue() > 1) {\n cur.setValue(cur.getValue() - 1);\n\n if (sb.length() >= (k - 1) && sb.charAt(sb.length() - (k - 1)) == cur.getKey()) {\n onHold = cur;\n } else {\n pq.add(cur);\n }\n }\n }\n\n return sb.toString();\n }","title":""},{"docid":"c83b1d880914cf75e5ac3c0cf66b93be","score":"0.48046133","text":"public void checkConsume() {\n\t\tint tempSize = 0;\n\t\tfor (Organism x : this.getOrganisms()) {\n\t\t\ttempSize = this.size;\n\t\t\tfor (Organism z : this.getOrganisms()) {\n\t\t\t\tconsume(x, z);\n\t\t\t\tif (this.size < tempSize) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (this.size < tempSize) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"78edd2066bb73174e94ebe1f1022cdae","score":"0.48020563","text":"private boolean g()\r\n/* 192: */ {\r\n/* 193:221 */ return ((this.r.u > -1) && (this.r.u < a.size())) || (this.t.b().length() > 1);\r\n/* 194: */ }","title":""},{"docid":"6befba9d238ad0f1521caf86d789b37c","score":"0.48008034","text":"private int[] checkMatches(Card[] combination) {\n int[] combo_value = new int[7]; // The current hand value\n int[] kicker; // The kickers in the hand\n \n int matches; // The amount of cards matching.\n int n, j;\n OUTER:\n // Figures out how many cards are matching in the combination of cards.\n for (int i = 0; i < combination.length; i++) {\n matches = 0;\n n = 0; // Tracks how many cards have been checked\n j = 1 + i; // The card being checked with the current card\n while (n < 4) {\n // If true, wrap around to the start.\n if (j >= combination.length) {\n j -= combination.length;\n }\n \n // If true, we have a match.\n if (combination[i].value == combination[j].value) {\n // If there is no previous matches, then there are now\n // two matches, otherwise just add one more match\n if (matches == 0) {\n matches = 2;\n } else {\n matches += 1 ;\n }\n }\n \n j++;\n n++;\n }\n // Figures out what type of hand you have based on your matches\n switch (matches) {\n case 4:\n // Four of a Kind\n combo_value[0] = four_of_a_kind;\n combo_value[1] = combination[i].value;\n kicker = findKicker(combination, combination[i].value, 0, 1);\n combo_value[3] = kicker[0];\n break OUTER;\n case 3:\n // If there is a pair already, it is a full house\n if (combo_value[0] == pair) {\n // Full House\n combo_value[0] = full_house;\n combo_value[2] = combo_value[1];\n combo_value[1] = combination[i].value;\n break OUTER;\n } else {\n // Three of a Kind\n combo_value[0] = three_of_a_kind;\n combo_value[1] = combination[i].value;\n kicker = findKicker(combination, combination[i].value, 0, 2);\n combo_value[3] = kicker[0];\n combo_value[4] = kicker[1];\n }\n break;\n case 2:\n // If there is a three of a kind already, it is a full house\n if (combo_value[0] == three_of_a_kind) {\n // Full House\n combo_value[0] = full_house;\n combo_value[2] = combination[i].value;\n break OUTER;\n } else if (combo_value[0] == pair) {\n // Checks to see if there is another pair, therefore it is a two pair\n if (combo_value[1] != combination[i].value) {\n // Two Pair\n combo_value[0] = two_pair;\n // Puts the two pairs in order\n if (combination[i].value > combo_value[1]) {\n combo_value[2] = combo_value[1];\n combo_value[1] = combination[i].value;\n } else {\n combo_value[2] = combination[i].value;\n } \n kicker = findKicker(combination, combo_value[1], combo_value[2], 1);\n combo_value[3] = kicker[0];\n break OUTER;\n }\n } else {\n // Pair\n combo_value[0] = pair;\n combo_value[1] = combination[i].value;\n kicker = findKicker(combination, combination[i].value, 0, 3);\n combo_value[3] = kicker[0];\n combo_value[4] = kicker[1];\n combo_value[5] = kicker[2];\n }\n break;\n default:\n // High Card\n if (combo_value[0] == 0 && combo_value[1] < combination[i].value) {\n combo_value[1] = combination[i].value;\n kicker = findKicker(combination, combination[i].value, 0, 4);\n combo_value[3] = kicker[0];\n combo_value[4] = kicker[1];\n combo_value[5] = kicker[2];\n combo_value[6] = kicker[3];\n } break;\n }\n }\n \n return combo_value;\n }","title":""},{"docid":"e0ad7eb66c88fc245c1c74d7ede182a1","score":"0.48007342","text":"public static List<List<Integer>> combinations77(int n, int k) {\n List<List<Integer>> result = new ArrayList<List<Integer>>();\n if(k>n) return result; ///\n backTracking77(result, new ArrayList<>(), n,k, 1);\n return result;\n }","title":""},{"docid":"b576c2533f99d8fa49255768accc2abd","score":"0.4799459","text":"boolean hasCombinator();","title":""},{"docid":"66054f6569c2237ec22d6da6a47a3b65","score":"0.4777889","text":"private List<String> clumpFinding(String input, int L, int K, int t) {\n\t\tList<String> rto = new ArrayList<String>();\n\t\t\n\t\tint l0 = 0; \n\t\tint l1 = l0 + L;\n\n\t\t// Loop through windows of size L\n\t\twhile (l1 < input.length()) {\n\t\t\tString window = input.substring(l0, l1);\n\t\t\t\n\t\t\tint k0 = l0;\n\t\t\tint k1 = k0 + K;\n\t\t\t// Loop all possible patterns\n\t\t\twhile (k1 <= l1) {\n\t\t\t\tString pattern = input.substring(k0, k1);\n\t\t\t\t\n\t\t\t\tif (patternCount(window, pattern) >= t) {\n\t\t\t\t\tif (!rto.contains(pattern)) {\n\t\t\t\t\t\trto.add(pattern);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tk0++;\n\t\t\t\tk1++;\n\t\t\t}\n\t\t\tl0++;\n\t\t\tl1++;\n\t\t}\n\t\treturn rto;\n\t}","title":""},{"docid":"192825972487d92a84410cf100720f48","score":"0.4774058","text":"private static String removeRatingFromFilter(String filter){\n int openBracketCount = 0;\n if (filter.charAt(0) == '(' && filter.charAt(filter.length() - 1) == ')'){\n for (int i = 0; i < filter.length() - 1; i++){\n if (filter.charAt(i) == '('){\n openBracketCount ++;\n }\n\n if (filter.charAt(i) == ')'){\n openBracketCount --;\n }\n\n if (openBracketCount == 0){\n break;\n }\n }\n }\n if (openBracketCount <= 0)\n System.out.println (String.format(\"%s expression do not have outer brackets\", filter));\n else\n System.out.println (String.format(\"%s expression have outer brackets\", filter));\n // Find all the expressions\n\n\n\n return \"\";\n }","title":""},{"docid":"ebb0080df96bd73f7e0b27029a4e01de","score":"0.47729093","text":"public void dfsPablanInefficient(int index,\n String s,\n StringBuilder sequence,\n Set<String> result,\n int leftRem,\n int rightRem,\n int leftCount,\n int rightCount) {\n if(index == s.length()) {\n if(leftRem == 0 && rightRem == 0) {\n // This is a valid sequence\n result.add(sequence.toString());\n }\n } else {\n // Remove case\n if((s.charAt(index) == '(' && leftRem > 0) || (s.charAt(index) == ')') && rightRem > 0) {\n dfsPablanInefficient(index + 1,\n s,\n sequence,\n result,\n s.charAt(index) == '(' ? leftRem - 1 : leftRem,\n s.charAt(index) == ')' ? rightRem - 1 : rightRem,\n leftCount,\n rightCount);\n }\n\n // Append to create current Level\n sequence.append(s.charAt(index));\n\n // This decision part of the logic is needed... see this example\n // ()())( -> derived from ()())(), if you don't check that\n // leftCount > rightCount you will end up with such an expression\n // that's why we keep track of left count and right count\n\n if(s.charAt(index) != '(' && s.charAt(index) != ')') {\n // is not a parenthesis we simply expand dfs\n dfsPablanInefficient(index + 1, s, sequence, result, leftRem, rightRem, leftCount, rightCount);\n } else if(s.charAt(index) == '(') {\n dfsPablanInefficient(index + 1, s, sequence, result, leftRem, rightRem, leftCount + 1, rightCount);\n } else if(leftCount > rightCount) {\n dfsPablanInefficient(index + 1, s, sequence, result, leftRem, rightRem, leftCount, rightCount + 1);\n }\n\n // Remove current level for backtracking\n sequence.deleteCharAt(sequence.length() - 1);\n }\n }","title":""},{"docid":"d07c2921217c0d802b491be4c6f741aa","score":"0.4768981","text":"public List<String> removeInvalidParentheses(String s) {\n Queue<String> queue = new LinkedList();\n List<String> ans = new ArrayList();\n //Start BFS with string\n queue.add(s);\n Set<String> visited = new HashSet();\n visited.add(s);\n while (!queue.isEmpty()){\n String t = queue.poll();\n //Check if string is valid.\n if(isValid(t)){\n //Add to answer\n ans.add(t);\n }\n //If a valid string is found, then we need not BFS lower length strings\n if(ans.isEmpty()){\n for(int i=0;i<t.length();i++){\n //Remove ith character and add to stack. Only remove ith character if it is a bracket\n if(!Character.isAlphabetic(t.charAt(i))&&!visited.contains(t.substring(0,i)+t.substring(i+1))) {\n queue.add(t.substring(0, i) + t.substring(i + 1));\n visited.add(t.substring(0, i) + t.substring(i + 1));\n }\n }\n }\n }\n return ans;\n }","title":""},{"docid":"a3327d3e7789761959d62229ed183423","score":"0.47645098","text":"public static void keepOnlyCompositeNumbers( List<Integer> nums )\r\n {\nboolean checker=false;\n//make a for loop which traverses the array \nfor(int i=0; i<nums.size();i++){\n//make a for loop which goes through each value from 2 to the current index and constantly checks that checker is false \nfor(int j=2; j<nums.get(i) && !checker;j++){\n//check whether it has any factors (besides 1 and itself)... if it does, set checker to true \nif(nums.get(i)%j==0)\nchecker=true;\n//end nested for loop\n}\n//check if checker is still false\nif(!checker){\n//if so remove the current index and decrement the current index by 1 (to compensate for missing index)\nnums.remove(i);\ni--;\n }\n//else\nelse\n//reset checker to false \nchecker=false; \n//end for loop \n }\n//end method :)\r\n }","title":""},{"docid":"1a6199462d73f23b2d459b8a55c0b075","score":"0.47587198","text":"private int checkPatterns(Board gameBoard, String[] directions, int player) {\n\n\t\tint fourMe = 0;\n\t\tint fourYou = 0;\n\t\tint openThreeMe = 0;\n\t\tint openThreeYou = 0;\n\t\tint openTwoMe = 0;\n\t\tint openTwoYou = 0;\n\n\t\tchar me = (player == 1) ? gameBoard.getPlayer1Char() : gameBoard.getPlayer2Char();\n\t\tchar you = (player == 1) ? gameBoard.getPlayer2Char() : gameBoard.getPlayer1Char();\n\t\tchar no = gameBoard.getNoPlayerChar();\n\n\t\t//list of possible open two combinations\n\t\tString a = \"\" + no + me + me;\n\t\tString b = \"\" + me + me + no;\n\t\tString c = \"\" + me + no + me;\n\t\tString d = \"\" + no + you + you;\n\t\tString e = \"\" + you + you + no;\n\t\tString f = \"\" + you + no + you;\n\n\t\t//list of possible open three combinations\n\t\tString g = \"\" + me + no + me + me;\n\t\tString h = \"\" + me + me + no + me;\n\t\tString j = \"\" + no + me + me + me;\n\t\tString k = \"\" + me + me + me + no;\n\t\tString l = \"\" + you + no + you + you;\n\t\tString m = \"\" + you + you + no + you;\n\t\tString n = \"\" + no + you + you + you;\n\t\tString o = \"\" + you + you + you + no;\n\n\t\t//list of possible four combinations\n\t\tString p = \"\" + me + me + me + me;\n\t\tString q = \"\" + you + you + you + you;\n\n\t\t//go through strings of particular direction and check for occurrences of combinations above\n\t\tfor (int i = 0; i < gameBoard.getBoardSize(); i++) {\n\t\t\tString direction = new String (directions[i]);\n\n\t\t\t//check for four in a rows\n\t\t\tif (direction.contains(p)) fourMe++;\n\t\t\telse if (direction.contains(q)) fourYou++;\n\n\t\t\t//check for open three in a rows\n\t\t\telse if (direction.contains(g)) openThreeMe++;\n\t\t\telse if (direction.contains(h)) openThreeMe++;\n\t\t\telse if (direction.contains(j)) openThreeMe++;\n\t\t\telse if (direction.contains(k)) openThreeMe++;\n\t\t\telse if (direction.contains(l)) openThreeYou++;\n\t\t\telse if (direction.contains(m)) openThreeYou++;\n\t\t\telse if (direction.contains(n)) openThreeYou++;\n\t\t\telse if (direction.contains(o)) openThreeYou++;\n\n\t\t\t//check for open two in a rows\n\t\t\telse if (direction.contains(a + \".\") || direction.contains(\".\" + a)) openTwoMe++;\n\t\t\telse if (direction.contains(b + \".\") || direction.contains(\".\" + b)) openTwoMe++;\n\t\t\telse if (direction.contains(c + \".\") || direction.contains(\".\" + c)) openTwoMe++;\n\t\t\telse if (direction.contains(d + \".\") || direction.contains(\".\" + d)) openTwoYou++;\n\t\t\telse if (direction.contains(e + \".\") || direction.contains(\".\" + e)) openTwoYou++;\n\t\t\telse if (direction.contains(f + \".\") || direction.contains(\".\" + f)) openTwoYou++;\n\t\t}\n\n\t\t//return utility\n\t\treturn 10 * (fourMe - fourYou) + 3 * (openThreeMe - openThreeYou) + (openTwoMe - openTwoYou);\n\t}","title":""},{"docid":"61fea4d04e8c6b89e5d7024223f68c37","score":"0.47542918","text":"@Test\n public void test() {\n long bestNumRectangles = 0;\n for (int i = 1; tr(i) < 2 * N; i++)\n for (int j = 1; true; j++) {\n long numRectangles = tr(i) * tr(j);\n if (numRectangles >= 2 * N)\n break;\n if (Math.abs(numRectangles - N) < Math.abs(bestNumRectangles - N)) {\n bestNumRectangles = numRectangles;\n ans = i * j;\n }\n }\n check(2772);\n }","title":""},{"docid":"c9f027890c6f93e3b9419041b6d750de","score":"0.47541156","text":"public int longestValidParentheses(String s) {\n if (s.length() == 0) {\n return 0;\n }\n\n // translate the brackets into 1 and -1\n List<Integer> trans_data = new ArrayList<>(Arrays.asList());\n for (char c : s.toCharArray()) {\n if (c == '(') {\n trans_data.add(1);\n } else {\n trans_data.add(-1);\n }\n }\n\n // while loop to merge pairs\n boolean merged = true;\n while (merged) {\n merged = false;\n List<Integer> stack = new ArrayList<>(Arrays.asList());\n List<Integer> new_trans_data = new ArrayList<>(Arrays.asList());\n\n for (int elem : trans_data) {\n if (elem == 1) {\n if (stack.isEmpty()) {\n stack.add(elem);\n } else {\n new_trans_data.addAll(stack);\n stack.clear();\n stack.add(elem);\n }\n } else if (elem == -1) {\n if (!stack.isEmpty() && stack.get(0) == 1) {\n stack.add(elem);\n if (stack.size() == 2) {\n new_trans_data.add(2);\n } else {\n new_trans_data.add(stack.get(1) + 2);\n }\n stack.clear();\n merged = true;\n } else {\n new_trans_data.addAll(stack);\n stack.clear();\n new_trans_data.add(elem);\n }\n } else {\n if (!stack.isEmpty() && stack.get(stack.size() - 1) > 1) {\n stack.set(stack.size() - 1, stack.get(stack.size() - 1) + elem);\n } else {\n stack.add(elem);\n }\n }\n }\n\n if (!stack.isEmpty()) {\n new_trans_data.addAll(stack);\n }\n trans_data = new_trans_data;\n\n }\n\n // return the max value only if max value >= 2, otherwise they are single brackets (-1 or 1)\n int ans = 0;\n for (int i : trans_data) {\n if (i > ans) {\n ans = i;\n }\n }\n if (ans >= 2) {\n return ans;\n } else {\n return 0;\n }\n }","title":""},{"docid":"d23dee9697b907e24c9bc689c1742456","score":"0.47524497","text":"private int getWinCombination(int combinationNumber, int posY, int posX) {\n if (combinationNumber < fieldSize) { // strings\n if (posY == combinationNumber) {\n return BELONGS_TO_WIN_COMBINATION;\n }\n return DOESNT_BELONG_TO_WIN_COMBINATION;\n }\n if (combinationNumber >= fieldSize && combinationNumber < (fieldSize * 2)) { // columns\n if ((posX + fieldSize) == combinationNumber) {\n return BELONGS_TO_WIN_COMBINATION;\n }\n return DOESNT_BELONG_TO_WIN_COMBINATION;\n }\n if (combinationNumber == (fieldSize * 2) && posX == posY) { // diagonals\n return BELONGS_TO_WIN_COMBINATION;\n }\n if (combinationNumber == (fieldSize * 2 + 1) && posX == (fieldSize - posY - 1)) {\n return BELONGS_TO_WIN_COMBINATION;\n }\n return DOESNT_BELONG_TO_WIN_COMBINATION;\n }","title":""},{"docid":"5c139c7c5e8463917ef70d230a85d2b1","score":"0.47479993","text":"private boolean twoPieces(int f) {\n\t\tfor(int i=0;i<=t.length-1;i++){\r\n\t\t\tif(t[i][0]==t[i][1]&&t[i][0]==f&&t[i][2]==0){\r\n\t\t\t\tb.dropPiece(new PieceLocation(-1,i,2));return true;\r\n\t\t\t}else if(t[i][0]==t[i][2]&&t[i][0]==f&&t[i][1]==0){\r\n\t\t\t\tb.dropPiece(new PieceLocation(-1,i,1));return true;\r\n\t\t\t}else if (t[i][1]==t[i][2]&&t[i][1]==f&&t[i][0]==0){\r\n\t\t\t\tb.dropPiece(new PieceLocation(-1,i,0));return true;\r\n\t\t\t}else if(t[0][i]==t[1][i]&&t[0][i]==f&&t[2][i]==0){\r\n\t\t\t\tb.dropPiece(new PieceLocation(-1,2,i));return true;\r\n\t\t\t}else if (t[0][i]==t[2][i]&&t[0][i]==f&&t[1][i]==0){\r\n\t\t\t\tb.dropPiece(new PieceLocation(-1,1,i));return true;\r\n\t\t\t}else if(t[1][i]==t[2][i]&&t[1][i]==f&&t[0][i]==0){\r\n\t\t\t\tb.dropPiece(new PieceLocation(-1,0,i));return true;\r\n\t\t\t}\t\t\t\r\n\t\t}\r\n\t\tif (t[0][0]==t[1][1]&&t[0][0]==f&&t[2][2]==0){\r\n\t\t\tb.dropPiece(new PieceLocation(-1,2,2));return true;\r\n\t\t}else if(t[1][1]==t[2][2]&&t[1][1]==f&&t[0][0]==0){\r\n\t\t\tb.dropPiece(new PieceLocation(-1,0,0));return true;\r\n\t\t}else if(t[0][2]==t[1][1]&&t[0][2]==f&&t[2][0]==0){\r\n\t\t\tb.dropPiece(new PieceLocation(-1,2,0));return true;\r\n\t\t}else if (t[1][1]==t[2][0]&&t[1][1]==f&&t[0][2]==0){\r\n\t\t\tb.dropPiece(new PieceLocation(-1,0,2));return true;\r\n\t\t}else{\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}","title":""},{"docid":"ff3974fadddd68347507d4f239a3e77b","score":"0.4730188","text":"private void secondPass() {\n int distinctItems = reader.getDistinctItem();\n /* Size of the triangular array will need 2 (m * m) bytes */\n int [] traingularArray = new int[ 2 * ((int) Math.pow( frequentItemSet.size(), 2)/ Integer.BYTES) + 10];\n for (List<Integer> basket : baskets) {\n for(int i = 0; i < basket.size() - 1; i++) {\n if(! frequentItemSet.containsKey(basket.get(i)) ){\n continue;\n }\n for(int j = i + 1; j < basket.size(); j++) {\n if(!frequentItemSet.containsKey(basket.get(j))) {\n continue;\n }\n else {\n ArrayList<Integer> item = new ArrayList<>();\n item.add(basket.get(i));\n item.add(basket.get(j));\n int k = 0;\n int firstItem= frequentItemSet.get(item.get(0));\n int secondItem = frequentItemSet.get(item.get(1));\n if(firstItem < secondItem) {\n k = (firstItem - 1 ) * ( frequentItemSet.size() - (firstItem/2) ) + secondItem - firstItem;\n }\n else if(secondItem > firstItem )\n {\n k = (secondItem - 1 ) * ( frequentItemSet.size() - (secondItem/2) ) + firstItem - secondItem;\n }\n traingularArray[ k ]++;\n if(traingularArray[k] >= minSupport) {\n Collections.sort(item);\n String key = map.get(item.get(0)) + \",\" + map.get(item.get(1));\n if(!itemSet.contains(key)) {\n System.out.println(key);\n itemSet.add(key);\n }\n if(!frequentItemSet1.contains(item)) {\n frequentItemSet1.add(item);\n }\n }\n }\n }\n }\n }\n frequentItemSet = null;\n itemQuantity = null;\n itemSet.clear();\n\n if(frequentItemSet1.size() > 1) {\n findCandidateSet();\n }\n }","title":""},{"docid":"19c43a2f192b5fc4b603ef5ea865e6b4","score":"0.47239414","text":"public static StringBuilder cleanDoubledBrackets(StringBuilder inp) {if(inp.length()<5) return inp;\r\n StringBuilder res = inp;\r\n int index1;\r\n for (int pp = 0; pp < res.length(); pp++) {\r\n index1 = res.indexOf(\"((\", pp); if (index1==-1) break;\r\n int indexC = res.indexOf(\")\", index1 + 2);\r\n int indexO = res.indexOf(\"(\", index1 + 2);\r\n if ((indexC < indexO) || (indexO == -1)) {\r\n if ((indexC + 1 < res.length()) && (res.charAt(indexC + 1) == ')')) {\r\n res.deleteCharAt(indexC);\r\n res.deleteCharAt(index1);\r\n pp--;\r\n }\r\n } else {\r\n int counter = 1;\r\n for (int k = indexO + 1; k < res.length(); k++) {\r\n char charK = res.charAt(k);\r\n if (charK == '(') {\r\n counter++;\r\n } else {\r\n if (charK == ')') {\r\n counter--;\r\n }\r\n }\r\n if (counter == -1) {\r\n if ((k + 1 < res.length()) && (res.charAt(k + 1) == ')')) {\r\n res.deleteCharAt(k);\r\n res.deleteCharAt(index1);\r\n pp--;\r\n }\r\n break;\r\n }\r\n }\r\n }\r\n }\r\n // удалим скобки в которых нет операций + -, а перед ними нет функции и если после скобок нет шапочки или штриха\r\n // нужно сохранить скобки при \"(y^5)^6\" \r\n // и нужно сохранить \\sin([х])\r\n int pp = -1;\r\n b:\r\n while (pp < res.length()) {\r\n int index = res.indexOf(\"(\", pp);\r\n if (index == -1) {return res;}\r\n// int indexSB = res.indexOf(\"[\", index); //удаляем ([ ]), т.е. с вектора снимаем круглые скобки.\r\n// if (indexSB != -1) {\r\n// int tmp_bl = index + 1;\r\n// int ttt = res.charAt(tmp_bl);\r\n// while ((tmp_bl < indexSB) && ((ttt == ' ') || (ttt == '\\n'))) {\r\n// tmp_bl++;\r\n// }\r\n// if (res.charAt(tmp_bl) == '[') {\r\n// int posPareSB = posOfPareBracket(res, indexSB, '[', ']');\r\n// int temp = posPareSB + 1;\r\n// if ((posPareSB != -1) && (temp < res.length())) {\r\n// ttt = res.charAt(temp);\r\n// while ((temp < res.length()) && ((ttt == ' ') || (ttt == '\\n'))) {\r\n// temp++;\r\n// ttt = res.charAt(temp);\r\n// }\r\n// if (ttt == ')') {\r\n// res.deleteCharAt(temp);\r\n// res.deleteCharAt(index);\r\n// return res;\r\n// }\r\n// }\r\n// }\r\n// }\r\n int posPare = posOfPareBracket(res, index, '(', ')');\r\n int tmp_i = posPare + 1;\r\n while ((tmp_i < res.length()) && (res.charAt(tmp_i) == ' ')) {\r\n tmp_i++;\r\n }\r\n if ((tmp_i < res.length()) && (((res.charAt(tmp_i) == '^') || (res.charAt(tmp_i) == '\\'')))) {\r\n pp = index + 1;\r\n continue b;\r\n }\r\n int k = index + 1;\r\n while (k < posPare) {\r\n char charK = res.charAt(k);\r\n if ((charK == '+') || (charK == '-')) {\r\n pp = index + 1;\r\n continue b;\r\n } else {\r\n if (charK == '(') {\r\n k = posOfPareBracket(res, k, '(', ')') + 1;\r\n } else {\r\n k++;\r\n }\r\n }\r\n }\r\n int indexBackSlash = res.lastIndexOf(\"\\\\\", index);\r\n if (indexBackSlash == -1 && posPare != -1 &&\r\n (!((index>1)&&(res.charAt(index-1)=='{')&&(res.charAt(index-2)=='^')))) // <- показатель производной сохраняем в скобках\r\n {\r\n res.deleteCharAt(posPare);\r\n res.deleteCharAt(index);\r\n pp = index; \r\n } else {\r\n int indexO = res.indexOf(\"(\", indexBackSlash);\r\n int indexFB = res.indexOf(\"{\", indexBackSlash);\r\n int posPareFB = (indexFB == -1) ? (-1) : posOfPareBracket(res, indexFB, '{', '}');\r\n int indexO2 = (posPareFB == -1) ? (-1) : res.indexOf(\"(\", posPareFB);\r\n if ((((indexO2 != -1) && (indexO2 < index)) || ((index < posPareFB) && (index > indexFB))\r\n || ((indexO < index) && ((indexO < indexFB) || (indexFB == -1))) ) &&\r\n (!((index>1)&&(res.charAt(index-1)=='{')&&(res.charAt(index-2)=='^'))) ) // <- показатель производной сохраняем в скобках\r\n {\r\n res.deleteCharAt(posPare);\r\n res.deleteCharAt(index);\r\n pp = index;\r\n } else {\r\n pp = index + 1;\r\n }\r\n }\r\n }\r\n if(res.charAt(0)=='(') {int posStart = posOfPareBracket(res, 0, '(', ')');\r\n if(res.length()-1==posStart){ res.deleteCharAt(0);res.deleteCharAt(posStart);}\r\n }// удаление первой и парной последней скобки\r\n return (res);\r\n }","title":""},{"docid":"27542bd498214ec1b6b1ae5de378b9f5","score":"0.47226167","text":"private void dfs(List<String> result, String s, int leftUnmatch, int rightUnmatch, int index) {\n if (leftUnmatch == 0 && rightUnmatch == 0 && isValid(s)) {\n result.add(s);\n return;\n }\n\n for (int i = index; i < s.length(); i++) {\n if (i != index && s.charAt(i) == s.charAt(i - 1)) {\n continue;\n }\n\n // delete current character to form a new string\n String tempStr = s.substring(0, i) + s.substring(i + 1);\n\n // if we still have quota for deleting left parentheses or right parentheses, try next dfs recursion\n if (leftUnmatch > 0 && s.charAt(i) == '(') {\n // since we already -1 for next recursion index, we DO NOT need to use i+1 as parameter for next recursion\n dfs(result, tempStr, leftUnmatch - 1, rightUnmatch, i);\n }\n else if (rightUnmatch > 0 && s.charAt(i) == ')') {\n dfs(result, tempStr, leftUnmatch, rightUnmatch - 1, i);\n }\n }\n }","title":""},{"docid":"337cb879fca567a41a7162e6cac93f56","score":"0.4717629","text":"public void eliminateStrategy(Map<String, ArrayList<Integer>> gridValues) {\r\n\t\tString[] tempBoxes = grid.getBoxes();\r\n\t\tfor (int i = 0; i < tempBoxes.length; i++) { // tempBoxes.length\r\n\t\t\tif(gridValues.get(tempBoxes[i]).size()==1) {\r\n\t\t\t\tint temp = gridValues.get(tempBoxes[i]).get(0);\r\n\t\t\t\tfor(String[] lists : grid.getPeersMap().get(tempBoxes[i])) {\r\n\t\t\t\t\t\r\n\t\t\t\t\t//prints each value from row_unit, col_unit and box_unit\r\n\t\t\t\t\tfor (int j = 0; j < lists.length; j++) {\r\n\t\t\t\t\t\t//if(tempBoxes[i].equals(\"A3\")) {\r\n\t\t\t\t\t\t//System.out.println(\"E: \"+tempBoxes[i]+\" \"+CopyGridValues.get(lists[j]) +\" \"+lists[j]);\r\n\t\t\t\t\t\t//if(gridValues.get(lists[j]).size()>1) { //FOR SOME REASON THIS ALGORITHM WANTS TO DELETE FROM EMPTY FIELDS SO THIS IS NEEDED\r\n\t\t\t\t\t\t\tgridValues.get(lists[j]).remove(new Integer(temp));\r\n\t\t\t\t\t\t//}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t}\r\n\t}","title":""},{"docid":"95cbb859009c3739a15e8ceb302531de","score":"0.4714664","text":"private List<Chosen> initFewerChosenList( ){\n\t\tList<Chosen> chosenList = new ArrayList<Chosen>();\n\t\t\n\t\tfor(int notChosenIdx1 = 1 ; notChosenIdx1 <= n;notChosenIdx1++){\n\t\t\tfor(int notChosenIdx2 = 1 ; notChosenIdx2 <= n;notChosenIdx2++){\n\t\t\t\t//一个chose, 去除n选2的选择\n\t\t\t\tif( notChosenIdx1 != notChosenIdx2){\n\t\t\t\t\tChosen chosen = new Chosen();\n\t\t\t\t\tfor( int lineNume = 1 ; lineNume <= n;lineNume++){\n\t\t\t\t\t\tif( lineNume != notChosenIdx1 &&\n\t\t\t\t\t\t\tlineNume != notChosenIdx2)\n\t\t\t\t\t\t\tchosen.addLine(lineNume);\n\t\t\t\t\t}\n\t\t\t\t\tchosen.cal(pairs);\n\t\t\t\t\tchosenList.add(chosen);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn chosenList;\n\t}","title":""},{"docid":"5054189f87d598b0957fdc0ebeb57878","score":"0.46994248","text":"public static int Main()\n\t{\n\t\tint n;\n\t\tint k;\n\t\tint i;\n\t\tint j;\n\t\tint l;\n\t\tint maxc = 0;\n\t\tint x = 0;\n\t\tString c = new String(new char[501]);\n\t\tchar[][] strout = new char[501][5];\n\t\tint[] a = new int[501]; //???????????\n\t\tfor (i = 0; i < 501; i++)\n\t\t{\n\t\t\ta[i] = 1; //???????????? ??????1\n\t\t}\n\t\tn = Integer.parseInt(ConsoleInput.readToWhiteSpace(true));\n\t\tc = ConsoleInput.readToWhiteSpace(true).charAt(0);\n\t\tk = c.length(); //??????????\n\t\tString p = c; //??????? ?????????\n\t\tfor (j = 0; j <= k - n; j++)\n\t\t{\n\t\t\tfor (l = j + 1; l <= k - n; l++)\n\t\t\t{\n\t\t\t\tfor (i = 0; i < n; i++) //???????\n\t\t\t\t{\n\t\t\t\t\tif (*(p.Substring(j) + i) == *(p.Substring(l) + i)) //??i+1?????????????\n\t\t\t\t\t{\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (i >= n) //????break??? ??????????\n\t\t\t\t{\n\t\t\t\t\ta[j]++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (i = 0;i < k - n; i++)\n\t\t{\n\t\t\tif (a[i] >= maxc)\n\t\t\t{\n\t\t\t\tmaxc = a[i];\n\t\t\t}\n\t\t}\n\t\tfor (i = 0;i < k - n; i++)\n\t\t{\n\t\t\tif (a[i] >= maxc) //???????????? ???? ??????????????\n\t\t\t{\n\t\t\t\tfor (j = 0;j < n; j++)\n\t\t\t\t{\n\t\t\t\t\tstrout[x][j] = (p.Substring(i) + j);\n\t\t\t\t}\n\t\t\t\tx++;\n\t\t\t}\n\t\t}\n\t\tif (maxc == 1) //??????? ??NO\n\t\t{\n\t\t\tSystem.out.print(\"NO\");\n\t\t\tSystem.out.print(\"\\n\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tSystem.out.print(maxc);\n\t\t\tSystem.out.print(\"\\n\");\n\t\t\tfor (i = 0; i < x; i++)\n\t\t\t{\n\t\t\t\tfor (j = 0;j < n; j++)\n\t\t\t\t{\n\t\t\t\t\tSystem.out.print(strout[i][j]);\n\t\t\t\t}\n\t\t\t\tSystem.out.print(\"\\n\");\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}","title":""},{"docid":"f5d92e90eedebdfeea8820cc40734f42","score":"0.46974498","text":"static void minimumBribes(int[] q) {\n int bribeCount = 0;\n boolean isChaotic = false;\n\n for(int i =0; i < q.length; i++){\n if(q[i] - (i+1) >2){\n isChaotic = true;\n break;\n }\n for(int j= Math.max(0,q[i] -2); j < i; j++){\n System.out.println(\"Printing value of ::\" +i );\n if(q[j] > q[i]){\n bribeCount++;\n }\n }\n\n }\n if(isChaotic){\n System.out.println(\"Too chaotic\");\n }else{\n System.out.println(bribeCount);\n }\n }","title":""},{"docid":"3394b99dea06e5b1824d69281d1a857f","score":"0.46803004","text":"private String gameWon() {\n for(int row = 0; row < 6; row++) {\n if(numR[row] >= 4) {\n String last = null; \n int count = 1; \n int largestCount = 1; \n for(int i = 0; i < 7; i++ ) {\n String str = this.board[row][i]; \n if (count == 3 && i != 6) {\n String next = this.board[row][i + 1]; \n if (next != null && str != null) {\n if (str.equals(next)) {\n return str; \n }\n }\n }\n if (str == null) {\n last = str; \n count = 1; \n } else {\n if (str.equals(last)) {\n count++; \n } else {\n last = str; \n count = 1; \n }\n }\n if (count > largestCount) { largestCount = count; numR[row] = largestCount; }\n if (count == 4) { return str; }\n }\n }\n }\n for(int col = 0; col < 7; col++) {\n if(numC[col] >= 4) {\n String last = null; \n int count = 1; \n int largestCount = 1; \n for(int i = 0; i < 6; i++ ){\n String str = this.board[i][col]; \n if (str == null) {\n last = str; \n count = 1; \n } else {\n if (str.equals(last)) {\n count++; \n } else {\n last = str; \n count = 1; \n }\n }\n if (count > largestCount) { largestCount = count; numC[col] = largestCount; }\n if (count == 4) { return str; }\n }\n }\n }\n for(int c = -2; c <=3; c++) {\n String last = null; \n int count = 1; \n int largestCount = 1; \n for(int r = 0; r < 6; r++) {\n if (c + r < 0 || c + r > 6) { continue; }\n String str = board[r][c + r]; \n if (str == null) { \n count = 1; \n last = null; \n } else {\n if (str.equals(last)) {\n count++; \n } else {\n last = str; \n count = 1; \n }\n }\n if (count > largestCount) { largestCount = count; }\n if (count == 4) { return str; }\n }\n }\n for(int c = 8; c >= 3; c--) {\n String last = null; \n int count = 1; \n int largestCount = 1; \n for(int r = 0; r < 6; r++) {\n if (c - r > 6 || c - r < 0) { last = null; continue; }\n String str = board[r][c-r]; \n if (str == null) {\n count = 1; \n last = null; \n } else {\n if (str.equals(last)) {\n count++; \n } else {\n last = str; \n count = 1; \n }\n }\n if (count > largestCount) { largestCount = count; }\n if (count == 4) { return str; }\n }\n }\n return null; \n }","title":""},{"docid":"44d6c72ed644b4a264ad8950070f605c","score":"0.4671125","text":"void noMoreBagsToCollect();","title":""},{"docid":"e9bb26b644ba34cfcca0bb599fc13ed2","score":"0.46677682","text":"static void processSequence(int openBracketsCount, int closeBracketsCount) {\n\tif (openBracketsCount + closeBracketsCount == 2 * n) {\n\t // at this point we've formed a correct sequence, incrementing\n\t // result\n\t numberOfCorrectSequences++;\n\t return;\n\t}\n\n\tif (openBracketsCount < n)\n\t // if '('-brackets are available, than adding '('\n\t processSequence(openBracketsCount + 1, closeBracketsCount);\n\n\tif (openBracketsCount > closeBracketsCount)\n\t // if current sequence can be closed 'correctly', than adding ')'.\n\t // Note: in this way of rules we are generating ONLY correct\n\t // sequences\n\t processSequence(openBracketsCount, closeBracketsCount + 1);\n\n\treturn;\n\n }","title":""},{"docid":"41d73470782b86e0fc1c4711aaf88102","score":"0.46677428","text":"private void combinations(int len, int fileCount){\n ArrayList<String> resources= new ArrayList<>(timeHarMap.keySet());\n System.out.println(\"Número resources \" + resources.size());\n Set<Set<String>> combinations = Sets.combinations(ImmutableSet.copyOf(resources), len);\n Set r;\n StringBuffer line = new StringBuffer();\n Iterator combIterator = combinations.iterator();\n System.out.println(\"Número combinações \" + combinations.size());\n int i = 0;\n while (combIterator.hasNext()){\n r = (Set) combIterator.next();\n\n line.setLength(0);\n Iterator lineIterator = r.iterator();\n while(lineIterator.hasNext()){\n if(line.length()>0) line.append(\",\");\n line.append(lineIterator.next().toString());\n }\n\n ProcessCombinationModel combinationInfo= new ProcessCombinationModel();\n combinationInfo.combination = line.toString();\n calculateStatistics(combinationInfo,fileCount);\n if(i++%100000==0) System.out.println(\"Comb \" + i);\n }\n }","title":""},{"docid":"19607aa2b91f79a8cc758462d2578009","score":"0.46658823","text":"@Override\n\tpublic int chooseNum(TreeSet<Integer> avail) {\n\t\tif (findOptimal == false){\n\t\t\tList<Integer> choices = new ArrayList<Integer>();\n\t\t\tsolve(avail,0,0,choices);\n\t\t}\n\t\t\n\t\t//Get the next number in the sequence and remove it\n\t\tint currentChoice = bestChoice.get(0);\n\t\tbestChoice.remove(0);\n\t\t\n\t\treturn currentChoice;\n\t}","title":""},{"docid":"fdf95543230d1be7db7a16820df2ca81","score":"0.46631432","text":"public void removeImpossibleRCs(int numMutable, int strandMut[][]){\n\n boolean done = false;\n\n while( !done ){//We iterate until no more RCs can be removed\n\n done = true;\n \n int numAAtypes[] = new int[numMutable];\n \n boolean prunedRCs[][][][] = new boolean[numberOfStrands][][][];//Which RCs should be removed\n for(int str=0; str<numberOfStrands; str++)\n prunedRCs[str] = new boolean[m.strand[str].numberOfResidues][strandRot[str].rl.getNumAAallowed()][];\n\n int ctr=0;\n for(int str=0;str<strandMut.length;str++){ //the number of AAs allowed for each AS residue\n for(int i=0;i<strandMut[str].length;i++){\n numAAtypes[ctr] = strandRot[str].getNumAllowable(strandMut[str][i]);\n ctr++;\n }\n }\n\n for (int curPos=0; curPos<numMutable; curPos++){\n int str=mutRes2Strand[curPos];\n int strResNum=strandMut[str][mutRes2StrandMutIndex[curPos]];\n Residue res = m.strand[str].residue[strResNum];\n\n for (int AA=0; AA<numAAtypes[curPos]; AA++){\n int curAA = strandRot[str].getIndexOfNthAllowable(strResNum,AA);\n\n //find how many rotamers are allowed for the current AA type at the given residue;\n //note that ala and gly have 0 possible rotamers\n int numRCForCurAAatPos = getNumRot( str, strResNum, curAA );\n\n prunedRCs[str][strResNum][curAA] = new boolean[numRCForCurAAatPos];\n\n for(int curRC=0; curRC<numRCForCurAAatPos; curRC++){\n\n prunedRCs[str][strResNum][curAA][curRC] = false;\n\n for (int altPos=0; altPos<numMutable; altPos++){\n\n if( altPos != curPos ){\n\n int str2=mutRes2Strand[altPos];\n int strResNum2=strandMut[str2][mutRes2StrandMutIndex[altPos]];\n\n boolean prune = true;\n Residue res2 = m.strand[str2].residue[strResNum2];\n \n for (int AA2=0; AA2<numAAtypes[altPos]; AA2++){\n int altAA = strandRot[str2].getIndexOfNthAllowable(strResNum2,AA2);\n\n //find how many rotamers are allowed for the current AA type at the given residue;\n //note that ala and gly have 0 possible rotamers\n int numRCForCurAAatPos2 = getNumRot( str2, strResNum2, altAA );\n\n\n for(int altRC=0; altRC<numRCForCurAAatPos2; altRC++){\n\n if( ! isParametricallyIncompatible(res, curAA, curRC, res2, altAA, altRC))\n prune = false;\n }\n }\n\n prunedRCs[str][strResNum][curAA][curRC] = prunedRCs[str][strResNum][curAA][curRC] || prune;\n }\n }\n\n if(prunedRCs[str][strResNum][curAA][curRC])\n done = false;\n }\n }\n }\n\n\n for(int str=0; str<numberOfStrands; str++)\n ((StrandRCs)strandRot[str]).removeRCs(prunedRCs[str]);\n }\n }","title":""},{"docid":"0a1be1c0336a7d664179c4e424d4ceb0","score":"0.46602437","text":"public void a(int paramInt)\r\n/* 233: */ {\r\n/* 234:394 */ paramInt = MathUtils.clamp(paramInt, 3, 32);\r\n/* 235:395 */ if (paramInt == this.g) {\r\n/* 236:396 */ return;\r\n/* 237: */ }\r\n/* 238:398 */ int j = paramInt - this.g;\r\n/* 239: */ \r\n/* 240:400 */ ArrayList<qw> localArrayList = Lists.newArrayList(this.c);\r\n/* 241:401 */ for (qw localqw : localArrayList)\r\n/* 242: */ {\r\n/* 243:402 */ int k = (int)localqw.xPos >> 4;\r\n/* 244:403 */ int m = (int)localqw.zPos >> 4;\r\n/* 245: */ int n;\r\n/* 246: */ int i1;\r\n/* 247:405 */ if (j > 0) {\r\n/* 248:406 */ for (n = k - paramInt; n <= k + paramInt; n++) {\r\n/* 249:407 */ for (i1 = m - paramInt; i1 <= m + paramInt; i1++)\r\n/* 250: */ {\r\n/* 251:408 */ qr localqr = a(n, i1, true);\r\n/* 252:410 */ if (!qr.b(localqr).contains(localqw)) {\r\n/* 253:411 */ localqr.a(localqw);\r\n/* 254: */ }\r\n/* 255: */ }\r\n/* 256: */ }\r\n/* 257: */ } else {\r\n/* 258:416 */ for (n = k - this.g; n <= k + this.g; n++) {\r\n/* 259:417 */ for (i1 = m - this.g; i1 <= m + this.g; i1++) {\r\n/* 260:418 */ if (!a(n, i1, k, m, paramInt)) {\r\n/* 261:419 */ a(n, i1, true).b(localqw);\r\n/* 262: */ }\r\n/* 263: */ }\r\n/* 264: */ }\r\n/* 265: */ }\r\n/* 266: */ }\r\n/* 267:426 */ this.g = paramInt;\r\n/* 268: */ }","title":""},{"docid":"93161b57788577525a4b2fa125b64265","score":"0.46600524","text":"private void removeInvalidFromPool()\r\n\t{\r\n\t\tint i;\r\n\t\tint size_mature_pool;\r\n\t\tint idx_to_remove;//index of an chromosome which has to be removed\r\n\t\tDiffEvolutionError error_cur;//object of the current error\r\n\t\tdouble[] max_error;\r\n\t\t\r\n\t\tsize_mature_pool = _pool_of_bests.size();\r\n\t\t\r\n\t\t//if the maturity pool is full and none of the genotypes could be removed above because of module outputs\r\n\t\t//then remove one of the oldest individuals according to the errors\r\n\t\tif(_pool_of_bests.size()==_size_pool_of_bests)\r\n\t\t{\r\n\t\t\t//simply take the worst genotype if all have errors below the threshold\r\n\t\t\tif(_best_idx_previous!=0)\r\n\t\t\t{\r\n\t\t\t\tidx_to_remove = 0;\r\n\t\t\t\tmax_error = _pool_of_bests.get(idx_to_remove)._error.getAverageError();\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tidx_to_remove = 1;\r\n\t\t\t\tmax_error = _pool_of_bests.get(idx_to_remove)._error.getAverageError();\r\n\t\t\t}\r\n\t\t\tfor(i=0; i<size_mature_pool; i++)\r\n\t\t\t{\r\n\t\t\t\tif(i!=_best_idx_previous)//previously found best genotype cannot be removed\r\n\t\t\t\t{\r\n\t\t\t\t\terror_cur = _pool_of_bests.get(i)._error;\r\n\t\t\t\t\tif(error_cur.isWorse(max_error)==true)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmax_error = error_cur.getAverageError();\r\n\t\t\t\t\t\tidx_to_remove = i;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//check consistency\r\n\t\t\tif(idx_to_remove==_best_idx_previous)\r\n\t\t\t{\r\n\t\t\t\tSystem.err.println(\"DiffEvolutionMature.findBest: best previous genotype cannot be removed\");\r\n\t\t\t\tSystem.exit(1);\r\n\t\t\t}\r\n\t\t\telse if(idx_to_remove < _best_idx_previous)//correct index of the previous best genotype\r\n\t\t\t{\r\n\t\t\t\t_best_idx_previous--;\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\t//everything is fine\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t_pool_of_bests.remove(idx_to_remove);\r\n\t\t}//is maturity pool full?\r\n\t}","title":""},{"docid":"9085c661ea666c2c29ca94a68d3b77d6","score":"0.46537703","text":"public static void main(String[] args) {\n\t\tInteger in = 11;\n\t\twhile( in > 1 ) {\n\t\t\tif( in%2 != 0 && (in >> 1)%2 != 0)\n\t\t\t\tSystem.out.println( true );\n\t\t\tin = in >> 1;\n\t\t}\n\t\t\n\t\t/*\n\t\t * Problem 2: Compute the smallest string possible by removing all instances of any one char\n\t\t * String should be the smallest one possible.\n\t\t */\n\t\tString str = \"\";\n\t\tHashMap<Character, Integer> map = new HashMap<>();\n\t\tchar maxChar = 'a';\n\t\tint maxCount = 0, newCount = 0;\n\t\tfor( char c : str.toCharArray() ) {\n\t\t\tif( map.containsKey(c) ) {\n\t\t\t\tmap.put(c, map.get(c) + 1 );\n\t\t\t\t\n\t\t\t}\n\t\t\telse {\n\t\t\t\tmap.put(c, 1);\n\t\t\t}\n\t\t\tnewCount = map.get(c);\n\t\t\tif( newCount > maxCount ) {\n\t\t\t\tmaxCount = newCount;\n\t\t\t\tmaxChar = c;\n\t\t\t}\n\t\t}\n\t\t\n\t\t/*\n\t\t * Problem 3: Calculate total of substrings of S containing \n\t\t * both Strings A and B \n\t\t */\n\t\t\n\t\tString[] newStr = str.split(\"c\");\n\t\tString resultStr = \"\";\n\t\tfor( String tStr : newStr ) {\n\t\t\tresultStr.concat( tStr );\n\t\t}\n\t\tSystem.out.println( resultStr );\n\t\t\n\t\t\n\t\tString a = \"c\", b = \"\", s = \"\";\n\t\tint totalCount = 0;\n\t\tfor( int i = 0; i < a.length(); i++ ) {\n\t\t\tfor( int j=i+1; j < b.length(); j++ ) {\n\t\t\t\tString newSubStr = s.substring(i, j);\n\t\t\t\tif ( newSubStr.contains(a) && newSubStr.contains(b) )\n\t\t\t\t\ttotalCount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(totalCount);\n\n\t}","title":""},{"docid":"93a48c6f01e5bcdc5907cc54cae02309","score":"0.46522623","text":"static int knapSack(int W, int wt[], int val[], int n) {\n\t\tif(n == 0 || W == 0) {\n\t\t\treturn 0;\n\t\t}\n\t\t// If the last element of the weights array is greater than the target weight, then we do not select that Weight\n\t\tif(wt[n-1]>W) {\n\t\t\treturn knapSack(W,wt,val,n-1);\n\t\t}\n\t\t// Else we select the maximum weight out of the tow condition, whether including it or not including it.\n\t\telse {\n\t\t\treturn Math.max(val[n-1] + knapSack(W - wt[n-1], wt, val, n - 1) , knapSack(W, wt, val, n-1)); \n\t\t}\n\t}","title":""},{"docid":"e0977d2762139af5a706b0231284b834","score":"0.46491355","text":"static void doo(String s, int k){\n\n if(!check(s,k)){\n System.out.print(-1);\n return;\n }\n\n\n Set<Character> set = new HashSet<>();\n set.clear();\n// aabacbebebe\n\n int n=s.length();\n int i=0;\n int mx = -1;\n\n for(i=0; i<n; i++){\n int c=0;\n for (int j=i; j<n; j++) {\n char ch = s.charAt(j);\n\n\n if(set.size()<k){\n set.add(ch);\n }\n else if(set.size()==k && set.contains(ch)){\n set.add(ch);\n }\n else{\n j=n;\n continue;\n }\n c++;\n // System.out.print(ch);\n mx = Math.max(mx, c);\n }\n // System.out.println();\n\n set.clear();\n }\n\n System.out.println(mx);\n\n\n }","title":""},{"docid":"facaca0041507b8d47ca992e67f24a44","score":"0.4644437","text":"private boolean multSol () {\n\t\tint n = 0;\n\t\tfor (int i = 0; i < 9; i++) {\n\t\t\tfor (int j = 0; j < 9; j++) {\n\t\t\t\tif (srcBoard.getCell(i,j) != null && srcBoard.getCell(i,j).equals(0)) {\n\t\t\t\t\t//if a cell in the original puzzle is empty\n\t\t\t\t\tfor (int k = 1; k < 10; k++) {\n\t\t\t\t\t\t//loop through all possible numbers for this cell\n\t\t\t\t\t\tboard.copy(srcBoard);\n\t\t\t\t\t\tboard.setCell(i,j,k, true);\n\t\t\t\t\t\tif (!board.contains(i, j, k) && solvable()) {\n\t\t\t\t\t\t\t//count all possible solutions for numbers in this cell\n\t\t\t\t\t\t\tn++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif (n > 1) {\n\t\t\t\t\t\t//if there is more than one possible solution, return true\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t\tboard.setCell(i,j,0,false);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//if after testing all possible numbers for all empty cells there is not more than one solution, return false\n\t\treturn false;\n\t}","title":""},{"docid":"9a7aa11fd89940443138015b0285dcde","score":"0.46297425","text":"private int[] checkStraight(Card[] combination) {\n int[] combo_value = new int[7];\n boolean s = true; // True if the combination is a straight.\n // Checks that the next card is the next card in order.\n for (int i = 0; i < combination.length-1; i++) {\n if (combination[i].value != combination[i+1].value+1) {\n s = false;\n break;\n }\n }\n \n if (s) {\n combo_value[0] = straight;\n combo_value[1] = combination[0].value;\n combo_value[3] = combination[1].value;\n combo_value[4] = combination[2].value;\n combo_value[5] = combination[3].value;\n combo_value[6] = combination[4].value;\n }\n \n return combo_value;\n }","title":""},{"docid":"4087291f4585b8afcb7e88be8b07c4b4","score":"0.4619857","text":"public int findChainCombination()\n {\n // Get the combinations count\n int combinationsCount = Core.getInstance().getPreSetCombinations().getChainCombinationsCount();\n // Don't allow redundant combinations\n int combinationId;\n do\n {\n // Find a random combination id\n combinationId = MathUtils.random(0, combinationsCount - 1);\n } while(combinationId == lastChainCombinationId);\n // Return the chain combination\n return (lastChainCombinationId = combinationId);\n }","title":""},{"docid":"ec57e48c153f6122d1659237b81fe380","score":"0.46178296","text":"public static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n\t\tint N = Integer.parseInt(br.readLine());\r\n\t\tint[][] arr = new int[N][N];\r\n\t\tint[][][] chk = new int[N][N][2];\r\n\t\tStringTokenizer st;\r\n\t\tfor(int i = 0; i < N; i++)\r\n\t\t{\r\n\t\t\tst = new StringTokenizer(br.readLine());\r\n\t\t\tfor(int j = 0; j < N; j++)\r\n\t\t\t{\r\n\t\t\t\tarr[i][j] = Integer.parseInt(st.nextToken());\r\n\t\t\t\tif(i != 0 || j != 0) Arrays.fill(chk[i][j], Integer.MAX_VALUE);\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tQueue<Pair> q = new LinkedList<Pair>();\r\n\t\tq.offer(new Pair(0, 0, 0));\r\n\t\tint size = 0;\r\n\t\twhile(!q.isEmpty())\r\n\t\t{\r\n\t\t\tsize = q.size();\r\n\t\t\twhile(--size >= 0)\r\n\t\t\t{\r\n\t\t\t\tPair p = q.poll();\r\n\t\t\t\tif(p.x == N - 1 && p.y == N - 1) continue;\r\n\t\t\t\tif(p.y + 1 < N)\r\n\t\t\t\t{\r\n\t\t\t\t\tint sub = (arr[p.x][p.y] <= arr[p.x][p.y + 1] ? arr[p.x][p.y + 1] - arr[p.x][p.y] + 1 : 0);\r\n\t\t\t\t\tif(chk[p.x][p.y+1][1] > chk[p.x][p.y][p.d] + sub)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tchk[p.x][p.y + 1][1] = chk[p.x][p.y][p.d] + sub;\r\n\t\t\t\t\t\tq.offer(new Pair(p.x, p.y + 1, 1));\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tif(p.x + 1 < N)\r\n\t\t\t\t{\r\n\t\t\t\t\tint sub = (arr[p.x][p.y] <= arr[p.x+1][p.y] ? arr[p.x+1][p.y] - arr[p.x][p.y] + 1 : 0);\r\n\t\t\t\t\tif(chk[p.x+1][p.y][0] > chk[p.x][p.y][p.d] + sub)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tchk[p.x+1][p.y][0] = chk[p.x][p.y][p.d] + sub;\r\n\t\t\t\t\t\tq.offer(new Pair(p.x+1, p.y, 0));\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tSystem.out.println(Math.min(chk[N-1][N-1][0], chk[N-1][N-1][1]));\r\n\t}","title":""},{"docid":"846ef5eb95babe331928e360ff565835","score":"0.46161655","text":"public void findHandValue(ArrayList<Card[]> combinations) {\n int[] combo_value;\n \n for (Card[] combination : combinations) {\n int[] f = checkFlush(combination); // Check if it is a flush\n int[] s = checkStraight(combination); // Check if it is a straight\n // Check first if it is a royal flush, or a straight flush\n // If it isn't, then check for the other \n if (f[0] > 0 && s[0] > 0) {\n if (s[1] == 14 && f[1] == 14) {\n combo_value = s;\n combo_value[0] = royal_flush;\n } else {\n combo_value = s;\n combo_value[0] = straight_flush;\n }\n } else {\n int[] m = checkMatches(combination);\n if (f[0] > m[0]) {\n combo_value = f;\n } else if (s[0] > m[0]) {\n combo_value = s;\n } else {\n combo_value = m;\n }\n }\n \n \n // Checks if the combination is the best combination the player has.\n for (int val = 0; val < hand_value.length; val++) {\n if (combo_value[val] > hand_value[val]) {\n hand_value = combo_value;\n hand_cards = combination;\n } else if (combo_value[val] != hand_value[val]) {\n break;\n }\n }\n }\n }","title":""},{"docid":"9c0dd4e9d96ef30840da4d6beaf990ef","score":"0.4613829","text":"void removeAllBadPairs() {\n\t\tArrayList<String> toBeRemoved = new ArrayList<String>();\n\t\tfor(String pair: listOfPairs) {\n\t\t\tString fp = pair.split(\",\")[0];\n\t\t\tString sp = pair.split(\",\")[1];\n\t\t\t// if both have parent, remove the pair\n\t\t\tif(tree.contains(fp) && tree.getNode(fp).hasParent()) {\n\t\t\t\tif(tree.contains(sp) && tree.getNode(sp).hasParent()) {\n\t\t\t\t\ttoBeRemoved.add(pair);\n\t\t\t\t\t//\tSystem.out.println(\"removed \"+pair);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tlistOfPairs.removeAll(toBeRemoved);\n\t}","title":""},{"docid":"8b9ea58d35cfc7b6e795e7b6cbd8fab6","score":"0.46133274","text":"static void displayPathtoPrincess(int q, char[][] grid){\n Queue<String> ans = new LinkedList<String>();\n Queue<Integer> x = new LinkedList<Integer>();\n Queue<Integer> y = new LinkedList<Integer>();\n if(grid[startx][starty] == 'd') {\n \tSystem.out.println(\"CLEAN\");\n \treturn;\n }\n boolean[][] visited = new boolean[m][n];\n visited[startx][starty] = true;\n x.add(startx);\n y.add(starty);\n ans.add(\"\");\n while(x.size() != 0) {\n int xx = x.remove();\n int yy = y.remove();\n String tmp = ans.remove();\n if(grid[xx][yy] == 'd') {\n System.out.println(tmp.split(\"\\n\")[0]);\n return;\n }\n int[] xxx = {0,1,0,-1};\n int[] yyy = {1,0,-1,0};\n Vector<Integer> rand = new Vector<Integer>();\n HashSet<Integer> set = new HashSet<Integer>();\n while(rand.size() != 4) {\n \tint temp = (int)(Math.random()*4);\n \tif(set.add(temp))\n\t \trand.add(temp);\n }\n for(Integer r : rand) {\n \tint i = (int)r;\n if(xx+xxx[i] >= 0 && xx+xxx[i] < m && yy+yyy[i] >= 0 && yy+yyy[i] < n)\n if(!visited[xx+xxx[i]][yy+yyy[i]]) {\n visited[xx+xxx[i]][yy+yyy[i]] = true;\n x.add(xx+xxx[i]);\n y.add(yy+yyy[i]);\n if(xxx[i] == 0) {\n if(yyy[i] == 1)\n ans.add(tmp+\"RIGHT\\n\");\n if(yyy[i] == -1)\n ans.add(tmp+\"LEFT\\n\");\n }\n if(yyy[i] == 0) {\n if(xxx[i] == 1)\n ans.add(tmp+\"DOWN\\n\");\n if(xxx[i] == -1)\n ans.add(tmp+\"UP\\n\");\n }\n }\n }\n }\n }","title":""},{"docid":"ceeddaba736bad7f1a68bc646fc56169","score":"0.46050575","text":"void solve(){\n int t=ii();\n int a=ii(),b=ii();\n for(int tc=0;tc<t;tc++)\n {\n String s=is();\n if(s.charAt(0)=='A')\n {\n char num=s.charAt(1);\n int A=0;\n for(int i=a;i<=b;i++)\n {\n char c[]=String.valueOf(i).toCharArray();\n if(c.length>2)\n {\n boolean ans=true;\n if(c[0]==num)\n {\n for(int j=2;j<c.length;j++)\n if(c[j]!=num)\n {\n ans=false;\n break;\n }\n }\n else if(c[0]!=num || !ans)\n {\n ans=false;\n for(int j=1;j<c.length;j++)\n if(c[j]!=num)\n {\n ans=false;\n break;\n }\n }\n if(ans)\n A++;\n }\n }\n out.println(A);\n }\n else if(s.charAt(0)=='C')\n {\n int num=Integer.parseInt(s.substring(s.length()-1));\n int rep=Integer.parseInt(s.substring(1, s.length()-1));\n int v=0;\n for(int i=a;i<=b;i++)\n {\n String km=String.valueOf(i);\n String pat=String.valueOf(num);\n for(int ii=0;ii<rep;ii++)\n pat=pat.concat(pat);\n if(km.contains(pat))\n v++;\n }\n out.println(v);\n }\n else\n {\n int count=0;\n for(int i=0;i<s.length();i++)\n if(s.charAt(i)=='W')\n count++;\n out.println((long)Math.pow(10, count));\n }\n }\n }","title":""},{"docid":"64d7d6473d14ff47ec62fcb39fd9c514","score":"0.46027413","text":"public String evaluate(ArrayList<String> myStatements, ArrayList<Wire[]> wireSpots){\r\n ArrayList<String> tempList = new ArrayList<String>();\r\n for(int i=0;i<myStatements.size();i++){\r\n if(myStatements.get(i).equals(\"(\")){\r\n myStatements.remove(i);\r\n if(myStatements.get(i-1).equals(\"!\")||myStatements.get(i-1).equals(\"~\")){\r\n tempList.add(myStatements.get(i-1));\r\n myStatements.remove(i-1);\r\n i--;\r\n }\r\n int there = 0;\r\n while(!myStatements.get(i).equals(\")\") || there!=0){\r\n if(myStatements.get(i).equals(\"(\"))\r\n there++;\r\n if(there!=0&&myStatements.get(i).equals(\")\"))\r\n there--;\r\n tempList.add(myStatements.get(i));\r\n myStatements.remove(i);\r\n }\r\n myStatements.remove(i);\r\n int currSize=tempList.size();\r\n boolean turnary = false;\r\n if(i<myStatements.size()){\r\n if(myStatements.get(i).equals(\"?\"))\r\n turnary=true;\r\n }\r\n else{\r\n for(int l=0;l<currSize;l++){\r\n if(tempList.get(l).equals(\">=\")||tempList.get(l).equals(\"<=\")||\r\n tempList.get(l).equals(\">\")||tempList.get(l).equals(\"<\")||\r\n tempList.get(l).equals(\"==\")||tempList.get(l).equals(\"!=\"))\r\n turnary=true;\r\n }\r\n }\r\n if(turnary){\r\n while(!myStatements.get(i).equals(\"?\"))\r\n i++;\r\n for(int j=0;j<4;j++){\r\n tempList.add(myStatements.get(i));\r\n myStatements.remove(i);\r\n }\r\n }\r\n myStatements.add(i,parens(tempList,wireSpots));\r\n for(int j=i+1;j<myStatements.size();j++){\r\n try{\r\n int newNum = Integer.parseInt(myStatements.get(j));\r\n newNum = newNum-1;\r\n myStatements.remove(j);\r\n myStatements.add(j,\"\"+newNum);\r\n }\r\n catch(NumberFormatException e){}\r\n }\r\n tempList.clear();\r\n }\r\n }\r\n for(int i=0;i<myStatements.size();i++){\r\n if(myStatements.get(i).equals(\"*\")){\r\n i--;\r\n for(int j = 0; j < 3; j++){\r\n tempList.add(myStatements.get(i));\r\n myStatements.remove(i);\r\n }\r\n myStatements.add(i,multiplier(tempList,wireSpots));\r\n tempList.clear();\r\n }\r\n }\r\n for(int i = 0; i < myStatements.size(); i++){\r\n if(myStatements.get(i).equals(\"+\")){\r\n i--;\r\n for(int j = 0; j < 3; j++){\r\n tempList.add(myStatements.get(i));\r\n myStatements.remove(i);\r\n }\r\n if(i <= myStatements.size()-1){\r\n if(myStatements.get(i).equals(\"+\")){\r\n tempList.add(myStatements.get(i));\r\n myStatements.remove(i);\r\n tempList.add(myStatements.get(i));\r\n myStatements.remove(i);\r\n }\r\n }\r\n myStatements.add(i,adder(tempList,wireSpots));\r\n tempList.clear();\r\n }\r\n }\r\n for(int i=0;i<myStatements.size();i++){\r\n if(myStatements.get(i).equals(\"-\")){\r\n i--;\r\n for(int j = 0; j < 3; j++){\r\n tempList.add(myStatements.get(i));\r\n myStatements.remove(i);\r\n }\r\n myStatements.add(i,subtractor(tempList,wireSpots));\r\n tempList.clear();\r\n }\r\n }\r\n for(int i=0;i<myStatements.size();i++){\r\n if(myStatements.get(i).equals(\"&\")||myStatements.get(i).equals(\"&&\")){\r\n i--;\r\n int size=3;\r\n if(myStatements.get(i).equals(\"~\")){\r\n size=4;\r\n i--;\r\n }\r\n for(int j=0;j<size;j++){\r\n tempList.add(myStatements.get(i));\r\n myStatements.remove(i);\r\n }\r\n if(tempList.size()==3)\r\n myStatements.add(i,and(tempList,wireSpots));\r\n else if(tempList.size()==4)\r\n myStatements.add(i,nand(tempList,wireSpots));\r\n for(int j=i+1;j<myStatements.size();j++){\r\n try{\r\n int newNum = Integer.parseInt(myStatements.get(j));\r\n newNum = newNum-1;\r\n myStatements.remove(j);\r\n myStatements.add(j,\"\"+newNum);\r\n }\r\n catch(NumberFormatException e){}\r\n }\r\n tempList.clear();\r\n }\r\n }\r\n for(int i=0;i<myStatements.size();i++){\r\n if(myStatements.get(i).equals(\"|\")||myStatements.get(i).equals(\"||\")){\r\n i--;\r\n int size=3;\r\n if(myStatements.get(i).equals(\"~\")){\r\n size=4;\r\n i--;\r\n }\r\n for(int j=0;j<size;j++){\r\n tempList.add(myStatements.get(i));\r\n myStatements.remove(i);\r\n }\r\n if(tempList.size()==3)\r\n myStatements.add(i,or(tempList,wireSpots));\r\n else if(tempList.size()==4)\r\n myStatements.add(i,nor(tempList,wireSpots));\r\n for(int j=i+1;j<myStatements.size();j++){\r\n try{\r\n int newNum = Integer.parseInt(myStatements.get(j));\r\n newNum = newNum-1;\r\n myStatements.remove(j);\r\n myStatements.add(j,\"\"+newNum);\r\n }\r\n catch(NumberFormatException e){}\r\n }\r\n tempList.clear();\r\n }\r\n }\r\n for(int i=0;i<myStatements.size();i++){\r\n if(myStatements.get(i).equals(\"^\")){\r\n i--;\r\n int size=3;\r\n if(myStatements.get(i).equals(\"~\")){\r\n size=4;\r\n i--;\r\n }\r\n for(int j=0;j<size;j++){\r\n tempList.add(myStatements.get(i));\r\n myStatements.remove(i);\r\n }\r\n if(tempList.size()==3)\r\n myStatements.add(i,xor(tempList,wireSpots));\r\n else if(tempList.size()==4)\r\n myStatements.add(i,xnor(tempList,wireSpots));\r\n tempList.clear();\r\n }\r\n }\r\n for(int i=0;i<myStatements.size();i++){\r\n if(myStatements.get(i).equals(\"{\")){\r\n myStatements.remove(i);\r\n while(!myStatements.get(i).equals(\"}\")){\r\n tempList.add(myStatements.get(i));\r\n myStatements.remove(i);\r\n }\r\n myStatements.remove(i);\r\n myStatements.add(i,concatenate(tempList,wireSpots));\r\n tempList.clear();\r\n }\r\n }\r\n for(int i=0;i<myStatements.size();i++){\r\n if(myStatements.get(i).equals(\">\")){\r\n i--;\r\n for(int j=0;j<4;j++){\r\n tempList.add(myStatements.get(i));\r\n myStatements.remove(i);\r\n }\r\n myStatements.add(i,bitShiftR(tempList,wireSpots));\r\n tempList.clear();\r\n }\r\n }\r\n for(int i=0;i<myStatements.size();i++){\r\n if(myStatements.get(i).equals(\"<\")){\r\n i--;\r\n for(int j=0;j<4;j++){\r\n tempList.add(myStatements.get(i));\r\n myStatements.remove(i);\r\n }\r\n myStatements.add(i,bitShiftL(tempList,wireSpots));\r\n tempList.clear();\r\n }\r\n }\r\n for(int i=0;i<myStatements.size();i++){\r\n if(myStatements.get(i).equals(\"=\")){\r\n i--;\r\n for(int j = 0; j < 3; j++){\r\n tempList.add(myStatements.get(i));\r\n myStatements.remove(i);\r\n }\r\n String action = equalSign(tempList,wireSpots);\r\n if(action.equals(\"0\"))\r\n return \"\";\r\n else\r\n return \"\"+action;\r\n }\r\n }\r\n return\"\"+myStatements.get(0);\r\n }","title":""},{"docid":"c20fc96b6e4fc67433638e419c8ebc6a","score":"0.45986474","text":"public ArrayList<Integer> checkIfOrderPossible(String color, int order) {\n ArrayList<Integer> result = new ArrayList<>();\n if (order <= 0) {\n System.out.println(\"Invalid Input for order\");\n return result;\n }\n try {\n stack = new Stack<>();\n stackSum = 0;\n Paint paintRequired = null;\n int x = 0;\n for (Paint paint : goods) {\n\n if (paint.getColor().equalsIgnoreCase(color)) {\n paintRequired = paint;\n break;\n }\n x++;\n }\n \n if (paintRequired==null){\n System.out.print(\"Invalid input for color\");\n return result;\n }\n \n // calling helper method to check if target order can be obtained or not\n subset(paintRequired.getCans(), 0, paintRequired.getCans().size(), order);\n\n if (stackSum != order) {\n System.out.println(\"Not possible to fulfill an order of \" + order + \" liter(s) of \" + paintRequired.getColor() + \" paint with current inventory.\");\n\n } else {\n\n ArrayList<Integer> removeCans = new ArrayList<>();\n\n System.out.print(\"Checked out the following cans to fulfill the order of \" + order + \" liter(s) of \" + paintRequired.getColor() + \" paint: [\");\n while (!stack.isEmpty()) {\n int num = stack.pop();\n removeCans.add(num);\n System.out.print(num);\n\n if (!stack.isEmpty()) {\n System.out.print(\",\");\n\n }\n\n }\n System.out.println(\"]\");\n //Calling remove method to remove checked out paint cans\n removeFromInventory(x, removeCans);\n result = removeCans;\n }\n\n } catch (Exception e) {\n System.err.println(e.getMessage());\n }\n return result;\n }","title":""},{"docid":"b49ae8a147b1f0cd492a0bdb75cc0969","score":"0.4598453","text":"int blockPlayerWin() {\n int equalCount = 0;\n int emptyI = 0, emptyJ = 0;\n // fieldSize * 2 for rows and columns , 2 more for diagonals\n int winCombinationsNumber = fieldSize * 2 + 2;\n for (int k = 0; k < winCombinationsNumber; k++) {\n equalCount = 0;\n for (int i = 0; i < fieldSize; i++)\n for (int j = 0; j < fieldSize; j++) {\n if (fieldArray[i][j] == playerMark\n && (getWinCombination(k, i, j) == BELONGS_TO_WIN_COMBINATION)) {\n equalCount++; // count number of player marks , that belong to win combination\n }\n if ((fieldArray[i][j] == EMPTY_MARK)\n && (getWinCombination(k, i, j) == BELONGS_TO_WIN_COMBINATION)) {\n emptyI = i; // coordinates of empty cell , that belongs to win combination\n emptyJ = j;\n }\n\n if ((fieldArray[i][j] == aIMark)\n && (getWinCombination(k, i, j) == BELONGS_TO_WIN_COMBINATION)) {\n j = fieldSize; // already non-win combination\n i = fieldSize; // check next combination\n equalCount = 0;\n }\n }\n if (equalCount == (fieldSize - 1)) {\n return (emptyI * fieldSize + emptyJ); // cell number\n }\n }\n return NOTHING_TO_PREVENT;\n }","title":""},{"docid":"de7ab71ec9f43f726f618df54ca9dadf","score":"0.45881742","text":"public List<String> removeInvalidParentheses(String s) {\n int leftUnmatch = 0;\n int rightUnmatch = 0;\n for (char c : s.toCharArray()) {\n if (c == '(') {\n leftUnmatch++;\n }\n else if (c == ')') {\n if (leftUnmatch == 0) {\n rightUnmatch++;\n }\n else {\n leftUnmatch--;\n }\n }\n }\n\n System.out.println(leftUnmatch + \" \" + rightUnmatch);\n List<String> result = new ArrayList<>();\n dfs(result, s, leftUnmatch, rightUnmatch, 0);\n return result;\n }","title":""},{"docid":"d727241da6a0774137e6f2c81c1a3225","score":"0.4584714","text":"public void lastlooptest(){\n if(loopNumber<10) {\n //remenber which position have been selected and selected it from index of groupChoice\n String[] keepChoice=new String[3]; // save three wrong choice\n int selectedUsed = 0; // check keepChoice have been used or not\n Random random = new Random();\n int choiceRandom = random.nextInt(4);\n ButtomCorrectPosition = choiceRandom;\n String presentCorrectAnswer=Choice.get(loopNumber);\n if(allChoice.containsKey(Choice.get(loopNumber))){ // check whether map have this key\n Choice.set(loopNumber,allChoice.get(presentCorrectAnswer)); // delete the index value and add new value to the indexx\n //Choice[loopNumber]=allChoice.get(presentCorrectAnswer);\n }\n String lastChar=presentCorrectAnswer.substring(presentCorrectAnswer.length() - 1);// get the last character\n char[] last = lastChar.toCharArray();\n if(lastChar.equals(\"1\")){\n for(int i=2;i<5;i++) {\n if (presentCorrectAnswer.charAt(presentCorrectAnswer.length() - 1) == last[0]) {// delete the last character\n presentCorrectAnswer = presentCorrectAnswer.substring(0, presentCorrectAnswer.length() - 1);\n\n presentCorrectAnswer=presentCorrectAnswer.concat(Integer.toString(i)); //concatenate string\n if(allChoice.containsKey(presentCorrectAnswer)){\n keepChoice[i-2]=allChoice.get(presentCorrectAnswer);// save the wronng choice to keepChoice array\n }\n }\n String AgainlastChar=presentCorrectAnswer.substring(presentCorrectAnswer.length() - 1);// get the last character\n last= AgainlastChar.toCharArray(); //set new last\n }\n }else if(lastChar.equals(\"2\")) {\n if (presentCorrectAnswer.charAt(presentCorrectAnswer.length() - 1) == last[0]) {// delete the last character\n presentCorrectAnswer = presentCorrectAnswer.substring(0, presentCorrectAnswer.length() - 1);\n\n presentCorrectAnswer = presentCorrectAnswer.concat(\"1\"); //concatenate string\n if (allChoice.containsKey(presentCorrectAnswer)) {\n keepChoice[0] = allChoice.get(presentCorrectAnswer);// save the wronng choice to keepChoice array\n }\n String AgainlastChar=presentCorrectAnswer.substring(presentCorrectAnswer.length() - 1);// get the last character\n last= AgainlastChar.toCharArray(); //set new last\n }\n for (int i = 3; i < 5; i++) {\n if (presentCorrectAnswer.charAt(presentCorrectAnswer.length() - 1) == last[0]) {// delete the last character\n presentCorrectAnswer = presentCorrectAnswer.substring(0, presentCorrectAnswer.length() - 1);\n\n presentCorrectAnswer = presentCorrectAnswer.concat(Integer.toString(i)); //concatenate string\n if (allChoice.containsKey(presentCorrectAnswer)) {\n keepChoice[i - 2] = allChoice.get(presentCorrectAnswer);// save the wronng choice to keepChoice array\n }\n }\n String AgainlastChar=presentCorrectAnswer.substring(presentCorrectAnswer.length() - 1);// get the last character\n last= AgainlastChar.toCharArray(); //set new last\n }\n }else if(lastChar.equals(\"3\")) {\n if (presentCorrectAnswer.charAt(presentCorrectAnswer.length() - 1) == last[0]) {// delete the last character\n presentCorrectAnswer = presentCorrectAnswer.substring(0, presentCorrectAnswer.length() - 1);\n\n presentCorrectAnswer = presentCorrectAnswer.concat(\"4\"); //concatenate string\n if (allChoice.containsKey(presentCorrectAnswer)) {\n keepChoice[0] = allChoice.get(presentCorrectAnswer);// save the wronng choice to keepChoice array\n }\n String AgainlastChar=presentCorrectAnswer.substring(presentCorrectAnswer.length() - 1);// get the last character\n last= AgainlastChar.toCharArray(); //set new last\n }\n for (int i =1; i < 3; i++) {\n if (presentCorrectAnswer.charAt(presentCorrectAnswer.length() - 1) == last[0]) {// delete the last character\n presentCorrectAnswer = presentCorrectAnswer.substring(0, presentCorrectAnswer.length() - 1);\n\n presentCorrectAnswer = presentCorrectAnswer.concat(Integer.toString(i)); //concatenate string\n if (allChoice.containsKey(presentCorrectAnswer)) {\n keepChoice[i] = allChoice.get(presentCorrectAnswer);// save the wronng choice to keepChoice array\n }\n }\n String AgainlastChar=presentCorrectAnswer.substring(presentCorrectAnswer.length() - 1);// get the last character\n last= AgainlastChar.toCharArray(); //set new last\n }\n }else if(lastChar.equals(\"4\")) {\n for (int i = 3; i > 0; i--) {\n if (presentCorrectAnswer.charAt(presentCorrectAnswer.length() - 1) == last[0]) {// delete the last character\n presentCorrectAnswer = presentCorrectAnswer.substring(0, presentCorrectAnswer.length() - 1);\n\n presentCorrectAnswer = presentCorrectAnswer.concat(Integer.toString(i)); //concatenate string\n if (allChoice.containsKey(presentCorrectAnswer)) {\n keepChoice[3 - i] = allChoice.get(presentCorrectAnswer);// save the wronng choice to keepChoice array\n }\n }\n String AgainlastChar = presentCorrectAnswer.substring(presentCorrectAnswer.length() - 1);// get the last character\n last = AgainlastChar.toCharArray(); //set new last\n }\n }\n if (choiceRandom == 0) {\n bone.setText(Choice.get(loopNumber));\n //bone.setBackgroundColor(Color.GREEN);\n } else {\n bone.setText(keepChoice[selectedUsed]);\n ++selectedUsed;\n }\n if (choiceRandom == 1) {\n btwo.setText(Choice.get(loopNumber));\n } else {\n btwo.setText(keepChoice[selectedUsed]);\n ++selectedUsed;\n }\n if (choiceRandom == 2) {\n bthree.setText(Choice.get(loopNumber));\n } else {\n bthree.setText(keepChoice[selectedUsed]);\n ++selectedUsed;\n }\n if (choiceRandom == 3) {\n bfour.setText(Choice.get(loopNumber));\n } else {\n bfour.setText(keepChoice[selectedUsed]);\n }\n play(loopNumber);\n loopNumber++;\n }else{\n Intent intent=new Intent(this,score.class);\n intent.putExtra(\"Testscore\",score);\n intent.putExtra(\"cateid\",cateid);\n intent.putExtra(\"lessonid\", lessonid);\n startActivity(intent);\n //Toast.makeText(this,\"....Finished....\",Toast.LENGTH_LONG).show();\n }\n }","title":""},{"docid":"961cf91f5ace3ae5ccd9babcf8b2af14","score":"0.45785385","text":"static void printExceptNumOfMultiplyBy7(int x){\r\n for(int i=1; i<x; i++){\r\n if(i%7==0)\r\n continue;\r\n System.out.print(i + \" \");\r\n }\r\n }","title":""},{"docid":"77cf1094bc6f71565f659a4ff3ead1fb","score":"0.45772496","text":"public String minRemoveToMakeValidV4(String s) {\n int left = 0;\n int right = 0;\n for (char ch : s.toCharArray()) {\n if (ch == ')') {\n right++;\n }\n }\n\n StringBuilder res = new StringBuilder();\n for (char ch : s.toCharArray()) {\n if (ch == '(') {\n if (left == right) {\n /**\n * It means current ch '(' is illegal, because left-bracket counts have matched out.\n * We need to skip it.\n */\n continue;\n }\n left++;\n } else if (ch == ')') {\n right--;\n if (left == 0) {\n /**\n * It means current ch ')' is illegal, because there is no left-bracket to match with it.\n * We need to skip it.\n */\n continue;\n }\n left--;\n }\n res.append(ch);\n }\n return res.toString();\n }","title":""},{"docid":"a1e7444871fefcc50941122ae68434e8","score":"0.45745102","text":"protected static long getNextCombination(long x) {\n // Assume in the annotations that x has form x'01^a10^b\n long u = x & -x; // extract rightmost bit 1; u = 0'00^a10^b\n long v = u + x; // set last non-trailing bit 0, and clear to the right; v = x'10^a00^b\n if (v == 0) { // then overflow in v, or x == 0\n return -1; // signal that next k-combination cannot be represented\n }\n x = v + (((v ^ x) / u) >> 2); // v^x = 0'11^a10^b, (v^x)/u = 0'0^b1^{a+2}, and x ← x'100^b1^a\n return x;\n }","title":""},{"docid":"2d49e89b01ff93a71c0d24b524b5afbf","score":"0.4570648","text":"public int findSimpleCombination()\n {\n // Get the combinations count\n int combinationsCount = Core.getInstance().getPreSetCombinations().getSimpleCombinationsCount();\n // Don't allow redundant combinations\n int combinationId;\n do\n {\n // Find a random movement (different from 0 as its the default static movement)\n combinationId = MathUtils.random(0, combinationsCount - 1);\n } while(combinationId == lastSimpleCombinationId);\n // Return the simple combination\n return (lastSimpleCombinationId = combinationId);\n }","title":""},{"docid":"f66fc657c159852c246a8e65727e3f48","score":"0.45685813","text":"@Test\r\n\t@SuppressWarnings(\"unchecked\")\r\n\tpublic void probarCombinacionesDeNumeros() {\n\t\tIterable<Integer> centenas = Resetable2IterableAdapter.createFrom(IntegerRangeIterator.create(0, 2));\r\n\t\tIterable<Integer> decenas = Resetable2IterableAdapter.createFrom(IntegerRangeIterator.create(0, 2));\r\n\t\tIterable<Integer> unidades = Resetable2IterableAdapter.createFrom(IntegerRangeIterator.create(0, 2));\r\n\t\tCombinatorialIterator<Integer> combinations = CombinatorialIterator.<Integer> createFrom(new Iterable[] {\r\n\t\t\t\tcentenas, decenas, unidades });\r\n\t\tfor (int i = 0; i < 8; i++) {\r\n\t\t\tAssert.True(combinations.hasNext());\r\n\t\t\tint expectedUnidad = i & 1;\r\n\t\t\tint expectedDecena = (i & 2) >> 1;\r\n\t\t\tint expectedCentena = (i & 4) >> 2;\r\n\r\n\t\t\tList<Integer> integers = combinations.next();\r\n\t\t\tAssert.equals(expectedCentena, integers.get(0).intValue());\r\n\t\t\tAssert.equals(expectedDecena, integers.get(1).intValue());\r\n\t\t\tAssert.equals(expectedUnidad, integers.get(2).intValue());\r\n\t\t}\r\n\t\tAssert.False(combinations.hasNext());\r\n\t}","title":""},{"docid":"ab1a732ae3d2fc5e00dbc7d2bdc864be","score":"0.45676628","text":"public void removeFailing()\r\n\t{\n\t\tint x = 0;\r\n\t\twhile (x<student.size())\r\n\t\t{\r\n\t\t\tif((student.get(x)).gpa<2)\r\n\t\t\t\tstudent.remove(x);\r\n\t\t\telse\r\n\t\t\t\tx++;\r\n\t\t}\r\n\t}","title":""},{"docid":"209eb68afffb482d4b28340f9da26ade","score":"0.45615128","text":"private static int calculateCouple(int target, int[] values) throws Exception {\n if(target != values.length) {\n throw new Exception(\"Not match\");\n }\n int pairs = 0;\n Set<Integer> sets = new HashSet<>();\n for (int i : values) {\n if(!sets.contains(i)) {\n sets.add(i);\n }else{\n sets.remove(i);\n ++pairs;\n }\n }\n return pairs;\n }","title":""},{"docid":"61762f4cd8bdb8664d0746a3108c38f3","score":"0.4558154","text":"public static void Apply_Reduc_Rules(Hashtable<Integer,TreeSet<Integer>>E, TreeSet<Integer> V,TreeSet<Integer>IN,TreeSet<Integer>LN,TreeSet<Integer>BN,TreeSet<Integer>FL,TreeSet<Integer>Free)\n\t{\n\t\t{\n\t\t\tfor(Integer u : FL)\n\t\t\t{\n\t\t\t\tTreeSet<Integer> nei_u = new TreeSet<Integer>(E.get(u));\n\t\t\t\tfor(Integer v:E.get(u))\n\t\t\t\t{\n\t\t\t\t\tif(FL.contains(v))\n\t\t\t\t\t{\n\t\t\t\t\t\t//E.get(u).remove(v);\n\t\t\t\t\t\t//E.get(v).remove(u);\n\t\t\t\t\t\tnei_u.remove(v);\n\t\t\t\t\t\tnei_u.remove(u);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tE.put(u, nei_u);\n\t\t\t}\n\t\t\tfor(Integer u : BN)\n\t\t\t{\n\t\t\t\tTreeSet<Integer> nei_u = new TreeSet<Integer>(E.get(u));\n\t\t\t\tfor(Integer v:E.get(u))\n\t\t\t\t{\n\t\t\t\t\tif(BN.contains(v))\n\t\t\t\t\t{\n\t\t\t\t\t\t//E.get(u).remove(v);\n\t\t\t\t\t\t//E.get(v).remove(u);\n\t\t\t\t\t\tnei_u.remove(v);\n\t\t\t\t\t\tnei_u.remove(u);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tE.put(u, nei_u);\n\t\t\t}\n\t\t}\n\t\t//==================== RULE 2 ============\n\t\t{\n\t\t\tTreeSet<Integer> BN_copy = new TreeSet<Integer>(BN);\n\t\t\tfor(Integer u : BN)\n\t\t\t{\n\t\t\t\tif(get_degree(u,E,V,IN,LN,BN,FL,Free)==0)\n\t\t\t\t{\n\t\t\t\t\tLN.add(u);\n\t\t\t\t\tBN_copy.remove(u);\n\t\t\t\t\t//Free.remove(u);\n\t\t\t\t}\n\t\t\t}\n\t\t\tBN = BN_copy;\n\t\t}\n\t\t//=================== RULE 3 ================\n\t\t{\n\t\t\tTreeSet<Integer> Free_copy = new TreeSet<Integer>(Free);\n\t\t\tfor(Integer u : Free)\n\t\t\t{\n\t\t\t\tif(get_degree(u,E,V,IN,LN,BN,FL,Free)==1)\n\t\t\t\t{\n\t\t\t\t\tFL.add(u);\n\t\t\t\t\t//BN.remove(u);\n\t\t\t\t\tFree_copy.remove(u);\n\t\t\t\t}\n\t\t\t}\n\t\t\t//Free = Free_copy;\n\t\t\tFree = new TreeSet<Integer>(Free_copy);\n\t\t}\n\t\t//=================== RULE 4 ================\n\t\t{\n\t\t\tTreeSet<Integer> temp = new TreeSet<Integer>(Free);\n\t\t\tTreeSet<Integer> Free_copy = new TreeSet<Integer>(Free);\n\t\t\ttemp.addAll(FL);\n\t\t\tfor(Integer u : Free)\n\t\t\t{\t//if(!temp.contains(v))\n\t\t\t\ttemp.retainAll(E.get(u));\n\t\t\t\t//if(temp.equals(new TreeSet<Integer>()))\n\t\t\t\tif(temp.size()==0)\n\t\t\t\t{\n\t\t\t\t\tFL.add(u);\n\t\t\t\t\tFree_copy.remove(u);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\tFree = new TreeSet<Integer>(Free_copy);\n\t\t\t//Free = Free_copy;\n\t\t}\n\t\t//=================== RULE 5 ================\n\t\t{\n\t\t\tTreeSet<Integer> Free_copy = new TreeSet<Integer>(Free);\n\t\t\tfor(Integer x : Free)\n\t\t\t{\n\t\t\t\tif(get_degree(x,E,V,IN,LN,BN,FL,Free)==2)\n\t\t\t\t{\n\t\t\t\t\tfor(Integer y: E.get(x))\n\t\t\t\t\t{\n\t\t\t\t\t\tfor(Integer z: E.get(y))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(E.get(z).contains(x))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tFL.add(x);\n\t\t\t\t\t\t\t\tFree_copy.remove(x);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tFree = new TreeSet<Integer>(Free_copy);\n\t\t\t//Free = Free_copy;\n\t\t}\n\t\t//=================== RULE 6 ================\n\t\t{\n\t\t\tHashtable<Integer,Integer> visited = new Hashtable<Integer,Integer>();\n\t\t\tTreeSet<Integer> BN_copy = new TreeSet<Integer>(BN);\n\t\t\tfor(Integer u:BN)\n\t\t\t{\n\t\t\t\tfor(Integer v:E.keySet())\n\t\t\t\t\tvisited.put(v, 0);\n\t\t\t\tQueue<Integer> s = new LinkedList<Integer>();\n\t\t\t\ts.add(E.get(u).first());\n\t\t\t\tvisited.put(u, 1);\n\t\t\t\tvisited.put(E.get(u).first(),1);\n\t\t\t\twhile(s.size()!=0) //?????????????????\n\t\t\t\t{\n\t\t\t\t\tInteger t = s.poll();\n\t\t\t\t\tvisited.put(t, 1);\n\t\t\t\t\tfor(Integer n:E.get(t))\n\t\t\t\t\t{\n\t\t\t\t\t\tif(n!=u && visited.get(n)==0)\n\t\t\t\t\t\t\ts.add(n);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(visited.contains(0))\n\t\t\t\t{\n\t\t\t\t\t//u--->IN\n\t\t\t\t\t//IN.add(u);\n\t\t\t\t\t//BN_copy.remove(u);\n\t\t\t\t\tADD(u,BN_copy,IN,E,IN,BN_copy,FL,Free);\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t\tBN = BN_copy;\n\t\t}\n\t\t//=================== RULE 7 ================\n\t\t{\n\t\t\tTreeSet<Integer> tem = new TreeSet<Integer>(V);\n\t\t\ttem.removeAll(IN);\n\t\t\tfor(Integer u : LN)\n\t\t\t{\n\t\t\t\tTreeSet<Integer> nei_u = new TreeSet<Integer>(E.get(u));\n\t\t\t\tfor(Integer v:E.get(u))\n\t\t\t\t{\n\t\t\t\t\tif(tem.contains(v))\n\t\t\t\t\t{\n\t\t\t\t\t\t//E.get(u).remove(v);\n\t\t\t\t\t\t//E.get(v).remove(u);\n\t\t\t\t\t\tnei_u.remove(v);\n\t\t\t\t\t\tnei_u.remove(u);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tE.put(u, nei_u);\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"8ac689893e2f004160378ee212d0d7fe","score":"0.45557013","text":"public static boolean isValid(String s) {\n Boolean pass = false;\n// if (s.length() == 1 || s.length() == 0){\n// return \"YES\";\n// }\n\n //Condition 1: string has 1 lot of each character, e.g map values are all 1\n\n //Condition 2: if e.g abccc is entered, remove a c and we get 1a 1b and 2c \n\n char[] charArray = s.toCharArray();\n HashMap<Character, Integer> characterHashSet = new HashMap<>();\n for (char c : charArray) {\n Integer frequency = characterHashSet.get(c) != null ? characterHashSet.get(c) + 1 : 1;\n characterHashSet.put(c, frequency);\n }\n\n //Need to find the different values\n //We only allow tolerance of +1, if we get > 1 then we fail\n Integer min = Collections.min(characterHashSet.values());\n Integer max = Collections.max(characterHashSet.values());\n\n Integer maxFreq = Collections.frequency(characterHashSet.values(), max);\n Integer minFreq = Collections.frequency(characterHashSet.values(), min);\n\n Integer amountDiffMax = characterHashSet.size() - maxFreq;\n Integer amountDiffMin = characterHashSet.size() - minFreq;\n\n //There can be only one difference, lets say there are 8 characters\n //Minimum frequency we should have 7, therefore if we find the difference we should expect 1\n //as that is the tolerance we allow\n if (amountDiffMax == 1 || amountDiffMin == 1) {\n pass = true;\n\n //There is just frequency of 1 for max or min\n //We then have a sub condition where if the min frequency is NOT 1 fre, e.g 1,1,1,5\n //We then need to calculate the difference due as example has difference of 4\n //If min frequency is 1, then e.g we have 1,3,3,3\n //then this is allowed as we are able to remove 1 to make 3,3,3 pass therefore pass this condition\n if (minFreq != 1){\n Integer diff = Math.abs(max - min);\n if (diff > 1) {\n pass = false;\n }\n }\n } else {\n //If lets say we have 4,4,4,4,4 then amount diff is 0 and also min max diff is 0\n\n //Also if we have 2,2,4,4 then the min max diff will be greater than 1\n\n //Second condition, we cant have diff of max - min of 2\n Integer diff = Math.abs(max - min);\n if (diff == 0) {\n pass = true;\n } else if (diff > 1) {\n pass = false;\n }\n }\n\n//\n\n return pass;\n }","title":""},{"docid":"2f16c2fb566ce2caee4f09613a22e5cd","score":"0.45415443","text":"private void trimSolution() {\n if (solution.size() > 4) {\n int size = solution.size();\n solution = solution.subList(size - 4, size);\n } else if (solution.size() < 4) {\n solution.clear();\n }\n System.out.println(Arrays.deepToString(solution.toArray()));\n }","title":""},{"docid":"d746e680140357e3e23526ef51bd21b2","score":"0.45336834","text":"private String rowConLegalEasy() { \n String problems = \"\";\n int row = 0; //used to count the amount of lines its gone through\n while(row < rowConstraints.length) {\n int column = 0; //row constraint position\n while(column < rowConstraints.length-1) { \n if(grid[row][column].getSquareValue() != 0 && grid[row][column+1].getSquareValue() > 1 && \"<\".equals(rowConstraints[row][column].getValue())) { //to check for legal < \n if(grid[row][column].getSquareValue() >= grid[row][column+1].getSquareValue()) { \n problems+=\"Numbers in row \" + (row+1) + \" column \" + (column+1) + \" and column \" + (column+2) + \" break its row constraint -\\n\";\n }\n }\n else if(grid[row][column].getSquareValue() > 1 && grid[row][column+1].getSquareValue() != 0 && \">\".equals(rowConstraints[row][column].getValue())) { //to check for legal > \n if(grid[row][column].getSquareValue() <= grid[row][column+1].getSquareValue()) { \n problems+=\"Numbers in row \" + (row+1) + \" column \" + (column+1) + \" and column \" + (column+2) + \" break its row constraint -\\n\";\n }\n }\n if(grid[row][column].getSquareValue() == grid[0].length && grid[row][column+1].getSquareValue() == 0 && \"<\".equals(rowConstraints[row][column].getValue())) {\n problems+=\"Numbers in row \" + (row+1) + \" column \" + (column+1) + \" and column \" + (column+2) + \" break its row constraint -\\n\";\n }\n else if(grid[row][column+1].getSquareValue() == grid[0].length && grid[row][column].getSquareValue() == 0 && \">\".equals(rowConstraints[row][column].getValue())) {\n problems+=\"Numbers in row \" + (row+1) + \" column \" + (column+1) + \" and column \" + (column+2) + \" break its row constraint -\\n\";\n }\n else if(grid[row][column].getSquareValue() == 1 && \">\".equals(rowConstraints[row][column].getValue())) {\n problems+=\"Numbers in row \" + (row+1) + \" column \" + (column+1) + \" and column \" + (column+2) + \" break its row constraint -\\n\";\n }\n else if(grid[row][column+1].getSquareValue() == 1 && \"<\".equals(rowConstraints[row][column].getValue())) {\n problems+=\"Numbers in row \" + (row+1) + \" column \" + (column+1) + \" and column \" + (column+2) + \" break its row constraint -\\n\";\n }\n column++;\n }\n row++;\n }\n return problems;\n }","title":""},{"docid":"1eed520b5ac9e49b3c8a32d666b980ff","score":"0.4532535","text":"public int[] checkUserCombination(int[] userComb, ArrayList<Integer> combination) {\n int hits = 0;\n int almostHits = 0;\n int [] returnResult = new int[2];\n int[] copyOfUserComb = new int[numberOfColumns];\n int[] copyOfMainComb = new int[numberOfColumns];\n for (int i = 0; i < numberOfColumns; i++) {\n copyOfUserComb[i] = userComb[i];\n copyOfMainComb[i] = combination.get(i);\n }\n for (int i = 0; i < numberOfColumns; i++) {\n if (copyOfUserComb[i] == copyOfMainComb[i]) {\n hits++;\n copyOfUserComb[i] = -1;\n copyOfMainComb[i] = -2;\n }\n }\n for (int i = 0; i < numberOfColumns; i++) {\n for (int j = 0; j < numberOfColumns; j++) {\n if (copyOfUserComb[i] == copyOfMainComb[j] && i != j) {\n almostHits++;\n copyOfMainComb[j] = -2;\n copyOfUserComb[i] = -1;\n }\n }\n }\n returnResult[0] = hits;\n returnResult[1] = almostHits;\n return returnResult;\n }","title":""},{"docid":"c7b40f9fbacd6cc86e3c2fee31f73d5c","score":"0.452756","text":"private void goParen() {\r\n\r\n while (!theStackP.isEmpty()) {\r\n\r\n String s = theStackP.pop();\r\n if (s.equals(\"(\"))\r\n break;\r\n output.add(s);\r\n }\r\n\r\n }","title":""},{"docid":"54ede77c4c14200845df43a2a365ac44","score":"0.45262244","text":"@Test\n\tpublic void checkParanthesisBalance() {\n\t\tint [] arr={2,5,1,8,2,9,1};\n\n\t\tint maxSum=0;\n\t\tint windowSize=3;\n\t\t//Here subArrays of size are\n\t\t/*{2,5,1} =>8\n\t\t{5,1,8}=>14\n\t\t{1,8,2}=>11\n\t\t{8,2,9}=>19\n\t\t{2,9,1}=>12*/\n\t\tfor(int i=0;i<arr.length-2;i++){\n\t\t\tint sum=0;\n\t\t\tfor(int j=i;j<i+windowSize;j++){\n\t\t\t\tsum=sum+arr[j];\n\t\t\t}\n\t\t\tif(sum>maxSum){\n\t\t\t\tmaxSum=sum;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(maxSum);\n\t}","title":""},{"docid":"62272d0f61317f787e755911bac2b964","score":"0.45252776","text":"public static int Main()\n\t{\n\t\tfor (int a = 1; a < 6; a++)\n\t\t{\n\t\t\tfor (int b = 1; b < 6; b++)\n\t\t\t{\n\t\t\t\tfor (int c = 1; c < 6; c++)\n\t\t\t\t{\n\t\t\t\t\tfor (int d = 1; d < 6; d++)\n\t\t\t\t\t{\n\t\t\t\t\t\tfor (int e = 1; e < 6; e++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif (e != 2 && e != 3 && ((e == 1 && d == 1 && c != 1) + (b == 2) + (a == 5 && e != 1) + (c != 1) + (d == 1 && c != 1) == 2) && (a == 5) && (c == 1) && (a + b + c + d + e) == 15 && a * b * c * d * e == 120)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tSystem.out.print(a);\n\t\t\t\t\t\t\t\tSystem.out.print(\" \");\n\t\t\t\t\t\t\t\tSystem.out.print(b);\n\t\t\t\t\t\t\t\tSystem.out.print(\" \");\n\t\t\t\t\t\t\t\tSystem.out.print(c);\n\t\t\t\t\t\t\t\tSystem.out.print(\" \");\n\t\t\t\t\t\t\t\tSystem.out.print(d);\n\t\t\t\t\t\t\t\tSystem.out.print(\" \");\n\t\t\t\t\t\t\t\tSystem.out.print(e);\n\t\t\t\t\t\t\t\tSystem.out.print(\"\\n\");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}","title":""},{"docid":"2533e2de17f44fda6d3e3e8bb9b031a9","score":"0.45249578","text":"private static <T> List<List<T>> combination(List<T> values, int size) {\n\n if (0 == size) {\n return Collections.singletonList(Collections.<T>emptyList());\n }\n\n if (values.isEmpty()) {\n return Collections.emptyList();\n }\n\n List<List<T>> combination = new LinkedList<List<T>>();\n\n T actual = values.iterator().next();\n\n List<T> subSet = new LinkedList<T>(values);\n subSet.remove(actual);\n\n List<List<T>> subSetCombination = combination(subSet, size - 1);\n\n for (List<T> set : subSetCombination) {\n List<T> newSet = new LinkedList<T>(set);\n newSet.add(0, actual);\n combination.add(newSet);\n }\n\n combination.addAll(combination(subSet, size));\n\n return combination;\n }","title":""},{"docid":"2dd92306d2920b66a58cf2e55f1884ed","score":"0.4519015","text":"private boolean r1() // Rule for testing chance for winning\n {\n int x ;\n int y ;\n int c ;\n\n for(int i=0;i < 3;i++)\t\t\t\n {\n x = -1 ;\n y = -1 ;\n c = 0 ;\n \n for(int j=0;j < 3;j++)\t\t\n { \n if(sq[i][j] == this.compSymbol)\t\n {\n c++ ;\n }\n\t\t\t\telse if(sq[i][j] == -1)\t\n {\n x = i ; \n y = j ;\n }\n }\n \n if(x != -1 && y != -1)\n {\n if(c==2 && sq[x][y] == -1)\n {\n sq[x][y] = this.compSymbol ;\n this.aa = 1 ;\n this.bb = 1 ;\n return true ;\n }\n }\n }\n\n //X Axis\n for(int i=0;i < 3;i++)\n {\n x = -1 ;\n y = -1 ;\n c = 0 ;\n \n for(int j=0;j < 3;j++)\n {\n\t\t\t\tif(sq[j][i] == this.compSymbol)\n {\n c++ ;\n }\n\t\t\t\telse if(sq[j][i] == -1)\t\n {\n x = j ;\n y = i ;\n }\n }\n \n if(x != -1 && y != -1)\n {\n if(c==2 && sq[x][y] == -1)\n {\n sq[x][y] = this.compSymbol ;\n this.aa = 1 ;\n this.bb = 2 ;\n return true ;\n }\n }\n }\n\n // Diagonal 1\n x = -1 ;\n y = -1 ;\n c = 0 ;\n \n for(int i=0;i < 3;i++)\n {\n if(sq[i][i] == this.compSymbol)\n {\n\t\t\t\tc++ ;\n }\n else if(sq[i][i] == -1)\t\n {\n\t\t\t\tx = i ;\n\t\t\t\ty = i ;\n }\n }\n \n if(x != -1 && y != -1)\n {\n if(c==2 && sq[x][y] == -1)\n {\n sq[x][y] = this.compSymbol ;\n this.aa = 1 ;\n this.bb = 3 ;\n return true ;\n }\n }\n\n // Diagonal 2\n x = -1 ;\n y = -1 ;\n c = 0 ;\n \n for(int i=0;i < 3;i++)\n {\n if(sq[2-i][i] == this.compSymbol)\n {\n\t\t\t\tc++ ;\n }\n else if(sq[2-i][i] == -1)\n {\n\t\t\t\tx = 2 - i ;\n\t\t\t\ty = i ;\n }\n }\n \n if(x != -1 && y != -1)\n {\n if(c == 2 && sq[x][y] == -1)\n {\n sq[x][y] = this.compSymbol ;\n this.aa = 1 ;\n this.bb = 4 ;\n return true ;\n }\n }\n\n return false ;\n }","title":""},{"docid":"556ed6283cfe9a234b83badaeb529d72","score":"0.4514619","text":"private static int maximum()\n {\n int PopulationSize = 0;\n Chromosome DNA = null;\n Chromosome thatChromo = null;\n int winner = 0;\n boolean foundNewWinner = false;\n boolean Solution = false;\n while(!Solution)\n {\n foundNewWinner = false;\n PopulationSize = population.size();\n for(int i = 0; i < PopulationSize; i++)\n {\n if(i != winner){ // Avoid self-comparison.\n DNA = population.get(i);\n thatChromo = population.get(winner);\n if(DNA.conflicts() > thatChromo.conflicts()){\n winner = i;\n foundNewWinner = true;\n }\n }\n }\n if(foundNewWinner == false){\n Solution = true;\n }\n }\n return winner;\n }","title":""},{"docid":"d66371ebdb2bbb4defd4e0c021c705f6","score":"0.45136055","text":"private static int generateAllValidPermutations(int[] validTopSort) {\n\n\t\tint t = n + 1;\n\t\t// create a tXt matrix which marks the constraints. if i,j is a\n\t\t// restriction then i,j and j,i location of the matrix will be 1/true.\n\t\t// for all other locations it will be 0. Also all the items in the last\n\t\t// row will be 1/true\n\t\tint[][] incidenceMatrix = new int[t][t];\n\n\t\tfor (int i = 0; i < t; i++) {\n\t\t\tincidenceMatrix[i][t - 1] = 1;\n\t\t}\n\t\t// marking the constraints in the matrix with data from incedenceArray\n\t\tfor (int i = 0; i < restrictions; i++) {\n\t\t\tint val1 = incedenceArray[i][0];\n\t\t\tint val2 = incedenceArray[i][1];\n\n\t\t\tincidenceMatrix[val1][val2] = 1;\n\t\t\tincidenceMatrix[val2][val1] = 1;\n\t\t}\n\t\t// creating array arr_p of size t and populating values from 0 to t\n\t\t// creating array arr_loc of size t and populating values from 0 to t\n\t\tint[] arr_p = new int[t];\n\t\tint[] arr_loc = new int[t];\n\t\tfor (int i = 0; i < t; i++) {\n\t\t\tarr_p[i] = i;\n\t\t\tarr_loc[i] = i;\n\t\t}\n\t\tint counter = 1;\n\t\t// initialize all the variables\n\t\tint i = 0, var_k = 0, var_k1 = 0, obj_k, obj_k1;\n\n\t\tif (v == 1) {\n\n\t\t\tvisit(validTopSort, arr_p, n);\n\n\t\t}\n\t\t// Algorithm is explained in detail in the project report. variables are\n\t\t// named with the same names as in the original algorithm\n\t\twhile (i < t - 1) {\n\t\t\tvar_k = arr_loc[i];\n\t\t\tvar_k1 = var_k + 1;\n\t\t\tobj_k = arr_p[var_k];\n\t\t\tobj_k1 = arr_p[var_k1];\n\t\t\t// if incidenceMatrix[i][obj_k1] == 1 then this can't be swapped\n\t\t\tif (incidenceMatrix[i][obj_k1] == 1) {\n\t\t\t\t// reversing the array from location k\n\t\t\t\tfor (int l = var_k; l >= i + 1; l--)\t\n\t\t\t\t\tarr_p[l] = arr_p[l - 1];\n\t\t\t\tarr_p[i] = obj_k;\n\t\t\t\tarr_loc[i] = i;\n\t\t\t\ti++;\n\t\t\t} else {\n\t\t\t\t// swap arr_p[var_k] and arr_p[var_k1]. add var_k1 to arr_loc[i]\n\t\t\t\tarr_p[var_k] = obj_k1;\n\t\t\t\tarr_p[var_k1] = obj_k;\n\t\t\t\tarr_loc[i] = var_k1;\n\t\t\t\t// Visit the permutation and increment the counter\n\n\t\t\t\t// if verbose input==1 then print the permutation\n\t\t\t\tif (v == 1) {\n\t\t\t\t\tvisit(validTopSort, arr_p, n);\n\t\t\t\t}\n\n\t\t\t\tcounter++;\n\t\t\t\ti = 0;\n\n\t\t\t}\n\t\t}\n\t\treturn counter;\n\t}","title":""},{"docid":"f6b14dadc992ea3c479e204f1354c2dd","score":"0.4507802","text":"public void checkOrderCombination(int pickup_variation, int drop_variation){\n if(pickup_variation <=1 && drop_variation<=1){\n System.out.println(\" Pickup Variation is: \"+pickup_variation+ \".Delivery Variation is \"+pickup_variation+ \" \\n\\n\\ncombine the orders\");\n }else{\n System.out.println(\" Pickup Variation is: \"+pickup_variation+ \".Delivery Variation is \"+pickup_variation+ \" \\n\\n\\nOrders cannot be combined\"); \n }\n \n }","title":""},{"docid":"22ea99f3f7d31360ce51a371180b63fe","score":"0.45062014","text":"private List<Pair<Integer, Point>> getUnStuck( HashMap<Integer, Point> player_pieces, HashMap<Integer, Point> opponent_pieces, boolean isplayer1, List<Integer> player_list, List<Pair<Integer, Point>> possible_moves){\t\t\n\t\tSystem.out.println(\"get unstuck\");\n\t\tpossible_moves = new ArrayList<>();\n\t\tList<Pair<Double, Double>> potential_holes = new ArrayList<>();\n\t\tfor (Map.Entry<Integer, Point> entry : player_pieces.entrySet()){\n\t\t\tboolean over_line = isplayer1 ? entry.getValue().x < -20 - 1E-7 : entry.getValue().x > 20 + 1E-7 ;\n\t\t\tif (!over_line && !stuck_pieces.containsKey(entry.getKey())){\n\t\t\t\tstuck_pieces.put(entry.getKey(), false);\n\t\t\t}\n\t\t}\t\n\t\t\n\t\tfor (Integer stuck_piece : stuck_pieces.keySet()){\n\t\t\tpotential_holes.addAll(find_hole(opponent_pieces, player_pieces, player_pieces.get(stuck_piece)));\n\t\t}\n\t\tif(potential_holes.size() > 0){\n\t\t\tdouble closest_dist = Double.MAX_VALUE;\n\t\t\tPair<Double, Double> closest_hole = new Pair<>(22.0, 22.0);\n\t\t\tInteger closest_player = -1;\n\t\t\tHashMap<Integer, Double> side_of_hole = new HashMap<>();\n\t\t\t// Identify a stuck point that has the minimal distance to a hole\n\t\t\tfor (Pair<Double, Double> potential_hole : potential_holes){\n\t\t\t\tfor (int stuck_player : stuck_pieces.keySet()){\n\t\t\t\t\tPoint stuck_loc = player_pieces.get(stuck_player); \n\t\t\t\t\tdouble dist = 22.0;\n\t\t\t\t\tif(stuck_loc.y > potential_hole.getKey()){\n\t\t\t\t\t\tdist = Math.sqrt(/*Math.pow(stuck_loc.x - potential_hole.,2) + */Math.pow(stuck_loc.y - potential_hole.getKey(),2)); \n\t\t\t\t\t\tside_of_hole.put(stuck_player, potential_hole.getKey());\n\t\t\t\t\t}\n\t\t\t\t\telse if(stuck_loc.y < potential_hole.getValue()){\n\t\t\t\t\t\tdist = Math.sqrt(/*Math.pow(stuck_loc.x - potential_hole.,2) + */Math.pow(stuck_loc.y - potential_hole.getValue(),2)); \n\t\t\t\t\t\tside_of_hole.put(stuck_player, potential_hole.getValue());\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tdist = Math.sqrt(Math.pow(stuck_loc.y - potential_hole.getKey(),2));\n\t\t\t\t\t\tside_of_hole.put(stuck_player, potential_hole.getKey());\n\t\t\t\t\t}\n\t\t\t\t\tif (dist < closest_dist){\n\t\t\t\t\t \tclosest_dist = dist; \n\t\t\t\t\t\tclosest_player = stuck_player; \n\t\t\t\t\t\tclosest_hole = potential_hole;\n\t\t\t\t\t}// we have now found our closest y coord to send our stuck player to\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tboolean moved_backwards = stuck_pieces.get(closest_player);\n\t\t\tif(!moved_backwards){\n\t\t\t\tPoint curr_position = new Point(player_pieces.get(closest_player));\n\t\t\t\tfor(int i = 0; i < 2; i++){\n\t\t\t\t\tPoint new_position = new Point(curr_position);\n\t\t\t\t\tnew_position.x = isplayer1 ? new_position.x + diameter_piece : new_position.x - diameter_piece;\n\t\t\t\t\tPair<Integer, Point> move = new Pair<Integer, Point>(closest_player, new_position);\t\t\n\t\t\t\t\tcurr_position = move.getValue();\n\t\t\t\t\tif(!Board.check_collision(opponent_pieces, move) && !Board.check_collision(player_pieces, move)){\n\t\t\t\t\t\tpossible_moves.add(move);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(possible_moves.size() >= 2){\n\t\t\t\t\tstuck_pieces.put(closest_player, true);\t\t\n\t\t\t\t\treturn possible_moves;\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\t\t\t\n\t\t\t\tDouble closest_y = side_of_hole.get(closest_player);\n\t\t\t\tboolean above = closest_y > closest_hole.getValue();\n\t\t\t\tPoint curr_position = new Point(player_pieces.get(closest_player));\n\t\t\t\tfor (int i = 0; i < 2; i++){\n\t\t\t\t\tPoint new_position = new Point(curr_position);\n\t\t\t\t\tnew_position.y = above ? new_position.y - diameter_piece : new_position.y + diameter_piece;\n\t\t\t\t\tPair<Integer, Point> move = new Pair<Integer, Point>(closest_player, new_position);\n\t\t\t\t\tif(valid_whitespace(player_pieces, opponent_pieces, move)){\n\t\t\t\t\t\tpossible_moves.add(move);\n\t\t\t\t\t}\n\t\t\t\t\tcurr_position = move.getValue();\n\t\t\t\t}\n\t\t\t\t// Remove players that are at the hole \n\t\t\t\tboolean beyond_y = above? player_pieces.get(closest_player).y < closest_y + 1 : player_pieces.get(closest_player).y > closest_y + 1 ;\n\t\t\t\tif(beyond_y){\n\t\t\t\t\tstuck_pieces.remove(closest_player);\n\t\t\t\t}\n\t\t\t\tif(possible_moves.size()>=2){\n\t\t\t\t\treturn possible_moves;\n\t\t\t\t}\n\t\t\t}\t\n\t\t}\n\t\telse{\n\t\t\t// if we can't find a hole (we should use the bouncy strategy from the group we saw in class)\n\t\t\tSystem.out.println(\"we can't find a hole\");\n\t\t}\n\t\t// TODO: this check shouldn't be if ran out of moves but should be if can move forward \n\t\tif( possible_moves.size() < 2){\n\t\t\tstuck_pieces = new HashMap<>();\n\t\t}\n\t\treturn null;\n\t}","title":""}],"string":"[\n {\n \"docid\": \"484aff52d60275dd5a712d8610def3d3\",\n \"score\": \"0.5677479\",\n \"text\": \"Set<Set<T>> getAllBarelyPassingCombinations();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99a2e95f037bf436db3ee3d25af7e336\",\n \"score\": \"0.5429457\",\n \"text\": \"public static void main(String[] args) {\\n Scanner scanner = new Scanner(System.in);\\n char s[] = scanner.nextLine().toCharArray();\\n \\n // Count chars\\n Map<Character, Integer> countMap = new TreeMap<>();\\n for (int i=0; i<s.length; i++) {\\n Integer count = countMap.get(s[i]);\\n if (count == null) {\\n count = 1;\\n } else {\\n count = count+1;\\n }\\n countMap.put(s[i], count);\\n }\\n \\n // Create discard map (Max allowed a char can be discarded)\\n // Create select map (Max char to add)\\n Map<Character, Integer> discardMap = new TreeMap<>();\\n Map<Character, Integer> selectMap = new TreeMap<>();\\n for (Character c : countMap.keySet()) {\\n discardMap.put(c, countMap.get(c)/2);\\n selectMap.put(c, countMap.get(c)/2);\\n }\\n \\n // Find lowest lexy\\n List<Character> lexy = new ArrayList<Character>();\\n for (int i=s.length-1; i>=0; i--) {\\n \\n // append char only if select allowed is not exhausted\\n if (selectMap.get(s[i]) > 0) {\\n int cutAt = -1;\\n \\n // check current lexy where to put char best\\n for (int j=lexy.size()-1; j>=0; j--) {\\n \\n // only if the char is lexy lower than on current lexy and that can still be discarded\\n if (s[i] < lexy.get(j) && discardMap.get(lexy.get(j)) > 0) {\\n cutAt=j;\\n // reduce discard allowed\\n discardMap.put(lexy.get(j), discardMap.get(lexy.get(j))-1);\\n\\n // increase back select allowed if necessary\\n if (selectMap.get(lexy.get(j)) < countMap.get(lexy.get(j))/2) {\\n selectMap.put(lexy.get(j), selectMap.get(lexy.get(j))+1);\\n }\\n } else {\\n \\n break;\\n }\\n }\\n if (cutAt != -1) {\\n lexy = lexy.subList(0, cutAt);\\n } \\n lexy.add(s[i]);\\n selectMap.put(s[i], selectMap.get(s[i])-1);\\n \\n } else {\\n // discard char\\n discardMap.put(s[i], discardMap.get(s[i])-1);\\n }\\n \\n }\\n \\n StringBuilder sb = new StringBuilder(); \\n for (Character c : lexy) {\\n sb.append(c);\\n }\\n \\n System.out.println(sb.toString()); \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c985df3c0f5051e9d0ce7cc97a6f040\",\n \"score\": \"0.52293086\",\n \"text\": \"public static void main(String[] args) throws IOException {\\n Scanner sc = new Scanner(System.in);\\r\\n String line = sc.nextLine();\\r\\n\\r\\n String[] tokens = line.split(\\\",\\\");\\r\\n int len = tokens.length;\\r\\n\\r\\n int[] tanks = new int[len - 1];\\r\\n for (int i = 0; i < len - 1; i++) {\\r\\n String curr = tokens[i];\\r\\n if (i == 0) {\\r\\n if (len == 2) // means there is only single element like -> (xy)\\r\\n curr = curr.substring(1, curr.length() - 1);\\r\\n else\\r\\n curr = curr.substring(1);\\r\\n tanks[i] = Integer.parseInt(curr);\\r\\n continue;\\r\\n }\\r\\n if (i == len - 2) {\\r\\n curr = curr.substring(0, curr.length() - 1);\\r\\n tanks[i] = Integer.parseInt(curr);\\r\\n continue;\\r\\n }\\r\\n tanks[i] = Integer.parseInt(curr);\\r\\n }\\r\\n int qty = Integer.parseInt(tokens[len - 1].substring(1)); // removal of space\\r\\n\\r\\n // tanks array contains individual quantity (sorted manner), qty contains final qty to be filled\\r\\n // Lets find if any solution exists or not, if Not min qty to be added we need to output\\r\\n // we are doing this as it will lead to better performance result in case solution does not exist\\r\\n boolean flag = dpWays(tanks, qty);\\r\\n if (!flag) {\\r\\n // means no solution exists\\r\\n int add1 = tanks[0] * 2 - qty;\\r\\n int add2 = tanks[0] + tanks[1] - qty;\\r\\n\\r\\n System.out.println(add1 < add2 ? add1 : add2);\\r\\n }\\r\\n\\r\\n // Here now we are sure that solution exists and hence we need to give solution\\r\\n\\r\\n Map<Integer, Integer> map = new HashMap<>(); // used to store index to be used while building result\\r\\n for (int i = 0; i < tanks.length; i++)\\r\\n map.put(tanks[i], i);\\r\\n\\r\\n List<ListUtil> result = new ArrayList<>();\\r\\n ListUtil each = new ListUtil(tanks.length, 0);\\r\\n \\r\\n getAllWays(tanks, qty, 0, each, result, map);\\r\\n\\r\\n //We need to sort result lists and hence made ListUtil class\\r\\n Collections.sort(result);\\r\\n\\r\\n System.out.println(listToString(result));\\r\\n\\r\\n sc.close();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00017f04c73074c4c5243f635bbe2604\",\n \"score\": \"0.52217966\",\n \"text\": \"private static boolean isValidItemSet(String itemset, int pair_size) {\\r\\n itemset.replace(\\\"[\\\", \\\"\\\");\\r\\n itemset.replace(\\\"]\\\", \\\"\\\");\\r\\n String[] arr = itemset.split(\\\",\\\");\\r\\n ArrayList<String> items = new ArrayList<>();\\r\\n for (int i = 0; i < arr.length; i++) {\\r\\n arr[i] = arr[i].trim().replace(\\\"[\\\", \\\"\\\").replace(\\\"]\\\", \\\"\\\");\\r\\n items.add(arr[i]);\\r\\n }\\r\\n\\r\\n ArrayList<String> temp = new ArrayList<>();\\r\\n ArrayList<String> subset_of_itemset = new ArrayList<>();\\r\\n makeCombination(items, items.size(), 0, pair_size - 1, temp, subset_of_itemset);\\r\\n\\r\\n for (int i = 0; i < subset_of_itemset.size(); i++) {\\r\\n if (!previousItemSet.contains(subset_of_itemset.get(i))) {\\r\\n // System.out.println(\\\"fails\\\");\\r\\n return false;\\r\\n }\\r\\n }\\r\\n // System.out.println(\\\"pass\\\");\\r\\n subset_of_itemset.clear();\\r\\n temp.clear();\\r\\n return true;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54864941655bfa4ddacac54ec2146007\",\n \"score\": \"0.5089\",\n \"text\": \"private Set<Integer> findThree(StringBuffer line, boolean first) {\\n\\t\\tSet<Integer> retVal = new HashSet<>();\\n\\t\\tif (line.length() <= 5)\\n\\t\\t\\treturn retVal;\\n\\t\\t\\n\\t\\tint selfCnt = 0, empCnt = 0;\\n\\t\\tchar selfCh = first ? '3' : '2';\\n\\t\\tchar oppCh = first ? '2' : '3';\\n\\t\\tchar empty = '0';\\n\\n\\t\\t// Keep track of the set of empty locations\\n\\t\\tSet<Integer> empLocSet = new HashSet<>();\\n\\t\\tfor (int i = 0; i < 6; i++) {\\n\\t\\t\\tchar ch = line.charAt(i);\\n\\t\\t\\tif (ch == selfCh)\\n\\t\\t\\t\\tselfCnt ++;\\n\\t\\t\\telse if (ch == empty) {\\n\\t\\t\\t\\tempLocSet.add(i);\\n\\t\\t\\t\\tempCnt ++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tif (selfCnt == 3 && empCnt == 3 && empLocSet.contains(0) && empLocSet.contains(5)) {\\n\\t\\t\\tif (empLocSet.contains(1)) {\\n\\t\\t\\t\\tretVal.add(1);\\n\\t\\t\\t\\tretVal.add(5);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tretVal.addAll(empLocSet);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor (int i = 0, j = 6; j < line.length(); i++, j++) {\\n\\t\\t\\tchar front = line.charAt(j);\\n\\t\\t\\tchar back = line.charAt(i);\\n\\t\\t\\tif (back == selfCh)\\n\\t\\t\\t\\tselfCnt --;\\n\\t\\t\\telse if (back == empty) {\\n\\t\\t\\t\\tempCnt --;\\n\\t\\t\\t\\tempLocSet.remove(i);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif (front == selfCh)\\n\\t\\t\\t\\tselfCnt ++;\\n\\t\\t\\telse if (front == empty) {\\n\\t\\t\\t\\tempCnt ++;\\n\\t\\t\\t\\tempLocSet.add(j);\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Two ends empty; meets criteria\\n\\t\\t\\tif (selfCnt == 3 && empCnt == 3 && empLocSet.contains(i + 1) && empLocSet.contains(j)) {\\n\\t\\t\\t\\t// First check the boundary\\n\\t\\t\\t\\tif (j == line.length() - 1) {\\n\\t\\t\\t\\t\\tif (empLocSet.contains(j - 1)) {\\n\\t\\t\\t\\t\\t\\tretVal.add(i + 1);\\n\\t\\t\\t\\t\\t\\tretVal.add(j - 1);\\n\\t\\t\\t\\t\\t} else retVal.addAll(empLocSet);\\n\\t\\t\\t\\t} else if (line.charAt(i) == oppCh) { // blocked in the front\\n\\t\\t\\t\\t\\tif (line.charAt(j + 1) == oppCh) {\\n\\t\\t\\t\\t\\t\\t// two sides blocked, add all;\\n\\t\\t\\t\\t\\t\\tretVal.addAll(empLocSet);\\n\\t\\t\\t\\t\\t} else if (empLocSet.contains(i + 2)) {\\n\\t\\t\\t\\t\\t\\tretVal.add(i + 2);\\n\\t\\t\\t\\t\\t\\tretVal.add(j);\\n\\t\\t\\t\\t\\t} else if (empLocSet.contains(j - 1)) {\\n\\t\\t\\t\\t\\t retVal.addAll(empLocSet);\\n } else retVal.addAll(empLocSet);\\n\\t\\t\\t\\t} else if (line.charAt(j + 1) == oppCh) { // blocked in the back but open in the front\\n\\t\\t\\t\\t\\tif (empLocSet.contains(j - 1)) {\\n\\t\\t\\t\\t\\t\\tretVal.add(j - 1);\\n\\t\\t\\t\\t\\t\\tretVal.add(i + 1);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tretVal.addAll(empLocSet);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else { // open on both sides\\n\\t\\t\\t\\t\\tif (empLocSet.contains(i + 2)) {\\n\\t\\t\\t\\t\\t\\tretVal.add(i + 2);\\n\\t\\t\\t\\t\\t\\tretVal.add(j);\\n\\t\\t\\t\\t\\t} else if (empLocSet.contains(j - 1)) {\\n\\t\\t\\t\\t\\t\\tretVal.add(j - 1);\\n\\t\\t\\t\\t\\t\\tretVal.add(i + 1);\\n\\t\\t\\t\\t\\t} else retVal.addAll(empLocSet);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn retVal;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db369fee6737f5da14ab57eac5ec4726\",\n \"score\": \"0.5074884\",\n \"text\": \"static int eggDrop(int n, int k)\\n {\\n // Your code here\\n int dp[][] = new int[n+1][k+1];\\n for(int i=0;i<dp.length;i++){\\n Arrays.fill(dp[i],Integer.MAX_VALUE);\\n }\\n //For 1 egg answer is number of floors\\n for(int j=1;j<=k;j++){\\n dp[1][j] = j;\\n }\\n //For 1 floor answer is always 1 and for 0 floors answer is always 0\\n for(int i=1;i<=n;i++){\\n dp[i][0] = 0;\\n dp[i][1] = 1;\\n }\\n\\n for(int i=2;i<=n;i++){\\n for(int j=2;j<=k;j++){\\n //Assume egg is dropped from xth floor\\n for(int x=1;x<=j;x++){\\n //Worst case is either egg is broken on xth floor i.e dp[i-1][x-1] or egg is not broken on xth floor i.e dp[i][j-x]\\n dp[i][j] = Math.min(dp[i][j],1+Math.max(dp[i-1][x-1],dp[i][j-x]));\\n }\\n }\\n }\\n return dp[n][k];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf0aefb4a76ab7b2e697abe1c2ecea30\",\n \"score\": \"0.50586575\",\n \"text\": \"private void removeOnePair() {\\n String tag = (String) T.remove(T.size() - 1);\\n if (tag.equals(\\\"B\\\") || tag.equals(\\\"C\\\") || tag.equals(\\\"I\\\")\\n || tag.equals(\\\"S\\\") || tag.equals(\\\"Z\\\")) {\\n caseI_KI.remove(caseI_KI.size() - 1);\\n } else if (tag.equals(\\\"D\\\")) {\\n caseD_KD.remove(caseD_KD.size() - 1);\\n } else if (tag.equals(\\\"F\\\")) {\\n caseF_KF.remove(caseF_KF.size() - 1);\\n } else if (tag.equals(\\\"J\\\")) {\\n caseJ_KJ.remove(caseJ_KJ.size() - 1);\\n } else if (tag.equals(\\\"C\\\")) {\\n casec_RS.remove(casec_RS.size() - 1);\\n } else if (tag.equals(\\\"e\\\")) {\\n caseet_RS.remove(caseet_RS.size() - 1);\\n caseec_RU.remove(caseet_RS.size() - 1);\\n } else if (tag.equals(\\\"s\\\")) {\\n cases_RU.remove(cases_RU.size() - 1);\\n } else if (tag.equals(\\\"[\\\")) {\\n int arraySize = casearray_N.remove(casearray_N.size() - 1);\\n numBackwardsCalls -= arraySize;\\n for (int k = 0; k < arraySize; k++) {\\n removeOnePair();\\n }\\n } else if (tag.equals(\\\"@\\\")) {\\n nesttype_RS.remove(nesttype_RS.size() - 1);\\n int numPairs = nestpair_N.remove(nestpair_N.size() - 1);\\n numBackwardsCalls -= numPairs;\\n for (int i = 0; i < numPairs; i++) {\\n removeOnePair();\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c27a4e35269c9e1d1cfb7dd7c1d9afb\",\n \"score\": \"0.50495744\",\n \"text\": \"public int findComposedCombination()\\n {\\n // Get the combinations count\\n int combinationsCount = Core.getInstance().getPreSetCombinations().getComposedCombinationsCount();\\n // Don't allow redundant combinations\\n int combinationId;\\n do\\n {\\n // Find a random movement (different from 0 as its the default static movement)\\n combinationId = MathUtils.random(0, combinationsCount - 1);\\n } while(combinationId == lastComposedCombinationId);\\n // Return the composed combination\\n return (lastComposedCombinationId = combinationId);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07eb139813e322f133db4646a81b8687\",\n \"score\": \"0.50376993\",\n \"text\": \"public boolean prune() {\\n\\n boolean ret = false;\\n int red = 0;\\n\\n Set<Character> alphabet = I.next.keySet();\\n int n = 0;\\n for (Character c : alphabet) {\\n n += I.next(c).getTimes();\\n }\\n\\n double K = (2 * alphabet.size() + 4) * (Math.log(n) / Math.log(2)) * ratio;\\n double sum = 0;\\n\\n Set<State> terminal = I.getTerminal();\\n\\n for (State t : terminal) {\\n sum = 0;\\n String u = t.getFullName();\\n String w = u.substring(1, u.length());\\n for (Character c : alphabet) {\\n\\n\\n double uc = condProb(u + c);\\n double wc = condProb(w + c);\\n if ((uc > 0) && (wc > 0)) {\\n sum += uc * (Math.log(uc / wc) / Math.log(2)) * times(u);\\n }\\n }\\n\\n // si l'estat es irrelevant l'eliminem\\n if (sum < K) {\\n t.delete();\\n ret = true;\\n red++;\\n }\\n }\\n\\n return ret;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6522bd9733423c65ba47c15d8bd72538\",\n \"score\": \"0.502112\",\n \"text\": \"public void backtrack(List<String> combinations, Map<Character, String> phoneMap, String digits, int index, StringBuffer combination) {\\n if (index == digits.length()) {\\n combinations.add(combination.toString());\\n } else {\\n char digit = digits.charAt(index);\\n String letters = phoneMap.get(digit);\\n int lettersCount = letters.length();\\n for (int i = 0; i < lettersCount; i++) {\\n combination.append(letters.charAt(i));\\n System.out.println(\\\"当前字符串:\\\"+letters.charAt(i)+\\\" combination:\\\"+combination.toString());\\n backtrack(combinations, phoneMap, digits, index + 1, combination);\\n System.out.println(\\\"删除\\\"+combination.charAt(index)+\\\" index\\\"+index);\\n combination.deleteCharAt(index);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5a36d4f758973f1c007a09bbf200f97\",\n \"score\": \"0.499863\",\n \"text\": \"boolean remaining(TreeSet<Integer> avail){\\n\\t\\t\\n\\t\\tfor (int i : avail){\\n\\t\\t\\tfor (int j : avail){\\n\\t\\t\\t\\tif (i == j){\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif ((i > j) && (i % j == 0)){\\n\\t\\t\\t\\t\\t//we have found a valid choice\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\t//there are no remaining valid choices\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c99432c2994fdb53c0cb668590fe2598\",\n \"score\": \"0.49844334\",\n \"text\": \"private void determinePermutations(final int currentLevel,\\r\\n final And and,\\r\\n And combination,\\r\\n final Or or) {\\r\\n final Object entry = and.getChildren().get( currentLevel );\\r\\n if ( entry instanceof Or ) {\\r\\n // Only OR nodes need to be iterated over\\r\\n final Or childOr = (Or) entry;\\r\\n for ( final Iterator it = childOr.getChildren().iterator(); it.hasNext(); ) {\\r\\n // Make a temp copy of combinations+new entry which will be\\r\\n // sent forward\\r\\n final And temp = new And();\\r\\n if ( currentLevel == 0 ) {\\r\\n // Always start with a clean combination\\r\\n combination = new And();\\r\\n } else {\\r\\n temp.getChildren().addAll( combination.getChildren() );\\r\\n }\\r\\n \\r\\n // now check for and remove duplicates\\r\\n final Object object = it.next();\\r\\n if ( object instanceof And ) {\\r\\n // Can't have duplicate Ands so move up the children\\r\\n final And childAnd = (And) object;\\r\\n for ( final Iterator childIter = childAnd.getChildren().iterator(); childIter.hasNext(); ) {\\r\\n temp.addChild( childIter.next() );\\r\\n }\\r\\n } else {\\r\\n // no duplicates so just add\\r\\n temp.addChild( object );\\r\\n }\\r\\n \\r\\n if ( currentLevel < and.getChildren().size() - 1 ) {\\r\\n // keep recursing to build up the combination until we\\r\\n // are at the end where it will be added to or\\r\\n determinePermutations( currentLevel + 1,\\r\\n and,\\r\\n temp,\\r\\n or );\\r\\n } else {\\r\\n // we are at the end so just attach the combination to\\r\\n // the or node\\r\\n or.addChild( temp );\\r\\n }\\r\\n }\\r\\n } else {\\r\\n // Make a temp copy of combinations+new entry which will be sent\\r\\n // forward\\r\\n final And temp = new And();\\r\\n if ( currentLevel == 0 ) {\\r\\n // Always start with a clean combination\\r\\n combination = new And();\\r\\n } else {\\r\\n temp.getChildren().addAll( combination.getChildren() );\\r\\n }\\r\\n temp.addChild( entry );\\r\\n \\r\\n if ( currentLevel < and.getChildren().size() - 1 ) {\\r\\n // keep recursing to build up the combination until we are\\r\\n // at the end where it will be added to or\\r\\n determinePermutations( currentLevel + 1,\\r\\n and,\\r\\n temp,\\r\\n or );\\r\\n } else {\\r\\n // we are at the end so just attach the combination to the\\r\\n // or node\\r\\n or.addChild( temp );\\r\\n }\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b649ae0b72fcb86270804b9c97830e07\",\n \"score\": \"0.49716857\",\n \"text\": \"public void reduceOptions(Puzzle p) {\\r\\n\\t\\tint pSize = p.getSize();\\r\\n\\t\\tABQueue<Integer> newOptions = new ABQueue<Integer>(pSize);\\r\\n\\t\\tfor (int i = 1; i <= (pSize); i++) {\\r\\n\\t\\t\\tnewOptions.enqueue(i);\\r\\n\\t\\t} // end for\\r\\n\\r\\n\\t\\tint temp[] = p.getRow(row);\\r\\n\\t\\tint OptLen = newOptions.length();\\r\\n\\t\\tboolean dup;\\r\\n\\t\\tfor (int i = 0; i < OptLen; i++) {\\r\\n\\t\\t\\tdup = false;\\r\\n\\t\\t\\tint option = newOptions.dequeue();\\r\\n\\t\\t\\tfor (int j = 0; j < pSize; j++) {\\r\\n\\t\\t\\t\\tif (option == temp[j]) {\\r\\n\\t\\t\\t\\t\\tdup = true;\\r\\n\\t\\t\\t\\t\\tj = (j + 2) * pSize;\\r\\n\\t\\t\\t\\t} // end if\\r\\n\\t\\t\\t} // end for\\r\\n\\t\\t\\tif (!dup) {\\r\\n\\t\\t\\t\\tnewOptions.enqueue(option);\\r\\n\\t\\t\\t} // end if\\r\\n\\t\\t} // end for\\r\\n\\r\\n\\t\\ttemp = p.getColumn(col);\\r\\n\\t\\tOptLen = newOptions.length();\\r\\n\\t\\tfor (int i = 0; i < OptLen; i++) {\\r\\n\\t\\t\\tdup = false;\\r\\n\\t\\t\\tint option = newOptions.dequeue();\\r\\n\\t\\t\\tfor (int j = 0; j < pSize; j++) {\\r\\n\\t\\t\\t\\tif (option == temp[j]) {\\r\\n\\t\\t\\t\\t\\tdup = true;\\r\\n\\t\\t\\t\\t\\tj = (j + 2) * pSize;\\r\\n\\t\\t\\t\\t} // end if\\r\\n\\t\\t\\t} // end for\\r\\n\\t\\t\\tif (!dup) {\\r\\n\\t\\t\\t\\tnewOptions.enqueue(option);\\r\\n\\t\\t\\t} // end if\\r\\n\\t\\t} // end for\\r\\n\\r\\n\\t\\ttemp = p.getBlock(col, row);\\r\\n\\t\\tOptLen = newOptions.length();\\r\\n\\t\\tfor (int i = 0; i < OptLen; i++) {\\r\\n\\t\\t\\tdup = false;\\r\\n\\t\\t\\tint option = newOptions.dequeue();\\r\\n\\t\\t\\tfor (int j = 0; j < pSize; j++) {\\r\\n\\t\\t\\t\\tif (option == temp[j]) {\\r\\n\\t\\t\\t\\t\\tdup = true;\\r\\n\\t\\t\\t\\t\\tj = (j + 2) * pSize;\\r\\n\\t\\t\\t\\t} // end if\\r\\n\\t\\t\\t} // end for\\r\\n\\t\\t\\tif (!dup) {\\r\\n\\t\\t\\t\\tnewOptions.enqueue(option);\\r\\n\\t\\t\\t} // end if\\r\\n\\t\\t} // end for\\r\\n\\t\\toptions = newOptions;\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15bd3e153f7c397c60d660b3da0ef461\",\n \"score\": \"0.49531338\",\n \"text\": \"public List<GenPolynomial<C>> \\n minimalGB(List<GenPolynomial<C>> Gp) { \\n if ( Gp == null || Gp.size() <= 1 ) {\\n return Gp;\\n }\\n // remove zero polynomials\\n List<GenPolynomial<C>> G\\n = new ArrayList<GenPolynomial<C>>( Gp.size() );\\n for ( GenPolynomial<C> a : Gp ) { \\n if ( a != null && !a.isZERO() ) { // always true in GB()\\n // already positive a = a.abs();\\n G.add( a );\\n }\\n }\\n if ( G.size() <= 1 ) {\\n //wg monic do not return G;\\n }\\n // remove top reducible polynomials\\n GenPolynomial<C> a, b;\\n List<GenPolynomial<C>> F;\\n List<GenPolynomial<C>> bcH;\\n F = new ArrayList<GenPolynomial<C>>( G.size() );\\n while ( G.size() > 0 ) {\\n a = G.remove(0); b = a;\\n if ( red.isTopReducible(G,a) || red.isTopReducible(F,a) ) {\\n // drop polynomial \\n if ( true || debug ) {\\n List<GenPolynomial<C>> ff;\\n ff = new ArrayList<GenPolynomial<C>>( G );\\n ff.addAll(F);\\n a = red.normalform( ff, a );\\n if ( !a.isZERO() ) {\\n //System.out.println(\\\"minGB nf(a) != 0 \\\" + a);\\n bcH = red.reducedBooleanClosure(G,a);\\n if ( bcH.size() > 1 ) { // never happend so far\\n System.out.println(\\\"minGB not bc: bcH size = \\\" + bcH.size());\\n F.add(b); // do not replace, stay with b\\n } else {\\n //System.out.println(\\\"minGB add bc(a): a = \\\" + a + \\\", bc(a) = \\\" + bcH.get(0));\\n F.addAll( bcH );\\n }\\n } else {\\n //System.out.println(\\\"minGB dropped \\\" + b);\\n }\\n }\\n } else {\\n F.add(a);\\n }\\n }\\n G = F;\\n if ( G.size() <= 1 ) {\\n // wg monic return G;\\n }\\n // reduce remaining polynomials\\n int len = G.size();\\n int el = 0;\\n while ( el < len ) {\\n a = G.remove(0); b = a;\\n //System.out.println(\\\"doing \\\" + a.length());\\n a = red.normalform( G, a );\\n //a = red.normalform( F, a );\\n bcH = red.reducedBooleanClosure(G,a);\\n if ( bcH.size() > 1 ) {\\n System.out.println(\\\"minGB not bc: bcH size = \\\" + bcH.size());\\n G.add( b ); // do not reduce\\n } else {\\n G.addAll( bcH );\\n }\\n el++;\\n }\\n // make monic if possible\\n F = new ArrayList<GenPolynomial<C>>( G.size() );\\n for ( GenPolynomial<C> p : G ) {\\n a = p.monic().abs();\\n if ( p.length() != a.length() ) {\\n System.out.println(\\\"minGB not bc: #p != #a: a = \\\" + a + \\\", p = \\\" + p);\\n a = p; // dont make monic for now\\n }\\n F.add( a );\\n }\\n G = F;\\n \\n /* stratify: collect polynomials with equal leading terms */\\n ExpVector e, f;\\n F = new ArrayList<GenPolynomial<C>>( G.size() );\\n for ( int i = 0; i < G.size(); i++ ) {\\n a = G.get(i);\\n if ( a == null || a.isZERO() ) {\\n continue;\\n }\\n e = a.leadingExpVector();\\n for ( int j = i+1; j < G.size(); j++ ) {\\n b = G.get(j);\\n if ( b == null || b.isZERO() ) {\\n continue;\\n }\\n f = b.leadingExpVector();\\n if ( e.equals(f) ) {\\n //System.out.println(\\\"minGB e == f: \\\" + a + \\\", \\\" + b);\\n a = a.sum(b);\\n G.set(j,null);\\n }\\n }\\n F.add( a );\\n }\\n G = F;\\n \\n /* info on boolean algebra element blocks \\n Map<C,List<GenPolynomial<C>>> bd = new TreeMap<C,List<GenPolynomial<C>>>();\\n for ( GenPolynomial<C> p : G ) { \\n C cf = p.leadingBaseCoefficient();\\n cf = cf.idempotent();\\n List<GenPolynomial<C>> block = bd.get( cf );\\n if ( block == null ) {\\n block = new ArrayList<GenPolynomial<C>>();\\n }\\n block.add( p ); \\n bd.put( cf, block );\\n }\\n System.out.println(\\\"\\\\nminGB bd:\\\");\\n for( C k: bd.keySet() ) {\\n System.out.println(\\\"\\\\nkey = \\\" + k + \\\":\\\");\\n System.out.println(\\\"val = \\\" + bd.get(k));\\n }\\n System.out.println();\\n */\\n return G;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a40060098e67fae17415d91e876aab16\",\n \"score\": \"0.49366426\",\n \"text\": \"private void removeShortEdges(Vertex v){\\n for(Edge vw :v){\\n Vertex w=vw.getEndVertex();\\n int numIter=0;\\n //w.sortEdges();\\n for(Edge wx : w){\\n Vertex x=wx.getEndVertex();\\n numIter++;\\n if(mark(x)!=Mark.INPLAY){\\n continue;\\n }\\n if(numIter==1){\\n \\tcount2++;\\n \\tmark(x,Mark.ELIMINATED);\\n }\\n else if(wx.length()<FUZZ){\\n \\tcount2++;\\n \\tmark(x,Mark.ELIMINATED);\\n }\\n else if (wx.length()>=FUZZ){\\n break;\\n }\\n }\\n }\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"947f3986b4075bed192b2f7eb2bc55e5\",\n \"score\": \"0.49319765\",\n \"text\": \"private boolean isValidCombinationPossibleInner(SwccgGame game, Collection<PhysicalCard> cardsInPile, List<PhysicalCard> currentCombination) {\\n if (isSelectionValid(game, currentCombination)) {\\n return true;\\n }\\n\\n Collection<PhysicalCard> selectableCards = Filters.filter(cardsInPile, game, Filters.and(getValidToSelectFilter(game, currentCombination), Filters.not(Filters.in(currentCombination))));\\n for (PhysicalCard selectableCard : selectableCards) {\\n currentCombination.add(selectableCard);\\n if (isValidCombinationPossibleInner(game, cardsInPile, currentCombination)) {\\n return true;\\n }\\n currentCombination.remove(selectableCard);\\n }\\n\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ee17d8fa95cd2eab40c3640c0fd4369\",\n \"score\": \"0.4930462\",\n \"text\": \"static void minimumBribesMySolution(int[] q) {\\n int bribeCount = 0;\\n boolean isChaotic = false;\\n\\n for(int i = 0 ; i < q.length; i++){\\n int queueIndex = i+1;\\n if(q[i] - queueIndex > 2 ){\\n isChaotic = true;\\n break;\\n }\\n for(int j=Math.max(0, q[i] -2); j < i;j++){\\n if(q[i] < q[j]){\\n bribeCount++;\\n }\\n }\\n }\\n\\n if(isChaotic){\\n System.out.println(\\\"Too chaotic\\\");\\n }else{\\n System.out.println(bribeCount);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"defed4bacdd756f7de6ddd40546d12c6\",\n \"score\": \"0.49161157\",\n \"text\": \"public String minRemoveToMakeValid(String s) {\\n StringBuilder sb = new StringBuilder();\\n char[] str = s.toCharArray();\\n\\n int oppPar = 0;\\n /*\\n scan the string from left to right marking closing parenthesis that need to be deleted. When an open parenthesis\\n is encountered, we increase the count of opposite Parenthesis needed to make s valid. When a closing Parenthesis\\n is encountered, if the count is greater than 0, decrease the count since we found a pair, otherwise, there is\\n no open for the close so mark it for deletion\\n */\\n for (int i = 0; i < str.length; i++) {\\n if (str[i] == '(') {\\n oppPar++;\\n } else if (str[i] == ')') {\\n if (oppPar > 0) {\\n oppPar--;\\n } else {\\n str[i] = 0;\\n }\\n }\\n }\\n\\n oppPar = 0;\\n //scan string from right to left and perform the same operations as before but for closing parenthesis\\n for (int i = str.length - 1; i >= 0; i--) {\\n if (str[i] == ')') {\\n oppPar++;\\n } else if (str[i] == '(') {\\n if (oppPar > 0) {\\n oppPar--;\\n } else {\\n str[i] = 0;\\n }\\n }\\n }\\n\\n //generate the new string now that all invalid parenthesis are marked\\n for (char c : str) {\\n if (c != 0) {\\n sb.append(c);\\n }\\n }\\n return sb.toString();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"813d27c4c734bb76979fe9d99840c21f\",\n \"score\": \"0.48924944\",\n \"text\": \"final private void prune(TransRecords tr, float minSup, byte itemsetSize){\\n\\t\\tArrayList matches;\\n\\t\\tint incCount = 0;\\n\\t\\tString[] trans;\\n\\t\\tint[] can;\\n\\t\\tint t1, t2, c1, c2, n1, m1;\\n\\t\\tc1 = candidates.size();\\n\\t\\tcCounters = new int[c1];\\n\\t\\tcSupports = new float[c1];\\n\\t\\tcTransList = new Object[c1];\\n\\t\\tfor (int i = 0; i < c1; i++){\\n\\t\\t\\tcCounters[i] = 0;\\n\\t\\t}\\n\\t\\t//Determine candidate frequency...\\n\\t\\tObject[] temp = tr.getRec();\\n\\t\\tString[] name = tr.getNames();\\n\\t\\tint[] ids = tr.getIDs();\\n\\t\\tt1 = temp.length;\\n\\t\\tn1 = name.length;\\n\\t\\t//Check all transactions...\\n\\t\\tfor (int i = 0; i < t1; i++){\\n\\t\\t\\ttrans = (String[])temp[i];\\n\\t\\t\\tt2 = trans.length;\\n\\t\\t\\t//Check all candidates...\\n\\t\\t\\tfor (int j = 0; j < c1; j++){\\n\\t\\t\\t\\tcan = (int[])candidates.get(j);\\n\\t\\t\\t\\tc2 = can.length;\\n\\t\\t\\t\\t//Check all items are present in this transaction...\\n\\t\\t\\t\\tfor (int k = 0; k < c2; k++){\\n\\t\\t\\t\\t\\tmatches = tr.getMatches(can[k]);\\n\\t\\t\\t\\t\\tm1 = matches.size();\\n\\t\\t\\t\\t\\tfor (int l = 0; l < m1; l++){\\n\\t\\t\\t\\t\\t\\tif (((Integer)matches.get(l) < t2) && (trans[(Integer)matches.get(l)].equals(\\\"1\\\"))){\\n\\t\\t\\t\\t\\t\\t\\tincCount++;\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (incCount == c2){\\n\\t\\t\\t\\t\\t//All candidates present, increase counter...\\n\\t\\t\\t\\t\\tcCounters[j] = cCounters[j] + 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tincCount = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//Determine frequent itemset...\\n\\t\\tfrequent = new ArrayList();\\n\\t\\tfCounters = new ArrayList();\\n\\t\\tfSupport = new ArrayList();\\n\\t\\tfTransList = new ArrayList();\\n\\t\\tint transCount = tr.getNumberRecs();\\n\\t\\tfloat support;\\n\\t\\t//For each candidate...\\n\\t\\tfor (int i = 0; i < c1; i++){\\n\\t\\t\\tbfi.messageBox(\\\"Generating \\\" + itemsetSize + \\\" item list (Evaluating Candidate \\\" + (i + 1) + \\\" of \\\" + c1);\\n\\t\\t\\t//Determine the support level...\\n\\t\\t\\tif (minSupMode == 1 || minSupMode == 2){\\n\\t\\t\\t\\tsupport = (float)cCounters[i] / (float)transCount;\\n\\t\\t\\t\\tcSupports[i] = support;\\n\\t\\t\\t\\tif (support >= minSup){\\n\\t\\t\\t\\t\\t//Candidate support high enough to be frequent item...\\n\\t\\t\\t\\t\\tfrequent.add((int[])candidates.get(i));\\n\\t\\t\\t\\t\\tfCounters.add(cCounters[i]);\\n\\t\\t\\t\\t\\tfSupport.add(support);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tsupport = (float)cCounters[i] / (float)transCount;\\n\\t\\t\\t\\tcSupports[i] = support;\\n\\t\\t\\t\\tif ((float)cCounters[i] >= minSup){\\n\\t\\t\\t\\t\\t//Candidate support/frequency high enough to be frequent item...\\n\\t\\t\\t\\t\\tfrequent.add((int[])candidates.get(i));\\n\\t\\t\\t\\t\\tfCounters.add(cCounters[i]);\\n\\t\\t\\t\\t\\tfSupport.add(support);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (c1 > 0){\\n\\t\\t\\tcl.addEntryCollapse(itemsetSize, candidates, cCounters, cSupports, cTransList);\\n\\t\\t}\\n\\t\\tif (frequent.size() > 0){\\n\\t\\t\\tfl.addEntryCollapse(itemsetSize, frequent, fCounters, fSupport, fTransList);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65582fa001bbccefc982bf1cb0676e29\",\n \"score\": \"0.4891539\",\n \"text\": \"static int combinations(int powerup_count) {\\n return (1 << powerup_count);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"23729e90e8853e41ccaa5ce4a64bfafd\",\n \"score\": \"0.48901716\",\n \"text\": \"private ArrayList<int[]> setPossibleNumsNoOperator() {\\n\\t\\tArrayList<int[]> AllResults = new ArrayList<>();\\n\\n\\t\\t// Single cell cages can only contain the value of the single cell.\\n\\t\\tif (mCells.size() == 1) {\\n\\t\\t\\tint number[] = { mResult };\\n\\t\\t\\tAllResults.add(number);\\n\\t\\t\\treturn AllResults;\\n\\t\\t}\\n\\n\\t\\t// Cages of size two can contain any operation\\n\\t\\tint gridSize = mGrid.getGridSize();\\n\\t\\tif (mCells.size() == 2) {\\n\\t\\t\\tfor (int i1 = 1; i1 <= gridSize; i1++) {\\n\\t\\t\\t\\tfor (int i2 = i1 + 1; i2 <= gridSize; i2++) {\\n\\t\\t\\t\\t\\tif (i2 - i1 == mResult || i1 - i2 == mResult\\n\\t\\t\\t\\t\\t\\t\\t|| mResult * i1 == i2 || mResult * i2 == i1\\n\\t\\t\\t\\t\\t\\t\\t|| i1 + i2 == mResult || i1 * i2 == mResult) {\\n\\t\\t\\t\\t\\t\\tint numbers[] = { i1, i2 };\\n\\t\\t\\t\\t\\t\\tAllResults.add(numbers);\\n\\t\\t\\t\\t\\t\\tnumbers = new int[] { i2, i1 };\\n\\t\\t\\t\\t\\t\\tAllResults.add(numbers);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn AllResults;\\n\\t\\t}\\n\\n\\t\\t// Cages of size two and above can only contain an add or a multiply\\n\\t\\t// operation\\n\\t\\tAllResults = getAllAddCombos(gridSize, mResult, mCells.size());\\n\\t\\tArrayList<int[]> multResults = getAllMultiplyCombos(gridSize, mResult,\\n\\t\\t\\t\\tmCells.size());\\n\\n\\t\\t// Combine Add & Multiply result sets\\n\\t\\tfor (int[] possibleset : multResults) {\\n\\t\\t\\tboolean foundset = false;\\n\\t\\t\\tfor (int[] currentset : AllResults) {\\n\\t\\t\\t\\tif (Arrays.equals(possibleset, currentset)) {\\n\\t\\t\\t\\t\\tfoundset = true;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (!foundset) {\\n\\t\\t\\t\\tAllResults.add(possibleset);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn AllResults;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ff9e885b5daf0c4a81cc1a52e5fb9cc\",\n \"score\": \"0.4885721\",\n \"text\": \"public int findPartedCombination()\\n {\\n // Get the combinations count\\n int combinationsCount = Core.getInstance().getPreSetCombinations().getPartedCombinationsCount();\\n // Don't allow redundant combinations\\n int combinationId;\\n do\\n {\\n // Find a random movement\\n combinationId = MathUtils.random(0, combinationsCount - 1);\\n } while(combinationId == lastPartedCombinationId);\\n // Return the parted combination\\n return (lastPartedCombinationId = combinationId);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fbff0158c824604540e0af5311f25cf0\",\n \"score\": \"0.48833323\",\n \"text\": \"private ArrayList<Sequence> prune(ArrayList<Sequence> candidates,ArrayList<Sequence> ofSize) {\\n\\t\\tArrayList<Sequence> prunedSeq = new ArrayList<Sequence>();\\n \\tArrayList<Sequence> subSeq = new ArrayList<Sequence>(); \\t\\n \\t\\n \\tint size = 0;\\n \\t\\n \\tif(ofSize.size() > 0){\\n \\t\\tsize = ofSize.get(0).getSequence().size();\\n \\t}\\n \\t\\n \\tfor(Sequence seq : candidates){\\n \\t\\t \\t\\t\\n \\t\\tif(seq.getDistinctItemsinSequence().contains(this.totalItems.get(0))){\\n \\t\\t\\t\\n \\t\\t\\tArrayList<ItemSet> seeds = getsubSequences(seq); \\t\\t\\t\\n \\t\\t\\t\\n \\t\\t\\tfor(int i=0; i < seeds.size(); i++){\\n \\t\\t\\t\\t\\n \\t\\t\\t\\tint top = 0;\\n \\t\\t\\t\\t\\n \\t\\t\\t\\tif(i != top){\\n \\t\\t\\t\\t\\n\\t \\t\\t\\t\\tSequence newseq = new Sequence();\\n\\t \\t\\t\\t\\t\\n\\t \\t\\t\\t\\twhile(newseq.getItemsinSequence().size() < size && top < seeds.size()){\\n\\t \\t\\t\\t\\t\\t\\n\\t \\t\\t\\t\\t\\tItemSet is = new ItemSet();\\n\\t \\t\\t\\t\\t\\tis.setItemSet(new ArrayList<Integer>(seeds.get(top).getItemSet()));\\n\\t \\t\\t\\t\\t\\tnewseq.addItemSet(is); \\n\\t \\t\\t\\t\\t\\t\\n\\t \\t\\t\\t\\t\\ttop = top + 1;\\n\\t \\t\\t\\t\\t\\t\\n\\t \\t\\t\\t\\t\\tif(newseq.getItemsinSequence().size() == size){\\n\\t \\t\\t\\t\\t\\t\\tsubSeq.add(newseq);\\n\\t \\t\\t\\t\\t\\t}\\n\\t \\t\\t\\t\\t} \\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n\\n \\t\\t\\tint count = 0;\\n \\t\\t\\t\\n \\t\\t\\tfor(int j=0; j<subSeq.size() ; j++){\\n \\t\\t\\t\\t\\n \\t\\t\\t\\tif(ListContains(ofSize, subSeq.get(j))){ \\t\\t\\t\\t\\n \\t\\t\\t\\t\\tcount = count++;\\n \\t\\t\\t\\t} \\t\\t\\t\\t\\n \\t\\t\\t}\\n \\t\\t\\t\\n \\t\\t\\tif(count == subSeq.size()){\\n \\t\\t\\t\\tif(!ListHas(prunedSeq, seq))\\n \\t\\t\\t\\t\\tprunedSeq.add(seq);\\n \\t\\t\\t}\\n \\t\\t}\\n \\t\\telse{\\n \\t\\t\\tif(!ListHas(prunedSeq, seq))\\n \\t\\t\\t\\tprunedSeq.add(seq);\\n \\t\\t} \\t\\t\\n \\t}\\n \\t\\n\\t\\treturn prunedSeq;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e385d1fa31cec57b9e674983f3885585\",\n \"score\": \"0.4875365\",\n \"text\": \"private static void cutGrid() {\\n\\n int tCount = isTomato(0, 0) ? 1 : 0;\\n Cell currCell = new Cell(0, 0, tCount, tCount ^= 1);\\n\\n if (isMaxPossibleSlice(currCell)){\\n ++nCuts;\\n //mark result grid\\n //reset curr cell, always try to move down first, if not possible then right\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4cfdb856c1144fd5a5bd18ffee1952b0\",\n \"score\": \"0.48683217\",\n \"text\": \"private static Set<Set<Cover>> getCoverCombinations(List<Cover> groupSize, int k) {\\n Set<Set<Cover>> allCombos = new HashSet<>();\\n // base cases for recursion\\n if (k == 0) {\\n // There is only one combination of size 0, the empty team.\\n allCombos.add(new HashSet<Cover>());\\n return allCombos;\\n }\\n if (k > groupSize.size()) {\\n // There can be no teams with size larger than the group size,\\n // so return allCombos without putting any teams in it.\\n return allCombos;\\n }\\n\\n // Create a copy of the group with one item removed.\\n List<Cover> groupWithoutX = new ArrayList<>(groupSize);\\n Cover x = groupWithoutX.remove(groupWithoutX.size() - 1);\\n\\n Set<Set<Cover>> combosWithoutX = getCoverCombinations(groupWithoutX, k);\\n Set<Set<Cover>> combosWithX = getCoverCombinations(groupWithoutX, k - 1);\\n for (Set<Cover> combo : combosWithX) {\\n combo.add(x);\\n }\\n allCombos.addAll(combosWithoutX);\\n allCombos.addAll(combosWithX);\\n return allCombos;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd9bf5628434c59c82d06d79c0873699\",\n \"score\": \"0.48660406\",\n \"text\": \"private static List<String> selectOptions(List<String> optKeys) throws IOException\\n\\t{\\n\\n\\t\\tint numNEval = 20;\\n\\t\\tMap<String, Double> optList = new HashMap<String, Double>();\\n\\t\\tValueComparator bvcAux = new ValueComparator(optList);\\n\\t\\tTreeMap<String, Double> sorted_opt = new TreeMap<String, Double>(bvcAux);\\n\\n\\t\\tint numNodes;\\n\\t\\t// Identify repeated patterns in top categories\\n\\t\\tString newoption;\\n\\t\\tString[] pair = new String[2];\\n\\t\\tfor (int n = 0; n < optKeys.size(); n++)\\n\\t\\t{\\n\\t\\t\\tfor (int m = 0; m < n; m++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tpair[0] = optKeys.get(n);\\n\\t\\t\\t\\tpair[1] = optKeys.get(m);\\n\\t\\t\\t\\tnewoption = catUtils.longestAncestor(pair);\\n\\t\\t\\t\\tif (optList.containsKey(newoption))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\toptList.put(newoption, ((Double) optList.get(newoption)) + 1.0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\toptList.put(newoption, new Double(1));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tsorted_opt.putAll(optList);\\n\\n\\t\\t// Filter out just relevant patterns\\n\\t\\tMap<String, Double> optList2 = new HashMap<String, Double>();\\n\\t\\tValueComparator bvcAux2 = new ValueComparator(optList2);\\n\\t\\tTreeMap<String, Double> sorted_opt2 = new TreeMap<String, Double>(bvcAux2);\\n\\t\\tDouble numrepeat;\\n\\t\\tSet<String> optKeys2 = sorted_opt.keySet();\\n\\t\\tfor (String optKey : optKeys2)\\n\\t\\t{\\n\\t\\t\\tnumNodes = catUtils.nodes(optKey);\\n\\t\\t\\tnumrepeat = optList.get(optKey);\\n\\t\\t\\tif (numNodes >= 4 && numrepeat > 3)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (catUtils.last(optKey).length() > 1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (!optList2.containsKey(catUtils.take(optKey, numNEval)))\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\toptList2.put(catUtils.take(optKey, numNEval), new Double(numNodes));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tsorted_opt2.putAll(optList2);\\n\\t\\t// Present sorted pattern form most relevant to less relevant\\n\\t\\tSet<String> sorted_optKeys2 = sorted_opt2.keySet();\\n\\t\\tList<String> arrayOpt = new ArrayList<String>();\\n\\t\\t// Add top 3\\n\\t\\tint numtop;\\n\\t\\tif (sorted_optKeys2.size() < 5)\\n\\t\\t{\\n\\t\\t\\tnumtop = 5;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tnumtop = 4;\\n\\t\\t}\\n\\t\\tint numresults = 0;\\n\\t\\tfor (int i = 0; i < optKeys.size(); i++)\\n\\t\\t{\\n\\t\\t\\tif (numresults >= numtop)\\n\\t\\t\\t{\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t// String key = catUtils.init(optKeys.get(i));\\n\\t\\t\\tString key = optKeys.get(i);\\n\\t\\t\\tif (!arrayOpt.contains(key))\\n\\t\\t\\t{\\n\\t\\t\\t\\tarrayOpt.add(key);\\n\\t\\t\\t\\tnumresults++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// Add rest of the patterns\\n\\t\\tfor (String key : sorted_optKeys2)\\n\\t\\t{\\n\\t\\t\\tif (!arrayOpt.contains(key))\\n\\t\\t\\t{\\n\\t\\t\\t\\tarrayOpt.add(key);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn arrayOpt;\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1819309927d5eb2a94407a613179d95b\",\n \"score\": \"0.48567906\",\n \"text\": \"private void filterCandidateSet(ArrayList<ArrayList<Integer>> candidateSet ) {\\n ArrayList<ArrayList<Integer>> tempFrequentItemSet1 = new ArrayList<ArrayList<Integer>>();\\n /* A temporary array to store all combination one by one */\\n for (ArrayList<Integer> candidate : candidateSet) {\\n ArrayList<ArrayList<Integer>> combinationList = new ArrayList<ArrayList<Integer>>();\\n findSubsets(candidate, candidate.size(), candidate.size() - 1, 0, new int[candidate.size() - 1], 0, combinationList);\\n if ( allSubsetPresent(combinationList, frequentItemSet1)) {\\n\\n /* check the bucket list.\\n for each bucket check if the combination is present */\\n int count = 0;\\n for (ArrayList<Integer> basket : baskets) {\\n if(basket.containsAll(candidate)) {\\n count++;\\n if(count >= minSupport) {\\n String data = \\\"\\\";\\n ArrayList<Integer> tempFrequentItem = new ArrayList<>();\\n for(int item = 0; item < candidate.size();item++) {\\n tempFrequentItem.add(candidate.get(item));\\n data +=map.get(candidate.get(item));\\n if(item != (candidate.size() - 1)) {\\n data += \\\",\\\";\\n }\\n }\\n if(!tempFrequentItemSet1.contains(tempFrequentItem)) {\\n tempFrequentItemSet1.add(tempFrequentItem);\\n System.out.println(data);\\n itemSet.add(data);\\n }\\n }\\n }\\n }\\n }\\n }\\n frequentItemSet1 = new ArrayList<ArrayList<Integer>> (tempFrequentItemSet1);\\n tempFrequentItemSet1.clear();\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd167426a06d21f5476f83ab4ece4215\",\n \"score\": \"0.4850351\",\n \"text\": \"private void dfs (Set<String> ans, String build, int le, int re, int balance, int index, String s) {\\n if (le == 0 && re == 0 && balance == 0 && index == s.length()) {\\n ans.add(build);\\n }\\n\\n if (le < 0 || re < 0 || index >= s.length() || balance < 0) return;\\n\\n char c = s.charAt(index);\\n\\n if (c == '(') {\\n dfs (ans, build, le - 1, re, balance, index + 1, s); // delete this\\n dfs (ans, build + \\\"(\\\", le, re, balance + 1, index + 1, s); // add this\\n }\\n else if (c == ')') {\\n dfs (ans, build, le, re - 1, balance, index + 1, s); // delete this\\n dfs (ans, build + \\\")\\\", le, re, balance - 1, index + 1, s); // add this\\n } else {\\n //situation of other string\\n dfs (ans, build + c, le, re, balance, index + 1, s);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf402a0b66958075ac631086b9d84c85\",\n \"score\": \"0.48332748\",\n \"text\": \"private void degenerate() {\\n final double worst = Double.MIN_VALUE;//min possible value to test\\n \\n if (supply.length + demand.length - 1 != toList().size()) {\\n \\n for (int r = 0; r < supply.length; r++)\\n for (int c = 0; c < demand.length; c++) {\\n if (cellPath[r][c] == null) {\\n Transport tmp = new Transport(worst, costs[r][c], r, c);\\n if (pathFinder(tmp).length == 0) {\\n \\tcellPath[r][c] = tmp;\\n return;//should work\\n }\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19b528e4208b73b51e4ad510a21ba88f\",\n \"score\": \"0.48190096\",\n \"text\": \"private void looser(int n) {\\n\\t\\tfor(String key:lost_to.keySet()) {\\n\\t\\t\\tif(lost_to.get(key).size() == n-1) {\\n\\t\\t\\t\\tlooser = key;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15ee5dd8cfaf89fba8cefcb764f43051\",\n \"score\": \"0.48144624\",\n \"text\": \"private boolean noSet() {\\n\\t\\tint[] have = new int[256];\\n\\t\\tfor (Card card : currentCards) {\\n\\t\\t\\thave[card.getBits()] = currentCards.indexOf(card);\\n\\t\\t}\\n\\t\\tfor (int i=0; i<currentCards.size(); i++) {\\n\\t\\t\\tfor (int j=i+1; j<currentCards.size(); j++) {\\n\\t\\t\\t\\tint k = have[thirdCardBits(currentCards.get(i), currentCards.get(j))];\\n\\t\\t\\t\\tif (k > j) {\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn true;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9913b4790d4c5e6193bb925b7b3cf629\",\n \"score\": \"0.48140326\",\n \"text\": \"private static void comboCounter() {\\n\\t\\tif (preHit && !sunkShip) // if the previous attack was a hit and not\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// sunk\\n\\t\\t\\tcombo *= THREE;\\n\\t\\telse if (preHit && sunkShip) // if the previous attack sunk the ship\\n\\t\\t\\tcombo *= FIVE;\\n\\t\\telse\\n\\t\\t\\tcombo = ONE; // if the current attack was a SUNK but the previous\\n\\t\\t\\t\\t\\t\\t\\t// attack was a MISS\\n\\t\\t\\t\\t\\t\\t\\t// or the current attack was a hit but the previous\\n\\t\\t\\t\\t\\t\\t\\t// was a MISS\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ad1e13e0d9e2297a362e40e0736ffca6\",\n \"score\": \"0.4807406\",\n \"text\": \"private boolean r3() // Rule for testing for best practices\\n {\\n int c = 0 ;\\n \\n if(sq[0][0] == this.userSymbol)\\n {\\n c++ ;\\n }\\n \\n if(sq[0][2] == this.userSymbol)\\n {\\n c++ ;\\n }\\n \\n if(sq[2][0] == this.userSymbol)\\n {\\n c++ ;\\n }\\n \\n if(sq[2][2] == this.userSymbol)\\n {\\n c++ ;\\n }\\n \\n if(c > 1 && sq[1][1] == this.compSymbol)\\n {\\n if(sq[0][1] == -1)\\n {\\n sq[0][1] = this.compSymbol ;\\n return true ;\\n }\\n else if(sq[1][0] == -1)\\n {\\n sq[1][0] = this.compSymbol ;\\n return true ;\\n }\\n else if(sq[1][2] == -1)\\n {\\n sq[1][2] = this.compSymbol ;\\n return true ;\\n }\\n else if(sq[2][1] == -1)\\n {\\n sq[2][1] = this.compSymbol ;\\n return true ;\\n }\\n }\\n \\n // Two crosses at specific position to opponent and our in middle scenario\\n \\n if(sq[0][0] == this.userSymbol && sq[2][1] == this.userSymbol && sq[1][1] == this.compSymbol && sq[1][2] == -1)\\n {\\n sq[1][2] = this.compSymbol ;\\n return true ;\\n }\\n else if(sq[2][0] == this.userSymbol && sq[1][2] == this.userSymbol && sq[1][1] == this.compSymbol && sq[0][1] == -1)\\n {\\n sq[0][1] = this.compSymbol ;\\n return true ;\\n }\\n else if(sq[0][2] == this.userSymbol && sq[1][0] == this.userSymbol && sq[1][1] == this.compSymbol && sq[2][1] == -1)\\n {\\n sq[2][1] = this.compSymbol ;\\n return true ;\\n }\\n else if(sq[2][2] == this.userSymbol && sq[0][1] == this.userSymbol && sq[1][1] == this.compSymbol && sq[1][0] == -1)\\n {\\n sq[1][0] = this.compSymbol ;\\n return true ;\\n }\\n \\n return false ;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b3f104721fc9790274402a6b8e16a15\",\n \"score\": \"0.4806415\",\n \"text\": \"private String construccStringWithKDistinctApart(int[] nums, int k) {\\n\\n StringBuilder sb = new StringBuilder();\\n\\n HashMap<Character, Integer> map = new HashMap<>();\\n\\n map.put('a', nums[0]);\\n map.put('b', nums[1]);\\n map.put('c', nums[2]);\\n\\n PriorityQueue<Map.Entry<Character, Integer>> pq\\n = new PriorityQueue<>(11, (a, b) -> (b.getValue() - a.getValue()));\\n\\n pq.addAll(map.entrySet());\\n\\n int len = nums[0] + nums[1] + nums[2];\\n\\n Map.Entry<Character, Integer> onHold = null;\\n\\n while (!pq.isEmpty()) {\\n Map.Entry<Character, Integer> cur = pq.poll();\\n\\n sb.append(cur.getKey());\\n\\n\\n if (onHold != null) {\\n pq.add(onHold);\\n onHold = null;\\n }\\n\\n if (cur.getValue() > 1) {\\n cur.setValue(cur.getValue() - 1);\\n\\n if (sb.length() >= (k - 1) && sb.charAt(sb.length() - (k - 1)) == cur.getKey()) {\\n onHold = cur;\\n } else {\\n pq.add(cur);\\n }\\n }\\n }\\n\\n return sb.toString();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c83b1d880914cf75e5ac3c0cf66b93be\",\n \"score\": \"0.48046133\",\n \"text\": \"public void checkConsume() {\\n\\t\\tint tempSize = 0;\\n\\t\\tfor (Organism x : this.getOrganisms()) {\\n\\t\\t\\ttempSize = this.size;\\n\\t\\t\\tfor (Organism z : this.getOrganisms()) {\\n\\t\\t\\t\\tconsume(x, z);\\n\\t\\t\\t\\tif (this.size < tempSize) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (this.size < tempSize) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"78edd2066bb73174e94ebe1f1022cdae\",\n \"score\": \"0.48020563\",\n \"text\": \"private boolean g()\\r\\n/* 192: */ {\\r\\n/* 193:221 */ return ((this.r.u > -1) && (this.r.u < a.size())) || (this.t.b().length() > 1);\\r\\n/* 194: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6befba9d238ad0f1521caf86d789b37c\",\n \"score\": \"0.48008034\",\n \"text\": \"private int[] checkMatches(Card[] combination) {\\n int[] combo_value = new int[7]; // The current hand value\\n int[] kicker; // The kickers in the hand\\n \\n int matches; // The amount of cards matching.\\n int n, j;\\n OUTER:\\n // Figures out how many cards are matching in the combination of cards.\\n for (int i = 0; i < combination.length; i++) {\\n matches = 0;\\n n = 0; // Tracks how many cards have been checked\\n j = 1 + i; // The card being checked with the current card\\n while (n < 4) {\\n // If true, wrap around to the start.\\n if (j >= combination.length) {\\n j -= combination.length;\\n }\\n \\n // If true, we have a match.\\n if (combination[i].value == combination[j].value) {\\n // If there is no previous matches, then there are now\\n // two matches, otherwise just add one more match\\n if (matches == 0) {\\n matches = 2;\\n } else {\\n matches += 1 ;\\n }\\n }\\n \\n j++;\\n n++;\\n }\\n // Figures out what type of hand you have based on your matches\\n switch (matches) {\\n case 4:\\n // Four of a Kind\\n combo_value[0] = four_of_a_kind;\\n combo_value[1] = combination[i].value;\\n kicker = findKicker(combination, combination[i].value, 0, 1);\\n combo_value[3] = kicker[0];\\n break OUTER;\\n case 3:\\n // If there is a pair already, it is a full house\\n if (combo_value[0] == pair) {\\n // Full House\\n combo_value[0] = full_house;\\n combo_value[2] = combo_value[1];\\n combo_value[1] = combination[i].value;\\n break OUTER;\\n } else {\\n // Three of a Kind\\n combo_value[0] = three_of_a_kind;\\n combo_value[1] = combination[i].value;\\n kicker = findKicker(combination, combination[i].value, 0, 2);\\n combo_value[3] = kicker[0];\\n combo_value[4] = kicker[1];\\n }\\n break;\\n case 2:\\n // If there is a three of a kind already, it is a full house\\n if (combo_value[0] == three_of_a_kind) {\\n // Full House\\n combo_value[0] = full_house;\\n combo_value[2] = combination[i].value;\\n break OUTER;\\n } else if (combo_value[0] == pair) {\\n // Checks to see if there is another pair, therefore it is a two pair\\n if (combo_value[1] != combination[i].value) {\\n // Two Pair\\n combo_value[0] = two_pair;\\n // Puts the two pairs in order\\n if (combination[i].value > combo_value[1]) {\\n combo_value[2] = combo_value[1];\\n combo_value[1] = combination[i].value;\\n } else {\\n combo_value[2] = combination[i].value;\\n } \\n kicker = findKicker(combination, combo_value[1], combo_value[2], 1);\\n combo_value[3] = kicker[0];\\n break OUTER;\\n }\\n } else {\\n // Pair\\n combo_value[0] = pair;\\n combo_value[1] = combination[i].value;\\n kicker = findKicker(combination, combination[i].value, 0, 3);\\n combo_value[3] = kicker[0];\\n combo_value[4] = kicker[1];\\n combo_value[5] = kicker[2];\\n }\\n break;\\n default:\\n // High Card\\n if (combo_value[0] == 0 && combo_value[1] < combination[i].value) {\\n combo_value[1] = combination[i].value;\\n kicker = findKicker(combination, combination[i].value, 0, 4);\\n combo_value[3] = kicker[0];\\n combo_value[4] = kicker[1];\\n combo_value[5] = kicker[2];\\n combo_value[6] = kicker[3];\\n } break;\\n }\\n }\\n \\n return combo_value;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0ad7eb66c88fc245c1c74d7ede182a1\",\n \"score\": \"0.48007342\",\n \"text\": \"public static List<List<Integer>> combinations77(int n, int k) {\\n List<List<Integer>> result = new ArrayList<List<Integer>>();\\n if(k>n) return result; ///\\n backTracking77(result, new ArrayList<>(), n,k, 1);\\n return result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b576c2533f99d8fa49255768accc2abd\",\n \"score\": \"0.4799459\",\n \"text\": \"boolean hasCombinator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66054f6569c2237ec22d6da6a47a3b65\",\n \"score\": \"0.4777889\",\n \"text\": \"private List<String> clumpFinding(String input, int L, int K, int t) {\\n\\t\\tList<String> rto = new ArrayList<String>();\\n\\t\\t\\n\\t\\tint l0 = 0; \\n\\t\\tint l1 = l0 + L;\\n\\n\\t\\t// Loop through windows of size L\\n\\t\\twhile (l1 < input.length()) {\\n\\t\\t\\tString window = input.substring(l0, l1);\\n\\t\\t\\t\\n\\t\\t\\tint k0 = l0;\\n\\t\\t\\tint k1 = k0 + K;\\n\\t\\t\\t// Loop all possible patterns\\n\\t\\t\\twhile (k1 <= l1) {\\n\\t\\t\\t\\tString pattern = input.substring(k0, k1);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (patternCount(window, pattern) >= t) {\\n\\t\\t\\t\\t\\tif (!rto.contains(pattern)) {\\n\\t\\t\\t\\t\\t\\trto.add(pattern);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tk0++;\\n\\t\\t\\t\\tk1++;\\n\\t\\t\\t}\\n\\t\\t\\tl0++;\\n\\t\\t\\tl1++;\\n\\t\\t}\\n\\t\\treturn rto;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"192825972487d92a84410cf100720f48\",\n \"score\": \"0.4774058\",\n \"text\": \"private static String removeRatingFromFilter(String filter){\\n int openBracketCount = 0;\\n if (filter.charAt(0) == '(' && filter.charAt(filter.length() - 1) == ')'){\\n for (int i = 0; i < filter.length() - 1; i++){\\n if (filter.charAt(i) == '('){\\n openBracketCount ++;\\n }\\n\\n if (filter.charAt(i) == ')'){\\n openBracketCount --;\\n }\\n\\n if (openBracketCount == 0){\\n break;\\n }\\n }\\n }\\n if (openBracketCount <= 0)\\n System.out.println (String.format(\\\"%s expression do not have outer brackets\\\", filter));\\n else\\n System.out.println (String.format(\\\"%s expression have outer brackets\\\", filter));\\n // Find all the expressions\\n\\n\\n\\n return \\\"\\\";\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebb0080df96bd73f7e0b27029a4e01de\",\n \"score\": \"0.47729093\",\n \"text\": \"public void dfsPablanInefficient(int index,\\n String s,\\n StringBuilder sequence,\\n Set<String> result,\\n int leftRem,\\n int rightRem,\\n int leftCount,\\n int rightCount) {\\n if(index == s.length()) {\\n if(leftRem == 0 && rightRem == 0) {\\n // This is a valid sequence\\n result.add(sequence.toString());\\n }\\n } else {\\n // Remove case\\n if((s.charAt(index) == '(' && leftRem > 0) || (s.charAt(index) == ')') && rightRem > 0) {\\n dfsPablanInefficient(index + 1,\\n s,\\n sequence,\\n result,\\n s.charAt(index) == '(' ? leftRem - 1 : leftRem,\\n s.charAt(index) == ')' ? rightRem - 1 : rightRem,\\n leftCount,\\n rightCount);\\n }\\n\\n // Append to create current Level\\n sequence.append(s.charAt(index));\\n\\n // This decision part of the logic is needed... see this example\\n // ()())( -> derived from ()())(), if you don't check that\\n // leftCount > rightCount you will end up with such an expression\\n // that's why we keep track of left count and right count\\n\\n if(s.charAt(index) != '(' && s.charAt(index) != ')') {\\n // is not a parenthesis we simply expand dfs\\n dfsPablanInefficient(index + 1, s, sequence, result, leftRem, rightRem, leftCount, rightCount);\\n } else if(s.charAt(index) == '(') {\\n dfsPablanInefficient(index + 1, s, sequence, result, leftRem, rightRem, leftCount + 1, rightCount);\\n } else if(leftCount > rightCount) {\\n dfsPablanInefficient(index + 1, s, sequence, result, leftRem, rightRem, leftCount, rightCount + 1);\\n }\\n\\n // Remove current level for backtracking\\n sequence.deleteCharAt(sequence.length() - 1);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d07c2921217c0d802b491be4c6f741aa\",\n \"score\": \"0.4768981\",\n \"text\": \"public List<String> removeInvalidParentheses(String s) {\\n Queue<String> queue = new LinkedList();\\n List<String> ans = new ArrayList();\\n //Start BFS with string\\n queue.add(s);\\n Set<String> visited = new HashSet();\\n visited.add(s);\\n while (!queue.isEmpty()){\\n String t = queue.poll();\\n //Check if string is valid.\\n if(isValid(t)){\\n //Add to answer\\n ans.add(t);\\n }\\n //If a valid string is found, then we need not BFS lower length strings\\n if(ans.isEmpty()){\\n for(int i=0;i<t.length();i++){\\n //Remove ith character and add to stack. Only remove ith character if it is a bracket\\n if(!Character.isAlphabetic(t.charAt(i))&&!visited.contains(t.substring(0,i)+t.substring(i+1))) {\\n queue.add(t.substring(0, i) + t.substring(i + 1));\\n visited.add(t.substring(0, i) + t.substring(i + 1));\\n }\\n }\\n }\\n }\\n return ans;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3327d3e7789761959d62229ed183423\",\n \"score\": \"0.47645098\",\n \"text\": \"public static void keepOnlyCompositeNumbers( List<Integer> nums )\\r\\n {\\nboolean checker=false;\\n//make a for loop which traverses the array \\nfor(int i=0; i<nums.size();i++){\\n//make a for loop which goes through each value from 2 to the current index and constantly checks that checker is false \\nfor(int j=2; j<nums.get(i) && !checker;j++){\\n//check whether it has any factors (besides 1 and itself)... if it does, set checker to true \\nif(nums.get(i)%j==0)\\nchecker=true;\\n//end nested for loop\\n}\\n//check if checker is still false\\nif(!checker){\\n//if so remove the current index and decrement the current index by 1 (to compensate for missing index)\\nnums.remove(i);\\ni--;\\n }\\n//else\\nelse\\n//reset checker to false \\nchecker=false; \\n//end for loop \\n }\\n//end method :)\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a6199462d73f23b2d459b8a55c0b075\",\n \"score\": \"0.47587198\",\n \"text\": \"private int checkPatterns(Board gameBoard, String[] directions, int player) {\\n\\n\\t\\tint fourMe = 0;\\n\\t\\tint fourYou = 0;\\n\\t\\tint openThreeMe = 0;\\n\\t\\tint openThreeYou = 0;\\n\\t\\tint openTwoMe = 0;\\n\\t\\tint openTwoYou = 0;\\n\\n\\t\\tchar me = (player == 1) ? gameBoard.getPlayer1Char() : gameBoard.getPlayer2Char();\\n\\t\\tchar you = (player == 1) ? gameBoard.getPlayer2Char() : gameBoard.getPlayer1Char();\\n\\t\\tchar no = gameBoard.getNoPlayerChar();\\n\\n\\t\\t//list of possible open two combinations\\n\\t\\tString a = \\\"\\\" + no + me + me;\\n\\t\\tString b = \\\"\\\" + me + me + no;\\n\\t\\tString c = \\\"\\\" + me + no + me;\\n\\t\\tString d = \\\"\\\" + no + you + you;\\n\\t\\tString e = \\\"\\\" + you + you + no;\\n\\t\\tString f = \\\"\\\" + you + no + you;\\n\\n\\t\\t//list of possible open three combinations\\n\\t\\tString g = \\\"\\\" + me + no + me + me;\\n\\t\\tString h = \\\"\\\" + me + me + no + me;\\n\\t\\tString j = \\\"\\\" + no + me + me + me;\\n\\t\\tString k = \\\"\\\" + me + me + me + no;\\n\\t\\tString l = \\\"\\\" + you + no + you + you;\\n\\t\\tString m = \\\"\\\" + you + you + no + you;\\n\\t\\tString n = \\\"\\\" + no + you + you + you;\\n\\t\\tString o = \\\"\\\" + you + you + you + no;\\n\\n\\t\\t//list of possible four combinations\\n\\t\\tString p = \\\"\\\" + me + me + me + me;\\n\\t\\tString q = \\\"\\\" + you + you + you + you;\\n\\n\\t\\t//go through strings of particular direction and check for occurrences of combinations above\\n\\t\\tfor (int i = 0; i < gameBoard.getBoardSize(); i++) {\\n\\t\\t\\tString direction = new String (directions[i]);\\n\\n\\t\\t\\t//check for four in a rows\\n\\t\\t\\tif (direction.contains(p)) fourMe++;\\n\\t\\t\\telse if (direction.contains(q)) fourYou++;\\n\\n\\t\\t\\t//check for open three in a rows\\n\\t\\t\\telse if (direction.contains(g)) openThreeMe++;\\n\\t\\t\\telse if (direction.contains(h)) openThreeMe++;\\n\\t\\t\\telse if (direction.contains(j)) openThreeMe++;\\n\\t\\t\\telse if (direction.contains(k)) openThreeMe++;\\n\\t\\t\\telse if (direction.contains(l)) openThreeYou++;\\n\\t\\t\\telse if (direction.contains(m)) openThreeYou++;\\n\\t\\t\\telse if (direction.contains(n)) openThreeYou++;\\n\\t\\t\\telse if (direction.contains(o)) openThreeYou++;\\n\\n\\t\\t\\t//check for open two in a rows\\n\\t\\t\\telse if (direction.contains(a + \\\".\\\") || direction.contains(\\\".\\\" + a)) openTwoMe++;\\n\\t\\t\\telse if (direction.contains(b + \\\".\\\") || direction.contains(\\\".\\\" + b)) openTwoMe++;\\n\\t\\t\\telse if (direction.contains(c + \\\".\\\") || direction.contains(\\\".\\\" + c)) openTwoMe++;\\n\\t\\t\\telse if (direction.contains(d + \\\".\\\") || direction.contains(\\\".\\\" + d)) openTwoYou++;\\n\\t\\t\\telse if (direction.contains(e + \\\".\\\") || direction.contains(\\\".\\\" + e)) openTwoYou++;\\n\\t\\t\\telse if (direction.contains(f + \\\".\\\") || direction.contains(\\\".\\\" + f)) openTwoYou++;\\n\\t\\t}\\n\\n\\t\\t//return utility\\n\\t\\treturn 10 * (fourMe - fourYou) + 3 * (openThreeMe - openThreeYou) + (openTwoMe - openTwoYou);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"61fea4d04e8c6b89e5d7024223f68c37\",\n \"score\": \"0.47542918\",\n \"text\": \"@Test\\n public void test() {\\n long bestNumRectangles = 0;\\n for (int i = 1; tr(i) < 2 * N; i++)\\n for (int j = 1; true; j++) {\\n long numRectangles = tr(i) * tr(j);\\n if (numRectangles >= 2 * N)\\n break;\\n if (Math.abs(numRectangles - N) < Math.abs(bestNumRectangles - N)) {\\n bestNumRectangles = numRectangles;\\n ans = i * j;\\n }\\n }\\n check(2772);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9f027890c6f93e3b9419041b6d750de\",\n \"score\": \"0.47541156\",\n \"text\": \"public int longestValidParentheses(String s) {\\n if (s.length() == 0) {\\n return 0;\\n }\\n\\n // translate the brackets into 1 and -1\\n List<Integer> trans_data = new ArrayList<>(Arrays.asList());\\n for (char c : s.toCharArray()) {\\n if (c == '(') {\\n trans_data.add(1);\\n } else {\\n trans_data.add(-1);\\n }\\n }\\n\\n // while loop to merge pairs\\n boolean merged = true;\\n while (merged) {\\n merged = false;\\n List<Integer> stack = new ArrayList<>(Arrays.asList());\\n List<Integer> new_trans_data = new ArrayList<>(Arrays.asList());\\n\\n for (int elem : trans_data) {\\n if (elem == 1) {\\n if (stack.isEmpty()) {\\n stack.add(elem);\\n } else {\\n new_trans_data.addAll(stack);\\n stack.clear();\\n stack.add(elem);\\n }\\n } else if (elem == -1) {\\n if (!stack.isEmpty() && stack.get(0) == 1) {\\n stack.add(elem);\\n if (stack.size() == 2) {\\n new_trans_data.add(2);\\n } else {\\n new_trans_data.add(stack.get(1) + 2);\\n }\\n stack.clear();\\n merged = true;\\n } else {\\n new_trans_data.addAll(stack);\\n stack.clear();\\n new_trans_data.add(elem);\\n }\\n } else {\\n if (!stack.isEmpty() && stack.get(stack.size() - 1) > 1) {\\n stack.set(stack.size() - 1, stack.get(stack.size() - 1) + elem);\\n } else {\\n stack.add(elem);\\n }\\n }\\n }\\n\\n if (!stack.isEmpty()) {\\n new_trans_data.addAll(stack);\\n }\\n trans_data = new_trans_data;\\n\\n }\\n\\n // return the max value only if max value >= 2, otherwise they are single brackets (-1 or 1)\\n int ans = 0;\\n for (int i : trans_data) {\\n if (i > ans) {\\n ans = i;\\n }\\n }\\n if (ans >= 2) {\\n return ans;\\n } else {\\n return 0;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d23dee9697b907e24c9bc689c1742456\",\n \"score\": \"0.47524497\",\n \"text\": \"private int getWinCombination(int combinationNumber, int posY, int posX) {\\n if (combinationNumber < fieldSize) { // strings\\n if (posY == combinationNumber) {\\n return BELONGS_TO_WIN_COMBINATION;\\n }\\n return DOESNT_BELONG_TO_WIN_COMBINATION;\\n }\\n if (combinationNumber >= fieldSize && combinationNumber < (fieldSize * 2)) { // columns\\n if ((posX + fieldSize) == combinationNumber) {\\n return BELONGS_TO_WIN_COMBINATION;\\n }\\n return DOESNT_BELONG_TO_WIN_COMBINATION;\\n }\\n if (combinationNumber == (fieldSize * 2) && posX == posY) { // diagonals\\n return BELONGS_TO_WIN_COMBINATION;\\n }\\n if (combinationNumber == (fieldSize * 2 + 1) && posX == (fieldSize - posY - 1)) {\\n return BELONGS_TO_WIN_COMBINATION;\\n }\\n return DOESNT_BELONG_TO_WIN_COMBINATION;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c139c7c5e8463917ef70d230a85d2b1\",\n \"score\": \"0.47479993\",\n \"text\": \"private boolean twoPieces(int f) {\\n\\t\\tfor(int i=0;i<=t.length-1;i++){\\r\\n\\t\\t\\tif(t[i][0]==t[i][1]&&t[i][0]==f&&t[i][2]==0){\\r\\n\\t\\t\\t\\tb.dropPiece(new PieceLocation(-1,i,2));return true;\\r\\n\\t\\t\\t}else if(t[i][0]==t[i][2]&&t[i][0]==f&&t[i][1]==0){\\r\\n\\t\\t\\t\\tb.dropPiece(new PieceLocation(-1,i,1));return true;\\r\\n\\t\\t\\t}else if (t[i][1]==t[i][2]&&t[i][1]==f&&t[i][0]==0){\\r\\n\\t\\t\\t\\tb.dropPiece(new PieceLocation(-1,i,0));return true;\\r\\n\\t\\t\\t}else if(t[0][i]==t[1][i]&&t[0][i]==f&&t[2][i]==0){\\r\\n\\t\\t\\t\\tb.dropPiece(new PieceLocation(-1,2,i));return true;\\r\\n\\t\\t\\t}else if (t[0][i]==t[2][i]&&t[0][i]==f&&t[1][i]==0){\\r\\n\\t\\t\\t\\tb.dropPiece(new PieceLocation(-1,1,i));return true;\\r\\n\\t\\t\\t}else if(t[1][i]==t[2][i]&&t[1][i]==f&&t[0][i]==0){\\r\\n\\t\\t\\t\\tb.dropPiece(new PieceLocation(-1,0,i));return true;\\r\\n\\t\\t\\t}\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\tif (t[0][0]==t[1][1]&&t[0][0]==f&&t[2][2]==0){\\r\\n\\t\\t\\tb.dropPiece(new PieceLocation(-1,2,2));return true;\\r\\n\\t\\t}else if(t[1][1]==t[2][2]&&t[1][1]==f&&t[0][0]==0){\\r\\n\\t\\t\\tb.dropPiece(new PieceLocation(-1,0,0));return true;\\r\\n\\t\\t}else if(t[0][2]==t[1][1]&&t[0][2]==f&&t[2][0]==0){\\r\\n\\t\\t\\tb.dropPiece(new PieceLocation(-1,2,0));return true;\\r\\n\\t\\t}else if (t[1][1]==t[2][0]&&t[1][1]==f&&t[0][2]==0){\\r\\n\\t\\t\\tb.dropPiece(new PieceLocation(-1,0,2));return true;\\r\\n\\t\\t}else{\\r\\n\\t\\t\\treturn false;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff3974fadddd68347507d4f239a3e77b\",\n \"score\": \"0.4730188\",\n \"text\": \"private void secondPass() {\\n int distinctItems = reader.getDistinctItem();\\n /* Size of the triangular array will need 2 (m * m) bytes */\\n int [] traingularArray = new int[ 2 * ((int) Math.pow( frequentItemSet.size(), 2)/ Integer.BYTES) + 10];\\n for (List<Integer> basket : baskets) {\\n for(int i = 0; i < basket.size() - 1; i++) {\\n if(! frequentItemSet.containsKey(basket.get(i)) ){\\n continue;\\n }\\n for(int j = i + 1; j < basket.size(); j++) {\\n if(!frequentItemSet.containsKey(basket.get(j))) {\\n continue;\\n }\\n else {\\n ArrayList<Integer> item = new ArrayList<>();\\n item.add(basket.get(i));\\n item.add(basket.get(j));\\n int k = 0;\\n int firstItem= frequentItemSet.get(item.get(0));\\n int secondItem = frequentItemSet.get(item.get(1));\\n if(firstItem < secondItem) {\\n k = (firstItem - 1 ) * ( frequentItemSet.size() - (firstItem/2) ) + secondItem - firstItem;\\n }\\n else if(secondItem > firstItem )\\n {\\n k = (secondItem - 1 ) * ( frequentItemSet.size() - (secondItem/2) ) + firstItem - secondItem;\\n }\\n traingularArray[ k ]++;\\n if(traingularArray[k] >= minSupport) {\\n Collections.sort(item);\\n String key = map.get(item.get(0)) + \\\",\\\" + map.get(item.get(1));\\n if(!itemSet.contains(key)) {\\n System.out.println(key);\\n itemSet.add(key);\\n }\\n if(!frequentItemSet1.contains(item)) {\\n frequentItemSet1.add(item);\\n }\\n }\\n }\\n }\\n }\\n }\\n frequentItemSet = null;\\n itemQuantity = null;\\n itemSet.clear();\\n\\n if(frequentItemSet1.size() > 1) {\\n findCandidateSet();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19c43a2f192b5fc4b603ef5ea865e6b4\",\n \"score\": \"0.47239414\",\n \"text\": \"public static StringBuilder cleanDoubledBrackets(StringBuilder inp) {if(inp.length()<5) return inp;\\r\\n StringBuilder res = inp;\\r\\n int index1;\\r\\n for (int pp = 0; pp < res.length(); pp++) {\\r\\n index1 = res.indexOf(\\\"((\\\", pp); if (index1==-1) break;\\r\\n int indexC = res.indexOf(\\\")\\\", index1 + 2);\\r\\n int indexO = res.indexOf(\\\"(\\\", index1 + 2);\\r\\n if ((indexC < indexO) || (indexO == -1)) {\\r\\n if ((indexC + 1 < res.length()) && (res.charAt(indexC + 1) == ')')) {\\r\\n res.deleteCharAt(indexC);\\r\\n res.deleteCharAt(index1);\\r\\n pp--;\\r\\n }\\r\\n } else {\\r\\n int counter = 1;\\r\\n for (int k = indexO + 1; k < res.length(); k++) {\\r\\n char charK = res.charAt(k);\\r\\n if (charK == '(') {\\r\\n counter++;\\r\\n } else {\\r\\n if (charK == ')') {\\r\\n counter--;\\r\\n }\\r\\n }\\r\\n if (counter == -1) {\\r\\n if ((k + 1 < res.length()) && (res.charAt(k + 1) == ')')) {\\r\\n res.deleteCharAt(k);\\r\\n res.deleteCharAt(index1);\\r\\n pp--;\\r\\n }\\r\\n break;\\r\\n }\\r\\n }\\r\\n }\\r\\n }\\r\\n // удалим скобки в которых нет операций + -, а перед ними нет функции и если после скобок нет шапочки или штриха\\r\\n // нужно сохранить скобки при \\\"(y^5)^6\\\" \\r\\n // и нужно сохранить \\\\sin([х])\\r\\n int pp = -1;\\r\\n b:\\r\\n while (pp < res.length()) {\\r\\n int index = res.indexOf(\\\"(\\\", pp);\\r\\n if (index == -1) {return res;}\\r\\n// int indexSB = res.indexOf(\\\"[\\\", index); //удаляем ([ ]), т.е. с вектора снимаем круглые скобки.\\r\\n// if (indexSB != -1) {\\r\\n// int tmp_bl = index + 1;\\r\\n// int ttt = res.charAt(tmp_bl);\\r\\n// while ((tmp_bl < indexSB) && ((ttt == ' ') || (ttt == '\\\\n'))) {\\r\\n// tmp_bl++;\\r\\n// }\\r\\n// if (res.charAt(tmp_bl) == '[') {\\r\\n// int posPareSB = posOfPareBracket(res, indexSB, '[', ']');\\r\\n// int temp = posPareSB + 1;\\r\\n// if ((posPareSB != -1) && (temp < res.length())) {\\r\\n// ttt = res.charAt(temp);\\r\\n// while ((temp < res.length()) && ((ttt == ' ') || (ttt == '\\\\n'))) {\\r\\n// temp++;\\r\\n// ttt = res.charAt(temp);\\r\\n// }\\r\\n// if (ttt == ')') {\\r\\n// res.deleteCharAt(temp);\\r\\n// res.deleteCharAt(index);\\r\\n// return res;\\r\\n// }\\r\\n// }\\r\\n// }\\r\\n// }\\r\\n int posPare = posOfPareBracket(res, index, '(', ')');\\r\\n int tmp_i = posPare + 1;\\r\\n while ((tmp_i < res.length()) && (res.charAt(tmp_i) == ' ')) {\\r\\n tmp_i++;\\r\\n }\\r\\n if ((tmp_i < res.length()) && (((res.charAt(tmp_i) == '^') || (res.charAt(tmp_i) == '\\\\'')))) {\\r\\n pp = index + 1;\\r\\n continue b;\\r\\n }\\r\\n int k = index + 1;\\r\\n while (k < posPare) {\\r\\n char charK = res.charAt(k);\\r\\n if ((charK == '+') || (charK == '-')) {\\r\\n pp = index + 1;\\r\\n continue b;\\r\\n } else {\\r\\n if (charK == '(') {\\r\\n k = posOfPareBracket(res, k, '(', ')') + 1;\\r\\n } else {\\r\\n k++;\\r\\n }\\r\\n }\\r\\n }\\r\\n int indexBackSlash = res.lastIndexOf(\\\"\\\\\\\\\\\", index);\\r\\n if (indexBackSlash == -1 && posPare != -1 &&\\r\\n (!((index>1)&&(res.charAt(index-1)=='{')&&(res.charAt(index-2)=='^')))) // <- показатель производной сохраняем в скобках\\r\\n {\\r\\n res.deleteCharAt(posPare);\\r\\n res.deleteCharAt(index);\\r\\n pp = index; \\r\\n } else {\\r\\n int indexO = res.indexOf(\\\"(\\\", indexBackSlash);\\r\\n int indexFB = res.indexOf(\\\"{\\\", indexBackSlash);\\r\\n int posPareFB = (indexFB == -1) ? (-1) : posOfPareBracket(res, indexFB, '{', '}');\\r\\n int indexO2 = (posPareFB == -1) ? (-1) : res.indexOf(\\\"(\\\", posPareFB);\\r\\n if ((((indexO2 != -1) && (indexO2 < index)) || ((index < posPareFB) && (index > indexFB))\\r\\n || ((indexO < index) && ((indexO < indexFB) || (indexFB == -1))) ) &&\\r\\n (!((index>1)&&(res.charAt(index-1)=='{')&&(res.charAt(index-2)=='^'))) ) // <- показатель производной сохраняем в скобках\\r\\n {\\r\\n res.deleteCharAt(posPare);\\r\\n res.deleteCharAt(index);\\r\\n pp = index;\\r\\n } else {\\r\\n pp = index + 1;\\r\\n }\\r\\n }\\r\\n }\\r\\n if(res.charAt(0)=='(') {int posStart = posOfPareBracket(res, 0, '(', ')');\\r\\n if(res.length()-1==posStart){ res.deleteCharAt(0);res.deleteCharAt(posStart);}\\r\\n }// удаление первой и парной последней скобки\\r\\n return (res);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27542bd498214ec1b6b1ae5de378b9f5\",\n \"score\": \"0.47226167\",\n \"text\": \"private void dfs(List<String> result, String s, int leftUnmatch, int rightUnmatch, int index) {\\n if (leftUnmatch == 0 && rightUnmatch == 0 && isValid(s)) {\\n result.add(s);\\n return;\\n }\\n\\n for (int i = index; i < s.length(); i++) {\\n if (i != index && s.charAt(i) == s.charAt(i - 1)) {\\n continue;\\n }\\n\\n // delete current character to form a new string\\n String tempStr = s.substring(0, i) + s.substring(i + 1);\\n\\n // if we still have quota for deleting left parentheses or right parentheses, try next dfs recursion\\n if (leftUnmatch > 0 && s.charAt(i) == '(') {\\n // since we already -1 for next recursion index, we DO NOT need to use i+1 as parameter for next recursion\\n dfs(result, tempStr, leftUnmatch - 1, rightUnmatch, i);\\n }\\n else if (rightUnmatch > 0 && s.charAt(i) == ')') {\\n dfs(result, tempStr, leftUnmatch, rightUnmatch - 1, i);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"337cb879fca567a41a7162e6cac93f56\",\n \"score\": \"0.4717629\",\n \"text\": \"public void eliminateStrategy(Map<String, ArrayList<Integer>> gridValues) {\\r\\n\\t\\tString[] tempBoxes = grid.getBoxes();\\r\\n\\t\\tfor (int i = 0; i < tempBoxes.length; i++) { // tempBoxes.length\\r\\n\\t\\t\\tif(gridValues.get(tempBoxes[i]).size()==1) {\\r\\n\\t\\t\\t\\tint temp = gridValues.get(tempBoxes[i]).get(0);\\r\\n\\t\\t\\t\\tfor(String[] lists : grid.getPeersMap().get(tempBoxes[i])) {\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//prints each value from row_unit, col_unit and box_unit\\r\\n\\t\\t\\t\\t\\tfor (int j = 0; j < lists.length; j++) {\\r\\n\\t\\t\\t\\t\\t\\t//if(tempBoxes[i].equals(\\\"A3\\\")) {\\r\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"E: \\\"+tempBoxes[i]+\\\" \\\"+CopyGridValues.get(lists[j]) +\\\" \\\"+lists[j]);\\r\\n\\t\\t\\t\\t\\t\\t//if(gridValues.get(lists[j]).size()>1) { //FOR SOME REASON THIS ALGORITHM WANTS TO DELETE FROM EMPTY FIELDS SO THIS IS NEEDED\\r\\n\\t\\t\\t\\t\\t\\t\\tgridValues.get(lists[j]).remove(new Integer(temp));\\r\\n\\t\\t\\t\\t\\t\\t//}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95cbb859009c3739a15e8ceb302531de\",\n \"score\": \"0.4714664\",\n \"text\": \"private List<Chosen> initFewerChosenList( ){\\n\\t\\tList<Chosen> chosenList = new ArrayList<Chosen>();\\n\\t\\t\\n\\t\\tfor(int notChosenIdx1 = 1 ; notChosenIdx1 <= n;notChosenIdx1++){\\n\\t\\t\\tfor(int notChosenIdx2 = 1 ; notChosenIdx2 <= n;notChosenIdx2++){\\n\\t\\t\\t\\t//一个chose, 去除n选2的选择\\n\\t\\t\\t\\tif( notChosenIdx1 != notChosenIdx2){\\n\\t\\t\\t\\t\\tChosen chosen = new Chosen();\\n\\t\\t\\t\\t\\tfor( int lineNume = 1 ; lineNume <= n;lineNume++){\\n\\t\\t\\t\\t\\t\\tif( lineNume != notChosenIdx1 &&\\n\\t\\t\\t\\t\\t\\t\\tlineNume != notChosenIdx2)\\n\\t\\t\\t\\t\\t\\t\\tchosen.addLine(lineNume);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tchosen.cal(pairs);\\n\\t\\t\\t\\t\\tchosenList.add(chosen);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn chosenList;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5054189f87d598b0957fdc0ebeb57878\",\n \"score\": \"0.46994248\",\n \"text\": \"public static int Main()\\n\\t{\\n\\t\\tint n;\\n\\t\\tint k;\\n\\t\\tint i;\\n\\t\\tint j;\\n\\t\\tint l;\\n\\t\\tint maxc = 0;\\n\\t\\tint x = 0;\\n\\t\\tString c = new String(new char[501]);\\n\\t\\tchar[][] strout = new char[501][5];\\n\\t\\tint[] a = new int[501]; //???????????\\n\\t\\tfor (i = 0; i < 501; i++)\\n\\t\\t{\\n\\t\\t\\ta[i] = 1; //???????????? ??????1\\n\\t\\t}\\n\\t\\tn = Integer.parseInt(ConsoleInput.readToWhiteSpace(true));\\n\\t\\tc = ConsoleInput.readToWhiteSpace(true).charAt(0);\\n\\t\\tk = c.length(); //??????????\\n\\t\\tString p = c; //??????? ?????????\\n\\t\\tfor (j = 0; j <= k - n; j++)\\n\\t\\t{\\n\\t\\t\\tfor (l = j + 1; l <= k - n; l++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (i = 0; i < n; i++) //???????\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (*(p.Substring(j) + i) == *(p.Substring(l) + i)) //??i+1?????????????\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (i >= n) //????break??? ??????????\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ta[j]++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (i = 0;i < k - n; i++)\\n\\t\\t{\\n\\t\\t\\tif (a[i] >= maxc)\\n\\t\\t\\t{\\n\\t\\t\\t\\tmaxc = a[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (i = 0;i < k - n; i++)\\n\\t\\t{\\n\\t\\t\\tif (a[i] >= maxc) //???????????? ???? ??????????????\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (j = 0;j < n; j++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tstrout[x][j] = (p.Substring(i) + j);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tx++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (maxc == 1) //??????? ??NO\\n\\t\\t{\\n\\t\\t\\tSystem.out.print(\\\"NO\\\");\\n\\t\\t\\tSystem.out.print(\\\"\\\\n\\\");\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tSystem.out.print(maxc);\\n\\t\\t\\tSystem.out.print(\\\"\\\\n\\\");\\n\\t\\t\\tfor (i = 0; i < x; i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (j = 0;j < n; j++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tSystem.out.print(strout[i][j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tSystem.out.print(\\\"\\\\n\\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5d92e90eedebdfeea8820cc40734f42\",\n \"score\": \"0.46974498\",\n \"text\": \"static void minimumBribes(int[] q) {\\n int bribeCount = 0;\\n boolean isChaotic = false;\\n\\n for(int i =0; i < q.length; i++){\\n if(q[i] - (i+1) >2){\\n isChaotic = true;\\n break;\\n }\\n for(int j= Math.max(0,q[i] -2); j < i; j++){\\n System.out.println(\\\"Printing value of ::\\\" +i );\\n if(q[j] > q[i]){\\n bribeCount++;\\n }\\n }\\n\\n }\\n if(isChaotic){\\n System.out.println(\\\"Too chaotic\\\");\\n }else{\\n System.out.println(bribeCount);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3394b99dea06e5b1824d69281d1a857f\",\n \"score\": \"0.46803004\",\n \"text\": \"private String gameWon() {\\n for(int row = 0; row < 6; row++) {\\n if(numR[row] >= 4) {\\n String last = null; \\n int count = 1; \\n int largestCount = 1; \\n for(int i = 0; i < 7; i++ ) {\\n String str = this.board[row][i]; \\n if (count == 3 && i != 6) {\\n String next = this.board[row][i + 1]; \\n if (next != null && str != null) {\\n if (str.equals(next)) {\\n return str; \\n }\\n }\\n }\\n if (str == null) {\\n last = str; \\n count = 1; \\n } else {\\n if (str.equals(last)) {\\n count++; \\n } else {\\n last = str; \\n count = 1; \\n }\\n }\\n if (count > largestCount) { largestCount = count; numR[row] = largestCount; }\\n if (count == 4) { return str; }\\n }\\n }\\n }\\n for(int col = 0; col < 7; col++) {\\n if(numC[col] >= 4) {\\n String last = null; \\n int count = 1; \\n int largestCount = 1; \\n for(int i = 0; i < 6; i++ ){\\n String str = this.board[i][col]; \\n if (str == null) {\\n last = str; \\n count = 1; \\n } else {\\n if (str.equals(last)) {\\n count++; \\n } else {\\n last = str; \\n count = 1; \\n }\\n }\\n if (count > largestCount) { largestCount = count; numC[col] = largestCount; }\\n if (count == 4) { return str; }\\n }\\n }\\n }\\n for(int c = -2; c <=3; c++) {\\n String last = null; \\n int count = 1; \\n int largestCount = 1; \\n for(int r = 0; r < 6; r++) {\\n if (c + r < 0 || c + r > 6) { continue; }\\n String str = board[r][c + r]; \\n if (str == null) { \\n count = 1; \\n last = null; \\n } else {\\n if (str.equals(last)) {\\n count++; \\n } else {\\n last = str; \\n count = 1; \\n }\\n }\\n if (count > largestCount) { largestCount = count; }\\n if (count == 4) { return str; }\\n }\\n }\\n for(int c = 8; c >= 3; c--) {\\n String last = null; \\n int count = 1; \\n int largestCount = 1; \\n for(int r = 0; r < 6; r++) {\\n if (c - r > 6 || c - r < 0) { last = null; continue; }\\n String str = board[r][c-r]; \\n if (str == null) {\\n count = 1; \\n last = null; \\n } else {\\n if (str.equals(last)) {\\n count++; \\n } else {\\n last = str; \\n count = 1; \\n }\\n }\\n if (count > largestCount) { largestCount = count; }\\n if (count == 4) { return str; }\\n }\\n }\\n return null; \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44d6c72ed644b4a264ad8950070f605c\",\n \"score\": \"0.4671125\",\n \"text\": \"void noMoreBagsToCollect();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9bb26b644ba34cfcca0bb599fc13ed2\",\n \"score\": \"0.46677682\",\n \"text\": \"static void processSequence(int openBracketsCount, int closeBracketsCount) {\\n\\tif (openBracketsCount + closeBracketsCount == 2 * n) {\\n\\t // at this point we've formed a correct sequence, incrementing\\n\\t // result\\n\\t numberOfCorrectSequences++;\\n\\t return;\\n\\t}\\n\\n\\tif (openBracketsCount < n)\\n\\t // if '('-brackets are available, than adding '('\\n\\t processSequence(openBracketsCount + 1, closeBracketsCount);\\n\\n\\tif (openBracketsCount > closeBracketsCount)\\n\\t // if current sequence can be closed 'correctly', than adding ')'.\\n\\t // Note: in this way of rules we are generating ONLY correct\\n\\t // sequences\\n\\t processSequence(openBracketsCount, closeBracketsCount + 1);\\n\\n\\treturn;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41d73470782b86e0fc1c4711aaf88102\",\n \"score\": \"0.46677428\",\n \"text\": \"private void combinations(int len, int fileCount){\\n ArrayList<String> resources= new ArrayList<>(timeHarMap.keySet());\\n System.out.println(\\\"Número resources \\\" + resources.size());\\n Set<Set<String>> combinations = Sets.combinations(ImmutableSet.copyOf(resources), len);\\n Set r;\\n StringBuffer line = new StringBuffer();\\n Iterator combIterator = combinations.iterator();\\n System.out.println(\\\"Número combinações \\\" + combinations.size());\\n int i = 0;\\n while (combIterator.hasNext()){\\n r = (Set) combIterator.next();\\n\\n line.setLength(0);\\n Iterator lineIterator = r.iterator();\\n while(lineIterator.hasNext()){\\n if(line.length()>0) line.append(\\\",\\\");\\n line.append(lineIterator.next().toString());\\n }\\n\\n ProcessCombinationModel combinationInfo= new ProcessCombinationModel();\\n combinationInfo.combination = line.toString();\\n calculateStatistics(combinationInfo,fileCount);\\n if(i++%100000==0) System.out.println(\\\"Comb \\\" + i);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19607aa2b91f79a8cc758462d2578009\",\n \"score\": \"0.46658823\",\n \"text\": \"@Override\\n\\tpublic int chooseNum(TreeSet<Integer> avail) {\\n\\t\\tif (findOptimal == false){\\n\\t\\t\\tList<Integer> choices = new ArrayList<Integer>();\\n\\t\\t\\tsolve(avail,0,0,choices);\\n\\t\\t}\\n\\t\\t\\n\\t\\t//Get the next number in the sequence and remove it\\n\\t\\tint currentChoice = bestChoice.get(0);\\n\\t\\tbestChoice.remove(0);\\n\\t\\t\\n\\t\\treturn currentChoice;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fdf95543230d1be7db7a16820df2ca81\",\n \"score\": \"0.46631432\",\n \"text\": \"public void removeImpossibleRCs(int numMutable, int strandMut[][]){\\n\\n boolean done = false;\\n\\n while( !done ){//We iterate until no more RCs can be removed\\n\\n done = true;\\n \\n int numAAtypes[] = new int[numMutable];\\n \\n boolean prunedRCs[][][][] = new boolean[numberOfStrands][][][];//Which RCs should be removed\\n for(int str=0; str<numberOfStrands; str++)\\n prunedRCs[str] = new boolean[m.strand[str].numberOfResidues][strandRot[str].rl.getNumAAallowed()][];\\n\\n int ctr=0;\\n for(int str=0;str<strandMut.length;str++){ //the number of AAs allowed for each AS residue\\n for(int i=0;i<strandMut[str].length;i++){\\n numAAtypes[ctr] = strandRot[str].getNumAllowable(strandMut[str][i]);\\n ctr++;\\n }\\n }\\n\\n for (int curPos=0; curPos<numMutable; curPos++){\\n int str=mutRes2Strand[curPos];\\n int strResNum=strandMut[str][mutRes2StrandMutIndex[curPos]];\\n Residue res = m.strand[str].residue[strResNum];\\n\\n for (int AA=0; AA<numAAtypes[curPos]; AA++){\\n int curAA = strandRot[str].getIndexOfNthAllowable(strResNum,AA);\\n\\n //find how many rotamers are allowed for the current AA type at the given residue;\\n //note that ala and gly have 0 possible rotamers\\n int numRCForCurAAatPos = getNumRot( str, strResNum, curAA );\\n\\n prunedRCs[str][strResNum][curAA] = new boolean[numRCForCurAAatPos];\\n\\n for(int curRC=0; curRC<numRCForCurAAatPos; curRC++){\\n\\n prunedRCs[str][strResNum][curAA][curRC] = false;\\n\\n for (int altPos=0; altPos<numMutable; altPos++){\\n\\n if( altPos != curPos ){\\n\\n int str2=mutRes2Strand[altPos];\\n int strResNum2=strandMut[str2][mutRes2StrandMutIndex[altPos]];\\n\\n boolean prune = true;\\n Residue res2 = m.strand[str2].residue[strResNum2];\\n \\n for (int AA2=0; AA2<numAAtypes[altPos]; AA2++){\\n int altAA = strandRot[str2].getIndexOfNthAllowable(strResNum2,AA2);\\n\\n //find how many rotamers are allowed for the current AA type at the given residue;\\n //note that ala and gly have 0 possible rotamers\\n int numRCForCurAAatPos2 = getNumRot( str2, strResNum2, altAA );\\n\\n\\n for(int altRC=0; altRC<numRCForCurAAatPos2; altRC++){\\n\\n if( ! isParametricallyIncompatible(res, curAA, curRC, res2, altAA, altRC))\\n prune = false;\\n }\\n }\\n\\n prunedRCs[str][strResNum][curAA][curRC] = prunedRCs[str][strResNum][curAA][curRC] || prune;\\n }\\n }\\n\\n if(prunedRCs[str][strResNum][curAA][curRC])\\n done = false;\\n }\\n }\\n }\\n\\n\\n for(int str=0; str<numberOfStrands; str++)\\n ((StrandRCs)strandRot[str]).removeRCs(prunedRCs[str]);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a1be1c0336a7d664179c4e424d4ceb0\",\n \"score\": \"0.46602437\",\n \"text\": \"public void a(int paramInt)\\r\\n/* 233: */ {\\r\\n/* 234:394 */ paramInt = MathUtils.clamp(paramInt, 3, 32);\\r\\n/* 235:395 */ if (paramInt == this.g) {\\r\\n/* 236:396 */ return;\\r\\n/* 237: */ }\\r\\n/* 238:398 */ int j = paramInt - this.g;\\r\\n/* 239: */ \\r\\n/* 240:400 */ ArrayList<qw> localArrayList = Lists.newArrayList(this.c);\\r\\n/* 241:401 */ for (qw localqw : localArrayList)\\r\\n/* 242: */ {\\r\\n/* 243:402 */ int k = (int)localqw.xPos >> 4;\\r\\n/* 244:403 */ int m = (int)localqw.zPos >> 4;\\r\\n/* 245: */ int n;\\r\\n/* 246: */ int i1;\\r\\n/* 247:405 */ if (j > 0) {\\r\\n/* 248:406 */ for (n = k - paramInt; n <= k + paramInt; n++) {\\r\\n/* 249:407 */ for (i1 = m - paramInt; i1 <= m + paramInt; i1++)\\r\\n/* 250: */ {\\r\\n/* 251:408 */ qr localqr = a(n, i1, true);\\r\\n/* 252:410 */ if (!qr.b(localqr).contains(localqw)) {\\r\\n/* 253:411 */ localqr.a(localqw);\\r\\n/* 254: */ }\\r\\n/* 255: */ }\\r\\n/* 256: */ }\\r\\n/* 257: */ } else {\\r\\n/* 258:416 */ for (n = k - this.g; n <= k + this.g; n++) {\\r\\n/* 259:417 */ for (i1 = m - this.g; i1 <= m + this.g; i1++) {\\r\\n/* 260:418 */ if (!a(n, i1, k, m, paramInt)) {\\r\\n/* 261:419 */ a(n, i1, true).b(localqw);\\r\\n/* 262: */ }\\r\\n/* 263: */ }\\r\\n/* 264: */ }\\r\\n/* 265: */ }\\r\\n/* 266: */ }\\r\\n/* 267:426 */ this.g = paramInt;\\r\\n/* 268: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93161b57788577525a4b2fa125b64265\",\n \"score\": \"0.46600524\",\n \"text\": \"private void removeInvalidFromPool()\\r\\n\\t{\\r\\n\\t\\tint i;\\r\\n\\t\\tint size_mature_pool;\\r\\n\\t\\tint idx_to_remove;//index of an chromosome which has to be removed\\r\\n\\t\\tDiffEvolutionError error_cur;//object of the current error\\r\\n\\t\\tdouble[] max_error;\\r\\n\\t\\t\\r\\n\\t\\tsize_mature_pool = _pool_of_bests.size();\\r\\n\\t\\t\\r\\n\\t\\t//if the maturity pool is full and none of the genotypes could be removed above because of module outputs\\r\\n\\t\\t//then remove one of the oldest individuals according to the errors\\r\\n\\t\\tif(_pool_of_bests.size()==_size_pool_of_bests)\\r\\n\\t\\t{\\r\\n\\t\\t\\t//simply take the worst genotype if all have errors below the threshold\\r\\n\\t\\t\\tif(_best_idx_previous!=0)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tidx_to_remove = 0;\\r\\n\\t\\t\\t\\tmax_error = _pool_of_bests.get(idx_to_remove)._error.getAverageError();\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tidx_to_remove = 1;\\r\\n\\t\\t\\t\\tmax_error = _pool_of_bests.get(idx_to_remove)._error.getAverageError();\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tfor(i=0; i<size_mature_pool; i++)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif(i!=_best_idx_previous)//previously found best genotype cannot be removed\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\terror_cur = _pool_of_bests.get(i)._error;\\r\\n\\t\\t\\t\\t\\tif(error_cur.isWorse(max_error)==true)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmax_error = error_cur.getAverageError();\\r\\n\\t\\t\\t\\t\\t\\tidx_to_remove = i;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//check consistency\\r\\n\\t\\t\\tif(idx_to_remove==_best_idx_previous)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tSystem.err.println(\\\"DiffEvolutionMature.findBest: best previous genotype cannot be removed\\\");\\r\\n\\t\\t\\t\\tSystem.exit(1);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse if(idx_to_remove < _best_idx_previous)//correct index of the previous best genotype\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t_best_idx_previous--;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t//everything is fine\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t_pool_of_bests.remove(idx_to_remove);\\r\\n\\t\\t}//is maturity pool full?\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9085c661ea666c2c29ca94a68d3b77d6\",\n \"score\": \"0.46537703\",\n \"text\": \"public static void main(String[] args) {\\n\\t\\tInteger in = 11;\\n\\t\\twhile( in > 1 ) {\\n\\t\\t\\tif( in%2 != 0 && (in >> 1)%2 != 0)\\n\\t\\t\\t\\tSystem.out.println( true );\\n\\t\\t\\tin = in >> 1;\\n\\t\\t}\\n\\t\\t\\n\\t\\t/*\\n\\t\\t * Problem 2: Compute the smallest string possible by removing all instances of any one char\\n\\t\\t * String should be the smallest one possible.\\n\\t\\t */\\n\\t\\tString str = \\\"\\\";\\n\\t\\tHashMap<Character, Integer> map = new HashMap<>();\\n\\t\\tchar maxChar = 'a';\\n\\t\\tint maxCount = 0, newCount = 0;\\n\\t\\tfor( char c : str.toCharArray() ) {\\n\\t\\t\\tif( map.containsKey(c) ) {\\n\\t\\t\\t\\tmap.put(c, map.get(c) + 1 );\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tmap.put(c, 1);\\n\\t\\t\\t}\\n\\t\\t\\tnewCount = map.get(c);\\n\\t\\t\\tif( newCount > maxCount ) {\\n\\t\\t\\t\\tmaxCount = newCount;\\n\\t\\t\\t\\tmaxChar = c;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t/*\\n\\t\\t * Problem 3: Calculate total of substrings of S containing \\n\\t\\t * both Strings A and B \\n\\t\\t */\\n\\t\\t\\n\\t\\tString[] newStr = str.split(\\\"c\\\");\\n\\t\\tString resultStr = \\\"\\\";\\n\\t\\tfor( String tStr : newStr ) {\\n\\t\\t\\tresultStr.concat( tStr );\\n\\t\\t}\\n\\t\\tSystem.out.println( resultStr );\\n\\t\\t\\n\\t\\t\\n\\t\\tString a = \\\"c\\\", b = \\\"\\\", s = \\\"\\\";\\n\\t\\tint totalCount = 0;\\n\\t\\tfor( int i = 0; i < a.length(); i++ ) {\\n\\t\\t\\tfor( int j=i+1; j < b.length(); j++ ) {\\n\\t\\t\\t\\tString newSubStr = s.substring(i, j);\\n\\t\\t\\t\\tif ( newSubStr.contains(a) && newSubStr.contains(b) )\\n\\t\\t\\t\\t\\ttotalCount++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tSystem.out.println(totalCount);\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93a48c6f01e5bcdc5907cc54cae02309\",\n \"score\": \"0.46522623\",\n \"text\": \"static int knapSack(int W, int wt[], int val[], int n) {\\n\\t\\tif(n == 0 || W == 0) {\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\t// If the last element of the weights array is greater than the target weight, then we do not select that Weight\\n\\t\\tif(wt[n-1]>W) {\\n\\t\\t\\treturn knapSack(W,wt,val,n-1);\\n\\t\\t}\\n\\t\\t// Else we select the maximum weight out of the tow condition, whether including it or not including it.\\n\\t\\telse {\\n\\t\\t\\treturn Math.max(val[n-1] + knapSack(W - wt[n-1], wt, val, n - 1) , knapSack(W, wt, val, n-1)); \\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0977d2762139af5a706b0231284b834\",\n \"score\": \"0.46491355\",\n \"text\": \"static void doo(String s, int k){\\n\\n if(!check(s,k)){\\n System.out.print(-1);\\n return;\\n }\\n\\n\\n Set<Character> set = new HashSet<>();\\n set.clear();\\n// aabacbebebe\\n\\n int n=s.length();\\n int i=0;\\n int mx = -1;\\n\\n for(i=0; i<n; i++){\\n int c=0;\\n for (int j=i; j<n; j++) {\\n char ch = s.charAt(j);\\n\\n\\n if(set.size()<k){\\n set.add(ch);\\n }\\n else if(set.size()==k && set.contains(ch)){\\n set.add(ch);\\n }\\n else{\\n j=n;\\n continue;\\n }\\n c++;\\n // System.out.print(ch);\\n mx = Math.max(mx, c);\\n }\\n // System.out.println();\\n\\n set.clear();\\n }\\n\\n System.out.println(mx);\\n\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"facaca0041507b8d47ca992e67f24a44\",\n \"score\": \"0.4644437\",\n \"text\": \"private boolean multSol () {\\n\\t\\tint n = 0;\\n\\t\\tfor (int i = 0; i < 9; i++) {\\n\\t\\t\\tfor (int j = 0; j < 9; j++) {\\n\\t\\t\\t\\tif (srcBoard.getCell(i,j) != null && srcBoard.getCell(i,j).equals(0)) {\\n\\t\\t\\t\\t\\t//if a cell in the original puzzle is empty\\n\\t\\t\\t\\t\\tfor (int k = 1; k < 10; k++) {\\n\\t\\t\\t\\t\\t\\t//loop through all possible numbers for this cell\\n\\t\\t\\t\\t\\t\\tboard.copy(srcBoard);\\n\\t\\t\\t\\t\\t\\tboard.setCell(i,j,k, true);\\n\\t\\t\\t\\t\\t\\tif (!board.contains(i, j, k) && solvable()) {\\n\\t\\t\\t\\t\\t\\t\\t//count all possible solutions for numbers in this cell\\n\\t\\t\\t\\t\\t\\t\\tn++;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif (n > 1) {\\n\\t\\t\\t\\t\\t\\t//if there is more than one possible solution, return true\\n\\t\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tboard.setCell(i,j,0,false);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//if after testing all possible numbers for all empty cells there is not more than one solution, return false\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a7aa11fd89940443138015b0285dcde\",\n \"score\": \"0.46297425\",\n \"text\": \"private int[] checkStraight(Card[] combination) {\\n int[] combo_value = new int[7];\\n boolean s = true; // True if the combination is a straight.\\n // Checks that the next card is the next card in order.\\n for (int i = 0; i < combination.length-1; i++) {\\n if (combination[i].value != combination[i+1].value+1) {\\n s = false;\\n break;\\n }\\n }\\n \\n if (s) {\\n combo_value[0] = straight;\\n combo_value[1] = combination[0].value;\\n combo_value[3] = combination[1].value;\\n combo_value[4] = combination[2].value;\\n combo_value[5] = combination[3].value;\\n combo_value[6] = combination[4].value;\\n }\\n \\n return combo_value;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4087291f4585b8afcb7e88be8b07c4b4\",\n \"score\": \"0.4619857\",\n \"text\": \"public int findChainCombination()\\n {\\n // Get the combinations count\\n int combinationsCount = Core.getInstance().getPreSetCombinations().getChainCombinationsCount();\\n // Don't allow redundant combinations\\n int combinationId;\\n do\\n {\\n // Find a random combination id\\n combinationId = MathUtils.random(0, combinationsCount - 1);\\n } while(combinationId == lastChainCombinationId);\\n // Return the chain combination\\n return (lastChainCombinationId = combinationId);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec57e48c153f6122d1659237b81fe380\",\n \"score\": \"0.46178296\",\n \"text\": \"public static void main(String[] args) throws IOException {\\n\\t\\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\r\\n\\t\\tint N = Integer.parseInt(br.readLine());\\r\\n\\t\\tint[][] arr = new int[N][N];\\r\\n\\t\\tint[][][] chk = new int[N][N][2];\\r\\n\\t\\tStringTokenizer st;\\r\\n\\t\\tfor(int i = 0; i < N; i++)\\r\\n\\t\\t{\\r\\n\\t\\t\\tst = new StringTokenizer(br.readLine());\\r\\n\\t\\t\\tfor(int j = 0; j < N; j++)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tarr[i][j] = Integer.parseInt(st.nextToken());\\r\\n\\t\\t\\t\\tif(i != 0 || j != 0) Arrays.fill(chk[i][j], Integer.MAX_VALUE);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tQueue<Pair> q = new LinkedList<Pair>();\\r\\n\\t\\tq.offer(new Pair(0, 0, 0));\\r\\n\\t\\tint size = 0;\\r\\n\\t\\twhile(!q.isEmpty())\\r\\n\\t\\t{\\r\\n\\t\\t\\tsize = q.size();\\r\\n\\t\\t\\twhile(--size >= 0)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tPair p = q.poll();\\r\\n\\t\\t\\t\\tif(p.x == N - 1 && p.y == N - 1) continue;\\r\\n\\t\\t\\t\\tif(p.y + 1 < N)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tint sub = (arr[p.x][p.y] <= arr[p.x][p.y + 1] ? arr[p.x][p.y + 1] - arr[p.x][p.y] + 1 : 0);\\r\\n\\t\\t\\t\\t\\tif(chk[p.x][p.y+1][1] > chk[p.x][p.y][p.d] + sub)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tchk[p.x][p.y + 1][1] = chk[p.x][p.y][p.d] + sub;\\r\\n\\t\\t\\t\\t\\t\\tq.offer(new Pair(p.x, p.y + 1, 1));\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif(p.x + 1 < N)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tint sub = (arr[p.x][p.y] <= arr[p.x+1][p.y] ? arr[p.x+1][p.y] - arr[p.x][p.y] + 1 : 0);\\r\\n\\t\\t\\t\\t\\tif(chk[p.x+1][p.y][0] > chk[p.x][p.y][p.d] + sub)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tchk[p.x+1][p.y][0] = chk[p.x][p.y][p.d] + sub;\\r\\n\\t\\t\\t\\t\\t\\tq.offer(new Pair(p.x+1, p.y, 0));\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.println(Math.min(chk[N-1][N-1][0], chk[N-1][N-1][1]));\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"846ef5eb95babe331928e360ff565835\",\n \"score\": \"0.46161655\",\n \"text\": \"public void findHandValue(ArrayList<Card[]> combinations) {\\n int[] combo_value;\\n \\n for (Card[] combination : combinations) {\\n int[] f = checkFlush(combination); // Check if it is a flush\\n int[] s = checkStraight(combination); // Check if it is a straight\\n // Check first if it is a royal flush, or a straight flush\\n // If it isn't, then check for the other \\n if (f[0] > 0 && s[0] > 0) {\\n if (s[1] == 14 && f[1] == 14) {\\n combo_value = s;\\n combo_value[0] = royal_flush;\\n } else {\\n combo_value = s;\\n combo_value[0] = straight_flush;\\n }\\n } else {\\n int[] m = checkMatches(combination);\\n if (f[0] > m[0]) {\\n combo_value = f;\\n } else if (s[0] > m[0]) {\\n combo_value = s;\\n } else {\\n combo_value = m;\\n }\\n }\\n \\n \\n // Checks if the combination is the best combination the player has.\\n for (int val = 0; val < hand_value.length; val++) {\\n if (combo_value[val] > hand_value[val]) {\\n hand_value = combo_value;\\n hand_cards = combination;\\n } else if (combo_value[val] != hand_value[val]) {\\n break;\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c0dd4e9d96ef30840da4d6beaf990ef\",\n \"score\": \"0.4613829\",\n \"text\": \"void removeAllBadPairs() {\\n\\t\\tArrayList<String> toBeRemoved = new ArrayList<String>();\\n\\t\\tfor(String pair: listOfPairs) {\\n\\t\\t\\tString fp = pair.split(\\\",\\\")[0];\\n\\t\\t\\tString sp = pair.split(\\\",\\\")[1];\\n\\t\\t\\t// if both have parent, remove the pair\\n\\t\\t\\tif(tree.contains(fp) && tree.getNode(fp).hasParent()) {\\n\\t\\t\\t\\tif(tree.contains(sp) && tree.getNode(sp).hasParent()) {\\n\\t\\t\\t\\t\\ttoBeRemoved.add(pair);\\n\\t\\t\\t\\t\\t//\\tSystem.out.println(\\\"removed \\\"+pair);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tlistOfPairs.removeAll(toBeRemoved);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b9ea58d35cfc7b6e795e7b6cbd8fab6\",\n \"score\": \"0.46133274\",\n \"text\": \"static void displayPathtoPrincess(int q, char[][] grid){\\n Queue<String> ans = new LinkedList<String>();\\n Queue<Integer> x = new LinkedList<Integer>();\\n Queue<Integer> y = new LinkedList<Integer>();\\n if(grid[startx][starty] == 'd') {\\n \\tSystem.out.println(\\\"CLEAN\\\");\\n \\treturn;\\n }\\n boolean[][] visited = new boolean[m][n];\\n visited[startx][starty] = true;\\n x.add(startx);\\n y.add(starty);\\n ans.add(\\\"\\\");\\n while(x.size() != 0) {\\n int xx = x.remove();\\n int yy = y.remove();\\n String tmp = ans.remove();\\n if(grid[xx][yy] == 'd') {\\n System.out.println(tmp.split(\\\"\\\\n\\\")[0]);\\n return;\\n }\\n int[] xxx = {0,1,0,-1};\\n int[] yyy = {1,0,-1,0};\\n Vector<Integer> rand = new Vector<Integer>();\\n HashSet<Integer> set = new HashSet<Integer>();\\n while(rand.size() != 4) {\\n \\tint temp = (int)(Math.random()*4);\\n \\tif(set.add(temp))\\n\\t \\trand.add(temp);\\n }\\n for(Integer r : rand) {\\n \\tint i = (int)r;\\n if(xx+xxx[i] >= 0 && xx+xxx[i] < m && yy+yyy[i] >= 0 && yy+yyy[i] < n)\\n if(!visited[xx+xxx[i]][yy+yyy[i]]) {\\n visited[xx+xxx[i]][yy+yyy[i]] = true;\\n x.add(xx+xxx[i]);\\n y.add(yy+yyy[i]);\\n if(xxx[i] == 0) {\\n if(yyy[i] == 1)\\n ans.add(tmp+\\\"RIGHT\\\\n\\\");\\n if(yyy[i] == -1)\\n ans.add(tmp+\\\"LEFT\\\\n\\\");\\n }\\n if(yyy[i] == 0) {\\n if(xxx[i] == 1)\\n ans.add(tmp+\\\"DOWN\\\\n\\\");\\n if(xxx[i] == -1)\\n ans.add(tmp+\\\"UP\\\\n\\\");\\n }\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ceeddaba736bad7f1a68bc646fc56169\",\n \"score\": \"0.46050575\",\n \"text\": \"void solve(){\\n int t=ii();\\n int a=ii(),b=ii();\\n for(int tc=0;tc<t;tc++)\\n {\\n String s=is();\\n if(s.charAt(0)=='A')\\n {\\n char num=s.charAt(1);\\n int A=0;\\n for(int i=a;i<=b;i++)\\n {\\n char c[]=String.valueOf(i).toCharArray();\\n if(c.length>2)\\n {\\n boolean ans=true;\\n if(c[0]==num)\\n {\\n for(int j=2;j<c.length;j++)\\n if(c[j]!=num)\\n {\\n ans=false;\\n break;\\n }\\n }\\n else if(c[0]!=num || !ans)\\n {\\n ans=false;\\n for(int j=1;j<c.length;j++)\\n if(c[j]!=num)\\n {\\n ans=false;\\n break;\\n }\\n }\\n if(ans)\\n A++;\\n }\\n }\\n out.println(A);\\n }\\n else if(s.charAt(0)=='C')\\n {\\n int num=Integer.parseInt(s.substring(s.length()-1));\\n int rep=Integer.parseInt(s.substring(1, s.length()-1));\\n int v=0;\\n for(int i=a;i<=b;i++)\\n {\\n String km=String.valueOf(i);\\n String pat=String.valueOf(num);\\n for(int ii=0;ii<rep;ii++)\\n pat=pat.concat(pat);\\n if(km.contains(pat))\\n v++;\\n }\\n out.println(v);\\n }\\n else\\n {\\n int count=0;\\n for(int i=0;i<s.length();i++)\\n if(s.charAt(i)=='W')\\n count++;\\n out.println((long)Math.pow(10, count));\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64d7d6473d14ff47ec62fcb39fd9c514\",\n \"score\": \"0.46027413\",\n \"text\": \"public String evaluate(ArrayList<String> myStatements, ArrayList<Wire[]> wireSpots){\\r\\n ArrayList<String> tempList = new ArrayList<String>();\\r\\n for(int i=0;i<myStatements.size();i++){\\r\\n if(myStatements.get(i).equals(\\\"(\\\")){\\r\\n myStatements.remove(i);\\r\\n if(myStatements.get(i-1).equals(\\\"!\\\")||myStatements.get(i-1).equals(\\\"~\\\")){\\r\\n tempList.add(myStatements.get(i-1));\\r\\n myStatements.remove(i-1);\\r\\n i--;\\r\\n }\\r\\n int there = 0;\\r\\n while(!myStatements.get(i).equals(\\\")\\\") || there!=0){\\r\\n if(myStatements.get(i).equals(\\\"(\\\"))\\r\\n there++;\\r\\n if(there!=0&&myStatements.get(i).equals(\\\")\\\"))\\r\\n there--;\\r\\n tempList.add(myStatements.get(i));\\r\\n myStatements.remove(i);\\r\\n }\\r\\n myStatements.remove(i);\\r\\n int currSize=tempList.size();\\r\\n boolean turnary = false;\\r\\n if(i<myStatements.size()){\\r\\n if(myStatements.get(i).equals(\\\"?\\\"))\\r\\n turnary=true;\\r\\n }\\r\\n else{\\r\\n for(int l=0;l<currSize;l++){\\r\\n if(tempList.get(l).equals(\\\">=\\\")||tempList.get(l).equals(\\\"<=\\\")||\\r\\n tempList.get(l).equals(\\\">\\\")||tempList.get(l).equals(\\\"<\\\")||\\r\\n tempList.get(l).equals(\\\"==\\\")||tempList.get(l).equals(\\\"!=\\\"))\\r\\n turnary=true;\\r\\n }\\r\\n }\\r\\n if(turnary){\\r\\n while(!myStatements.get(i).equals(\\\"?\\\"))\\r\\n i++;\\r\\n for(int j=0;j<4;j++){\\r\\n tempList.add(myStatements.get(i));\\r\\n myStatements.remove(i);\\r\\n }\\r\\n }\\r\\n myStatements.add(i,parens(tempList,wireSpots));\\r\\n for(int j=i+1;j<myStatements.size();j++){\\r\\n try{\\r\\n int newNum = Integer.parseInt(myStatements.get(j));\\r\\n newNum = newNum-1;\\r\\n myStatements.remove(j);\\r\\n myStatements.add(j,\\\"\\\"+newNum);\\r\\n }\\r\\n catch(NumberFormatException e){}\\r\\n }\\r\\n tempList.clear();\\r\\n }\\r\\n }\\r\\n for(int i=0;i<myStatements.size();i++){\\r\\n if(myStatements.get(i).equals(\\\"*\\\")){\\r\\n i--;\\r\\n for(int j = 0; j < 3; j++){\\r\\n tempList.add(myStatements.get(i));\\r\\n myStatements.remove(i);\\r\\n }\\r\\n myStatements.add(i,multiplier(tempList,wireSpots));\\r\\n tempList.clear();\\r\\n }\\r\\n }\\r\\n for(int i = 0; i < myStatements.size(); i++){\\r\\n if(myStatements.get(i).equals(\\\"+\\\")){\\r\\n i--;\\r\\n for(int j = 0; j < 3; j++){\\r\\n tempList.add(myStatements.get(i));\\r\\n myStatements.remove(i);\\r\\n }\\r\\n if(i <= myStatements.size()-1){\\r\\n if(myStatements.get(i).equals(\\\"+\\\")){\\r\\n tempList.add(myStatements.get(i));\\r\\n myStatements.remove(i);\\r\\n tempList.add(myStatements.get(i));\\r\\n myStatements.remove(i);\\r\\n }\\r\\n }\\r\\n myStatements.add(i,adder(tempList,wireSpots));\\r\\n tempList.clear();\\r\\n }\\r\\n }\\r\\n for(int i=0;i<myStatements.size();i++){\\r\\n if(myStatements.get(i).equals(\\\"-\\\")){\\r\\n i--;\\r\\n for(int j = 0; j < 3; j++){\\r\\n tempList.add(myStatements.get(i));\\r\\n myStatements.remove(i);\\r\\n }\\r\\n myStatements.add(i,subtractor(tempList,wireSpots));\\r\\n tempList.clear();\\r\\n }\\r\\n }\\r\\n for(int i=0;i<myStatements.size();i++){\\r\\n if(myStatements.get(i).equals(\\\"&\\\")||myStatements.get(i).equals(\\\"&&\\\")){\\r\\n i--;\\r\\n int size=3;\\r\\n if(myStatements.get(i).equals(\\\"~\\\")){\\r\\n size=4;\\r\\n i--;\\r\\n }\\r\\n for(int j=0;j<size;j++){\\r\\n tempList.add(myStatements.get(i));\\r\\n myStatements.remove(i);\\r\\n }\\r\\n if(tempList.size()==3)\\r\\n myStatements.add(i,and(tempList,wireSpots));\\r\\n else if(tempList.size()==4)\\r\\n myStatements.add(i,nand(tempList,wireSpots));\\r\\n for(int j=i+1;j<myStatements.size();j++){\\r\\n try{\\r\\n int newNum = Integer.parseInt(myStatements.get(j));\\r\\n newNum = newNum-1;\\r\\n myStatements.remove(j);\\r\\n myStatements.add(j,\\\"\\\"+newNum);\\r\\n }\\r\\n catch(NumberFormatException e){}\\r\\n }\\r\\n tempList.clear();\\r\\n }\\r\\n }\\r\\n for(int i=0;i<myStatements.size();i++){\\r\\n if(myStatements.get(i).equals(\\\"|\\\")||myStatements.get(i).equals(\\\"||\\\")){\\r\\n i--;\\r\\n int size=3;\\r\\n if(myStatements.get(i).equals(\\\"~\\\")){\\r\\n size=4;\\r\\n i--;\\r\\n }\\r\\n for(int j=0;j<size;j++){\\r\\n tempList.add(myStatements.get(i));\\r\\n myStatements.remove(i);\\r\\n }\\r\\n if(tempList.size()==3)\\r\\n myStatements.add(i,or(tempList,wireSpots));\\r\\n else if(tempList.size()==4)\\r\\n myStatements.add(i,nor(tempList,wireSpots));\\r\\n for(int j=i+1;j<myStatements.size();j++){\\r\\n try{\\r\\n int newNum = Integer.parseInt(myStatements.get(j));\\r\\n newNum = newNum-1;\\r\\n myStatements.remove(j);\\r\\n myStatements.add(j,\\\"\\\"+newNum);\\r\\n }\\r\\n catch(NumberFormatException e){}\\r\\n }\\r\\n tempList.clear();\\r\\n }\\r\\n }\\r\\n for(int i=0;i<myStatements.size();i++){\\r\\n if(myStatements.get(i).equals(\\\"^\\\")){\\r\\n i--;\\r\\n int size=3;\\r\\n if(myStatements.get(i).equals(\\\"~\\\")){\\r\\n size=4;\\r\\n i--;\\r\\n }\\r\\n for(int j=0;j<size;j++){\\r\\n tempList.add(myStatements.get(i));\\r\\n myStatements.remove(i);\\r\\n }\\r\\n if(tempList.size()==3)\\r\\n myStatements.add(i,xor(tempList,wireSpots));\\r\\n else if(tempList.size()==4)\\r\\n myStatements.add(i,xnor(tempList,wireSpots));\\r\\n tempList.clear();\\r\\n }\\r\\n }\\r\\n for(int i=0;i<myStatements.size();i++){\\r\\n if(myStatements.get(i).equals(\\\"{\\\")){\\r\\n myStatements.remove(i);\\r\\n while(!myStatements.get(i).equals(\\\"}\\\")){\\r\\n tempList.add(myStatements.get(i));\\r\\n myStatements.remove(i);\\r\\n }\\r\\n myStatements.remove(i);\\r\\n myStatements.add(i,concatenate(tempList,wireSpots));\\r\\n tempList.clear();\\r\\n }\\r\\n }\\r\\n for(int i=0;i<myStatements.size();i++){\\r\\n if(myStatements.get(i).equals(\\\">\\\")){\\r\\n i--;\\r\\n for(int j=0;j<4;j++){\\r\\n tempList.add(myStatements.get(i));\\r\\n myStatements.remove(i);\\r\\n }\\r\\n myStatements.add(i,bitShiftR(tempList,wireSpots));\\r\\n tempList.clear();\\r\\n }\\r\\n }\\r\\n for(int i=0;i<myStatements.size();i++){\\r\\n if(myStatements.get(i).equals(\\\"<\\\")){\\r\\n i--;\\r\\n for(int j=0;j<4;j++){\\r\\n tempList.add(myStatements.get(i));\\r\\n myStatements.remove(i);\\r\\n }\\r\\n myStatements.add(i,bitShiftL(tempList,wireSpots));\\r\\n tempList.clear();\\r\\n }\\r\\n }\\r\\n for(int i=0;i<myStatements.size();i++){\\r\\n if(myStatements.get(i).equals(\\\"=\\\")){\\r\\n i--;\\r\\n for(int j = 0; j < 3; j++){\\r\\n tempList.add(myStatements.get(i));\\r\\n myStatements.remove(i);\\r\\n }\\r\\n String action = equalSign(tempList,wireSpots);\\r\\n if(action.equals(\\\"0\\\"))\\r\\n return \\\"\\\";\\r\\n else\\r\\n return \\\"\\\"+action;\\r\\n }\\r\\n }\\r\\n return\\\"\\\"+myStatements.get(0);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c20fc96b6e4fc67433638e419c8ebc6a\",\n \"score\": \"0.45986474\",\n \"text\": \"public ArrayList<Integer> checkIfOrderPossible(String color, int order) {\\n ArrayList<Integer> result = new ArrayList<>();\\n if (order <= 0) {\\n System.out.println(\\\"Invalid Input for order\\\");\\n return result;\\n }\\n try {\\n stack = new Stack<>();\\n stackSum = 0;\\n Paint paintRequired = null;\\n int x = 0;\\n for (Paint paint : goods) {\\n\\n if (paint.getColor().equalsIgnoreCase(color)) {\\n paintRequired = paint;\\n break;\\n }\\n x++;\\n }\\n \\n if (paintRequired==null){\\n System.out.print(\\\"Invalid input for color\\\");\\n return result;\\n }\\n \\n // calling helper method to check if target order can be obtained or not\\n subset(paintRequired.getCans(), 0, paintRequired.getCans().size(), order);\\n\\n if (stackSum != order) {\\n System.out.println(\\\"Not possible to fulfill an order of \\\" + order + \\\" liter(s) of \\\" + paintRequired.getColor() + \\\" paint with current inventory.\\\");\\n\\n } else {\\n\\n ArrayList<Integer> removeCans = new ArrayList<>();\\n\\n System.out.print(\\\"Checked out the following cans to fulfill the order of \\\" + order + \\\" liter(s) of \\\" + paintRequired.getColor() + \\\" paint: [\\\");\\n while (!stack.isEmpty()) {\\n int num = stack.pop();\\n removeCans.add(num);\\n System.out.print(num);\\n\\n if (!stack.isEmpty()) {\\n System.out.print(\\\",\\\");\\n\\n }\\n\\n }\\n System.out.println(\\\"]\\\");\\n //Calling remove method to remove checked out paint cans\\n removeFromInventory(x, removeCans);\\n result = removeCans;\\n }\\n\\n } catch (Exception e) {\\n System.err.println(e.getMessage());\\n }\\n return result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b49ae8a147b1f0cd492a0bdb75cc0969\",\n \"score\": \"0.4598453\",\n \"text\": \"int blockPlayerWin() {\\n int equalCount = 0;\\n int emptyI = 0, emptyJ = 0;\\n // fieldSize * 2 for rows and columns , 2 more for diagonals\\n int winCombinationsNumber = fieldSize * 2 + 2;\\n for (int k = 0; k < winCombinationsNumber; k++) {\\n equalCount = 0;\\n for (int i = 0; i < fieldSize; i++)\\n for (int j = 0; j < fieldSize; j++) {\\n if (fieldArray[i][j] == playerMark\\n && (getWinCombination(k, i, j) == BELONGS_TO_WIN_COMBINATION)) {\\n equalCount++; // count number of player marks , that belong to win combination\\n }\\n if ((fieldArray[i][j] == EMPTY_MARK)\\n && (getWinCombination(k, i, j) == BELONGS_TO_WIN_COMBINATION)) {\\n emptyI = i; // coordinates of empty cell , that belongs to win combination\\n emptyJ = j;\\n }\\n\\n if ((fieldArray[i][j] == aIMark)\\n && (getWinCombination(k, i, j) == BELONGS_TO_WIN_COMBINATION)) {\\n j = fieldSize; // already non-win combination\\n i = fieldSize; // check next combination\\n equalCount = 0;\\n }\\n }\\n if (equalCount == (fieldSize - 1)) {\\n return (emptyI * fieldSize + emptyJ); // cell number\\n }\\n }\\n return NOTHING_TO_PREVENT;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de7ab71ec9f43f726f618df54ca9dadf\",\n \"score\": \"0.45881742\",\n \"text\": \"public List<String> removeInvalidParentheses(String s) {\\n int leftUnmatch = 0;\\n int rightUnmatch = 0;\\n for (char c : s.toCharArray()) {\\n if (c == '(') {\\n leftUnmatch++;\\n }\\n else if (c == ')') {\\n if (leftUnmatch == 0) {\\n rightUnmatch++;\\n }\\n else {\\n leftUnmatch--;\\n }\\n }\\n }\\n\\n System.out.println(leftUnmatch + \\\" \\\" + rightUnmatch);\\n List<String> result = new ArrayList<>();\\n dfs(result, s, leftUnmatch, rightUnmatch, 0);\\n return result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d727241da6a0774137e6f2c81c1a3225\",\n \"score\": \"0.4584714\",\n \"text\": \"public void lastlooptest(){\\n if(loopNumber<10) {\\n //remenber which position have been selected and selected it from index of groupChoice\\n String[] keepChoice=new String[3]; // save three wrong choice\\n int selectedUsed = 0; // check keepChoice have been used or not\\n Random random = new Random();\\n int choiceRandom = random.nextInt(4);\\n ButtomCorrectPosition = choiceRandom;\\n String presentCorrectAnswer=Choice.get(loopNumber);\\n if(allChoice.containsKey(Choice.get(loopNumber))){ // check whether map have this key\\n Choice.set(loopNumber,allChoice.get(presentCorrectAnswer)); // delete the index value and add new value to the indexx\\n //Choice[loopNumber]=allChoice.get(presentCorrectAnswer);\\n }\\n String lastChar=presentCorrectAnswer.substring(presentCorrectAnswer.length() - 1);// get the last character\\n char[] last = lastChar.toCharArray();\\n if(lastChar.equals(\\\"1\\\")){\\n for(int i=2;i<5;i++) {\\n if (presentCorrectAnswer.charAt(presentCorrectAnswer.length() - 1) == last[0]) {// delete the last character\\n presentCorrectAnswer = presentCorrectAnswer.substring(0, presentCorrectAnswer.length() - 1);\\n\\n presentCorrectAnswer=presentCorrectAnswer.concat(Integer.toString(i)); //concatenate string\\n if(allChoice.containsKey(presentCorrectAnswer)){\\n keepChoice[i-2]=allChoice.get(presentCorrectAnswer);// save the wronng choice to keepChoice array\\n }\\n }\\n String AgainlastChar=presentCorrectAnswer.substring(presentCorrectAnswer.length() - 1);// get the last character\\n last= AgainlastChar.toCharArray(); //set new last\\n }\\n }else if(lastChar.equals(\\\"2\\\")) {\\n if (presentCorrectAnswer.charAt(presentCorrectAnswer.length() - 1) == last[0]) {// delete the last character\\n presentCorrectAnswer = presentCorrectAnswer.substring(0, presentCorrectAnswer.length() - 1);\\n\\n presentCorrectAnswer = presentCorrectAnswer.concat(\\\"1\\\"); //concatenate string\\n if (allChoice.containsKey(presentCorrectAnswer)) {\\n keepChoice[0] = allChoice.get(presentCorrectAnswer);// save the wronng choice to keepChoice array\\n }\\n String AgainlastChar=presentCorrectAnswer.substring(presentCorrectAnswer.length() - 1);// get the last character\\n last= AgainlastChar.toCharArray(); //set new last\\n }\\n for (int i = 3; i < 5; i++) {\\n if (presentCorrectAnswer.charAt(presentCorrectAnswer.length() - 1) == last[0]) {// delete the last character\\n presentCorrectAnswer = presentCorrectAnswer.substring(0, presentCorrectAnswer.length() - 1);\\n\\n presentCorrectAnswer = presentCorrectAnswer.concat(Integer.toString(i)); //concatenate string\\n if (allChoice.containsKey(presentCorrectAnswer)) {\\n keepChoice[i - 2] = allChoice.get(presentCorrectAnswer);// save the wronng choice to keepChoice array\\n }\\n }\\n String AgainlastChar=presentCorrectAnswer.substring(presentCorrectAnswer.length() - 1);// get the last character\\n last= AgainlastChar.toCharArray(); //set new last\\n }\\n }else if(lastChar.equals(\\\"3\\\")) {\\n if (presentCorrectAnswer.charAt(presentCorrectAnswer.length() - 1) == last[0]) {// delete the last character\\n presentCorrectAnswer = presentCorrectAnswer.substring(0, presentCorrectAnswer.length() - 1);\\n\\n presentCorrectAnswer = presentCorrectAnswer.concat(\\\"4\\\"); //concatenate string\\n if (allChoice.containsKey(presentCorrectAnswer)) {\\n keepChoice[0] = allChoice.get(presentCorrectAnswer);// save the wronng choice to keepChoice array\\n }\\n String AgainlastChar=presentCorrectAnswer.substring(presentCorrectAnswer.length() - 1);// get the last character\\n last= AgainlastChar.toCharArray(); //set new last\\n }\\n for (int i =1; i < 3; i++) {\\n if (presentCorrectAnswer.charAt(presentCorrectAnswer.length() - 1) == last[0]) {// delete the last character\\n presentCorrectAnswer = presentCorrectAnswer.substring(0, presentCorrectAnswer.length() - 1);\\n\\n presentCorrectAnswer = presentCorrectAnswer.concat(Integer.toString(i)); //concatenate string\\n if (allChoice.containsKey(presentCorrectAnswer)) {\\n keepChoice[i] = allChoice.get(presentCorrectAnswer);// save the wronng choice to keepChoice array\\n }\\n }\\n String AgainlastChar=presentCorrectAnswer.substring(presentCorrectAnswer.length() - 1);// get the last character\\n last= AgainlastChar.toCharArray(); //set new last\\n }\\n }else if(lastChar.equals(\\\"4\\\")) {\\n for (int i = 3; i > 0; i--) {\\n if (presentCorrectAnswer.charAt(presentCorrectAnswer.length() - 1) == last[0]) {// delete the last character\\n presentCorrectAnswer = presentCorrectAnswer.substring(0, presentCorrectAnswer.length() - 1);\\n\\n presentCorrectAnswer = presentCorrectAnswer.concat(Integer.toString(i)); //concatenate string\\n if (allChoice.containsKey(presentCorrectAnswer)) {\\n keepChoice[3 - i] = allChoice.get(presentCorrectAnswer);// save the wronng choice to keepChoice array\\n }\\n }\\n String AgainlastChar = presentCorrectAnswer.substring(presentCorrectAnswer.length() - 1);// get the last character\\n last = AgainlastChar.toCharArray(); //set new last\\n }\\n }\\n if (choiceRandom == 0) {\\n bone.setText(Choice.get(loopNumber));\\n //bone.setBackgroundColor(Color.GREEN);\\n } else {\\n bone.setText(keepChoice[selectedUsed]);\\n ++selectedUsed;\\n }\\n if (choiceRandom == 1) {\\n btwo.setText(Choice.get(loopNumber));\\n } else {\\n btwo.setText(keepChoice[selectedUsed]);\\n ++selectedUsed;\\n }\\n if (choiceRandom == 2) {\\n bthree.setText(Choice.get(loopNumber));\\n } else {\\n bthree.setText(keepChoice[selectedUsed]);\\n ++selectedUsed;\\n }\\n if (choiceRandom == 3) {\\n bfour.setText(Choice.get(loopNumber));\\n } else {\\n bfour.setText(keepChoice[selectedUsed]);\\n }\\n play(loopNumber);\\n loopNumber++;\\n }else{\\n Intent intent=new Intent(this,score.class);\\n intent.putExtra(\\\"Testscore\\\",score);\\n intent.putExtra(\\\"cateid\\\",cateid);\\n intent.putExtra(\\\"lessonid\\\", lessonid);\\n startActivity(intent);\\n //Toast.makeText(this,\\\"....Finished....\\\",Toast.LENGTH_LONG).show();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"961cf91f5ace3ae5ccd9babcf8b2af14\",\n \"score\": \"0.45785385\",\n \"text\": \"static void printExceptNumOfMultiplyBy7(int x){\\r\\n for(int i=1; i<x; i++){\\r\\n if(i%7==0)\\r\\n continue;\\r\\n System.out.print(i + \\\" \\\");\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77cf1094bc6f71565f659a4ff3ead1fb\",\n \"score\": \"0.45772496\",\n \"text\": \"public String minRemoveToMakeValidV4(String s) {\\n int left = 0;\\n int right = 0;\\n for (char ch : s.toCharArray()) {\\n if (ch == ')') {\\n right++;\\n }\\n }\\n\\n StringBuilder res = new StringBuilder();\\n for (char ch : s.toCharArray()) {\\n if (ch == '(') {\\n if (left == right) {\\n /**\\n * It means current ch '(' is illegal, because left-bracket counts have matched out.\\n * We need to skip it.\\n */\\n continue;\\n }\\n left++;\\n } else if (ch == ')') {\\n right--;\\n if (left == 0) {\\n /**\\n * It means current ch ')' is illegal, because there is no left-bracket to match with it.\\n * We need to skip it.\\n */\\n continue;\\n }\\n left--;\\n }\\n res.append(ch);\\n }\\n return res.toString();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1e7444871fefcc50941122ae68434e8\",\n \"score\": \"0.45745102\",\n \"text\": \"protected static long getNextCombination(long x) {\\n // Assume in the annotations that x has form x'01^a10^b\\n long u = x & -x; // extract rightmost bit 1; u = 0'00^a10^b\\n long v = u + x; // set last non-trailing bit 0, and clear to the right; v = x'10^a00^b\\n if (v == 0) { // then overflow in v, or x == 0\\n return -1; // signal that next k-combination cannot be represented\\n }\\n x = v + (((v ^ x) / u) >> 2); // v^x = 0'11^a10^b, (v^x)/u = 0'0^b1^{a+2}, and x ← x'100^b1^a\\n return x;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d49e89b01ff93a71c0d24b524b5afbf\",\n \"score\": \"0.4570648\",\n \"text\": \"public int findSimpleCombination()\\n {\\n // Get the combinations count\\n int combinationsCount = Core.getInstance().getPreSetCombinations().getSimpleCombinationsCount();\\n // Don't allow redundant combinations\\n int combinationId;\\n do\\n {\\n // Find a random movement (different from 0 as its the default static movement)\\n combinationId = MathUtils.random(0, combinationsCount - 1);\\n } while(combinationId == lastSimpleCombinationId);\\n // Return the simple combination\\n return (lastSimpleCombinationId = combinationId);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f66fc657c159852c246a8e65727e3f48\",\n \"score\": \"0.45685813\",\n \"text\": \"@Test\\r\\n\\t@SuppressWarnings(\\\"unchecked\\\")\\r\\n\\tpublic void probarCombinacionesDeNumeros() {\\n\\t\\tIterable<Integer> centenas = Resetable2IterableAdapter.createFrom(IntegerRangeIterator.create(0, 2));\\r\\n\\t\\tIterable<Integer> decenas = Resetable2IterableAdapter.createFrom(IntegerRangeIterator.create(0, 2));\\r\\n\\t\\tIterable<Integer> unidades = Resetable2IterableAdapter.createFrom(IntegerRangeIterator.create(0, 2));\\r\\n\\t\\tCombinatorialIterator<Integer> combinations = CombinatorialIterator.<Integer> createFrom(new Iterable[] {\\r\\n\\t\\t\\t\\tcentenas, decenas, unidades });\\r\\n\\t\\tfor (int i = 0; i < 8; i++) {\\r\\n\\t\\t\\tAssert.True(combinations.hasNext());\\r\\n\\t\\t\\tint expectedUnidad = i & 1;\\r\\n\\t\\t\\tint expectedDecena = (i & 2) >> 1;\\r\\n\\t\\t\\tint expectedCentena = (i & 4) >> 2;\\r\\n\\r\\n\\t\\t\\tList<Integer> integers = combinations.next();\\r\\n\\t\\t\\tAssert.equals(expectedCentena, integers.get(0).intValue());\\r\\n\\t\\t\\tAssert.equals(expectedDecena, integers.get(1).intValue());\\r\\n\\t\\t\\tAssert.equals(expectedUnidad, integers.get(2).intValue());\\r\\n\\t\\t}\\r\\n\\t\\tAssert.False(combinations.hasNext());\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab1a732ae3d2fc5e00dbc7d2bdc864be\",\n \"score\": \"0.45676628\",\n \"text\": \"public void removeFailing()\\r\\n\\t{\\n\\t\\tint x = 0;\\r\\n\\t\\twhile (x<student.size())\\r\\n\\t\\t{\\r\\n\\t\\t\\tif((student.get(x)).gpa<2)\\r\\n\\t\\t\\t\\tstudent.remove(x);\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t\\tx++;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"209eb68afffb482d4b28340f9da26ade\",\n \"score\": \"0.45615128\",\n \"text\": \"private static int calculateCouple(int target, int[] values) throws Exception {\\n if(target != values.length) {\\n throw new Exception(\\\"Not match\\\");\\n }\\n int pairs = 0;\\n Set<Integer> sets = new HashSet<>();\\n for (int i : values) {\\n if(!sets.contains(i)) {\\n sets.add(i);\\n }else{\\n sets.remove(i);\\n ++pairs;\\n }\\n }\\n return pairs;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"61762f4cd8bdb8664d0746a3108c38f3\",\n \"score\": \"0.4558154\",\n \"text\": \"public static void Apply_Reduc_Rules(Hashtable<Integer,TreeSet<Integer>>E, TreeSet<Integer> V,TreeSet<Integer>IN,TreeSet<Integer>LN,TreeSet<Integer>BN,TreeSet<Integer>FL,TreeSet<Integer>Free)\\n\\t{\\n\\t\\t{\\n\\t\\t\\tfor(Integer u : FL)\\n\\t\\t\\t{\\n\\t\\t\\t\\tTreeSet<Integer> nei_u = new TreeSet<Integer>(E.get(u));\\n\\t\\t\\t\\tfor(Integer v:E.get(u))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(FL.contains(v))\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t//E.get(u).remove(v);\\n\\t\\t\\t\\t\\t\\t//E.get(v).remove(u);\\n\\t\\t\\t\\t\\t\\tnei_u.remove(v);\\n\\t\\t\\t\\t\\t\\tnei_u.remove(u);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tE.put(u, nei_u);\\n\\t\\t\\t}\\n\\t\\t\\tfor(Integer u : BN)\\n\\t\\t\\t{\\n\\t\\t\\t\\tTreeSet<Integer> nei_u = new TreeSet<Integer>(E.get(u));\\n\\t\\t\\t\\tfor(Integer v:E.get(u))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(BN.contains(v))\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t//E.get(u).remove(v);\\n\\t\\t\\t\\t\\t\\t//E.get(v).remove(u);\\n\\t\\t\\t\\t\\t\\tnei_u.remove(v);\\n\\t\\t\\t\\t\\t\\tnei_u.remove(u);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tE.put(u, nei_u);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//==================== RULE 2 ============\\n\\t\\t{\\n\\t\\t\\tTreeSet<Integer> BN_copy = new TreeSet<Integer>(BN);\\n\\t\\t\\tfor(Integer u : BN)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(get_degree(u,E,V,IN,LN,BN,FL,Free)==0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tLN.add(u);\\n\\t\\t\\t\\t\\tBN_copy.remove(u);\\n\\t\\t\\t\\t\\t//Free.remove(u);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tBN = BN_copy;\\n\\t\\t}\\n\\t\\t//=================== RULE 3 ================\\n\\t\\t{\\n\\t\\t\\tTreeSet<Integer> Free_copy = new TreeSet<Integer>(Free);\\n\\t\\t\\tfor(Integer u : Free)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(get_degree(u,E,V,IN,LN,BN,FL,Free)==1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tFL.add(u);\\n\\t\\t\\t\\t\\t//BN.remove(u);\\n\\t\\t\\t\\t\\tFree_copy.remove(u);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t//Free = Free_copy;\\n\\t\\t\\tFree = new TreeSet<Integer>(Free_copy);\\n\\t\\t}\\n\\t\\t//=================== RULE 4 ================\\n\\t\\t{\\n\\t\\t\\tTreeSet<Integer> temp = new TreeSet<Integer>(Free);\\n\\t\\t\\tTreeSet<Integer> Free_copy = new TreeSet<Integer>(Free);\\n\\t\\t\\ttemp.addAll(FL);\\n\\t\\t\\tfor(Integer u : Free)\\n\\t\\t\\t{\\t//if(!temp.contains(v))\\n\\t\\t\\t\\ttemp.retainAll(E.get(u));\\n\\t\\t\\t\\t//if(temp.equals(new TreeSet<Integer>()))\\n\\t\\t\\t\\tif(temp.size()==0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tFL.add(u);\\n\\t\\t\\t\\t\\tFree_copy.remove(u);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tFree = new TreeSet<Integer>(Free_copy);\\n\\t\\t\\t//Free = Free_copy;\\n\\t\\t}\\n\\t\\t//=================== RULE 5 ================\\n\\t\\t{\\n\\t\\t\\tTreeSet<Integer> Free_copy = new TreeSet<Integer>(Free);\\n\\t\\t\\tfor(Integer x : Free)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(get_degree(x,E,V,IN,LN,BN,FL,Free)==2)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor(Integer y: E.get(x))\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tfor(Integer z: E.get(y))\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tif(E.get(z).contains(x))\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tFL.add(x);\\n\\t\\t\\t\\t\\t\\t\\t\\tFree_copy.remove(x);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tFree = new TreeSet<Integer>(Free_copy);\\n\\t\\t\\t//Free = Free_copy;\\n\\t\\t}\\n\\t\\t//=================== RULE 6 ================\\n\\t\\t{\\n\\t\\t\\tHashtable<Integer,Integer> visited = new Hashtable<Integer,Integer>();\\n\\t\\t\\tTreeSet<Integer> BN_copy = new TreeSet<Integer>(BN);\\n\\t\\t\\tfor(Integer u:BN)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor(Integer v:E.keySet())\\n\\t\\t\\t\\t\\tvisited.put(v, 0);\\n\\t\\t\\t\\tQueue<Integer> s = new LinkedList<Integer>();\\n\\t\\t\\t\\ts.add(E.get(u).first());\\n\\t\\t\\t\\tvisited.put(u, 1);\\n\\t\\t\\t\\tvisited.put(E.get(u).first(),1);\\n\\t\\t\\t\\twhile(s.size()!=0) //?????????????????\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tInteger t = s.poll();\\n\\t\\t\\t\\t\\tvisited.put(t, 1);\\n\\t\\t\\t\\t\\tfor(Integer n:E.get(t))\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif(n!=u && visited.get(n)==0)\\n\\t\\t\\t\\t\\t\\t\\ts.add(n);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(visited.contains(0))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t//u--->IN\\n\\t\\t\\t\\t\\t//IN.add(u);\\n\\t\\t\\t\\t\\t//BN_copy.remove(u);\\n\\t\\t\\t\\t\\tADD(u,BN_copy,IN,E,IN,BN_copy,FL,Free);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tBN = BN_copy;\\n\\t\\t}\\n\\t\\t//=================== RULE 7 ================\\n\\t\\t{\\n\\t\\t\\tTreeSet<Integer> tem = new TreeSet<Integer>(V);\\n\\t\\t\\ttem.removeAll(IN);\\n\\t\\t\\tfor(Integer u : LN)\\n\\t\\t\\t{\\n\\t\\t\\t\\tTreeSet<Integer> nei_u = new TreeSet<Integer>(E.get(u));\\n\\t\\t\\t\\tfor(Integer v:E.get(u))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(tem.contains(v))\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t//E.get(u).remove(v);\\n\\t\\t\\t\\t\\t\\t//E.get(v).remove(u);\\n\\t\\t\\t\\t\\t\\tnei_u.remove(v);\\n\\t\\t\\t\\t\\t\\tnei_u.remove(u);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tE.put(u, nei_u);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ac689893e2f004160378ee212d0d7fe\",\n \"score\": \"0.45557013\",\n \"text\": \"public static boolean isValid(String s) {\\n Boolean pass = false;\\n// if (s.length() == 1 || s.length() == 0){\\n// return \\\"YES\\\";\\n// }\\n\\n //Condition 1: string has 1 lot of each character, e.g map values are all 1\\n\\n //Condition 2: if e.g abccc is entered, remove a c and we get 1a 1b and 2c \\n\\n char[] charArray = s.toCharArray();\\n HashMap<Character, Integer> characterHashSet = new HashMap<>();\\n for (char c : charArray) {\\n Integer frequency = characterHashSet.get(c) != null ? characterHashSet.get(c) + 1 : 1;\\n characterHashSet.put(c, frequency);\\n }\\n\\n //Need to find the different values\\n //We only allow tolerance of +1, if we get > 1 then we fail\\n Integer min = Collections.min(characterHashSet.values());\\n Integer max = Collections.max(characterHashSet.values());\\n\\n Integer maxFreq = Collections.frequency(characterHashSet.values(), max);\\n Integer minFreq = Collections.frequency(characterHashSet.values(), min);\\n\\n Integer amountDiffMax = characterHashSet.size() - maxFreq;\\n Integer amountDiffMin = characterHashSet.size() - minFreq;\\n\\n //There can be only one difference, lets say there are 8 characters\\n //Minimum frequency we should have 7, therefore if we find the difference we should expect 1\\n //as that is the tolerance we allow\\n if (amountDiffMax == 1 || amountDiffMin == 1) {\\n pass = true;\\n\\n //There is just frequency of 1 for max or min\\n //We then have a sub condition where if the min frequency is NOT 1 fre, e.g 1,1,1,5\\n //We then need to calculate the difference due as example has difference of 4\\n //If min frequency is 1, then e.g we have 1,3,3,3\\n //then this is allowed as we are able to remove 1 to make 3,3,3 pass therefore pass this condition\\n if (minFreq != 1){\\n Integer diff = Math.abs(max - min);\\n if (diff > 1) {\\n pass = false;\\n }\\n }\\n } else {\\n //If lets say we have 4,4,4,4,4 then amount diff is 0 and also min max diff is 0\\n\\n //Also if we have 2,2,4,4 then the min max diff will be greater than 1\\n\\n //Second condition, we cant have diff of max - min of 2\\n Integer diff = Math.abs(max - min);\\n if (diff == 0) {\\n pass = true;\\n } else if (diff > 1) {\\n pass = false;\\n }\\n }\\n\\n//\\n\\n return pass;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f16c2fb566ce2caee4f09613a22e5cd\",\n \"score\": \"0.45415443\",\n \"text\": \"private void trimSolution() {\\n if (solution.size() > 4) {\\n int size = solution.size();\\n solution = solution.subList(size - 4, size);\\n } else if (solution.size() < 4) {\\n solution.clear();\\n }\\n System.out.println(Arrays.deepToString(solution.toArray()));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d746e680140357e3e23526ef51bd21b2\",\n \"score\": \"0.45336834\",\n \"text\": \"private String rowConLegalEasy() { \\n String problems = \\\"\\\";\\n int row = 0; //used to count the amount of lines its gone through\\n while(row < rowConstraints.length) {\\n int column = 0; //row constraint position\\n while(column < rowConstraints.length-1) { \\n if(grid[row][column].getSquareValue() != 0 && grid[row][column+1].getSquareValue() > 1 && \\\"<\\\".equals(rowConstraints[row][column].getValue())) { //to check for legal < \\n if(grid[row][column].getSquareValue() >= grid[row][column+1].getSquareValue()) { \\n problems+=\\\"Numbers in row \\\" + (row+1) + \\\" column \\\" + (column+1) + \\\" and column \\\" + (column+2) + \\\" break its row constraint -\\\\n\\\";\\n }\\n }\\n else if(grid[row][column].getSquareValue() > 1 && grid[row][column+1].getSquareValue() != 0 && \\\">\\\".equals(rowConstraints[row][column].getValue())) { //to check for legal > \\n if(grid[row][column].getSquareValue() <= grid[row][column+1].getSquareValue()) { \\n problems+=\\\"Numbers in row \\\" + (row+1) + \\\" column \\\" + (column+1) + \\\" and column \\\" + (column+2) + \\\" break its row constraint -\\\\n\\\";\\n }\\n }\\n if(grid[row][column].getSquareValue() == grid[0].length && grid[row][column+1].getSquareValue() == 0 && \\\"<\\\".equals(rowConstraints[row][column].getValue())) {\\n problems+=\\\"Numbers in row \\\" + (row+1) + \\\" column \\\" + (column+1) + \\\" and column \\\" + (column+2) + \\\" break its row constraint -\\\\n\\\";\\n }\\n else if(grid[row][column+1].getSquareValue() == grid[0].length && grid[row][column].getSquareValue() == 0 && \\\">\\\".equals(rowConstraints[row][column].getValue())) {\\n problems+=\\\"Numbers in row \\\" + (row+1) + \\\" column \\\" + (column+1) + \\\" and column \\\" + (column+2) + \\\" break its row constraint -\\\\n\\\";\\n }\\n else if(grid[row][column].getSquareValue() == 1 && \\\">\\\".equals(rowConstraints[row][column].getValue())) {\\n problems+=\\\"Numbers in row \\\" + (row+1) + \\\" column \\\" + (column+1) + \\\" and column \\\" + (column+2) + \\\" break its row constraint -\\\\n\\\";\\n }\\n else if(grid[row][column+1].getSquareValue() == 1 && \\\"<\\\".equals(rowConstraints[row][column].getValue())) {\\n problems+=\\\"Numbers in row \\\" + (row+1) + \\\" column \\\" + (column+1) + \\\" and column \\\" + (column+2) + \\\" break its row constraint -\\\\n\\\";\\n }\\n column++;\\n }\\n row++;\\n }\\n return problems;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1eed520b5ac9e49b3c8a32d666b980ff\",\n \"score\": \"0.4532535\",\n \"text\": \"public int[] checkUserCombination(int[] userComb, ArrayList<Integer> combination) {\\n int hits = 0;\\n int almostHits = 0;\\n int [] returnResult = new int[2];\\n int[] copyOfUserComb = new int[numberOfColumns];\\n int[] copyOfMainComb = new int[numberOfColumns];\\n for (int i = 0; i < numberOfColumns; i++) {\\n copyOfUserComb[i] = userComb[i];\\n copyOfMainComb[i] = combination.get(i);\\n }\\n for (int i = 0; i < numberOfColumns; i++) {\\n if (copyOfUserComb[i] == copyOfMainComb[i]) {\\n hits++;\\n copyOfUserComb[i] = -1;\\n copyOfMainComb[i] = -2;\\n }\\n }\\n for (int i = 0; i < numberOfColumns; i++) {\\n for (int j = 0; j < numberOfColumns; j++) {\\n if (copyOfUserComb[i] == copyOfMainComb[j] && i != j) {\\n almostHits++;\\n copyOfMainComb[j] = -2;\\n copyOfUserComb[i] = -1;\\n }\\n }\\n }\\n returnResult[0] = hits;\\n returnResult[1] = almostHits;\\n return returnResult;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7b40f9fbacd6cc86e3c2fee31f73d5c\",\n \"score\": \"0.452756\",\n \"text\": \"private void goParen() {\\r\\n\\r\\n while (!theStackP.isEmpty()) {\\r\\n\\r\\n String s = theStackP.pop();\\r\\n if (s.equals(\\\"(\\\"))\\r\\n break;\\r\\n output.add(s);\\r\\n }\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54ede77c4c14200845df43a2a365ac44\",\n \"score\": \"0.45262244\",\n \"text\": \"@Test\\n\\tpublic void checkParanthesisBalance() {\\n\\t\\tint [] arr={2,5,1,8,2,9,1};\\n\\n\\t\\tint maxSum=0;\\n\\t\\tint windowSize=3;\\n\\t\\t//Here subArrays of size are\\n\\t\\t/*{2,5,1} =>8\\n\\t\\t{5,1,8}=>14\\n\\t\\t{1,8,2}=>11\\n\\t\\t{8,2,9}=>19\\n\\t\\t{2,9,1}=>12*/\\n\\t\\tfor(int i=0;i<arr.length-2;i++){\\n\\t\\t\\tint sum=0;\\n\\t\\t\\tfor(int j=i;j<i+windowSize;j++){\\n\\t\\t\\t\\tsum=sum+arr[j];\\n\\t\\t\\t}\\n\\t\\t\\tif(sum>maxSum){\\n\\t\\t\\t\\tmaxSum=sum;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tSystem.out.println(maxSum);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"62272d0f61317f787e755911bac2b964\",\n \"score\": \"0.45252776\",\n \"text\": \"public static int Main()\\n\\t{\\n\\t\\tfor (int a = 1; a < 6; a++)\\n\\t\\t{\\n\\t\\t\\tfor (int b = 1; b < 6; b++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (int c = 1; c < 6; c++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor (int d = 1; d < 6; d++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tfor (int e = 1; e < 6; e++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tif (e != 2 && e != 3 && ((e == 1 && d == 1 && c != 1) + (b == 2) + (a == 5 && e != 1) + (c != 1) + (d == 1 && c != 1) == 2) && (a == 5) && (c == 1) && (a + b + c + d + e) == 15 && a * b * c * d * e == 120)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.print(a);\\n\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.print(\\\" \\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.print(b);\\n\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.print(\\\" \\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.print(c);\\n\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.print(\\\" \\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.print(d);\\n\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.print(\\\" \\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.print(e);\\n\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.print(\\\"\\\\n\\\");\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2533e2de17f44fda6d3e3e8bb9b031a9\",\n \"score\": \"0.45249578\",\n \"text\": \"private static <T> List<List<T>> combination(List<T> values, int size) {\\n\\n if (0 == size) {\\n return Collections.singletonList(Collections.<T>emptyList());\\n }\\n\\n if (values.isEmpty()) {\\n return Collections.emptyList();\\n }\\n\\n List<List<T>> combination = new LinkedList<List<T>>();\\n\\n T actual = values.iterator().next();\\n\\n List<T> subSet = new LinkedList<T>(values);\\n subSet.remove(actual);\\n\\n List<List<T>> subSetCombination = combination(subSet, size - 1);\\n\\n for (List<T> set : subSetCombination) {\\n List<T> newSet = new LinkedList<T>(set);\\n newSet.add(0, actual);\\n combination.add(newSet);\\n }\\n\\n combination.addAll(combination(subSet, size));\\n\\n return combination;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2dd92306d2920b66a58cf2e55f1884ed\",\n \"score\": \"0.4519015\",\n \"text\": \"private boolean r1() // Rule for testing chance for winning\\n {\\n int x ;\\n int y ;\\n int c ;\\n\\n for(int i=0;i < 3;i++)\\t\\t\\t\\n {\\n x = -1 ;\\n y = -1 ;\\n c = 0 ;\\n \\n for(int j=0;j < 3;j++)\\t\\t\\n { \\n if(sq[i][j] == this.compSymbol)\\t\\n {\\n c++ ;\\n }\\n\\t\\t\\t\\telse if(sq[i][j] == -1)\\t\\n {\\n x = i ; \\n y = j ;\\n }\\n }\\n \\n if(x != -1 && y != -1)\\n {\\n if(c==2 && sq[x][y] == -1)\\n {\\n sq[x][y] = this.compSymbol ;\\n this.aa = 1 ;\\n this.bb = 1 ;\\n return true ;\\n }\\n }\\n }\\n\\n //X Axis\\n for(int i=0;i < 3;i++)\\n {\\n x = -1 ;\\n y = -1 ;\\n c = 0 ;\\n \\n for(int j=0;j < 3;j++)\\n {\\n\\t\\t\\t\\tif(sq[j][i] == this.compSymbol)\\n {\\n c++ ;\\n }\\n\\t\\t\\t\\telse if(sq[j][i] == -1)\\t\\n {\\n x = j ;\\n y = i ;\\n }\\n }\\n \\n if(x != -1 && y != -1)\\n {\\n if(c==2 && sq[x][y] == -1)\\n {\\n sq[x][y] = this.compSymbol ;\\n this.aa = 1 ;\\n this.bb = 2 ;\\n return true ;\\n }\\n }\\n }\\n\\n // Diagonal 1\\n x = -1 ;\\n y = -1 ;\\n c = 0 ;\\n \\n for(int i=0;i < 3;i++)\\n {\\n if(sq[i][i] == this.compSymbol)\\n {\\n\\t\\t\\t\\tc++ ;\\n }\\n else if(sq[i][i] == -1)\\t\\n {\\n\\t\\t\\t\\tx = i ;\\n\\t\\t\\t\\ty = i ;\\n }\\n }\\n \\n if(x != -1 && y != -1)\\n {\\n if(c==2 && sq[x][y] == -1)\\n {\\n sq[x][y] = this.compSymbol ;\\n this.aa = 1 ;\\n this.bb = 3 ;\\n return true ;\\n }\\n }\\n\\n // Diagonal 2\\n x = -1 ;\\n y = -1 ;\\n c = 0 ;\\n \\n for(int i=0;i < 3;i++)\\n {\\n if(sq[2-i][i] == this.compSymbol)\\n {\\n\\t\\t\\t\\tc++ ;\\n }\\n else if(sq[2-i][i] == -1)\\n {\\n\\t\\t\\t\\tx = 2 - i ;\\n\\t\\t\\t\\ty = i ;\\n }\\n }\\n \\n if(x != -1 && y != -1)\\n {\\n if(c == 2 && sq[x][y] == -1)\\n {\\n sq[x][y] = this.compSymbol ;\\n this.aa = 1 ;\\n this.bb = 4 ;\\n return true ;\\n }\\n }\\n\\n return false ;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"556ed6283cfe9a234b83badaeb529d72\",\n \"score\": \"0.4514619\",\n \"text\": \"private static int maximum()\\n {\\n int PopulationSize = 0;\\n Chromosome DNA = null;\\n Chromosome thatChromo = null;\\n int winner = 0;\\n boolean foundNewWinner = false;\\n boolean Solution = false;\\n while(!Solution)\\n {\\n foundNewWinner = false;\\n PopulationSize = population.size();\\n for(int i = 0; i < PopulationSize; i++)\\n {\\n if(i != winner){ // Avoid self-comparison.\\n DNA = population.get(i);\\n thatChromo = population.get(winner);\\n if(DNA.conflicts() > thatChromo.conflicts()){\\n winner = i;\\n foundNewWinner = true;\\n }\\n }\\n }\\n if(foundNewWinner == false){\\n Solution = true;\\n }\\n }\\n return winner;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d66371ebdb2bbb4defd4e0c021c705f6\",\n \"score\": \"0.45136055\",\n \"text\": \"private static int generateAllValidPermutations(int[] validTopSort) {\\n\\n\\t\\tint t = n + 1;\\n\\t\\t// create a tXt matrix which marks the constraints. if i,j is a\\n\\t\\t// restriction then i,j and j,i location of the matrix will be 1/true.\\n\\t\\t// for all other locations it will be 0. Also all the items in the last\\n\\t\\t// row will be 1/true\\n\\t\\tint[][] incidenceMatrix = new int[t][t];\\n\\n\\t\\tfor (int i = 0; i < t; i++) {\\n\\t\\t\\tincidenceMatrix[i][t - 1] = 1;\\n\\t\\t}\\n\\t\\t// marking the constraints in the matrix with data from incedenceArray\\n\\t\\tfor (int i = 0; i < restrictions; i++) {\\n\\t\\t\\tint val1 = incedenceArray[i][0];\\n\\t\\t\\tint val2 = incedenceArray[i][1];\\n\\n\\t\\t\\tincidenceMatrix[val1][val2] = 1;\\n\\t\\t\\tincidenceMatrix[val2][val1] = 1;\\n\\t\\t}\\n\\t\\t// creating array arr_p of size t and populating values from 0 to t\\n\\t\\t// creating array arr_loc of size t and populating values from 0 to t\\n\\t\\tint[] arr_p = new int[t];\\n\\t\\tint[] arr_loc = new int[t];\\n\\t\\tfor (int i = 0; i < t; i++) {\\n\\t\\t\\tarr_p[i] = i;\\n\\t\\t\\tarr_loc[i] = i;\\n\\t\\t}\\n\\t\\tint counter = 1;\\n\\t\\t// initialize all the variables\\n\\t\\tint i = 0, var_k = 0, var_k1 = 0, obj_k, obj_k1;\\n\\n\\t\\tif (v == 1) {\\n\\n\\t\\t\\tvisit(validTopSort, arr_p, n);\\n\\n\\t\\t}\\n\\t\\t// Algorithm is explained in detail in the project report. variables are\\n\\t\\t// named with the same names as in the original algorithm\\n\\t\\twhile (i < t - 1) {\\n\\t\\t\\tvar_k = arr_loc[i];\\n\\t\\t\\tvar_k1 = var_k + 1;\\n\\t\\t\\tobj_k = arr_p[var_k];\\n\\t\\t\\tobj_k1 = arr_p[var_k1];\\n\\t\\t\\t// if incidenceMatrix[i][obj_k1] == 1 then this can't be swapped\\n\\t\\t\\tif (incidenceMatrix[i][obj_k1] == 1) {\\n\\t\\t\\t\\t// reversing the array from location k\\n\\t\\t\\t\\tfor (int l = var_k; l >= i + 1; l--)\\t\\n\\t\\t\\t\\t\\tarr_p[l] = arr_p[l - 1];\\n\\t\\t\\t\\tarr_p[i] = obj_k;\\n\\t\\t\\t\\tarr_loc[i] = i;\\n\\t\\t\\t\\ti++;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t// swap arr_p[var_k] and arr_p[var_k1]. add var_k1 to arr_loc[i]\\n\\t\\t\\t\\tarr_p[var_k] = obj_k1;\\n\\t\\t\\t\\tarr_p[var_k1] = obj_k;\\n\\t\\t\\t\\tarr_loc[i] = var_k1;\\n\\t\\t\\t\\t// Visit the permutation and increment the counter\\n\\n\\t\\t\\t\\t// if verbose input==1 then print the permutation\\n\\t\\t\\t\\tif (v == 1) {\\n\\t\\t\\t\\t\\tvisit(validTopSort, arr_p, n);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tcounter++;\\n\\t\\t\\t\\ti = 0;\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn counter;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f6b14dadc992ea3c479e204f1354c2dd\",\n \"score\": \"0.4507802\",\n \"text\": \"public void checkOrderCombination(int pickup_variation, int drop_variation){\\n if(pickup_variation <=1 && drop_variation<=1){\\n System.out.println(\\\" Pickup Variation is: \\\"+pickup_variation+ \\\".Delivery Variation is \\\"+pickup_variation+ \\\" \\\\n\\\\n\\\\ncombine the orders\\\");\\n }else{\\n System.out.println(\\\" Pickup Variation is: \\\"+pickup_variation+ \\\".Delivery Variation is \\\"+pickup_variation+ \\\" \\\\n\\\\n\\\\nOrders cannot be combined\\\"); \\n }\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"22ea99f3f7d31360ce51a371180b63fe\",\n \"score\": \"0.45062014\",\n \"text\": \"private List<Pair<Integer, Point>> getUnStuck( HashMap<Integer, Point> player_pieces, HashMap<Integer, Point> opponent_pieces, boolean isplayer1, List<Integer> player_list, List<Pair<Integer, Point>> possible_moves){\\t\\t\\n\\t\\tSystem.out.println(\\\"get unstuck\\\");\\n\\t\\tpossible_moves = new ArrayList<>();\\n\\t\\tList<Pair<Double, Double>> potential_holes = new ArrayList<>();\\n\\t\\tfor (Map.Entry<Integer, Point> entry : player_pieces.entrySet()){\\n\\t\\t\\tboolean over_line = isplayer1 ? entry.getValue().x < -20 - 1E-7 : entry.getValue().x > 20 + 1E-7 ;\\n\\t\\t\\tif (!over_line && !stuck_pieces.containsKey(entry.getKey())){\\n\\t\\t\\t\\tstuck_pieces.put(entry.getKey(), false);\\n\\t\\t\\t}\\n\\t\\t}\\t\\n\\t\\t\\n\\t\\tfor (Integer stuck_piece : stuck_pieces.keySet()){\\n\\t\\t\\tpotential_holes.addAll(find_hole(opponent_pieces, player_pieces, player_pieces.get(stuck_piece)));\\n\\t\\t}\\n\\t\\tif(potential_holes.size() > 0){\\n\\t\\t\\tdouble closest_dist = Double.MAX_VALUE;\\n\\t\\t\\tPair<Double, Double> closest_hole = new Pair<>(22.0, 22.0);\\n\\t\\t\\tInteger closest_player = -1;\\n\\t\\t\\tHashMap<Integer, Double> side_of_hole = new HashMap<>();\\n\\t\\t\\t// Identify a stuck point that has the minimal distance to a hole\\n\\t\\t\\tfor (Pair<Double, Double> potential_hole : potential_holes){\\n\\t\\t\\t\\tfor (int stuck_player : stuck_pieces.keySet()){\\n\\t\\t\\t\\t\\tPoint stuck_loc = player_pieces.get(stuck_player); \\n\\t\\t\\t\\t\\tdouble dist = 22.0;\\n\\t\\t\\t\\t\\tif(stuck_loc.y > potential_hole.getKey()){\\n\\t\\t\\t\\t\\t\\tdist = Math.sqrt(/*Math.pow(stuck_loc.x - potential_hole.,2) + */Math.pow(stuck_loc.y - potential_hole.getKey(),2)); \\n\\t\\t\\t\\t\\t\\tside_of_hole.put(stuck_player, potential_hole.getKey());\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if(stuck_loc.y < potential_hole.getValue()){\\n\\t\\t\\t\\t\\t\\tdist = Math.sqrt(/*Math.pow(stuck_loc.x - potential_hole.,2) + */Math.pow(stuck_loc.y - potential_hole.getValue(),2)); \\n\\t\\t\\t\\t\\t\\tside_of_hole.put(stuck_player, potential_hole.getValue());\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tdist = Math.sqrt(Math.pow(stuck_loc.y - potential_hole.getKey(),2));\\n\\t\\t\\t\\t\\t\\tside_of_hole.put(stuck_player, potential_hole.getKey());\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (dist < closest_dist){\\n\\t\\t\\t\\t\\t \\tclosest_dist = dist; \\n\\t\\t\\t\\t\\t\\tclosest_player = stuck_player; \\n\\t\\t\\t\\t\\t\\tclosest_hole = potential_hole;\\n\\t\\t\\t\\t\\t}// we have now found our closest y coord to send our stuck player to\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tboolean moved_backwards = stuck_pieces.get(closest_player);\\n\\t\\t\\tif(!moved_backwards){\\n\\t\\t\\t\\tPoint curr_position = new Point(player_pieces.get(closest_player));\\n\\t\\t\\t\\tfor(int i = 0; i < 2; i++){\\n\\t\\t\\t\\t\\tPoint new_position = new Point(curr_position);\\n\\t\\t\\t\\t\\tnew_position.x = isplayer1 ? new_position.x + diameter_piece : new_position.x - diameter_piece;\\n\\t\\t\\t\\t\\tPair<Integer, Point> move = new Pair<Integer, Point>(closest_player, new_position);\\t\\t\\n\\t\\t\\t\\t\\tcurr_position = move.getValue();\\n\\t\\t\\t\\t\\tif(!Board.check_collision(opponent_pieces, move) && !Board.check_collision(player_pieces, move)){\\n\\t\\t\\t\\t\\t\\tpossible_moves.add(move);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(possible_moves.size() >= 2){\\n\\t\\t\\t\\t\\tstuck_pieces.put(closest_player, true);\\t\\t\\n\\t\\t\\t\\t\\treturn possible_moves;\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse{\\t\\t\\t\\n\\t\\t\\t\\tDouble closest_y = side_of_hole.get(closest_player);\\n\\t\\t\\t\\tboolean above = closest_y > closest_hole.getValue();\\n\\t\\t\\t\\tPoint curr_position = new Point(player_pieces.get(closest_player));\\n\\t\\t\\t\\tfor (int i = 0; i < 2; i++){\\n\\t\\t\\t\\t\\tPoint new_position = new Point(curr_position);\\n\\t\\t\\t\\t\\tnew_position.y = above ? new_position.y - diameter_piece : new_position.y + diameter_piece;\\n\\t\\t\\t\\t\\tPair<Integer, Point> move = new Pair<Integer, Point>(closest_player, new_position);\\n\\t\\t\\t\\t\\tif(valid_whitespace(player_pieces, opponent_pieces, move)){\\n\\t\\t\\t\\t\\t\\tpossible_moves.add(move);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tcurr_position = move.getValue();\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Remove players that are at the hole \\n\\t\\t\\t\\tboolean beyond_y = above? player_pieces.get(closest_player).y < closest_y + 1 : player_pieces.get(closest_player).y > closest_y + 1 ;\\n\\t\\t\\t\\tif(beyond_y){\\n\\t\\t\\t\\t\\tstuck_pieces.remove(closest_player);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(possible_moves.size()>=2){\\n\\t\\t\\t\\t\\treturn possible_moves;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\t\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\t// if we can't find a hole (we should use the bouncy strategy from the group we saw in class)\\n\\t\\t\\tSystem.out.println(\\\"we can't find a hole\\\");\\n\\t\\t}\\n\\t\\t// TODO: this check shouldn't be if ran out of moves but should be if can move forward \\n\\t\\tif( possible_moves.size() < 2){\\n\\t\\t\\tstuck_pieces = new HashMap<>();\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":1198,"cells":{"query_id":{"kind":"string","value":"481d167c9c533fc9653f69f53188ee3f"},"query":{"kind":"string","value":"Should be serialized as \"warnings\""},"positive_passages":{"kind":"list like","value":[{"docid":"7ccdd1f19ce55b254fa50083e1e84521","score":"0.7101745","text":"String getWarningsString();","title":""}],"string":"[\n {\n \"docid\": \"7ccdd1f19ce55b254fa50083e1e84521\",\n \"score\": \"0.7101745\",\n \"text\": \"String getWarningsString();\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"15b5bb9a0be549b7b3c8d4017e5f0059","score":"0.70417273","text":"@javax.annotation.Nullable\n @ApiModelProperty(value = \"Contains warnings about possible misuse.\")\n\n public Object getWarnings() {\n return warnings;\n }","title":""},{"docid":"eb87673dd07c7efdb7465347160f119e","score":"0.70034355","text":"public List<String> getWarnings() {\n return warnings;\n }","title":""},{"docid":"25840af1ddc112d8abfc22434058a7ea","score":"0.6908833","text":"public boolean isWarning() {\n\t\t\treturn false;\n\t\t}","title":""},{"docid":"8a6fb4734006b4af9eb5621fad9a4df8","score":"0.68071014","text":"@Override\n\tpublic boolean isWarnEnabled() {\n\t\treturn false;\n\t}","title":""},{"docid":"98224ab50c21d9c98ed60464a5d49ce6","score":"0.67795575","text":"public void warningPermit();","title":""},{"docid":"3aac57256502cc3e69eecaed20256bbf","score":"0.6748846","text":"@Override\n\tpublic void warn(Object message) {\n\n\t}","title":""},{"docid":"381f153febe322f5a316c030be52cae5","score":"0.6745037","text":"@Override\n\tpublic void warn(Marker marker, Object message) {\n\n\t}","title":""},{"docid":"751a0237d965b0c24eb1b0c0f95f488c","score":"0.672164","text":"public static void showWarnings() {\n\t\tenableWarn = true;\n\t}","title":""},{"docid":"5f35dc428d07f972dc6e27aaeedce13b","score":"0.6714355","text":"@Override\n\tpublic void warn(Marker marker, Message msg) {\n\n\t}","title":""},{"docid":"f87e3642758797c95a964d35281f43dc","score":"0.6711647","text":"@Override\n\tpublic void warn(Message msg) {\n\n\t}","title":""},{"docid":"40fbccc7bc1ab8bec08f131d174c9a05","score":"0.6636419","text":"public abstract boolean hasWarning();","title":""},{"docid":"a5a27aea74744158c960b869d7627a80","score":"0.66134554","text":"@Override\n\tpublic void warn(Marker marker, String message) {\n\n\t}","title":""},{"docid":"01f66900feb475108d71cbca24d71104","score":"0.6589249","text":"public static void hideWarnings() {\n\t\tenableWarn = false;\n\t}","title":""},{"docid":"f2f48aeeacc48e13c66b11ea028f660a","score":"0.6587925","text":"public\n ResourceWarning getWarnings() throws ResourceException;","title":""},{"docid":"56b2f24722000aca225163c01589eb63","score":"0.6532344","text":"@Override\r\n public void onStallWarning(StallWarning arg0) {\n\r\n }","title":""},{"docid":"56b2f24722000aca225163c01589eb63","score":"0.6532344","text":"@Override\r\n public void onStallWarning(StallWarning arg0) {\n\r\n }","title":""},{"docid":"b1c9645a69847c3a5c86a23ad2e4b936","score":"0.652952","text":"public boolean hasWarnings() {\n return !warnings.isEmpty();\n }","title":""},{"docid":"4776465052b81d5465da2a330c9d8b7d","score":"0.6513221","text":"public void addWarning(String warning);","title":""},{"docid":"88e2b239a440ccaa2bfb42d704abffc5","score":"0.6510405","text":"boolean hasWarnings();","title":""},{"docid":"743e391f5a307be15979565d25a10ac4","score":"0.64727646","text":"abstract void warn(String warning);","title":""},{"docid":"5f6bc62ef2ee4b51c993510df75b9e6e","score":"0.64662117","text":"@Override\n\tpublic void warn(Marker marker, String message, Object p0) {\n\n\t}","title":""},{"docid":"e271c5cdc28e352a61decdf936e5b181","score":"0.6456232","text":"@Override\n public void onWarning(String debugMessage) {\n }","title":""},{"docid":"582656cb5ccf54b363b18131a784a925","score":"0.6454852","text":"@Override\r\n public void onStallWarning(StallWarning warning) {\n }","title":""},{"docid":"582656cb5ccf54b363b18131a784a925","score":"0.6454852","text":"@Override\r\n public void onStallWarning(StallWarning warning) {\n }","title":""},{"docid":"1ff48881df39ddeba6ede709ed8f5c78","score":"0.6449496","text":"@Nonnull\r\n public Set<Warning> getWarnings() {\r\n return warnings;\r\n }","title":""},{"docid":"0be9c2610e90731f644253adb6c57b93","score":"0.6442734","text":"public List<ReportType> getWarnings() {\n\t\treturn warningList;\n\t}","title":""},{"docid":"5871a374449a86da7950fbaa296427a2","score":"0.64042574","text":"@Override\n\tpublic void warn(Marker marker, String message, Object... params) {\n\n\t}","title":""},{"docid":"96a8e37c0ee520cb92c951362aa3425f","score":"0.63671523","text":"@Override\n\tpublic boolean isWarnEnabled(Marker marker) {\n\t\treturn false;\n\t}","title":""},{"docid":"9ae238101c8749a3b414d3fb22b20786","score":"0.6361804","text":"@Override\n\tpublic void onStallWarning(StallWarning arg0) {\n\t\t\n\t}","title":""},{"docid":"ab804be22b8999b2c05ad623a991b846","score":"0.6360732","text":"@Override\n\t\tpublic void onStallWarning(StallWarning arg0) {\n\t\t\t\n\t\t}","title":""},{"docid":"ab804be22b8999b2c05ad623a991b846","score":"0.6360732","text":"@Override\n\t\tpublic void onStallWarning(StallWarning arg0) {\n\t\t\t\n\t\t}","title":""},{"docid":"71a19a561f0a3da6087f5dc6e1b383fe","score":"0.6343627","text":"public SQLWarning getWarnings() throws SQLException {\n return null;\r\n }","title":""},{"docid":"b61101b619541ddc5bb6c1571f52bd6a","score":"0.63414586","text":"public final String getWarningString() {\n return warningString;\n }","title":""},{"docid":"0fd696f05e272535cbb4ee794ebe2603","score":"0.6319678","text":"@Override\r\n public String getWarningMessageId() {\n return null;\r\n }","title":""},{"docid":"b18c1828997c0c7213a50fa07940d4db","score":"0.63178056","text":"@Override\n\t\t\tpublic void onStallWarning(StallWarning arg0) {\n\n\t\t\t}","title":""},{"docid":"0b1da23c8586f29b0f3777c0476bf834","score":"0.63176996","text":"@Override\n\tpublic void warn(Marker marker, String message, Object p0, Object p1) {\n\n\t}","title":""},{"docid":"097d510148f58477213358a7c0afe6af","score":"0.63113284","text":"@Override\n\tpublic void warn(Marker marker, CharSequence message) {\n\n\t}","title":""},{"docid":"b6aacdf8bfa82c1e8164c652135f8b91","score":"0.63102406","text":"protected Warning() {\n\n }","title":""},{"docid":"386dd28daa54f8a153f6216aa95594a9","score":"0.6309613","text":"@Override\r\n\t\tpublic SQLWarning getWarnings() throws SQLException {\n\t\t\treturn null;\r\n\t\t}","title":""},{"docid":"58adbe73af2614cbc0adf6d13da578fd","score":"0.62959725","text":"@Override\n public final SQLWarning getWarnings() throws SQLException {\n return null;\n }","title":""},{"docid":"7a7508d96163045b1537ece92f4c9b4c","score":"0.628188","text":"int getWarningMode();","title":""},{"docid":"8b035e7c8c19829b283ecdb24fa8afe8","score":"0.6262262","text":"@Override\n\tpublic void warn(Marker marker, String message, Object p0, Object p1, Object p2) {\n\n\t}","title":""},{"docid":"296a6671bfb91f1f667f9d62a31718f7","score":"0.62514913","text":"@Override\n\tpublic void warn(String message, Object... params) {\n\n\t}","title":""},{"docid":"0f09aea6f3818ce3a23cf2c7c00f58fb","score":"0.6224246","text":"protected final void warning(String warning) {\r\n //System.err.format(\"[\" + name + \"] @%4.9f: WARNING: %s\", Harness.getTime().getFracSeconds(), warning);\r\n //System.err.println();\r\n Harness.log(name, \"WARNING: \" + warning);\r\n warningCount++;\r\n }","title":""},{"docid":"030f47a63a03dcd3340dca83316c6278","score":"0.62011254","text":"@Override\n\tpublic void warn(Marker marker, String message, Object p0, Object p1, Object p2, Object p3) {\n\n\t}","title":""},{"docid":"dbdfc1439a8b5c2f28f76635cc404c54","score":"0.61905396","text":"public void onStallWarning(StallWarning arg0) { }","title":""},{"docid":"0489121a40fb503e1099028450249d69","score":"0.61592597","text":"@Override\n public void warning(SAXParseException saxpe) throws SAXException {\n System.out.println(\"Warning reported: \" + saxpe.getMessage());\n }","title":""},{"docid":"38e7dc9bc4444dc52aa7a964c1485048","score":"0.6144201","text":"abstract void logWarn(String warning);","title":""},{"docid":"2af89cd924f8f7447bce9981c3ead655","score":"0.6143078","text":"@Override\n\tpublic void warn(Marker marker, MessageSupplier msgSupplier) {\n\n\t}","title":""},{"docid":"3433acd465277e427223cb859629418b","score":"0.6141656","text":"public void warning(ValidationType type, String validationName, String content);","title":""},{"docid":"d8a16177b0441b091e1330529d50865e","score":"0.6124719","text":"@Override\n\tpublic void warn(Marker marker, Object message, Throwable t) {\n\n\t}","title":""},{"docid":"0ef59840f25afb710d247a3338cfd18f","score":"0.61208075","text":"public void onStallWarning(StallWarning warning) {\n \t\t\t}","title":""},{"docid":"ae1a61cbfc2abe07cc280327e462a5c8","score":"0.61091787","text":"public void publishTiancheWarn(String errorMsg) {\n }","title":""},{"docid":"eaac566ffc994de4b729ced02f341604","score":"0.6083836","text":"public String muestraListaWarnings(){\r\n \tString salida;\r\n \tsalida= \"\\n\";\r\n \tif (warnings.size()==0){\r\n\t \tsalida=salida+\"No hubo warnings\\n\";\r\n\t \treturn salida;\r\n \t}\r\n \telse {\r\n \t\tfor(TWarning warning: warnings) {\r\n \t\t\tsalida += warning + \"\\n\";\r\n \t\t}\r\n \t\treturn salida;\r\n \t}\r\n }","title":""},{"docid":"04d26b687adc2a7964a011ad346c4bb3","score":"0.6082905","text":"public synchronized boolean shouldWarn() {\n return fWarningAll;\n }","title":""},{"docid":"70842f387e90f3ac61c3b42ebe868d14","score":"0.60767597","text":"@Override\n\tpublic void warn(Marker marker, String message, Object p0, Object p1, Object p2, Object p3,\n\t\t\tObject p4, Object p5, Object p6, Object p7, Object p8, Object p9) {\n\n\t}","title":""},{"docid":"11cecef02940eefe70e8529785402e27","score":"0.6049745","text":"boolean isWarnEnabled();","title":""},{"docid":"69133c364f6ddfb963731d3c38c06f88","score":"0.60492945","text":"@Override\n\tpublic void warn(String message, Object p0) {\n\n\t}","title":""},{"docid":"e9290806676b0d7d57435801ea91403a","score":"0.6049163","text":"String getWarna() {\r\n\t\treturn warna;\r\n\t}","title":""},{"docid":"c0d9debb8904ba3f79b8719c002f81f2","score":"0.60375553","text":"@Override\n\tpublic void warn(Marker marker, String message, Object p0, Object p1, Object p2, Object p3,\n\t\t\tObject p4) {\n\n\t}","title":""},{"docid":"97f4c93132cc25767b313c2e848ed9f2","score":"0.6034263","text":"Warnings warn(Database database);","title":""},{"docid":"949e8be8f65e71d6aef0c522fcc20570","score":"0.60198474","text":"@Override\n\tpublic void warn(Marker marker, String message, Object p0, Object p1, Object p2, Object p3,\n\t\t\tObject p4, Object p5, Object p6, Object p7) {\n\n\t}","title":""},{"docid":"3a9fa0faf72f16dfbdd2d44084c21b90","score":"0.60198325","text":"@Override\n\tpublic void warn(Marker marker, String message, Object p0, Object p1, Object p2, Object p3,\n\t\t\tObject p4, Object p5, Object p6, Object p7, Object p8) {\n\n\t}","title":""},{"docid":"3130ed4627b11498fb2080415ddf2e55","score":"0.60056543","text":"public final void setWarn() {\r\n setLevel(org.apache.log4j.Level.WARN);\r\n }","title":""},{"docid":"383439aae402f19ad860c7d832588709","score":"0.6002105","text":"public Warning() {\n this(new ArrayList());\n }","title":""},{"docid":"9834b8aee1d165f2a781d25748f56786","score":"0.5997813","text":"public void printWarnings() {\n final int size = _warnings.size();\n if (size > 0) {\n System.err.println(new ErrorMsg(ErrorMsg.COMPILER_WARNING_KEY));\n for (int i = 0; i < size; i++) {\n System.err.println(\" \" + _warnings.get(i));\n }\n }\n }","title":""},{"docid":"837b6bb315e778ae1285b368391da6b7","score":"0.5983306","text":"public Object getWarningContext() {\n\t\treturn warningContext;\n\t}","title":""},{"docid":"a4d8fa3175d4be0df6034e47e64a5f35","score":"0.59817266","text":"@Override\n\tpublic void warn(String message, Object p0, Object p1) {\n\n\t}","title":""},{"docid":"abd92c330dc8a4db1f8e41b8512aa74a","score":"0.5981541","text":"@Override\n\tpublic void warn(Marker marker, Message msg, Throwable t) {\n\n\t}","title":""},{"docid":"9faecaba9c6557fde7f419f7a6efcdca","score":"0.5971752","text":"abstract void errorLogWarn(String warning);","title":""},{"docid":"6fcc7891a8d7e99abcefe352c4578d06","score":"0.5970895","text":"@Override\n\tpublic void warn(CharSequence message) {\n\n\t}","title":""},{"docid":"32be15ff2964b04c5341d4b9038a1c7d","score":"0.5970089","text":"@Override\n\tpublic void reportErrorWarning(String warningString) {\n\n\t}","title":""},{"docid":"1eedf82c322610e45d7aa704a97b947b","score":"0.5951189","text":"@Override\n\tpublic void warn(String message, Object p0, Object p1, Object p2) {\n\n\t}","title":""},{"docid":"7f40fb86e5cefead22ec9b17c055ce34","score":"0.595085","text":"private void logWarning(String msgText) {\n System.out.println (\"[WARNING] \" + msgText);\n \n }","title":""},{"docid":"c826b20216330628aaacabff51c28504","score":"0.5948119","text":"@Override\n\tpublic void warn(String message, Object p0, Object p1, Object p2, Object p3) {\n\n\t}","title":""},{"docid":"95c3151e1bdc79c59807c06d3cbadfd8","score":"0.5947609","text":"@Override\n\tpublic void warn(Marker marker, Supplier<?> msgSupplier) {\n\n\t}","title":""},{"docid":"7ef38697d8bf4c17c2804c9605b9cc95","score":"0.592719","text":"@Override\n\tpublic void warn(Marker marker, String message, Throwable t) {\n\n\t}","title":""},{"docid":"b2fe082c12df384e1daa08862502f47d","score":"0.5926968","text":"public void warn(String message);","title":""},{"docid":"b2fe082c12df384e1daa08862502f47d","score":"0.5926968","text":"public void warn(String message);","title":""},{"docid":"8332fbf412fff1183fe1b6f1588d8093","score":"0.59250885","text":"@Override\n\tpublic void warn(Marker marker, String message, Object p0, Object p1, Object p2, Object p3,\n\t\t\tObject p4, Object p5) {\n\n\t}","title":""},{"docid":"f3d81adac1e59845930d04af5901bf36","score":"0.5919674","text":"void notifyWarn(MessageSnapshot snapshot);","title":""},{"docid":"8019be0b08ef65d81c3e0d192eb8d3ec","score":"0.5912949","text":"@Override\n\tpublic void warn(Object message, Throwable t) {\n\n\t}","title":""},{"docid":"c256a5e26bf0836966b63cf07c96cc9c","score":"0.5910882","text":"@Override\n\tpublic void warn(Marker marker, String message, Object p0, Object p1, Object p2, Object p3,\n\t\t\tObject p4, Object p5, Object p6) {\n\n\t}","title":""},{"docid":"52a31dbcd99e64103fa327e5c96bd868","score":"0.5907795","text":"abstract void warn(String warning, Exception[] exceptions);","title":""},{"docid":"4d1d78395ec0cdafa73369c414842954","score":"0.58905846","text":"public final void printWarnings() {\n for (ShadowException exception : warningList) LOGGER.warn(exception.getMessage());\n }","title":""},{"docid":"a280726bcd2a1dcb302b441ed3bdf380","score":"0.58887136","text":"@Override\n\tpublic void warn(String message, Object p0, Object p1, Object p2, Object p3, Object p4) {\n\n\t}","title":""},{"docid":"b3980be7a33b869dd5666649fea18d0e","score":"0.5885285","text":"@Override\n public void warning(SAXParseException saxpe) throws SAXException {\n }","title":""},{"docid":"3d2bcbea0dd0e3ac4d0b272e1e854a26","score":"0.5883848","text":"public synchronized boolean getGenericWarningFlag() {\n return fWarningAll;\n }","title":""},{"docid":"9a8c6c770205eb51abcac9ae00ca237c","score":"0.5858131","text":"public void printWarning(){\n if (hasWarning()){\n System.err.println(\"Warning in line \"+filterLineNumber);\n }\n }","title":""},{"docid":"3ccbf8ac95aae612904e50628ea9657a","score":"0.5856882","text":"@Override\r\n public void warning(SAXParseException e) throws SAXException\r\n {\r\n System.out.println(\"Warning: \"); \r\n printInfo(e);\r\n }","title":""},{"docid":"d29fda1099afcde8c5ca103ba99620eb","score":"0.585352","text":"@Override\n\tpublic void warn(Marker marker, CharSequence message, Throwable t) {\n\n\t}","title":""},{"docid":"778ffec14e374d957b95c8999bd0dbc9","score":"0.5850977","text":"public void warning(String msg) {\n log(WARNING, msg);\n }","title":""},{"docid":"b8524f347c413d8588a787b9b1f98170","score":"0.5850844","text":"public SQLWarning getWarnings() throws SQLException\n {\n return m_rs.getWarnings();\n }","title":""},{"docid":"e0cbbb785c11def54ef08f031ec81ea4","score":"0.5850807","text":"void k2h_set_debug_level_warning();","title":""},{"docid":"a1431c53a5c206c9e7acc5fe134ae9b0","score":"0.58502626","text":"public SQLWarning getWarnings() throws SQLException {\n return currentPreparedStatement.getWarnings();\n }","title":""},{"docid":"7bff2742a0be99dbb8f72b19055fc1f4","score":"0.58252984","text":"public boolean logWarnings()\r\n {\r\n return warningLevelHandler.getBoolean();\r\n }","title":""},{"docid":"e01f44640c43d890dfb8ddfbb2c1f65e","score":"0.5820653","text":"public Long getWarn_count() {\n return warn_count;\n }","title":""},{"docid":"cb84d79544448eb3e6598953e171979b","score":"0.58205694","text":"public SQLWarning getWarnings() throws SQLException {\n\n try {\n debugCodeCall(\"getWarnings\");\n checkClosed();\n return null;\n }\n catch (Exception e) {\n throw logAndConvert(e);\n }\n }","title":""},{"docid":"ffc4a9ff11885d38e04accf65e7a9063","score":"0.5812366","text":"@Override\n\tpublic void warn(MessageSupplier msgSupplier) {\n\n\t}","title":""},{"docid":"91b477563621a90de855b80fcef01dbd","score":"0.5795554","text":"public boolean isWarnEnabled()\n/* */ {\n/* 290 */ return getLogger().isWarnEnabled();\n/* */ }","title":""}],"string":"[\n {\n \"docid\": \"15b5bb9a0be549b7b3c8d4017e5f0059\",\n \"score\": \"0.70417273\",\n \"text\": \"@javax.annotation.Nullable\\n @ApiModelProperty(value = \\\"Contains warnings about possible misuse.\\\")\\n\\n public Object getWarnings() {\\n return warnings;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb87673dd07c7efdb7465347160f119e\",\n \"score\": \"0.70034355\",\n \"text\": \"public List<String> getWarnings() {\\n return warnings;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25840af1ddc112d8abfc22434058a7ea\",\n \"score\": \"0.6908833\",\n \"text\": \"public boolean isWarning() {\\n\\t\\t\\treturn false;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a6fb4734006b4af9eb5621fad9a4df8\",\n \"score\": \"0.68071014\",\n \"text\": \"@Override\\n\\tpublic boolean isWarnEnabled() {\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98224ab50c21d9c98ed60464a5d49ce6\",\n \"score\": \"0.67795575\",\n \"text\": \"public void warningPermit();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3aac57256502cc3e69eecaed20256bbf\",\n \"score\": \"0.6748846\",\n \"text\": \"@Override\\n\\tpublic void warn(Object message) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"381f153febe322f5a316c030be52cae5\",\n \"score\": \"0.6745037\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, Object message) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"751a0237d965b0c24eb1b0c0f95f488c\",\n \"score\": \"0.672164\",\n \"text\": \"public static void showWarnings() {\\n\\t\\tenableWarn = true;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f35dc428d07f972dc6e27aaeedce13b\",\n \"score\": \"0.6714355\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, Message msg) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f87e3642758797c95a964d35281f43dc\",\n \"score\": \"0.6711647\",\n \"text\": \"@Override\\n\\tpublic void warn(Message msg) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40fbccc7bc1ab8bec08f131d174c9a05\",\n \"score\": \"0.6636419\",\n \"text\": \"public abstract boolean hasWarning();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5a27aea74744158c960b869d7627a80\",\n \"score\": \"0.66134554\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, String message) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01f66900feb475108d71cbca24d71104\",\n \"score\": \"0.6589249\",\n \"text\": \"public static void hideWarnings() {\\n\\t\\tenableWarn = false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2f48aeeacc48e13c66b11ea028f660a\",\n \"score\": \"0.6587925\",\n \"text\": \"public\\n ResourceWarning getWarnings() throws ResourceException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"56b2f24722000aca225163c01589eb63\",\n \"score\": \"0.6532344\",\n \"text\": \"@Override\\r\\n public void onStallWarning(StallWarning arg0) {\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"56b2f24722000aca225163c01589eb63\",\n \"score\": \"0.6532344\",\n \"text\": \"@Override\\r\\n public void onStallWarning(StallWarning arg0) {\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1c9645a69847c3a5c86a23ad2e4b936\",\n \"score\": \"0.652952\",\n \"text\": \"public boolean hasWarnings() {\\n return !warnings.isEmpty();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4776465052b81d5465da2a330c9d8b7d\",\n \"score\": \"0.6513221\",\n \"text\": \"public void addWarning(String warning);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88e2b239a440ccaa2bfb42d704abffc5\",\n \"score\": \"0.6510405\",\n \"text\": \"boolean hasWarnings();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"743e391f5a307be15979565d25a10ac4\",\n \"score\": \"0.64727646\",\n \"text\": \"abstract void warn(String warning);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f6bc62ef2ee4b51c993510df75b9e6e\",\n \"score\": \"0.64662117\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, String message, Object p0) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e271c5cdc28e352a61decdf936e5b181\",\n \"score\": \"0.6456232\",\n \"text\": \"@Override\\n public void onWarning(String debugMessage) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"582656cb5ccf54b363b18131a784a925\",\n \"score\": \"0.6454852\",\n \"text\": \"@Override\\r\\n public void onStallWarning(StallWarning warning) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"582656cb5ccf54b363b18131a784a925\",\n \"score\": \"0.6454852\",\n \"text\": \"@Override\\r\\n public void onStallWarning(StallWarning warning) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ff48881df39ddeba6ede709ed8f5c78\",\n \"score\": \"0.6449496\",\n \"text\": \"@Nonnull\\r\\n public Set<Warning> getWarnings() {\\r\\n return warnings;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0be9c2610e90731f644253adb6c57b93\",\n \"score\": \"0.6442734\",\n \"text\": \"public List<ReportType> getWarnings() {\\n\\t\\treturn warningList;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5871a374449a86da7950fbaa296427a2\",\n \"score\": \"0.64042574\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, String message, Object... params) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96a8e37c0ee520cb92c951362aa3425f\",\n \"score\": \"0.63671523\",\n \"text\": \"@Override\\n\\tpublic boolean isWarnEnabled(Marker marker) {\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ae238101c8749a3b414d3fb22b20786\",\n \"score\": \"0.6361804\",\n \"text\": \"@Override\\n\\tpublic void onStallWarning(StallWarning arg0) {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab804be22b8999b2c05ad623a991b846\",\n \"score\": \"0.6360732\",\n \"text\": \"@Override\\n\\t\\tpublic void onStallWarning(StallWarning arg0) {\\n\\t\\t\\t\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab804be22b8999b2c05ad623a991b846\",\n \"score\": \"0.6360732\",\n \"text\": \"@Override\\n\\t\\tpublic void onStallWarning(StallWarning arg0) {\\n\\t\\t\\t\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"71a19a561f0a3da6087f5dc6e1b383fe\",\n \"score\": \"0.6343627\",\n \"text\": \"public SQLWarning getWarnings() throws SQLException {\\n return null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b61101b619541ddc5bb6c1571f52bd6a\",\n \"score\": \"0.63414586\",\n \"text\": \"public final String getWarningString() {\\n return warningString;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0fd696f05e272535cbb4ee794ebe2603\",\n \"score\": \"0.6319678\",\n \"text\": \"@Override\\r\\n public String getWarningMessageId() {\\n return null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b18c1828997c0c7213a50fa07940d4db\",\n \"score\": \"0.63178056\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void onStallWarning(StallWarning arg0) {\\n\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b1da23c8586f29b0f3777c0476bf834\",\n \"score\": \"0.63176996\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, String message, Object p0, Object p1) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"097d510148f58477213358a7c0afe6af\",\n \"score\": \"0.63113284\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, CharSequence message) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b6aacdf8bfa82c1e8164c652135f8b91\",\n \"score\": \"0.63102406\",\n \"text\": \"protected Warning() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"386dd28daa54f8a153f6216aa95594a9\",\n \"score\": \"0.6309613\",\n \"text\": \"@Override\\r\\n\\t\\tpublic SQLWarning getWarnings() throws SQLException {\\n\\t\\t\\treturn null;\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58adbe73af2614cbc0adf6d13da578fd\",\n \"score\": \"0.62959725\",\n \"text\": \"@Override\\n public final SQLWarning getWarnings() throws SQLException {\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a7508d96163045b1537ece92f4c9b4c\",\n \"score\": \"0.628188\",\n \"text\": \"int getWarningMode();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b035e7c8c19829b283ecdb24fa8afe8\",\n \"score\": \"0.6262262\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, String message, Object p0, Object p1, Object p2) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"296a6671bfb91f1f667f9d62a31718f7\",\n \"score\": \"0.62514913\",\n \"text\": \"@Override\\n\\tpublic void warn(String message, Object... params) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f09aea6f3818ce3a23cf2c7c00f58fb\",\n \"score\": \"0.6224246\",\n \"text\": \"protected final void warning(String warning) {\\r\\n //System.err.format(\\\"[\\\" + name + \\\"] @%4.9f: WARNING: %s\\\", Harness.getTime().getFracSeconds(), warning);\\r\\n //System.err.println();\\r\\n Harness.log(name, \\\"WARNING: \\\" + warning);\\r\\n warningCount++;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"030f47a63a03dcd3340dca83316c6278\",\n \"score\": \"0.62011254\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, String message, Object p0, Object p1, Object p2, Object p3) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dbdfc1439a8b5c2f28f76635cc404c54\",\n \"score\": \"0.61905396\",\n \"text\": \"public void onStallWarning(StallWarning arg0) { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0489121a40fb503e1099028450249d69\",\n \"score\": \"0.61592597\",\n \"text\": \"@Override\\n public void warning(SAXParseException saxpe) throws SAXException {\\n System.out.println(\\\"Warning reported: \\\" + saxpe.getMessage());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"38e7dc9bc4444dc52aa7a964c1485048\",\n \"score\": \"0.6144201\",\n \"text\": \"abstract void logWarn(String warning);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2af89cd924f8f7447bce9981c3ead655\",\n \"score\": \"0.6143078\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, MessageSupplier msgSupplier) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3433acd465277e427223cb859629418b\",\n \"score\": \"0.6141656\",\n \"text\": \"public void warning(ValidationType type, String validationName, String content);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d8a16177b0441b091e1330529d50865e\",\n \"score\": \"0.6124719\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, Object message, Throwable t) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0ef59840f25afb710d247a3338cfd18f\",\n \"score\": \"0.61208075\",\n \"text\": \"public void onStallWarning(StallWarning warning) {\\n \\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae1a61cbfc2abe07cc280327e462a5c8\",\n \"score\": \"0.61091787\",\n \"text\": \"public void publishTiancheWarn(String errorMsg) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eaac566ffc994de4b729ced02f341604\",\n \"score\": \"0.6083836\",\n \"text\": \"public String muestraListaWarnings(){\\r\\n \\tString salida;\\r\\n \\tsalida= \\\"\\\\n\\\";\\r\\n \\tif (warnings.size()==0){\\r\\n\\t \\tsalida=salida+\\\"No hubo warnings\\\\n\\\";\\r\\n\\t \\treturn salida;\\r\\n \\t}\\r\\n \\telse {\\r\\n \\t\\tfor(TWarning warning: warnings) {\\r\\n \\t\\t\\tsalida += warning + \\\"\\\\n\\\";\\r\\n \\t\\t}\\r\\n \\t\\treturn salida;\\r\\n \\t}\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04d26b687adc2a7964a011ad346c4bb3\",\n \"score\": \"0.6082905\",\n \"text\": \"public synchronized boolean shouldWarn() {\\n return fWarningAll;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70842f387e90f3ac61c3b42ebe868d14\",\n \"score\": \"0.60767597\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, String message, Object p0, Object p1, Object p2, Object p3,\\n\\t\\t\\tObject p4, Object p5, Object p6, Object p7, Object p8, Object p9) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11cecef02940eefe70e8529785402e27\",\n \"score\": \"0.6049745\",\n \"text\": \"boolean isWarnEnabled();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69133c364f6ddfb963731d3c38c06f88\",\n \"score\": \"0.60492945\",\n \"text\": \"@Override\\n\\tpublic void warn(String message, Object p0) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9290806676b0d7d57435801ea91403a\",\n \"score\": \"0.6049163\",\n \"text\": \"String getWarna() {\\r\\n\\t\\treturn warna;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0d9debb8904ba3f79b8719c002f81f2\",\n \"score\": \"0.60375553\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, String message, Object p0, Object p1, Object p2, Object p3,\\n\\t\\t\\tObject p4) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"97f4c93132cc25767b313c2e848ed9f2\",\n \"score\": \"0.6034263\",\n \"text\": \"Warnings warn(Database database);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"949e8be8f65e71d6aef0c522fcc20570\",\n \"score\": \"0.60198474\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, String message, Object p0, Object p1, Object p2, Object p3,\\n\\t\\t\\tObject p4, Object p5, Object p6, Object p7) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a9fa0faf72f16dfbdd2d44084c21b90\",\n \"score\": \"0.60198325\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, String message, Object p0, Object p1, Object p2, Object p3,\\n\\t\\t\\tObject p4, Object p5, Object p6, Object p7, Object p8) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3130ed4627b11498fb2080415ddf2e55\",\n \"score\": \"0.60056543\",\n \"text\": \"public final void setWarn() {\\r\\n setLevel(org.apache.log4j.Level.WARN);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"383439aae402f19ad860c7d832588709\",\n \"score\": \"0.6002105\",\n \"text\": \"public Warning() {\\n this(new ArrayList());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9834b8aee1d165f2a781d25748f56786\",\n \"score\": \"0.5997813\",\n \"text\": \"public void printWarnings() {\\n final int size = _warnings.size();\\n if (size > 0) {\\n System.err.println(new ErrorMsg(ErrorMsg.COMPILER_WARNING_KEY));\\n for (int i = 0; i < size; i++) {\\n System.err.println(\\\" \\\" + _warnings.get(i));\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"837b6bb315e778ae1285b368391da6b7\",\n \"score\": \"0.5983306\",\n \"text\": \"public Object getWarningContext() {\\n\\t\\treturn warningContext;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d8fa3175d4be0df6034e47e64a5f35\",\n \"score\": \"0.59817266\",\n \"text\": \"@Override\\n\\tpublic void warn(String message, Object p0, Object p1) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"abd92c330dc8a4db1f8e41b8512aa74a\",\n \"score\": \"0.5981541\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, Message msg, Throwable t) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9faecaba9c6557fde7f419f7a6efcdca\",\n \"score\": \"0.5971752\",\n \"text\": \"abstract void errorLogWarn(String warning);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6fcc7891a8d7e99abcefe352c4578d06\",\n \"score\": \"0.5970895\",\n \"text\": \"@Override\\n\\tpublic void warn(CharSequence message) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32be15ff2964b04c5341d4b9038a1c7d\",\n \"score\": \"0.5970089\",\n \"text\": \"@Override\\n\\tpublic void reportErrorWarning(String warningString) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1eedf82c322610e45d7aa704a97b947b\",\n \"score\": \"0.5951189\",\n \"text\": \"@Override\\n\\tpublic void warn(String message, Object p0, Object p1, Object p2) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f40fb86e5cefead22ec9b17c055ce34\",\n \"score\": \"0.595085\",\n \"text\": \"private void logWarning(String msgText) {\\n System.out.println (\\\"[WARNING] \\\" + msgText);\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c826b20216330628aaacabff51c28504\",\n \"score\": \"0.5948119\",\n \"text\": \"@Override\\n\\tpublic void warn(String message, Object p0, Object p1, Object p2, Object p3) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95c3151e1bdc79c59807c06d3cbadfd8\",\n \"score\": \"0.5947609\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, Supplier<?> msgSupplier) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ef38697d8bf4c17c2804c9605b9cc95\",\n \"score\": \"0.592719\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, String message, Throwable t) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2fe082c12df384e1daa08862502f47d\",\n \"score\": \"0.5926968\",\n \"text\": \"public void warn(String message);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2fe082c12df384e1daa08862502f47d\",\n \"score\": \"0.5926968\",\n \"text\": \"public void warn(String message);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8332fbf412fff1183fe1b6f1588d8093\",\n \"score\": \"0.59250885\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, String message, Object p0, Object p1, Object p2, Object p3,\\n\\t\\t\\tObject p4, Object p5) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3d81adac1e59845930d04af5901bf36\",\n \"score\": \"0.5919674\",\n \"text\": \"void notifyWarn(MessageSnapshot snapshot);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8019be0b08ef65d81c3e0d192eb8d3ec\",\n \"score\": \"0.5912949\",\n \"text\": \"@Override\\n\\tpublic void warn(Object message, Throwable t) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c256a5e26bf0836966b63cf07c96cc9c\",\n \"score\": \"0.5910882\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, String message, Object p0, Object p1, Object p2, Object p3,\\n\\t\\t\\tObject p4, Object p5, Object p6) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52a31dbcd99e64103fa327e5c96bd868\",\n \"score\": \"0.5907795\",\n \"text\": \"abstract void warn(String warning, Exception[] exceptions);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d1d78395ec0cdafa73369c414842954\",\n \"score\": \"0.58905846\",\n \"text\": \"public final void printWarnings() {\\n for (ShadowException exception : warningList) LOGGER.warn(exception.getMessage());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a280726bcd2a1dcb302b441ed3bdf380\",\n \"score\": \"0.58887136\",\n \"text\": \"@Override\\n\\tpublic void warn(String message, Object p0, Object p1, Object p2, Object p3, Object p4) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b3980be7a33b869dd5666649fea18d0e\",\n \"score\": \"0.5885285\",\n \"text\": \"@Override\\n public void warning(SAXParseException saxpe) throws SAXException {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d2bcbea0dd0e3ac4d0b272e1e854a26\",\n \"score\": \"0.5883848\",\n \"text\": \"public synchronized boolean getGenericWarningFlag() {\\n return fWarningAll;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a8c6c770205eb51abcac9ae00ca237c\",\n \"score\": \"0.5858131\",\n \"text\": \"public void printWarning(){\\n if (hasWarning()){\\n System.err.println(\\\"Warning in line \\\"+filterLineNumber);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ccbf8ac95aae612904e50628ea9657a\",\n \"score\": \"0.5856882\",\n \"text\": \"@Override\\r\\n public void warning(SAXParseException e) throws SAXException\\r\\n {\\r\\n System.out.println(\\\"Warning: \\\"); \\r\\n printInfo(e);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d29fda1099afcde8c5ca103ba99620eb\",\n \"score\": \"0.585352\",\n \"text\": \"@Override\\n\\tpublic void warn(Marker marker, CharSequence message, Throwable t) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"778ffec14e374d957b95c8999bd0dbc9\",\n \"score\": \"0.5850977\",\n \"text\": \"public void warning(String msg) {\\n log(WARNING, msg);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8524f347c413d8588a787b9b1f98170\",\n \"score\": \"0.5850844\",\n \"text\": \"public SQLWarning getWarnings() throws SQLException\\n {\\n return m_rs.getWarnings();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0cbbb785c11def54ef08f031ec81ea4\",\n \"score\": \"0.5850807\",\n \"text\": \"void k2h_set_debug_level_warning();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1431c53a5c206c9e7acc5fe134ae9b0\",\n \"score\": \"0.58502626\",\n \"text\": \"public SQLWarning getWarnings() throws SQLException {\\n return currentPreparedStatement.getWarnings();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7bff2742a0be99dbb8f72b19055fc1f4\",\n \"score\": \"0.58252984\",\n \"text\": \"public boolean logWarnings()\\r\\n {\\r\\n return warningLevelHandler.getBoolean();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e01f44640c43d890dfb8ddfbb2c1f65e\",\n \"score\": \"0.5820653\",\n \"text\": \"public Long getWarn_count() {\\n return warn_count;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb84d79544448eb3e6598953e171979b\",\n \"score\": \"0.58205694\",\n \"text\": \"public SQLWarning getWarnings() throws SQLException {\\n\\n try {\\n debugCodeCall(\\\"getWarnings\\\");\\n checkClosed();\\n return null;\\n }\\n catch (Exception e) {\\n throw logAndConvert(e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ffc4a9ff11885d38e04accf65e7a9063\",\n \"score\": \"0.5812366\",\n \"text\": \"@Override\\n\\tpublic void warn(MessageSupplier msgSupplier) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91b477563621a90de855b80fcef01dbd\",\n \"score\": \"0.5795554\",\n \"text\": \"public boolean isWarnEnabled()\\n/* */ {\\n/* 290 */ return getLogger().isWarnEnabled();\\n/* */ }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":1199,"cells":{"query_id":{"kind":"string","value":"21377f446d35c4a026e15d36b8a8745c"},"query":{"kind":"string","value":"recogemos los parametros necesarios"},"positive_passages":{"kind":"list like","value":[{"docid":"e4e6ef164b511981ad3c1601b56ca4f9","score":"0.0","text":"public String borrarVenta(){\n FacesContext facesContext = FacesContext.getCurrentInstance();\r\n HttpSession session = (HttpSession) facesContext.getExternalContext().getSession(false);\r\n String idVenta = (String) facesContext.getExternalContext().getRequestParameterMap().get(\"idVentaABorrar\");\r\n Venta venta=ventaFacade.find((Integer)Integer.parseInt(idVenta));\r\n if (!venta.isCobrado()||!venta.isEnviado()||!venta.isPagado()||!venta.isRecibido()){\r\n FacesMessage message = new FacesMessage(FacesMessage.SEVERITY_INFO,ResourcesUtil.getString(\"app.MensajeNoBorradaVenta\"),\"\");\r\n FacesContext.getCurrentInstance().addMessage(null, message);\r\n return \"index.xhtml?faces-redirect=true\"; \r\n }else{\r\n \r\n \r\n productoFacade.remove(venta.getProductoIdproducto());\r\n FacesMessage message = new FacesMessage(FacesMessage.SEVERITY_INFO,\"Borrada Venta,\",\"\");\r\n FacesContext.getCurrentInstance().addMessage(null, message);\r\n return \"index.xhtml?faces-redirect=true\"; \r\n }\r\n \r\n }","title":""}],"string":"[\n {\n \"docid\": \"e4e6ef164b511981ad3c1601b56ca4f9\",\n \"score\": \"0.0\",\n \"text\": \"public String borrarVenta(){\\n FacesContext facesContext = FacesContext.getCurrentInstance();\\r\\n HttpSession session = (HttpSession) facesContext.getExternalContext().getSession(false);\\r\\n String idVenta = (String) facesContext.getExternalContext().getRequestParameterMap().get(\\\"idVentaABorrar\\\");\\r\\n Venta venta=ventaFacade.find((Integer)Integer.parseInt(idVenta));\\r\\n if (!venta.isCobrado()||!venta.isEnviado()||!venta.isPagado()||!venta.isRecibido()){\\r\\n FacesMessage message = new FacesMessage(FacesMessage.SEVERITY_INFO,ResourcesUtil.getString(\\\"app.MensajeNoBorradaVenta\\\"),\\\"\\\");\\r\\n FacesContext.getCurrentInstance().addMessage(null, message);\\r\\n return \\\"index.xhtml?faces-redirect=true\\\"; \\r\\n }else{\\r\\n \\r\\n \\r\\n productoFacade.remove(venta.getProductoIdproducto());\\r\\n FacesMessage message = new FacesMessage(FacesMessage.SEVERITY_INFO,\\\"Borrada Venta,\\\",\\\"\\\");\\r\\n FacesContext.getCurrentInstance().addMessage(null, message);\\r\\n return \\\"index.xhtml?faces-redirect=true\\\"; \\r\\n }\\r\\n \\r\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"25b01e1b9000cd5a750b185847405d80","score":"0.66812414","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n // jika id kosong maka simpan, jika id ada nilainya maka ubah\n params.put(\"idl\", id_lahan);\n return params;\n }","title":""},{"docid":"1ca77b09e8fbb0082f000ae98606af81","score":"0.66633195","text":"public abstract String getParams();","title":""},{"docid":"440f20ba2613ae583213c45763971c20","score":"0.66355264","text":"Map<String, List<String>> parameters();","title":""},{"docid":"cc74bd39705366e6f2221321ccc8e0f0","score":"0.65785486","text":"@Override\r\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\r\n params.put(\"id_marca\",String.valueOf(id_marca));\r\n return params;\r\n }","title":""},{"docid":"3cf31e41113ad78493217a826b0e8b50","score":"0.657519","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n params.put(\"Rango\", Rango);\n params.put(\"Sexo\", Sexo);\n params.put(\"idCliente\", idCliente);\n\n\n\n return params;\n }","title":""},{"docid":"0db1edf5715f6dc37d94ad773595b77b","score":"0.6537585","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n params.put(\"nominal\", nominal);\n params.put(\"nomor\", nomor);\n\n return params;\n }","title":""},{"docid":"e28b3617c10d42e4ffa1b98b96034373","score":"0.65217626","text":"Parametro createParametro();","title":""},{"docid":"c18b75322e56e5f0ccb12fa02946e08c","score":"0.6510214","text":"@Override\r\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\r\n\r\n // Adding All values to Params.\r\n // The firs argument should be same sa your MySQL database table columns.\r\n params.put(\"name\", NameHolder);\r\n params.put(\"uid\", UidHolder);\r\n params.put(\"password\", PasswordHolder);\r\n params.put(\"gender\", GenderHolder);\r\n params.put(\"email\", EmailHolder);\r\n params.put(\"department\", DepartmentHolder);\r\n\r\n return params;\r\n }","title":""},{"docid":"d7be7138335a101b09bb5e2b45d48fcb","score":"0.64774597","text":"public ParametroPorParametro() {\r\n\t}","title":""},{"docid":"8551aed46b70fc66998f01073f97aa69","score":"0.6438514","text":"@Override\n protected Map<String, String> getParams() throws AuthFailureError {\n\n Map<String, String> parametros = new Hashtable<String, String>();\n parametros.put(\"usuario\", usuario.getUsuario());\n parametros.put(\"usuarioDestino\", \"TODOS\");\n\n return parametros;\n }","title":""},{"docid":"0d507def6af69aa0a6f1c83f5728e9b2","score":"0.64270383","text":"Map<String, Object> getParameters();","title":""},{"docid":"f52a8e857bdc345c33d9625066fe1096","score":"0.6413558","text":"@Override\n protected Map<String, String> getParams() throws AuthFailureError {\n Map<String, String> parameters = new HashMap<String, String>();\n parameters.put(\"id_usuario\",user);\n //parameters.put(\"idP\", productos[0]);\n parameters.put(\"idP\",idProducto);\n //parameters.put(\"precio\", productos[2]);\n parameters.put(\"precio\", precioProducto);\n parameters.put(\"cantidad\", cant.getText().toString());\n parameters.put(\"modopago\", modoP);\n parameters.put(\"deudor\", deudo.getText().toString());\n //parameters.put(\"fecha\", date);\n return parameters;\n }","title":""},{"docid":"4d2b3795422d4227a5ff82a675a5eb6c","score":"0.63961005","text":"@Override\r\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\r\n\r\n\r\n\r\n // Adding All values to Params.\r\n // The firs argument should be same sa your MySQL database table columns.\r\n params.put(\"enrolment_no\", enrolment_no.getText().toString());\r\n params.put(\"password\", password.getText().toString());\r\n\r\n return params;\r\n }","title":""},{"docid":"41660a3ff3bc27b7ea4f8dd6a2a83cd4","score":"0.63909376","text":"Object[] getParameters();","title":""},{"docid":"927a62121cb942cb30c0b5121ef0bb21","score":"0.6382999","text":"@Override\n protected Map<String, String> getParams() throws AuthFailureError {\n Map<String, String> parametros = new HashMap<String, String>();\n parametros.put(\"nrocuentaorigen\", cOrigen);\n parametros.put(\"nrocuentadestino\", cDestino);\n parametros.put(\"valor\", cvalor);\n return parametros;\n }","title":""},{"docid":"029089c4ba0c5b72637b120e87a04045","score":"0.6379632","text":"private void setParametersToQuery(StringBuilder str,Map<String,Object> parametros,YoutubePlaylist filtro){\n\t\tif(isNotNull(filtro)){\n\t\t\tLong id=filtro.getId();\n\t\t\tNegocio negocio=filtro.getNegocio();\n\t\t\tLong idNeg=(negocio!=null)?negocio.getId():null;\n\t\t\tString nombre=filtro.getNombre();\n\t\t\tif(isNotNull(id)){\n\t\t\t\tagregarCondicion(str, \" p.id=:id \", CondicionLogica.AND);\n\t\t\t\tparametros.put(\"id\",id);\n\t\t\t}else{\n\t\t\t\tif(isValid(nombre)){\n\t\t\t\t\tagregarCondicion(str, \" p.nombre = :nombre \", CondicionLogica.AND);\n\t\t\t\t\tparametros.put(\"nombre\",nombre);\n\t\t\t\t}\n\t\t\t\tif(isNotNull(idNeg)){\n\t\t\t\t\tagregarCondicion(str, \" p.negocio.id = :idNeg \", CondicionLogica.AND);\n\t\t\t\t\tparametros.put(\"idNeg\",idNeg);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"bc7bb5f6d9580101806cdc1e23ca0047","score":"0.636183","text":"@Override\r\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\r\n params.put(\"nomor_bmn\", nomorbmn);\r\n\r\n return params;\r\n }","title":""},{"docid":"5fb8ed82bc9c98e2cc660e1b89f3a6e5","score":"0.6338157","text":"@Override\n protected Map<String,String> getParams(){\n\n Map<String,String> params = new HashMap<String, String>();\n\n params.put(\"docno\", repl);\n params.put(\"name\",Name.getText().toString());\n params.put(\"pass\",spinner2.getSelectedItem().toString());\n params.put(\"id\",ID.getText().toString());\n\n //Convert\n /*String YEAR = DOB.getText().toString().substring(0,4);\n String MONTH = DOB.getText().toString().substring(4,6);\n String DAY = DOB.getText().toString().substring(6,8);\n\n String dob = YEAR + \"-\" + MONTH + \"-\" + DAY;*/\n //System.out.println(\"DATE : \" + YEAR + \"-\" + MONTH + \"-\" + DAY);\n\n params.put(\"dob\", DOB.getText().toString());\n params.put(\"gender\", Gender.getText().toString());\n params.put(\"nationality\", Nationality.getText().toString());\n params.put(\"add\", Address.getText().toString());\n params.put(\"add2\", Address2.getText().toString());\n params.put(\"add3\", Address3.getText().toString());\n params.put(\"postcode\", Postcode.getText().toString());\n params.put(\"city\", City.getText().toString());\n params.put(\"state\", State.getText().toString());\n\n //FP1 = bytesToHexString(thumbprint1);\n // FP2 = bytesToHexString(thumbprint2);\n // params.put(\"fp1\", FP1);\n // params.put(\"fp2\", FP2);\n\n\n return params;\n }","title":""},{"docid":"775039b6387f81fb8110cb243232c709","score":"0.63288337","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n\n\n return params;\n }","title":""},{"docid":"775039b6387f81fb8110cb243232c709","score":"0.63288337","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n\n\n return params;\n }","title":""},{"docid":"e672fcd853de6bcc472cc2dbab0e246a","score":"0.6314709","text":"@Override\n protected Map<String, String> getParams() {\n\n\n\n Map<String, String> params = new HashMap<String, String>();\n //params.put(\"doctor_user_name\", signUpUserNameText);\n params.put(\"key\", Glob.Key);\n params.put(\"doctor_id\", myid);\n params.put(\"claimed_id\", climId);\n\n return params;\n }","title":""},{"docid":"63a962f2c8d01adbfee430ee5c8b1cea","score":"0.6312357","text":"@Override\n protected Map<String, String> getParams() {\n\n Map<String, String> params = new HashMap<String, String>();\n //Toast.makeText(FindDoctor.this, \"speciality_id in service\"+speciality_id, Toast.LENGTH_SHORT).show();\n params.put(\"key\", Glob.Key);\n params.put(\"doctor_id\", docId);\n params.put(\"uniqueId\", uniqueId);\n\n return params;\n }","title":""},{"docid":"fafeb86c5aba2b323cfb7c35cb677383","score":"0.6299847","text":"@Override\n protected Map<String, String> getParams() {\n\n Map<String, String> params = new HashMap<String, String>();\n //Toast.makeText(FindDoctor.this, \"speciality_id in service\"+speciality_id, Toast.LENGTH_SHORT).show();\n params.put(\"key\", Glob.Key);\n params.put(\"doctor_id\", docId);\n\n return params;\n }","title":""},{"docid":"d3c6ba8a2edc361b913e1cf00d844d8d","score":"0.62934333","text":"@Override\n\tprotected void prepare()\n\t{\n\t\tProcessInfoParameter[] para = getParameter();\n\t\tfor (ProcessInfoParameter element : para) {\n\t\t\tString name = element.getParameterName();\n\t\t\tif (element.getParameter() == null && element.getParameter_To() == null)\n\t\t\t\t;\n\t\t\telse if (name.equals(\"AD_Client_ID\"))\n\t\t\t\tp_client_id = element.getParameterAsInt();\n\t\t\telse if (name.equals(\"C_Order_ID\"))\n\t\t\t\tp_order_id = element.getParameterAsInt();\n\t\t\telse\n\t\t\t\tlog.log(Level.SEVERE, \"Unknown Parameter: \" + name);\n\t\t}\n\t}","title":""},{"docid":"a10f4c568ba2dffecc0c1d22a32d0742","score":"0.6282963","text":"@Override\r\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\r\n for (int i = 0; i < _e_no.size(); i++) {\r\n params.put(\"quiz_id\", _quiz_id);\r\n params.put(\"name[\" + i + \"]\", _name.get(i));\r\n params.put(\"e_no[\" + i + \"]\", _e_no.get(i));\r\n params.put(\"marks[\" + i + \"]\", _marks.get(i));\r\n }\r\n return params;\r\n }","title":""},{"docid":"77187cb00cbc09b962767e7e0168825c","score":"0.6279143","text":"@Override\n protected Map<String, String> getParams() throws AuthFailureError {\n\n Map<String, String> parametros = new Hashtable<String, String>();\n parametros.put(\"usuario\", usuario.getUsuario());\n parametros.put(\"usuarioDestino\", \"TODOS\");\n parametros.put(\"mensaje\", etTexto.getText().toString());\n\n return parametros;\n }","title":""},{"docid":"bd112a0a27bdf6fac131406a4149124e","score":"0.62762207","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n params.put(\"userID\", String.valueOf(userID));\n params.put(\"music\", music);\n params.put(\"food\", food);\n params.put(\"festival\", festival);\n params.put(\"social\", social);\n params.put(\"sports\", sports);\n params.put(\"party\", party);\n\n\n return params;\n }","title":""},{"docid":"183bc25582c49d4048dfd91d347c7bb4","score":"0.6263155","text":"@Override\r\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\r\n return params;\r\n }","title":""},{"docid":"6893c71bfb684a203da53fbe5929c25b","score":"0.6257797","text":"public void generateParameters() {\n\t\tparameters.add(shift.getDate());\n\t\tparameters.add(\"\" + shift.getTime());\n\t\tparameters.add(shift.getLocation());\n\t\tparameters.add(shift.getAbsentTeacherName());\n\t\tparameters.add(sub.getFirstName() + \" \" + sub.getLastName());\n\t\tgenerateEmailNotification();\n\t\tparameters.add(emailText);\n\t}","title":""},{"docid":"07359bc1f0fda01145a72e917149d10a","score":"0.62505347","text":"Map<String, String[]> getParamValues();","title":""},{"docid":"880d4bf3a4f281790bda252822651847","score":"0.62484735","text":"private SetParametersRequest(){}","title":""},{"docid":"3fc023f6e42e21940e2d4010ee77b587","score":"0.6247019","text":"public abstract String[] getParameterNames();","title":""},{"docid":"0bf080718ff161fc915b05f7000ddcd8","score":"0.624564","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n\n params.put(\"kdcust\", kdcustx);\n params.put(\"kdbrg\", kdbrg);\n params.put(\"satuan\", spin_satuan.getSelectedItem().toString());\n params.put(\"hrg\", harga.toString());\n params.put(\"hrgincppn\", hargaincppn.toString());\n params.put(\"diskon1\", disc1.toString());\n params.put(\"diskon2\", disc2.toString());\n params.put(\"diskon3\", disc3.toString());\n\n return params;\n }","title":""},{"docid":"68177a894dcf452a0e93bfbc9f77e963","score":"0.6243766","text":"@Override\n protected Map<String, String> getParams() {\n\n\n\n Map<String, String> params = new HashMap<String, String>();\n //params.put(\"doctor_user_name\", signUpUserNameText);\n params.put(\"key\", Glob.Key);\n\n return params;\n }","title":""},{"docid":"061b2329e4f1b0410e6e005f729f8293","score":"0.62386453","text":"@Override\n public void asignaParametros() {\n String sUsuario = request.getParameter(\"usuario\")!=null?request.getParameter(\"usuario\"):\"\";\n String sPass = request.getParameter(\"pass\")!=null?request.getParameter(\"pass\"):\"\";\n \n Usuario usuario = new Usuario(sUsuario, sPass);\n sesion.setUsuario(usuario);\n }","title":""},{"docid":"7a90c7eb601a08cc32d0bb5b622cfc5f","score":"0.6232835","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n\n params.put(\"kdcust\", kdcustx);\n params.put(\"kdbrg\", edt_kdbrg.getText().toString());\n params.put(\"satuan\", spin_satuan.getSelectedItem().toString());\n params.put(\"hrg\", harga.toString());\n params.put(\"hrgincppn\", hargaincppn.toString());\n params.put(\"diskon1\", disc1.toString());\n params.put(\"diskon2\", disc2.toString());\n params.put(\"diskon3\", disc3.toString());\n\n return params;\n }","title":""},{"docid":"f0c308e60bf13e2061c0ac97a5901013","score":"0.6226837","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n params.put(\"name\", name);\n params.put(\"age\", age);\n params.put(\"gender\", gender);\n if (image != null) {\n params.put(\"image\", image);\n }\n return params;\n }","title":""},{"docid":"06c09dc3d70f16c86fe7a2324a7255e6","score":"0.62220097","text":"@Override\n protected Map<String,String> getParams(){\n\n Map<String,String> params = new HashMap<String, String>();\n\n params.put(\"docty\", spinner.getSelectedItem().toString());\n params.put(\"docno\", ID.getText().toString());\n params.put(\"operator\",spinner2.getSelectedItem().toString());\n params.put(\"phoneNo\",PhoneNo.getText().toString());\n params.put(\"serialno\", SerialNo.getText().toString());\n params.put(\"puk1\",PUK1.getText().toString());\n params.put(\"puk2\", PUK2.getText().toString());\n\n\n return params;\n }","title":""},{"docid":"a69573e38aa8b1934fae173c54a7396e","score":"0.6205053","text":"protected void validateIdRepartoOrdenes(java.lang.String[] param){\r\n \r\n }","title":""},{"docid":"fb38e2bfc6544e859a21d736231330f7","score":"0.6196452","text":"public abstract String[] getParameterValues(String name);","title":""},{"docid":"553bf6d7a75396c424899638615ee429","score":"0.6185645","text":"private static String montaParametres(HashMap<String, String> params) throws UnsupportedEncodingException {\n StringBuilder result = new StringBuilder();\n boolean first = true;\n for(Map.Entry<String, String> entry : params.entrySet()){\n if (first) { first = false;} else {result.append(\"&\");}\n result.append(URLEncoder.encode(entry.getKey(), \"UTF-8\"));\n result.append(\"=\");\n result.append(URLEncoder.encode(entry.getValue(), \"UTF-8\"));\n }return result.toString();\n }","title":""},{"docid":"7d376230db11b75c908d71e361dd843d","score":"0.61805886","text":"@Override\r\n protected Map<String, String>getParams() {\n Map<String, String> params = new HashMap<String, String>();\r\n params.put(\"Full_Name\",Full_Name);\r\n params.put(\"Mobile_Number\",Mobile_Number);\r\n params.put(\"DOB\",DOB);\r\n params.put(\"Email\",Email);\r\n params.put(\"Qualification\",Qualification);\r\n params.put(\"Address\",Address);\r\n params.put(\"Blood_Group\",Blood_Group);\r\n params.put(\"Password\", Password);\r\n\r\n return params;\r\n }","title":""},{"docid":"524edd2c9f901cccb770a04bc36d417b","score":"0.61768425","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n params.put(\"MitarbeiterID\", name);\n params.put(\"password\", pw);\n\n return params;\n }","title":""},{"docid":"5645b4633f9a2db6f090f6ef2cc7afb5","score":"0.617004","text":"Map<String, String> getParam();","title":""},{"docid":"267ef392424f366b2406cd18ff396554","score":"0.6164376","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n params.put(\"fullname\", fullname);\n params.put(\"username\", username);\n params.put(\"emailId\", emailId);\n params.put(\"password\", password);\n params.put(\"courseInterest\", courseInterest);\n params.put(\"undergradGpa\", undergradGpa);\n params.put(\"greQuant\", greQuant);\n params.put(\"greVerbal\", greVerbal);\n params.put(\"greAWA\", greAWA);\n params.put(\"engScore\", engScore);\n params.put(\"workExp\", workExp);\n\n return params;\n }","title":""},{"docid":"346c116794ca6a887eeeabc47a681319","score":"0.61592346","text":"@Override\n\tpublic String[] getParams() {\n\t\tVector<String> s = new Vector<String>();\n\t\ts.add(\"name\");\n\t\ts.add(\"plural\");\n\t\ts.add(\"numerusGenus\");\n\t\ts.add(\"id\");\n\t\treturn s.toArray(new String[0]);\n\t}","title":""},{"docid":"8b1109ae93fa10b675810abe6ffa3e5c","score":"0.6144321","text":"@Override\n public void setParams()\n {\n\n }","title":""},{"docid":"099e034550790c989127bc83a58f9153","score":"0.6141572","text":"@Override\n protected Map<String, String> getParams()\n {\n return params;\n }","title":""},{"docid":"ea5662e602b0ace3a0707a73d43adbe7","score":"0.6117019","text":"@Override\n protected Map<String, String> getParams() {\n\n\n\n Map<String, String> params = new HashMap<String, String>();\n //params.put(\"doctor_user_name\", signUpUserNameText);\n params.put(\"key\", Glob.Key);\n params.put(\"doctor_id\", toReportID);\n params.put(\"user_id\", reporterID);\n params.put(\"report\", reportText);\n\n return params;\n }","title":""},{"docid":"99d4adb04200defe35e663db6d1c2902","score":"0.61138415","text":"public String getParameter();","title":""},{"docid":"3aeef8d4de882d4921aa69015f0d7ebe","score":"0.60980415","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n return params;\n }","title":""},{"docid":"dde601606989c724fa2c8bacdcf6510e","score":"0.6097558","text":"private String[] getAntecedentParameters(){\n\t\tString[] param = new String[1];\n\t\tparam[0] = antecedentParameters.getText().trim();\n\t\treturn param;\n\t}","title":""},{"docid":"d2a46a3bdf1f449656accf5e59741366","score":"0.60877806","text":"@Parameters\n public static Collection<Object[]> getParameters() {\n final Collection<Object[]> parameters = new ArrayList<Object[]>(10);\n parameters.add(new String[] {\"Alice\", \"secret\"});\n parameters.add(new String[] {\"Bob\", \"s&e+c`ret\"});\n parameters.add(new String[] {\"user\", \"\\u20ac\\u20ac\"});\n return parameters;\n }","title":""},{"docid":"bb13858e343e917ab56797524bc142bd","score":"0.6082097","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n params.put(\"first_name\", first_name);\n params.put(\"last_name\", last_name);\n params.put(\"sex\", sex);\n params.put(\"email\", email);\n params.put(\"telephone\", telephone);\n params.put(\"category\", category);\n params.put(\"password\", password);\n\n return params;\n }","title":""},{"docid":"f99fb0ec0368b6ddb6290c59b3e30c75","score":"0.608077","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n params.put(\"imgurl\", imgurl);\n params.put(\"uname\", uname);\n params.put(\"status\", status);\n params.put(\"uid\", uid);\n params.put(\"ureport\", ureport);\n\n return params;\n }","title":""},{"docid":"c1aa0d788ef04151f531395d587946c3","score":"0.6075087","text":"private void initParameters() {\n\t\tString parameterOperation = getParameter(PARAMETER_OPERATION);\n\t\tif (parameterOperation != null) {\n\t\t\toperation = Operation.valueOf(parameterOperation);\n\t\t}\n\n\t\tString parameterToken = getParameter(PARAMETER_TOKEN);\n\t\tif (parameterToken != null) {\n\t\t\ttokenType = SignatureTokenType.valueOf(parameterToken);\n\t\t}\n\n\t\tif (operation == null) {\n\t\t\tthrow new RuntimeException(\"Unable to retrieve '\" + PARAMETER_OPERATION + \"' parameter (\" + parameterOperation + \")\");\n\t\t}\n\n\t\tif (tokenType == null) {\n\t\t\tthrow new RuntimeException(\"Unable to retrieve '\" + PARAMETER_TOKEN + \"' parameter (\" + parameterToken + \")\");\n\t\t}\n\n\t\tif (Operation.sign_digest.equals(operation)) {\n\t\t\tString parameterDigest = getParameter(PARAMETER_DIGEST_TO_SIGN);\n\t\t\tif (parameterDigest != null) {\n\t\t\t\ttoBeSigned = new ToBeSigned(DatatypeConverter.parseBase64Binary(parameterDigest));\n\t\t\t}\n\n\t\t\tString parameterAlgo = getParameter(PARAMETER_DIGET_ALGORITHM);\n\t\t\tif (parameterAlgo != null) {\n\t\t\t\tdigestAlgorithm = DigestAlgorithm.valueOf(parameterAlgo);\n\t\t\t}\n\n\t\t\tbase64Certificate = getParameter(PARAMETER_BASE64_CERTIFICATE);\n\t\t}\n\n\t\tif (SignatureTokenType.PKCS11.equals(tokenType)) {\n\t\t\tpkcs11LibPath = getParameter(PARAMETER_PKCS11_PATH);\n\t\t\tpkcs11Pwd = getParameter(PARAMETER_PKCS11_PWD).toCharArray();\n\t\t}\n\t}","title":""},{"docid":"4b40749beb3ea9b5950d83a6d6ec8987","score":"0.6064441","text":"@Override\n\tprotected void prepare() {\n\t\tProcessInfoParameter[] para = getParameter();\n\t\tfor (ProcessInfoParameter element : para) {\n\t\t\tString name = element.getParameterName();\n\t\t\tif (element.getParameter() == null)\n\t\t\t\t;\n\t\t\telse if (name.equals(\"AD_Client_ID\"))\n\t\t\t\tm_AD_Client_ID = ((BigDecimal) element.getParameter())\n\t\t\t\t\t\t.intValue();\n\t\t\telse if (name.equals(\"DeleteOldImported\"))\n\t\t\t\tm_deleteOldImported = \"Y\".equals(element.getParameter());\n\t\t\telse if (name.equals(\"M_PriceList_Version_ID\"))\n\t\t\t\tp_M_PriceList_Version_ID = element.getParameterAsInt();\n\t\t\telse\n\t\t\t\tlog.log(Level.SEVERE, \"Unknown Parameter: \" + name);\n\t\t}\n\t\tif (m_DateValue == null)\n\t\t\tm_DateValue = new Timestamp(System.currentTimeMillis());\n\t}","title":""},{"docid":"d34b6c868d414ccb8ce5bad4372afbd5","score":"0.6061306","text":"public void setP_parametros(java.lang.String param){\r\n localP_parametrosTracker = true;\r\n \r\n this.localP_parametros=param;\r\n \r\n\r\n }","title":""},{"docid":"d34b6c868d414ccb8ce5bad4372afbd5","score":"0.6061306","text":"public void setP_parametros(java.lang.String param){\r\n localP_parametrosTracker = true;\r\n \r\n this.localP_parametros=param;\r\n \r\n\r\n }","title":""},{"docid":"955fcc73b5df47db443833025cb59553","score":"0.60466045","text":"@Override\n protected Map<String, String> getParams() throws AuthFailureError {\n if (!bitmap.equals(\"\")){\n image = getStringImage(bitmap);\n\n }\n\n\n\n\n\n\n //Getting Image Name\n\n\n Map<String,String> params = new Hashtable<String, String>();\n\n //Adding parameters\n params.put(KEY_IMAGE, image);\n params.put(KEY_NOM, nom);\n params.put(KEY_PRENOM, prenom);\n params.put(KEY_TEL, numtel);\n params.put(KEY_MAIL, mail);\n params.put(KEY_IDCLASSE, classe.getIdClasse()+\"\");\n\n\n //Creating parameters\n\n //returning parameters\n return params;\n }","title":""},{"docid":"380590a715a04b0d0d2072c2aa1bfabb","score":"0.6040724","text":"@Override\n protected Map<String, String> getParams() throws AuthFailureError {\n Map<String, String> params = new HashMap<String, String>();\n params.put(\"userId\", SharedPrefManager.getInstance(context).getUser().getId());\n params.put(\"workbenchId\", listOfBookingInfomation.get(position).getWorkbenchId());\n params.put(\"DateandTimeStart\",listOfBookingInfomation.get(position).getDateandTimeStart());\n params.put(\"Status\",listOfBookingInfomation.get(position).getStatus());\n \n\n return params;\n }","title":""},{"docid":"5c1bffe077e6667cc4ef033bcfb96de7","score":"0.60406584","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n params.put(\"idPrestasi\", idx);\n\n return params;\n }","title":""},{"docid":"5c1bffe077e6667cc4ef033bcfb96de7","score":"0.60406584","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n params.put(\"idPrestasi\", idx);\n\n return params;\n }","title":""},{"docid":"384304c49351ed8583bef9adb1079865","score":"0.6028118","text":"public abstract String getParameter(String name);","title":""},{"docid":"b772f7597e754d342de25cebd1709c8c","score":"0.60167724","text":"protected void prepare()\n\t{\n\t\tProcessInfoParameter[] para = getParameter();\n\t\tfor (int i = 0; i < para.length; i++)\n\t\t{\n\t\t\tString name = para[i].getParameterName();\n\t\t\tif (para[i].getParameter() == null)\n\t\t\t\t;\n\t\t\telse if (name.equals(\"'PONum\"))\n\t\t\t\tp_Ponum = (String)para[i].getParameter();\t\t\t\t\n\t\t\telse if (name.equals(\"MovementDate\")) {\n\t\t\t\tp_MovementDatefrom = (Timestamp)para[i].getParameter();\n\t\t\t\tp_MovementDateto = (Timestamp)para[i].getParameter_To();\t\t\t\n\t\t\t} \n\t\t\telse if (name.equals(\"M_Product_Categoty_ID\"))\n\t\t\t\tp_M_Product_Categoty_ID = ((BigDecimal)para[i].getParameter()).intValue();\n\t\t\telse if (name.equals(\"M_Product_ID\"))\n\t\t\t\tp_M_Product_ID = ((BigDecimal)para[i].getParameter()).intValue();\n\t\t\telse if (name.equals(\"SalesRep_ID\"))\n\t\t\t\tp_SalesRep_ID = ((BigDecimal)para[i].getParameter()).intValue();\n\t//\t\telse\n\t//\t\t\tlog.log(Level.SEVERE, \"Unknown Parameter: \" + name);\n\t\t}\n\t\tif (p_MovementDatefrom == null)\n\t\t\tp_MovementDatefrom = new Timestamp (System.currentTimeMillis());\n\t\tif (p_MovementDateto == null) \n\t\t\tp_MovementDateto = new Timestamp (System.currentTimeMillis());\n\t System.out.println(\" date :\" + p_MovementDatefrom + p_MovementDateto);\n\t}","title":""},{"docid":"6e98cc7cabd49b9c327893a5b4a17e96","score":"0.6012104","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n\n // Adding All values to Params.\n params.put(\"first_name\", FirstNameHolder);\n params.put(\"Mobile_no\", MobileNoHolder);\n params.put(\"email\", EmailHolder);\n\n return params;\n }","title":""},{"docid":"5e416fd968f3520b56f2ff5b1e9e70c3","score":"0.6008649","text":"public String getParameterFromP();","title":""},{"docid":"8385b397baa5f8e297e1c6d258491e2b","score":"0.5999497","text":"protected void validateInfoRepartoOrdenes(RepartoOrdenesDTO[] param){\r\n \r\n }","title":""},{"docid":"228505346d4306cde0f2815344bd13ab","score":"0.59972686","text":"public interface ParamsConstants {\n final static String PAGE_PARAMS_OFFSET = \"offset\";\n final static String PAGE_PARAMS_LENGTH = \"length\";\n final static String PAGE_PARAMS_ORDER_DESC = \"orderDesc\";\n final static String PAGE_PARAMS_EQUALPARAMS = \"equalParams\";\n final static String PAGE_PARAMS_LIKEPARAMS = \"likePrams\";\n final static String PAGE_DATA_COUNT = \"dataCount\";\n\n final static String PARAM_NAME = \"name\";\n final static String PARAM_TYPE = \"type\";\n final static String PARAM_PASSWORD = \"password\";\n\n final static String PARAM_MONGO_FILE_NAME = \"filename\";\n final static String PARAM_MONGO_ARTICLE_INFORMATION_ID = \"informationId\";\n\n final static String PARAM_ID = \"id\";\n final static String PARAM_UUID = \"uuid\";\n final static String PARAM_PICTURE = \"picture\";\n\n final static String PARAM_USER_NAME = \"name\";\n final static String PARAM_USER_USERNAME = \"userName\";\n final static String PARAM_USER_PASSWORD = \"password\";\n\n final static String PARAM_KTV_NAME = \"name\";\n final static String PARAM_KTV_ADDRESS = \"address\";\n final static String PARAM_KTV_ID = \"ktvId\";\n final static String PARAM_KTV_DISTRICT_ID = \"districtId\";\n\n final static String PARAM_INFORMATION_TITLE = \"title\";\n final static String PARAM_INFORMATION_ID = \"informationId\";\n\n final static String PARAM_COMMENT_COMMENT = \"comment\";\n final static String PARAM_COMMENT_SCORE = \"score\";\n final static String PARAM_COMMENT_KTV_ID = \"KTVId\";\n\n final static String PARAM_GAME_NAME = \"name\";\n final static String PARAM_GAME_ID = \"gameId\";\n\n final static String PARAM_SMALL_PICTURES = \"bigPictures\";\n final static String PARAM_MIDDLE_PICTURES = \"middlePictures\";\n final static String PARAM_BIG_PICTURES = \"smallPictures\";\n\n final static String DISTRICT_ID_REFERENCE = \"reference\";\n final static String DISTRICT_PROVINCE_ID = \"provinceId\";\n final static String DISTRICT_CITY_ID = \"cityId\";\n final static String DISTRICT_AREA_ID = \"areaId\";\n\n}","title":""},{"docid":"48186b1327150690b12d3beee1f0da6d","score":"0.5996312","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n params.put(\"name\", name);\n params.put(\"email\", email);\n params.put(\"password\", password);\n params.put(\"gender\", gender);\n params.put(\"phone\", phone);\n return params;\n }","title":""},{"docid":"c6e2165ac1e356e73974c849d0ff81d9","score":"0.59927636","text":"List<Parameter> getParameters();","title":""},{"docid":"7e0ab11052a86349648fc14d3c9d5d63","score":"0.5991918","text":"public void setParametro(java.lang.String param){\r\n localParametroTracker = true;\r\n \r\n this.localParametro=param;\r\n \r\n\r\n }","title":""},{"docid":"f0840215000b82460dd89125253ce7fc","score":"0.5981958","text":"private void writeParameters() throws Exception {\n\t\t\n\t\tString paramName;\n\t\t\n\t\tString paramValue;\n\t\tJavaClassElement.javaCodeBuffer.append(\"params=new ArrayList<>()\"+ JavaConstants.DOT_WITH_COMMA+ JavaConstants.NEW_LINE);\n\t\tfor(int i=0; i<queryTokenList.size();i++){\n\n\t\t\tcurToken=queryTokenList.get(i);\n\t\t\t\n\t\t\tif(curToken.isFiltreValue() && !curToken.isConstantVariableWithQuota()){\n\t\t\t\tif(curToken.getFiltreNameToken()!=null && curToken.getFiltreNameToken().getLinkedToken()!=null){\n\t\t\t\t\t\n\t\t\t\t\tparamName=curToken.getFiltreNameToken().getLinkedToken().getDeger().toString();\n\t\t\t\t}else if(curToken.getFiltreNameToken()!=null && curToken.getFiltreNameToken().getColumnNameToken()!=null){\n\t\t\t\t\tparamName=curToken.getFiltreNameToken().getColumnNameToken().getDeger().toString();\n\t\t\t\t}else{\n\t\t\t\t\tparamName=curToken.getFiltreNameToken().getDeger().toString();\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tJavaClassElement.javaCodeBuffer.append(\"params.add(new SQLParameter(\\\"\"+paramName+\"\\\", \"+JavaWriteUtilities.toCustomString(curToken)+\"))\"+ JavaConstants.DOT_WITH_COMMA+ JavaConstants.NEW_LINE);\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t}","title":""},{"docid":"c451763e8c0455c7d31dd563d5d6be9d","score":"0.5981369","text":"@Override\n protected Map<String, String> getParams() {\n final Map<String, String> params = new HashMap<>();\n params.put(\"id\", mid);\n// params.put(\"q\", query);\n// params.put(\"password\", password.getText().toString());\n\n return params;\n }","title":""},{"docid":"bb92b2bfaaf423750c5cf7a9185f79d7","score":"0.59806556","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n // params.put(\"tag\", \"upload\");\n params.put(\"product_name\", productname);\n params.put(\"description\", description);\n params.put(\"price\", price);\n params.put(\"supermarket\", supermarket);\n params.put(\"image\", attach);\n\n\n return params;\n }","title":""},{"docid":"3deaf9d110fa9b62b3740d87d278a05f","score":"0.5980397","text":"@Override\n public Iterator<String> getParameterNames()\n {\n return _params.keySet().iterator();\n }","title":""},{"docid":"cd86ef25176e6adc3f511296bc8af568","score":"0.597021","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n\n // Adding All values to Params.\n params.put( \"keterangan\", KeteangabnHolder );\n params.put( \"id_pelanggan\", id_pelanggan );\n params.put( \"berat\", BeratHolder );\n params.put( \"total\", TotalHolder );\n params.put( \"room_chat\", room_chat );\n return params;\n }","title":""},{"docid":"d5d9535ac04c1ec04abac825f81922d2","score":"0.5968736","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n\n params.put(\"id\", id);\n params.put(\"nama_kue\", nama);\n params.put(\"keterangan\", keterangan);\n params.put(\"harga\", harga);\n\n return params;\n }","title":""},{"docid":"f635a21f154475e13db0e13a2976c542","score":"0.5964683","text":"@Override\r\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\r\n params.put(\"name\", name);\r\n\r\n return params;\r\n }","title":""},{"docid":"ef6a66eb8bc953be0405f632b11d1477","score":"0.59631366","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n Log.d(\"enterd valuesssss......\",userName+\" \"+ user_email+\" \"+user_phn+\" \"+user_spclty+\" \"+gendr);\n\n params.put(\"user_login\", userName);\n params.put(\"user_email\", user_email);\n params.put(\"user_gender\", genderValue);\n params.put(\"user_description\", user_spclty);\n params.put(\"user_primary_contact\", user_phn);\n return params;\n }","title":""},{"docid":"4bb43637428329b9d1d72b6bfcdec50c","score":"0.5956743","text":"@Override\r\n protected Map<String, String> getParams() throws AuthFailureError {\n Map<String, String> parametros = new HashMap<>();\r\n parametros.put(\"usuario\", usuario);\r\n parametros.put(\"pass\", pass);\r\n\r\n return parametros;\r\n }","title":""},{"docid":"a142988740cbf0d8d98f01de275d1db4","score":"0.5955283","text":"@Override\n protected Map<String, String> getParams() throws AuthFailureError {\n Map<String,String> map = data.getParametersInMap(db);\n for (Map.Entry<String, String> entry : map.entrySet())\n {\n System.out.println(entry.getKey() + \" : \" + entry.getValue());\n\n }\n return map;\n }","title":""},{"docid":"66300bf3d16144bf3d59ef38dc194029","score":"0.5952609","text":"protected String paramString ( ) {\r\n\t\treturn \"x=\" + x + \",y=\" + y;\r\n\t}","title":""},{"docid":"b2bf48f51f1cbdffca95e175cadde70a","score":"0.59501487","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n Log.d(\"hello world\",\"sdkjfhsdkfbsk \"+ sid + subcode + rating + fid);\n params.put(\"Sid\", sid);\n params.put(\"Rating\", rating);\n params.put(\"Fid\", fid);\n params.put(\"subject\", subcode);\n params.put(\"comment1\", feedback);\n params.put(\"comment2\", comment);\n\n return params;\n }","title":""},{"docid":"ee737673a62b352b8c9f702b8c7c799d","score":"0.5937131","text":"public abstract Iterable<String> getParameterIterable();","title":""},{"docid":"cf7609f1339904119eda43fe160a2e66","score":"0.5936393","text":"@Override\n protected Map<String, String> getParams() throws AuthFailureError{\n Map<String, String> params = new HashMap<String, String>();\n // jika id kosong maka simpan, jika id ada nilainya maka update\n// if (idPrestasi.isEmpty()){\n params.put(\"npm\", getId);\n params.put(\"namaLomba\", namaLomba);\n params.put(\"tahun\", tahunPrestasi);\n params.put(\"juara\", juaraPrestasi);\n params.put(\"tingkat\", tingkatHide);\n params.put(\"jenis\", jenisHide);\n //params.put(\"scanBukti\", scanBukti);\n //params.put(\"PDF\", encodedimage);\n if(bitmap==null){\n params.put(\"PDF\", encodedPDF);\n params.put(\"file\", namaLomba + \".pdf\");\n encodedPDF = \"\";\n encodedimage = \"\";\n } else{\n params.put(\"PDF\", encodedimage);\n params.put(\"file\", namaLomba + \".jpg\");\n encodedPDF = \"\";\n encodedimage = \"\";\n bitmap = null;\n }\n\n return params;\n }","title":""},{"docid":"910bf59cddeb86018daa08c578bcbfb3","score":"0.5931808","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n\n params.put(\"id\", itemid);\n params.put(\"qty\", itemqty);\n params.put(\"ccaid\", id);\n params.put(\"tprice\", tprice);\n params.put(\"email\", sp.getString(\"userEmail\", \"abc@def.com\"));\n params.put(\"addr\", sp.getString(\"userAddr\", \"error\"));\n return params;\n }","title":""},{"docid":"886fab8bb072275a5e63375d85649371","score":"0.59294885","text":"protected Map<String, String> getParams() throws AuthFailureError {\n Map<String, String> param = new HashMap<>();\n param.put(\"registros\", registros);\n return param;\n }","title":""},{"docid":"0cf214f9903a0b9ee4d2b9e681b802cd","score":"0.59282535","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n params.put(\"name\", name);\n params.put(\"email\", email);\n params.put(\"mobile\", mobile);\n // params.put(\"mobile\", downpayment);\n params.put(\"password\", password);\n\n return params;\n }","title":""},{"docid":"724f4b7f9ca0c2cff6ec26274692254c","score":"0.59218025","text":"public void analyzeParameters(){\n determineTitle();\n determineSQLStatements();\n determineCustomization();\n }","title":""},{"docid":"62544bcdad1a5ea5979503f7f9035ad7","score":"0.5910727","text":"@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n params.put(\"ruserid\",userid);\n params.put(\"usertype\", type);\n params.put(\"track_jobid\", trackjobid);\n params.put(\"wages_paid\", wages);\n params.put(\"review\", rating);\n params.put(\"labour_id\", laborid);\n\n Log.e(\"\",\"\"+params);\n return params;\n }","title":""},{"docid":"e3bb6d50ebce4b00af8a59027a16db80","score":"0.5902726","text":"eicio.Model.Params getParams();","title":""},{"docid":"e3bb6d50ebce4b00af8a59027a16db80","score":"0.5902726","text":"eicio.Model.Params getParams();","title":""},{"docid":"e3bb6d50ebce4b00af8a59027a16db80","score":"0.5902726","text":"eicio.Model.Params getParams();","title":""},{"docid":"e3bb6d50ebce4b00af8a59027a16db80","score":"0.59009707","text":"eicio.Model.Params getParams();","title":""},{"docid":"e3bb6d50ebce4b00af8a59027a16db80","score":"0.59009707","text":"eicio.Model.Params getParams();","title":""},{"docid":"e3bb6d50ebce4b00af8a59027a16db80","score":"0.59009707","text":"eicio.Model.Params getParams();","title":""},{"docid":"e3bb6d50ebce4b00af8a59027a16db80","score":"0.59009707","text":"eicio.Model.Params getParams();","title":""},{"docid":"e3bb6d50ebce4b00af8a59027a16db80","score":"0.59009707","text":"eicio.Model.Params getParams();","title":""},{"docid":"e3bb6d50ebce4b00af8a59027a16db80","score":"0.59009707","text":"eicio.Model.Params getParams();","title":""},{"docid":"e3bb6d50ebce4b00af8a59027a16db80","score":"0.59009707","text":"eicio.Model.Params getParams();","title":""}],"string":"[\n {\n \"docid\": \"25b01e1b9000cd5a750b185847405d80\",\n \"score\": \"0.66812414\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n // jika id kosong maka simpan, jika id ada nilainya maka ubah\\n params.put(\\\"idl\\\", id_lahan);\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ca77b09e8fbb0082f000ae98606af81\",\n \"score\": \"0.66633195\",\n \"text\": \"public abstract String getParams();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"440f20ba2613ae583213c45763971c20\",\n \"score\": \"0.66355264\",\n \"text\": \"Map<String, List<String>> parameters();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc74bd39705366e6f2221321ccc8e0f0\",\n \"score\": \"0.65785486\",\n \"text\": \"@Override\\r\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\r\\n params.put(\\\"id_marca\\\",String.valueOf(id_marca));\\r\\n return params;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3cf31e41113ad78493217a826b0e8b50\",\n \"score\": \"0.657519\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n params.put(\\\"Rango\\\", Rango);\\n params.put(\\\"Sexo\\\", Sexo);\\n params.put(\\\"idCliente\\\", idCliente);\\n\\n\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0db1edf5715f6dc37d94ad773595b77b\",\n \"score\": \"0.6537585\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n params.put(\\\"nominal\\\", nominal);\\n params.put(\\\"nomor\\\", nomor);\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e28b3617c10d42e4ffa1b98b96034373\",\n \"score\": \"0.65217626\",\n \"text\": \"Parametro createParametro();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c18b75322e56e5f0ccb12fa02946e08c\",\n \"score\": \"0.6510214\",\n \"text\": \"@Override\\r\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\r\\n\\r\\n // Adding All values to Params.\\r\\n // The firs argument should be same sa your MySQL database table columns.\\r\\n params.put(\\\"name\\\", NameHolder);\\r\\n params.put(\\\"uid\\\", UidHolder);\\r\\n params.put(\\\"password\\\", PasswordHolder);\\r\\n params.put(\\\"gender\\\", GenderHolder);\\r\\n params.put(\\\"email\\\", EmailHolder);\\r\\n params.put(\\\"department\\\", DepartmentHolder);\\r\\n\\r\\n return params;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7be7138335a101b09bb5e2b45d48fcb\",\n \"score\": \"0.64774597\",\n \"text\": \"public ParametroPorParametro() {\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8551aed46b70fc66998f01073f97aa69\",\n \"score\": \"0.6438514\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() throws AuthFailureError {\\n\\n Map<String, String> parametros = new Hashtable<String, String>();\\n parametros.put(\\\"usuario\\\", usuario.getUsuario());\\n parametros.put(\\\"usuarioDestino\\\", \\\"TODOS\\\");\\n\\n return parametros;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d507def6af69aa0a6f1c83f5728e9b2\",\n \"score\": \"0.64270383\",\n \"text\": \"Map<String, Object> getParameters();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f52a8e857bdc345c33d9625066fe1096\",\n \"score\": \"0.6413558\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() throws AuthFailureError {\\n Map<String, String> parameters = new HashMap<String, String>();\\n parameters.put(\\\"id_usuario\\\",user);\\n //parameters.put(\\\"idP\\\", productos[0]);\\n parameters.put(\\\"idP\\\",idProducto);\\n //parameters.put(\\\"precio\\\", productos[2]);\\n parameters.put(\\\"precio\\\", precioProducto);\\n parameters.put(\\\"cantidad\\\", cant.getText().toString());\\n parameters.put(\\\"modopago\\\", modoP);\\n parameters.put(\\\"deudor\\\", deudo.getText().toString());\\n //parameters.put(\\\"fecha\\\", date);\\n return parameters;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d2b3795422d4227a5ff82a675a5eb6c\",\n \"score\": \"0.63961005\",\n \"text\": \"@Override\\r\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\r\\n\\r\\n\\r\\n\\r\\n // Adding All values to Params.\\r\\n // The firs argument should be same sa your MySQL database table columns.\\r\\n params.put(\\\"enrolment_no\\\", enrolment_no.getText().toString());\\r\\n params.put(\\\"password\\\", password.getText().toString());\\r\\n\\r\\n return params;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41660a3ff3bc27b7ea4f8dd6a2a83cd4\",\n \"score\": \"0.63909376\",\n \"text\": \"Object[] getParameters();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"927a62121cb942cb30c0b5121ef0bb21\",\n \"score\": \"0.6382999\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() throws AuthFailureError {\\n Map<String, String> parametros = new HashMap<String, String>();\\n parametros.put(\\\"nrocuentaorigen\\\", cOrigen);\\n parametros.put(\\\"nrocuentadestino\\\", cDestino);\\n parametros.put(\\\"valor\\\", cvalor);\\n return parametros;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"029089c4ba0c5b72637b120e87a04045\",\n \"score\": \"0.6379632\",\n \"text\": \"private void setParametersToQuery(StringBuilder str,Map<String,Object> parametros,YoutubePlaylist filtro){\\n\\t\\tif(isNotNull(filtro)){\\n\\t\\t\\tLong id=filtro.getId();\\n\\t\\t\\tNegocio negocio=filtro.getNegocio();\\n\\t\\t\\tLong idNeg=(negocio!=null)?negocio.getId():null;\\n\\t\\t\\tString nombre=filtro.getNombre();\\n\\t\\t\\tif(isNotNull(id)){\\n\\t\\t\\t\\tagregarCondicion(str, \\\" p.id=:id \\\", CondicionLogica.AND);\\n\\t\\t\\t\\tparametros.put(\\\"id\\\",id);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tif(isValid(nombre)){\\n\\t\\t\\t\\t\\tagregarCondicion(str, \\\" p.nombre = :nombre \\\", CondicionLogica.AND);\\n\\t\\t\\t\\t\\tparametros.put(\\\"nombre\\\",nombre);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(isNotNull(idNeg)){\\n\\t\\t\\t\\t\\tagregarCondicion(str, \\\" p.negocio.id = :idNeg \\\", CondicionLogica.AND);\\n\\t\\t\\t\\t\\tparametros.put(\\\"idNeg\\\",idNeg);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc7bb5f6d9580101806cdc1e23ca0047\",\n \"score\": \"0.636183\",\n \"text\": \"@Override\\r\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\r\\n params.put(\\\"nomor_bmn\\\", nomorbmn);\\r\\n\\r\\n return params;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5fb8ed82bc9c98e2cc660e1b89f3a6e5\",\n \"score\": \"0.6338157\",\n \"text\": \"@Override\\n protected Map<String,String> getParams(){\\n\\n Map<String,String> params = new HashMap<String, String>();\\n\\n params.put(\\\"docno\\\", repl);\\n params.put(\\\"name\\\",Name.getText().toString());\\n params.put(\\\"pass\\\",spinner2.getSelectedItem().toString());\\n params.put(\\\"id\\\",ID.getText().toString());\\n\\n //Convert\\n /*String YEAR = DOB.getText().toString().substring(0,4);\\n String MONTH = DOB.getText().toString().substring(4,6);\\n String DAY = DOB.getText().toString().substring(6,8);\\n\\n String dob = YEAR + \\\"-\\\" + MONTH + \\\"-\\\" + DAY;*/\\n //System.out.println(\\\"DATE : \\\" + YEAR + \\\"-\\\" + MONTH + \\\"-\\\" + DAY);\\n\\n params.put(\\\"dob\\\", DOB.getText().toString());\\n params.put(\\\"gender\\\", Gender.getText().toString());\\n params.put(\\\"nationality\\\", Nationality.getText().toString());\\n params.put(\\\"add\\\", Address.getText().toString());\\n params.put(\\\"add2\\\", Address2.getText().toString());\\n params.put(\\\"add3\\\", Address3.getText().toString());\\n params.put(\\\"postcode\\\", Postcode.getText().toString());\\n params.put(\\\"city\\\", City.getText().toString());\\n params.put(\\\"state\\\", State.getText().toString());\\n\\n //FP1 = bytesToHexString(thumbprint1);\\n // FP2 = bytesToHexString(thumbprint2);\\n // params.put(\\\"fp1\\\", FP1);\\n // params.put(\\\"fp2\\\", FP2);\\n\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"775039b6387f81fb8110cb243232c709\",\n \"score\": \"0.63288337\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"775039b6387f81fb8110cb243232c709\",\n \"score\": \"0.63288337\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e672fcd853de6bcc472cc2dbab0e246a\",\n \"score\": \"0.6314709\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n\\n\\n\\n Map<String, String> params = new HashMap<String, String>();\\n //params.put(\\\"doctor_user_name\\\", signUpUserNameText);\\n params.put(\\\"key\\\", Glob.Key);\\n params.put(\\\"doctor_id\\\", myid);\\n params.put(\\\"claimed_id\\\", climId);\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63a962f2c8d01adbfee430ee5c8b1cea\",\n \"score\": \"0.6312357\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n\\n Map<String, String> params = new HashMap<String, String>();\\n //Toast.makeText(FindDoctor.this, \\\"speciality_id in service\\\"+speciality_id, Toast.LENGTH_SHORT).show();\\n params.put(\\\"key\\\", Glob.Key);\\n params.put(\\\"doctor_id\\\", docId);\\n params.put(\\\"uniqueId\\\", uniqueId);\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fafeb86c5aba2b323cfb7c35cb677383\",\n \"score\": \"0.6299847\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n\\n Map<String, String> params = new HashMap<String, String>();\\n //Toast.makeText(FindDoctor.this, \\\"speciality_id in service\\\"+speciality_id, Toast.LENGTH_SHORT).show();\\n params.put(\\\"key\\\", Glob.Key);\\n params.put(\\\"doctor_id\\\", docId);\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3c6ba8a2edc361b913e1cf00d844d8d\",\n \"score\": \"0.62934333\",\n \"text\": \"@Override\\n\\tprotected void prepare()\\n\\t{\\n\\t\\tProcessInfoParameter[] para = getParameter();\\n\\t\\tfor (ProcessInfoParameter element : para) {\\n\\t\\t\\tString name = element.getParameterName();\\n\\t\\t\\tif (element.getParameter() == null && element.getParameter_To() == null)\\n\\t\\t\\t\\t;\\n\\t\\t\\telse if (name.equals(\\\"AD_Client_ID\\\"))\\n\\t\\t\\t\\tp_client_id = element.getParameterAsInt();\\n\\t\\t\\telse if (name.equals(\\\"C_Order_ID\\\"))\\n\\t\\t\\t\\tp_order_id = element.getParameterAsInt();\\n\\t\\t\\telse\\n\\t\\t\\t\\tlog.log(Level.SEVERE, \\\"Unknown Parameter: \\\" + name);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a10f4c568ba2dffecc0c1d22a32d0742\",\n \"score\": \"0.6282963\",\n \"text\": \"@Override\\r\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\r\\n for (int i = 0; i < _e_no.size(); i++) {\\r\\n params.put(\\\"quiz_id\\\", _quiz_id);\\r\\n params.put(\\\"name[\\\" + i + \\\"]\\\", _name.get(i));\\r\\n params.put(\\\"e_no[\\\" + i + \\\"]\\\", _e_no.get(i));\\r\\n params.put(\\\"marks[\\\" + i + \\\"]\\\", _marks.get(i));\\r\\n }\\r\\n return params;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77187cb00cbc09b962767e7e0168825c\",\n \"score\": \"0.6279143\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() throws AuthFailureError {\\n\\n Map<String, String> parametros = new Hashtable<String, String>();\\n parametros.put(\\\"usuario\\\", usuario.getUsuario());\\n parametros.put(\\\"usuarioDestino\\\", \\\"TODOS\\\");\\n parametros.put(\\\"mensaje\\\", etTexto.getText().toString());\\n\\n return parametros;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd112a0a27bdf6fac131406a4149124e\",\n \"score\": \"0.62762207\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n params.put(\\\"userID\\\", String.valueOf(userID));\\n params.put(\\\"music\\\", music);\\n params.put(\\\"food\\\", food);\\n params.put(\\\"festival\\\", festival);\\n params.put(\\\"social\\\", social);\\n params.put(\\\"sports\\\", sports);\\n params.put(\\\"party\\\", party);\\n\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"183bc25582c49d4048dfd91d347c7bb4\",\n \"score\": \"0.6263155\",\n \"text\": \"@Override\\r\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\r\\n return params;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6893c71bfb684a203da53fbe5929c25b\",\n \"score\": \"0.6257797\",\n \"text\": \"public void generateParameters() {\\n\\t\\tparameters.add(shift.getDate());\\n\\t\\tparameters.add(\\\"\\\" + shift.getTime());\\n\\t\\tparameters.add(shift.getLocation());\\n\\t\\tparameters.add(shift.getAbsentTeacherName());\\n\\t\\tparameters.add(sub.getFirstName() + \\\" \\\" + sub.getLastName());\\n\\t\\tgenerateEmailNotification();\\n\\t\\tparameters.add(emailText);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07359bc1f0fda01145a72e917149d10a\",\n \"score\": \"0.62505347\",\n \"text\": \"Map<String, String[]> getParamValues();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"880d4bf3a4f281790bda252822651847\",\n \"score\": \"0.62484735\",\n \"text\": \"private SetParametersRequest(){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3fc023f6e42e21940e2d4010ee77b587\",\n \"score\": \"0.6247019\",\n \"text\": \"public abstract String[] getParameterNames();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0bf080718ff161fc915b05f7000ddcd8\",\n \"score\": \"0.624564\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n\\n params.put(\\\"kdcust\\\", kdcustx);\\n params.put(\\\"kdbrg\\\", kdbrg);\\n params.put(\\\"satuan\\\", spin_satuan.getSelectedItem().toString());\\n params.put(\\\"hrg\\\", harga.toString());\\n params.put(\\\"hrgincppn\\\", hargaincppn.toString());\\n params.put(\\\"diskon1\\\", disc1.toString());\\n params.put(\\\"diskon2\\\", disc2.toString());\\n params.put(\\\"diskon3\\\", disc3.toString());\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68177a894dcf452a0e93bfbc9f77e963\",\n \"score\": \"0.6243766\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n\\n\\n\\n Map<String, String> params = new HashMap<String, String>();\\n //params.put(\\\"doctor_user_name\\\", signUpUserNameText);\\n params.put(\\\"key\\\", Glob.Key);\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"061b2329e4f1b0410e6e005f729f8293\",\n \"score\": \"0.62386453\",\n \"text\": \"@Override\\n public void asignaParametros() {\\n String sUsuario = request.getParameter(\\\"usuario\\\")!=null?request.getParameter(\\\"usuario\\\"):\\\"\\\";\\n String sPass = request.getParameter(\\\"pass\\\")!=null?request.getParameter(\\\"pass\\\"):\\\"\\\";\\n \\n Usuario usuario = new Usuario(sUsuario, sPass);\\n sesion.setUsuario(usuario);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a90c7eb601a08cc32d0bb5b622cfc5f\",\n \"score\": \"0.6232835\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n\\n params.put(\\\"kdcust\\\", kdcustx);\\n params.put(\\\"kdbrg\\\", edt_kdbrg.getText().toString());\\n params.put(\\\"satuan\\\", spin_satuan.getSelectedItem().toString());\\n params.put(\\\"hrg\\\", harga.toString());\\n params.put(\\\"hrgincppn\\\", hargaincppn.toString());\\n params.put(\\\"diskon1\\\", disc1.toString());\\n params.put(\\\"diskon2\\\", disc2.toString());\\n params.put(\\\"diskon3\\\", disc3.toString());\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0c308e60bf13e2061c0ac97a5901013\",\n \"score\": \"0.6226837\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n params.put(\\\"name\\\", name);\\n params.put(\\\"age\\\", age);\\n params.put(\\\"gender\\\", gender);\\n if (image != null) {\\n params.put(\\\"image\\\", image);\\n }\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06c09dc3d70f16c86fe7a2324a7255e6\",\n \"score\": \"0.62220097\",\n \"text\": \"@Override\\n protected Map<String,String> getParams(){\\n\\n Map<String,String> params = new HashMap<String, String>();\\n\\n params.put(\\\"docty\\\", spinner.getSelectedItem().toString());\\n params.put(\\\"docno\\\", ID.getText().toString());\\n params.put(\\\"operator\\\",spinner2.getSelectedItem().toString());\\n params.put(\\\"phoneNo\\\",PhoneNo.getText().toString());\\n params.put(\\\"serialno\\\", SerialNo.getText().toString());\\n params.put(\\\"puk1\\\",PUK1.getText().toString());\\n params.put(\\\"puk2\\\", PUK2.getText().toString());\\n\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a69573e38aa8b1934fae173c54a7396e\",\n \"score\": \"0.6205053\",\n \"text\": \"protected void validateIdRepartoOrdenes(java.lang.String[] param){\\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb38e2bfc6544e859a21d736231330f7\",\n \"score\": \"0.6196452\",\n \"text\": \"public abstract String[] getParameterValues(String name);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"553bf6d7a75396c424899638615ee429\",\n \"score\": \"0.6185645\",\n \"text\": \"private static String montaParametres(HashMap<String, String> params) throws UnsupportedEncodingException {\\n StringBuilder result = new StringBuilder();\\n boolean first = true;\\n for(Map.Entry<String, String> entry : params.entrySet()){\\n if (first) { first = false;} else {result.append(\\\"&\\\");}\\n result.append(URLEncoder.encode(entry.getKey(), \\\"UTF-8\\\"));\\n result.append(\\\"=\\\");\\n result.append(URLEncoder.encode(entry.getValue(), \\\"UTF-8\\\"));\\n }return result.toString();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d376230db11b75c908d71e361dd843d\",\n \"score\": \"0.61805886\",\n \"text\": \"@Override\\r\\n protected Map<String, String>getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\r\\n params.put(\\\"Full_Name\\\",Full_Name);\\r\\n params.put(\\\"Mobile_Number\\\",Mobile_Number);\\r\\n params.put(\\\"DOB\\\",DOB);\\r\\n params.put(\\\"Email\\\",Email);\\r\\n params.put(\\\"Qualification\\\",Qualification);\\r\\n params.put(\\\"Address\\\",Address);\\r\\n params.put(\\\"Blood_Group\\\",Blood_Group);\\r\\n params.put(\\\"Password\\\", Password);\\r\\n\\r\\n return params;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"524edd2c9f901cccb770a04bc36d417b\",\n \"score\": \"0.61768425\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n params.put(\\\"MitarbeiterID\\\", name);\\n params.put(\\\"password\\\", pw);\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5645b4633f9a2db6f090f6ef2cc7afb5\",\n \"score\": \"0.617004\",\n \"text\": \"Map<String, String> getParam();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"267ef392424f366b2406cd18ff396554\",\n \"score\": \"0.6164376\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n params.put(\\\"fullname\\\", fullname);\\n params.put(\\\"username\\\", username);\\n params.put(\\\"emailId\\\", emailId);\\n params.put(\\\"password\\\", password);\\n params.put(\\\"courseInterest\\\", courseInterest);\\n params.put(\\\"undergradGpa\\\", undergradGpa);\\n params.put(\\\"greQuant\\\", greQuant);\\n params.put(\\\"greVerbal\\\", greVerbal);\\n params.put(\\\"greAWA\\\", greAWA);\\n params.put(\\\"engScore\\\", engScore);\\n params.put(\\\"workExp\\\", workExp);\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"346c116794ca6a887eeeabc47a681319\",\n \"score\": \"0.61592346\",\n \"text\": \"@Override\\n\\tpublic String[] getParams() {\\n\\t\\tVector<String> s = new Vector<String>();\\n\\t\\ts.add(\\\"name\\\");\\n\\t\\ts.add(\\\"plural\\\");\\n\\t\\ts.add(\\\"numerusGenus\\\");\\n\\t\\ts.add(\\\"id\\\");\\n\\t\\treturn s.toArray(new String[0]);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b1109ae93fa10b675810abe6ffa3e5c\",\n \"score\": \"0.6144321\",\n \"text\": \"@Override\\n public void setParams()\\n {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"099e034550790c989127bc83a58f9153\",\n \"score\": \"0.6141572\",\n \"text\": \"@Override\\n protected Map<String, String> getParams()\\n {\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea5662e602b0ace3a0707a73d43adbe7\",\n \"score\": \"0.6117019\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n\\n\\n\\n Map<String, String> params = new HashMap<String, String>();\\n //params.put(\\\"doctor_user_name\\\", signUpUserNameText);\\n params.put(\\\"key\\\", Glob.Key);\\n params.put(\\\"doctor_id\\\", toReportID);\\n params.put(\\\"user_id\\\", reporterID);\\n params.put(\\\"report\\\", reportText);\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99d4adb04200defe35e663db6d1c2902\",\n \"score\": \"0.61138415\",\n \"text\": \"public String getParameter();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3aeef8d4de882d4921aa69015f0d7ebe\",\n \"score\": \"0.60980415\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dde601606989c724fa2c8bacdcf6510e\",\n \"score\": \"0.6097558\",\n \"text\": \"private String[] getAntecedentParameters(){\\n\\t\\tString[] param = new String[1];\\n\\t\\tparam[0] = antecedentParameters.getText().trim();\\n\\t\\treturn param;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2a46a3bdf1f449656accf5e59741366\",\n \"score\": \"0.60877806\",\n \"text\": \"@Parameters\\n public static Collection<Object[]> getParameters() {\\n final Collection<Object[]> parameters = new ArrayList<Object[]>(10);\\n parameters.add(new String[] {\\\"Alice\\\", \\\"secret\\\"});\\n parameters.add(new String[] {\\\"Bob\\\", \\\"s&e+c`ret\\\"});\\n parameters.add(new String[] {\\\"user\\\", \\\"\\\\u20ac\\\\u20ac\\\"});\\n return parameters;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb13858e343e917ab56797524bc142bd\",\n \"score\": \"0.6082097\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n params.put(\\\"first_name\\\", first_name);\\n params.put(\\\"last_name\\\", last_name);\\n params.put(\\\"sex\\\", sex);\\n params.put(\\\"email\\\", email);\\n params.put(\\\"telephone\\\", telephone);\\n params.put(\\\"category\\\", category);\\n params.put(\\\"password\\\", password);\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f99fb0ec0368b6ddb6290c59b3e30c75\",\n \"score\": \"0.608077\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n params.put(\\\"imgurl\\\", imgurl);\\n params.put(\\\"uname\\\", uname);\\n params.put(\\\"status\\\", status);\\n params.put(\\\"uid\\\", uid);\\n params.put(\\\"ureport\\\", ureport);\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c1aa0d788ef04151f531395d587946c3\",\n \"score\": \"0.6075087\",\n \"text\": \"private void initParameters() {\\n\\t\\tString parameterOperation = getParameter(PARAMETER_OPERATION);\\n\\t\\tif (parameterOperation != null) {\\n\\t\\t\\toperation = Operation.valueOf(parameterOperation);\\n\\t\\t}\\n\\n\\t\\tString parameterToken = getParameter(PARAMETER_TOKEN);\\n\\t\\tif (parameterToken != null) {\\n\\t\\t\\ttokenType = SignatureTokenType.valueOf(parameterToken);\\n\\t\\t}\\n\\n\\t\\tif (operation == null) {\\n\\t\\t\\tthrow new RuntimeException(\\\"Unable to retrieve '\\\" + PARAMETER_OPERATION + \\\"' parameter (\\\" + parameterOperation + \\\")\\\");\\n\\t\\t}\\n\\n\\t\\tif (tokenType == null) {\\n\\t\\t\\tthrow new RuntimeException(\\\"Unable to retrieve '\\\" + PARAMETER_TOKEN + \\\"' parameter (\\\" + parameterToken + \\\")\\\");\\n\\t\\t}\\n\\n\\t\\tif (Operation.sign_digest.equals(operation)) {\\n\\t\\t\\tString parameterDigest = getParameter(PARAMETER_DIGEST_TO_SIGN);\\n\\t\\t\\tif (parameterDigest != null) {\\n\\t\\t\\t\\ttoBeSigned = new ToBeSigned(DatatypeConverter.parseBase64Binary(parameterDigest));\\n\\t\\t\\t}\\n\\n\\t\\t\\tString parameterAlgo = getParameter(PARAMETER_DIGET_ALGORITHM);\\n\\t\\t\\tif (parameterAlgo != null) {\\n\\t\\t\\t\\tdigestAlgorithm = DigestAlgorithm.valueOf(parameterAlgo);\\n\\t\\t\\t}\\n\\n\\t\\t\\tbase64Certificate = getParameter(PARAMETER_BASE64_CERTIFICATE);\\n\\t\\t}\\n\\n\\t\\tif (SignatureTokenType.PKCS11.equals(tokenType)) {\\n\\t\\t\\tpkcs11LibPath = getParameter(PARAMETER_PKCS11_PATH);\\n\\t\\t\\tpkcs11Pwd = getParameter(PARAMETER_PKCS11_PWD).toCharArray();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b40749beb3ea9b5950d83a6d6ec8987\",\n \"score\": \"0.6064441\",\n \"text\": \"@Override\\n\\tprotected void prepare() {\\n\\t\\tProcessInfoParameter[] para = getParameter();\\n\\t\\tfor (ProcessInfoParameter element : para) {\\n\\t\\t\\tString name = element.getParameterName();\\n\\t\\t\\tif (element.getParameter() == null)\\n\\t\\t\\t\\t;\\n\\t\\t\\telse if (name.equals(\\\"AD_Client_ID\\\"))\\n\\t\\t\\t\\tm_AD_Client_ID = ((BigDecimal) element.getParameter())\\n\\t\\t\\t\\t\\t\\t.intValue();\\n\\t\\t\\telse if (name.equals(\\\"DeleteOldImported\\\"))\\n\\t\\t\\t\\tm_deleteOldImported = \\\"Y\\\".equals(element.getParameter());\\n\\t\\t\\telse if (name.equals(\\\"M_PriceList_Version_ID\\\"))\\n\\t\\t\\t\\tp_M_PriceList_Version_ID = element.getParameterAsInt();\\n\\t\\t\\telse\\n\\t\\t\\t\\tlog.log(Level.SEVERE, \\\"Unknown Parameter: \\\" + name);\\n\\t\\t}\\n\\t\\tif (m_DateValue == null)\\n\\t\\t\\tm_DateValue = new Timestamp(System.currentTimeMillis());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d34b6c868d414ccb8ce5bad4372afbd5\",\n \"score\": \"0.6061306\",\n \"text\": \"public void setP_parametros(java.lang.String param){\\r\\n localP_parametrosTracker = true;\\r\\n \\r\\n this.localP_parametros=param;\\r\\n \\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d34b6c868d414ccb8ce5bad4372afbd5\",\n \"score\": \"0.6061306\",\n \"text\": \"public void setP_parametros(java.lang.String param){\\r\\n localP_parametrosTracker = true;\\r\\n \\r\\n this.localP_parametros=param;\\r\\n \\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"955fcc73b5df47db443833025cb59553\",\n \"score\": \"0.60466045\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() throws AuthFailureError {\\n if (!bitmap.equals(\\\"\\\")){\\n image = getStringImage(bitmap);\\n\\n }\\n\\n\\n\\n\\n\\n\\n //Getting Image Name\\n\\n\\n Map<String,String> params = new Hashtable<String, String>();\\n\\n //Adding parameters\\n params.put(KEY_IMAGE, image);\\n params.put(KEY_NOM, nom);\\n params.put(KEY_PRENOM, prenom);\\n params.put(KEY_TEL, numtel);\\n params.put(KEY_MAIL, mail);\\n params.put(KEY_IDCLASSE, classe.getIdClasse()+\\\"\\\");\\n\\n\\n //Creating parameters\\n\\n //returning parameters\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"380590a715a04b0d0d2072c2aa1bfabb\",\n \"score\": \"0.6040724\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() throws AuthFailureError {\\n Map<String, String> params = new HashMap<String, String>();\\n params.put(\\\"userId\\\", SharedPrefManager.getInstance(context).getUser().getId());\\n params.put(\\\"workbenchId\\\", listOfBookingInfomation.get(position).getWorkbenchId());\\n params.put(\\\"DateandTimeStart\\\",listOfBookingInfomation.get(position).getDateandTimeStart());\\n params.put(\\\"Status\\\",listOfBookingInfomation.get(position).getStatus());\\n \\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c1bffe077e6667cc4ef033bcfb96de7\",\n \"score\": \"0.60406584\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n params.put(\\\"idPrestasi\\\", idx);\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c1bffe077e6667cc4ef033bcfb96de7\",\n \"score\": \"0.60406584\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n params.put(\\\"idPrestasi\\\", idx);\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"384304c49351ed8583bef9adb1079865\",\n \"score\": \"0.6028118\",\n \"text\": \"public abstract String getParameter(String name);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b772f7597e754d342de25cebd1709c8c\",\n \"score\": \"0.60167724\",\n \"text\": \"protected void prepare()\\n\\t{\\n\\t\\tProcessInfoParameter[] para = getParameter();\\n\\t\\tfor (int i = 0; i < para.length; i++)\\n\\t\\t{\\n\\t\\t\\tString name = para[i].getParameterName();\\n\\t\\t\\tif (para[i].getParameter() == null)\\n\\t\\t\\t\\t;\\n\\t\\t\\telse if (name.equals(\\\"'PONum\\\"))\\n\\t\\t\\t\\tp_Ponum = (String)para[i].getParameter();\\t\\t\\t\\t\\n\\t\\t\\telse if (name.equals(\\\"MovementDate\\\")) {\\n\\t\\t\\t\\tp_MovementDatefrom = (Timestamp)para[i].getParameter();\\n\\t\\t\\t\\tp_MovementDateto = (Timestamp)para[i].getParameter_To();\\t\\t\\t\\n\\t\\t\\t} \\n\\t\\t\\telse if (name.equals(\\\"M_Product_Categoty_ID\\\"))\\n\\t\\t\\t\\tp_M_Product_Categoty_ID = ((BigDecimal)para[i].getParameter()).intValue();\\n\\t\\t\\telse if (name.equals(\\\"M_Product_ID\\\"))\\n\\t\\t\\t\\tp_M_Product_ID = ((BigDecimal)para[i].getParameter()).intValue();\\n\\t\\t\\telse if (name.equals(\\\"SalesRep_ID\\\"))\\n\\t\\t\\t\\tp_SalesRep_ID = ((BigDecimal)para[i].getParameter()).intValue();\\n\\t//\\t\\telse\\n\\t//\\t\\t\\tlog.log(Level.SEVERE, \\\"Unknown Parameter: \\\" + name);\\n\\t\\t}\\n\\t\\tif (p_MovementDatefrom == null)\\n\\t\\t\\tp_MovementDatefrom = new Timestamp (System.currentTimeMillis());\\n\\t\\tif (p_MovementDateto == null) \\n\\t\\t\\tp_MovementDateto = new Timestamp (System.currentTimeMillis());\\n\\t System.out.println(\\\" date :\\\" + p_MovementDatefrom + p_MovementDateto);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e98cc7cabd49b9c327893a5b4a17e96\",\n \"score\": \"0.6012104\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n\\n // Adding All values to Params.\\n params.put(\\\"first_name\\\", FirstNameHolder);\\n params.put(\\\"Mobile_no\\\", MobileNoHolder);\\n params.put(\\\"email\\\", EmailHolder);\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e416fd968f3520b56f2ff5b1e9e70c3\",\n \"score\": \"0.6008649\",\n \"text\": \"public String getParameterFromP();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8385b397baa5f8e297e1c6d258491e2b\",\n \"score\": \"0.5999497\",\n \"text\": \"protected void validateInfoRepartoOrdenes(RepartoOrdenesDTO[] param){\\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"228505346d4306cde0f2815344bd13ab\",\n \"score\": \"0.59972686\",\n \"text\": \"public interface ParamsConstants {\\n final static String PAGE_PARAMS_OFFSET = \\\"offset\\\";\\n final static String PAGE_PARAMS_LENGTH = \\\"length\\\";\\n final static String PAGE_PARAMS_ORDER_DESC = \\\"orderDesc\\\";\\n final static String PAGE_PARAMS_EQUALPARAMS = \\\"equalParams\\\";\\n final static String PAGE_PARAMS_LIKEPARAMS = \\\"likePrams\\\";\\n final static String PAGE_DATA_COUNT = \\\"dataCount\\\";\\n\\n final static String PARAM_NAME = \\\"name\\\";\\n final static String PARAM_TYPE = \\\"type\\\";\\n final static String PARAM_PASSWORD = \\\"password\\\";\\n\\n final static String PARAM_MONGO_FILE_NAME = \\\"filename\\\";\\n final static String PARAM_MONGO_ARTICLE_INFORMATION_ID = \\\"informationId\\\";\\n\\n final static String PARAM_ID = \\\"id\\\";\\n final static String PARAM_UUID = \\\"uuid\\\";\\n final static String PARAM_PICTURE = \\\"picture\\\";\\n\\n final static String PARAM_USER_NAME = \\\"name\\\";\\n final static String PARAM_USER_USERNAME = \\\"userName\\\";\\n final static String PARAM_USER_PASSWORD = \\\"password\\\";\\n\\n final static String PARAM_KTV_NAME = \\\"name\\\";\\n final static String PARAM_KTV_ADDRESS = \\\"address\\\";\\n final static String PARAM_KTV_ID = \\\"ktvId\\\";\\n final static String PARAM_KTV_DISTRICT_ID = \\\"districtId\\\";\\n\\n final static String PARAM_INFORMATION_TITLE = \\\"title\\\";\\n final static String PARAM_INFORMATION_ID = \\\"informationId\\\";\\n\\n final static String PARAM_COMMENT_COMMENT = \\\"comment\\\";\\n final static String PARAM_COMMENT_SCORE = \\\"score\\\";\\n final static String PARAM_COMMENT_KTV_ID = \\\"KTVId\\\";\\n\\n final static String PARAM_GAME_NAME = \\\"name\\\";\\n final static String PARAM_GAME_ID = \\\"gameId\\\";\\n\\n final static String PARAM_SMALL_PICTURES = \\\"bigPictures\\\";\\n final static String PARAM_MIDDLE_PICTURES = \\\"middlePictures\\\";\\n final static String PARAM_BIG_PICTURES = \\\"smallPictures\\\";\\n\\n final static String DISTRICT_ID_REFERENCE = \\\"reference\\\";\\n final static String DISTRICT_PROVINCE_ID = \\\"provinceId\\\";\\n final static String DISTRICT_CITY_ID = \\\"cityId\\\";\\n final static String DISTRICT_AREA_ID = \\\"areaId\\\";\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48186b1327150690b12d3beee1f0da6d\",\n \"score\": \"0.5996312\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n params.put(\\\"name\\\", name);\\n params.put(\\\"email\\\", email);\\n params.put(\\\"password\\\", password);\\n params.put(\\\"gender\\\", gender);\\n params.put(\\\"phone\\\", phone);\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6e2165ac1e356e73974c849d0ff81d9\",\n \"score\": \"0.59927636\",\n \"text\": \"List<Parameter> getParameters();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e0ab11052a86349648fc14d3c9d5d63\",\n \"score\": \"0.5991918\",\n \"text\": \"public void setParametro(java.lang.String param){\\r\\n localParametroTracker = true;\\r\\n \\r\\n this.localParametro=param;\\r\\n \\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0840215000b82460dd89125253ce7fc\",\n \"score\": \"0.5981958\",\n \"text\": \"private void writeParameters() throws Exception {\\n\\t\\t\\n\\t\\tString paramName;\\n\\t\\t\\n\\t\\tString paramValue;\\n\\t\\tJavaClassElement.javaCodeBuffer.append(\\\"params=new ArrayList<>()\\\"+ JavaConstants.DOT_WITH_COMMA+ JavaConstants.NEW_LINE);\\n\\t\\tfor(int i=0; i<queryTokenList.size();i++){\\n\\n\\t\\t\\tcurToken=queryTokenList.get(i);\\n\\t\\t\\t\\n\\t\\t\\tif(curToken.isFiltreValue() && !curToken.isConstantVariableWithQuota()){\\n\\t\\t\\t\\tif(curToken.getFiltreNameToken()!=null && curToken.getFiltreNameToken().getLinkedToken()!=null){\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tparamName=curToken.getFiltreNameToken().getLinkedToken().getDeger().toString();\\n\\t\\t\\t\\t}else if(curToken.getFiltreNameToken()!=null && curToken.getFiltreNameToken().getColumnNameToken()!=null){\\n\\t\\t\\t\\t\\tparamName=curToken.getFiltreNameToken().getColumnNameToken().getDeger().toString();\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tparamName=curToken.getFiltreNameToken().getDeger().toString();\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tJavaClassElement.javaCodeBuffer.append(\\\"params.add(new SQLParameter(\\\\\\\"\\\"+paramName+\\\"\\\\\\\", \\\"+JavaWriteUtilities.toCustomString(curToken)+\\\"))\\\"+ JavaConstants.DOT_WITH_COMMA+ JavaConstants.NEW_LINE);\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c451763e8c0455c7d31dd563d5d6be9d\",\n \"score\": \"0.5981369\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n final Map<String, String> params = new HashMap<>();\\n params.put(\\\"id\\\", mid);\\n// params.put(\\\"q\\\", query);\\n// params.put(\\\"password\\\", password.getText().toString());\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb92b2bfaaf423750c5cf7a9185f79d7\",\n \"score\": \"0.59806556\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n // params.put(\\\"tag\\\", \\\"upload\\\");\\n params.put(\\\"product_name\\\", productname);\\n params.put(\\\"description\\\", description);\\n params.put(\\\"price\\\", price);\\n params.put(\\\"supermarket\\\", supermarket);\\n params.put(\\\"image\\\", attach);\\n\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3deaf9d110fa9b62b3740d87d278a05f\",\n \"score\": \"0.5980397\",\n \"text\": \"@Override\\n public Iterator<String> getParameterNames()\\n {\\n return _params.keySet().iterator();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd86ef25176e6adc3f511296bc8af568\",\n \"score\": \"0.597021\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n\\n // Adding All values to Params.\\n params.put( \\\"keterangan\\\", KeteangabnHolder );\\n params.put( \\\"id_pelanggan\\\", id_pelanggan );\\n params.put( \\\"berat\\\", BeratHolder );\\n params.put( \\\"total\\\", TotalHolder );\\n params.put( \\\"room_chat\\\", room_chat );\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d5d9535ac04c1ec04abac825f81922d2\",\n \"score\": \"0.5968736\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n\\n params.put(\\\"id\\\", id);\\n params.put(\\\"nama_kue\\\", nama);\\n params.put(\\\"keterangan\\\", keterangan);\\n params.put(\\\"harga\\\", harga);\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f635a21f154475e13db0e13a2976c542\",\n \"score\": \"0.5964683\",\n \"text\": \"@Override\\r\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\r\\n params.put(\\\"name\\\", name);\\r\\n\\r\\n return params;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef6a66eb8bc953be0405f632b11d1477\",\n \"score\": \"0.59631366\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n Log.d(\\\"enterd valuesssss......\\\",userName+\\\" \\\"+ user_email+\\\" \\\"+user_phn+\\\" \\\"+user_spclty+\\\" \\\"+gendr);\\n\\n params.put(\\\"user_login\\\", userName);\\n params.put(\\\"user_email\\\", user_email);\\n params.put(\\\"user_gender\\\", genderValue);\\n params.put(\\\"user_description\\\", user_spclty);\\n params.put(\\\"user_primary_contact\\\", user_phn);\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4bb43637428329b9d1d72b6bfcdec50c\",\n \"score\": \"0.5956743\",\n \"text\": \"@Override\\r\\n protected Map<String, String> getParams() throws AuthFailureError {\\n Map<String, String> parametros = new HashMap<>();\\r\\n parametros.put(\\\"usuario\\\", usuario);\\r\\n parametros.put(\\\"pass\\\", pass);\\r\\n\\r\\n return parametros;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a142988740cbf0d8d98f01de275d1db4\",\n \"score\": \"0.5955283\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() throws AuthFailureError {\\n Map<String,String> map = data.getParametersInMap(db);\\n for (Map.Entry<String, String> entry : map.entrySet())\\n {\\n System.out.println(entry.getKey() + \\\" : \\\" + entry.getValue());\\n\\n }\\n return map;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66300bf3d16144bf3d59ef38dc194029\",\n \"score\": \"0.5952609\",\n \"text\": \"protected String paramString ( ) {\\r\\n\\t\\treturn \\\"x=\\\" + x + \\\",y=\\\" + y;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2bf48f51f1cbdffca95e175cadde70a\",\n \"score\": \"0.59501487\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n Log.d(\\\"hello world\\\",\\\"sdkjfhsdkfbsk \\\"+ sid + subcode + rating + fid);\\n params.put(\\\"Sid\\\", sid);\\n params.put(\\\"Rating\\\", rating);\\n params.put(\\\"Fid\\\", fid);\\n params.put(\\\"subject\\\", subcode);\\n params.put(\\\"comment1\\\", feedback);\\n params.put(\\\"comment2\\\", comment);\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee737673a62b352b8c9f702b8c7c799d\",\n \"score\": \"0.5937131\",\n \"text\": \"public abstract Iterable<String> getParameterIterable();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cf7609f1339904119eda43fe160a2e66\",\n \"score\": \"0.5936393\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() throws AuthFailureError{\\n Map<String, String> params = new HashMap<String, String>();\\n // jika id kosong maka simpan, jika id ada nilainya maka update\\n// if (idPrestasi.isEmpty()){\\n params.put(\\\"npm\\\", getId);\\n params.put(\\\"namaLomba\\\", namaLomba);\\n params.put(\\\"tahun\\\", tahunPrestasi);\\n params.put(\\\"juara\\\", juaraPrestasi);\\n params.put(\\\"tingkat\\\", tingkatHide);\\n params.put(\\\"jenis\\\", jenisHide);\\n //params.put(\\\"scanBukti\\\", scanBukti);\\n //params.put(\\\"PDF\\\", encodedimage);\\n if(bitmap==null){\\n params.put(\\\"PDF\\\", encodedPDF);\\n params.put(\\\"file\\\", namaLomba + \\\".pdf\\\");\\n encodedPDF = \\\"\\\";\\n encodedimage = \\\"\\\";\\n } else{\\n params.put(\\\"PDF\\\", encodedimage);\\n params.put(\\\"file\\\", namaLomba + \\\".jpg\\\");\\n encodedPDF = \\\"\\\";\\n encodedimage = \\\"\\\";\\n bitmap = null;\\n }\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"910bf59cddeb86018daa08c578bcbfb3\",\n \"score\": \"0.5931808\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n\\n params.put(\\\"id\\\", itemid);\\n params.put(\\\"qty\\\", itemqty);\\n params.put(\\\"ccaid\\\", id);\\n params.put(\\\"tprice\\\", tprice);\\n params.put(\\\"email\\\", sp.getString(\\\"userEmail\\\", \\\"abc@def.com\\\"));\\n params.put(\\\"addr\\\", sp.getString(\\\"userAddr\\\", \\\"error\\\"));\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"886fab8bb072275a5e63375d85649371\",\n \"score\": \"0.59294885\",\n \"text\": \"protected Map<String, String> getParams() throws AuthFailureError {\\n Map<String, String> param = new HashMap<>();\\n param.put(\\\"registros\\\", registros);\\n return param;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0cf214f9903a0b9ee4d2b9e681b802cd\",\n \"score\": \"0.59282535\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n params.put(\\\"name\\\", name);\\n params.put(\\\"email\\\", email);\\n params.put(\\\"mobile\\\", mobile);\\n // params.put(\\\"mobile\\\", downpayment);\\n params.put(\\\"password\\\", password);\\n\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"724f4b7f9ca0c2cff6ec26274692254c\",\n \"score\": \"0.59218025\",\n \"text\": \"public void analyzeParameters(){\\n determineTitle();\\n determineSQLStatements();\\n determineCustomization();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"62544bcdad1a5ea5979503f7f9035ad7\",\n \"score\": \"0.5910727\",\n \"text\": \"@Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n params.put(\\\"ruserid\\\",userid);\\n params.put(\\\"usertype\\\", type);\\n params.put(\\\"track_jobid\\\", trackjobid);\\n params.put(\\\"wages_paid\\\", wages);\\n params.put(\\\"review\\\", rating);\\n params.put(\\\"labour_id\\\", laborid);\\n\\n Log.e(\\\"\\\",\\\"\\\"+params);\\n return params;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3bb6d50ebce4b00af8a59027a16db80\",\n \"score\": \"0.5902726\",\n \"text\": \"eicio.Model.Params getParams();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3bb6d50ebce4b00af8a59027a16db80\",\n \"score\": \"0.5902726\",\n \"text\": \"eicio.Model.Params getParams();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3bb6d50ebce4b00af8a59027a16db80\",\n \"score\": \"0.5902726\",\n \"text\": \"eicio.Model.Params getParams();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3bb6d50ebce4b00af8a59027a16db80\",\n \"score\": \"0.59009707\",\n \"text\": \"eicio.Model.Params getParams();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3bb6d50ebce4b00af8a59027a16db80\",\n \"score\": \"0.59009707\",\n \"text\": \"eicio.Model.Params getParams();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3bb6d50ebce4b00af8a59027a16db80\",\n \"score\": \"0.59009707\",\n \"text\": \"eicio.Model.Params getParams();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3bb6d50ebce4b00af8a59027a16db80\",\n \"score\": \"0.59009707\",\n \"text\": \"eicio.Model.Params getParams();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3bb6d50ebce4b00af8a59027a16db80\",\n \"score\": \"0.59009707\",\n \"text\": \"eicio.Model.Params getParams();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3bb6d50ebce4b00af8a59027a16db80\",\n \"score\": \"0.59009707\",\n \"text\": \"eicio.Model.Params getParams();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3bb6d50ebce4b00af8a59027a16db80\",\n \"score\": \"0.59009707\",\n \"text\": \"eicio.Model.Params getParams();\",\n \"title\": \"\"\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":11,"numItemsPerPage":100,"numTotalItems":995064,"offset":1100,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3ODc5MTQ1MCwic3ViIjoiL2RhdGFzZXRzL250aGFrdXIvY29ybnN0YWNrLWphdmEtdjEtdGV2YXRyb24tMU0iLCJleHAiOjE3Nzg3OTUwNTAsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.13_OZSmDE1qyMio47EpTA4L1k-pRy2Li2Ty0XCZe8kYJbpoVygo6qe-z9CMGdwkqZaml5Tc4EDRH2RFGhfvmDQ","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":995064,"numBytesParquet":17569818855}]},"discussionsStats":{"closed":0,"open":0,"total":0},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
query_id stringlengths 32 32 | query stringlengths 7 129k | positive_passages listlengths 1 1 | negative_passages listlengths 88 101 |
|---|---|---|---|
f11d91fd30474c700e112f87a144836e | new method for joins | [
{
"docid": "3509e2780954535c4a64cdd572421c37",
"score": "0.0",
"text": "public Result all(String id);",
"title": ""
}
] | [
{
"docid": "531a117827102b9d3093d0b51b5c1125",
"score": "0.7874396",
"text": "abstract protected Object joinClause(Object o1, Object o2);",
"title": ""
},
{
"docid": "3fb4db9f290400724f924d1b8cbb308e",
"score": "0.7644142",
"text": "Join createJoin();",
"title": ""
},
{
"... |
5dc89de2991a9c8561703808da3ee3da | Calculate the bNode closure from a resource. The Statement itself does not automatically get included. | [
{
"docid": "2b3b653c0022d086e4b7b87665d03d7e",
"score": "0.6428813",
"text": "public static Model closure(Resource resource, boolean testThisNode)\n {\n return closure(resource, new ClosureBNode(), testThisNode) ;\n }",
"title": ""
}
] | [
{
"docid": "579db00595b4aad32e3456360a6f1e05",
"score": "0.59724456",
"text": "public static Model closure(Statement stmt)\n {\n return closure(stmt, new ClosureBNode()) ;\n }",
"title": ""
},
{
"docid": "a46d119664f8bde47a5d699b39b7ce1b",
"score": "0.5961538",
"text": "... |
20320ee708f24438e18a0ddb19a1c12f | return the Score for GHOST eating | [
{
"docid": "671bd25d559ef641c086569cf3403819",
"score": "0.63751477",
"text": "public int getScore() {\n\t\treturn _score;\n\t}",
"title": ""
}
] | [
{
"docid": "a7f7ff56a5a93225d818821e6cf3d8b7",
"score": "0.71987385",
"text": "public int getScoreHome()\n {\n return scores[HOME_TEAM];\n }",
"title": ""
},
{
"docid": "35577f05808548f0c8cd63fe1c8606e6",
"score": "0.7163832",
"text": "public Integer gethScore() {\n ... |
96b46505b37eec5f219dffc9e07d6f0f | Check if the return description has a 'Description:' string. | [
{
"docid": "8253afabef2305131c5bf1f543ec60b7",
"score": "0.0",
"text": "@Test\n\t\t@RepeatedTest(100)\n\t\t@DisplayName(\"Get account description\")\n\t\tpublic void testSampleServiceGetAccountDescription() {\n\t\t\tassertTrue(orderService.getOrderDescription(1).contains(\"Description\"));\n\t\t}",
... | [
{
"docid": "e1cf2f02f06b1a7b7ccca8806fe2f0df",
"score": "0.79935926",
"text": "boolean hasDescription();",
"title": ""
},
{
"docid": "e1cf2f02f06b1a7b7ccca8806fe2f0df",
"score": "0.79935926",
"text": "boolean hasDescription();",
"title": ""
},
{
"docid": "e1cf2f02f06b1a7b... |
f34ad575af1f48d57f5ff4f41fad989a | getter method for member of Groups | [
{
"docid": "120b955792280602c81818ebbfc2349a",
"score": "0.73409426",
"text": "public ArrayList<Group> getMemberOf(){\n \n GroupDAO groupDAO = new GroupDAO();\n \n memberOf = groupDAO.getMemberOf(this);\n \n return memberOf;\n }",
"title": ""
}
] | [
{
"docid": "3d3389d7f929c5ed3a7eaa8072939b28",
"score": "0.74318105",
"text": "public String getGroup();",
"title": ""
},
{
"docid": "876b66be80d57c4962f70ddc8384a385",
"score": "0.73652494",
"text": "public Group get() {\n return mainGroup;\n }",
"title": ""
},
{
... |
455637a47811c4ca392b0b38401d85b0 | Changes language in default customer window. | [
{
"docid": "a71d8057af710fce3980bc6fed8eeea3",
"score": "0.711658",
"text": "public void setLanguage(String l, String c) {\n\t\tString language = properties.getProperty(l);\n\t\tString country = properties.getProperty(c);\n\t\tcurLocale = new Locale(language, country);\n\t\tLocale.setDefault(curLocale);... | [
{
"docid": "ed0a5111914fbd260f2a264c87a31896",
"score": "0.74713284",
"text": "public void setLanguageCustomer(String l, String c) {\n\t\tSystem.out.println(\"Kieli vaihdetaan \" + l + \" \" + c);\n\t\tString language = properties.getProperty(l);\n\t\tString country = properties.getProperty(c);\n\t\tcur... |
3620c5f91633ae4d7053bf6c11aae865 | Function to merge two linked lists | [
{
"docid": "c9f2694ee82c2c9a2b239ed349e1dfaa",
"score": "0.7086205",
"text": "protected Node merge(Node first, Node second) {\n // If first linked list is empty\n if (first == null) {\n return second;\n }\n\n // If second linked list is empty\n if (second ==... | [
{
"docid": "42e8eb94fd4a0dd40e01ae85f7e4774d",
"score": "0.839838",
"text": "public ListNode mergeTwoLists(ListNode l1, ListNode l2);",
"title": ""
},
{
"docid": "d7d811530c8340bdb9b455a87269d183",
"score": "0.79677486",
"text": "private static HeapNode mergeNodeLists(HeapNode first,... |
0eebf20d3db29e9de3771f3e70415940 | Internal method to print a subtree in sorted order. | [
{
"docid": "cc668e49dbdbaca9a06ea5040e6cbc78",
"score": "0.65128535",
"text": "private void printTree( BinaryNode<AnyType> t )\n {\n if( t != null )\n {\n printTree( t.left );\n System.out.println( t.element );\n printTree( t.right );\n }\n }",... | [
{
"docid": "9504d62520601271f90e764373c20911",
"score": "0.7463656",
"text": "void printInOrder()\n\t{\n\t\tprintInOrder(root);\n\t}",
"title": ""
},
{
"docid": "ef7a160734b034a62abb040743ca36d0",
"score": "0.7325559",
"text": "@Override\n\tpublic void printInorder() {\n\t\tif (null ... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "f5822401569272925aaf57c542b54083",
"score": "0.0",
"text": "public int getHealth() {\n\t\treturn health;\r\n\t}",
"title": ""
}
] | [
{
"docid": "fd7df110e087032be8c98522c4493f41",
"score": "0.6681592",
"text": "@Override\n public void otvori() {\n }",
"title": ""
},
{
"docid": "fd7df110e087032be8c98522c4493f41",
"score": "0.6681592",
"text": "@Override\n public void otvori() {\n ... |
dc5480fb3c04bad50a488502107572c8 | Process an element annotated by the handled Annotation Type. | [
{
"docid": "9a4085f5dae7bb56fe598e7820d8ecac",
"score": "0.61614984",
"text": "private void processElement(Element element) {\n\n if (element.getKind() != ElementKind.INTERFACE) {\n return;\n }\n\n TypeElement interfaceElement = (TypeElement) element;\n setDataAcce... | [
{
"docid": "05f8d80079e79fd530430965bad72d1c",
"score": "0.7680457",
"text": "public abstract void processTypeElement(final TypeElement annotation, final TypeElement element, final MessageInterface messageInterface);",
"title": ""
},
{
"docid": "48421ef37ffb23f0ddcbc59e90da6d19",
"score"... |
6c2b2ac5add7732336147b16ff9a65ab | public boolean GetVal(int startAddress, int size, OperandDataType data_type, IChunkVals chunk_vals, OperandVal operand_val); | [
{
"docid": "a188e86742b908aef5dbfbc30bd3abfa",
"score": "0.5982854",
"text": "boolean WriteOperandVal(IChunkVals cvals, String operand_val, String address, OperandDataType data_type);",
"title": ""
}
] | [
{
"docid": "8dc8ad247ed3413bdda29b75d3e8fcd9",
"score": "0.5768073",
"text": "Object getValue(long offset, Class<?> type, Object currentValue) {\n/* 363 */ Object result = null;\n/* 364 */ if (Structure.class.isAssignableFrom(type)) {\n/* 365 */ Structure s = (Structure)currentValue;\n/... |
bb2288ba335765c8f68dc6ef6a370746 | Logs the passed log text and amount to the log text file and system console. | [
{
"docid": "8e964c84b8fb5ae487c1bc1d326e4fd0",
"score": "0.0",
"text": "public static String logActivity(AppProperties appProps, String textToLog, boolean includeDateTime, boolean printToConsole) throws Exception{\r\n\t\ttry {\r\n\t\t\tif (includeDateTime) {\r\n\t\t\t\ttextToLog = AppTools.currentDateTi... | [
{
"docid": "544f4655d9bbc6d1c16dff0fb5b48cf4",
"score": "0.6670645",
"text": "public void PrintToLog(String text) {\n log = text;\n WriteLog();\n }",
"title": ""
},
{
"docid": "1d479f73d297cbea19970c523a168ac5",
"score": "0.6652545",
"text": "public void log( Str... |
003ce766ffc3f674a993109532fe4012 | Get P11 slot instance. Only one instance (provider) will ever be created for each slot regardless of how many times this method is called. | [
{
"docid": "05161e2346df9ce8aa516d1bff79873f",
"score": "0.56342864",
"text": "public static P11Slot getInstance(final String slotLabel, final String sharedLibrary, final Pkcs11SlotLabelType slotLabelType, \n final String attributesFile, final P11SlotUser token, final int id) throws CryptoTok... | [
{
"docid": "feabf275c1bc2c0f48a107cf2d897fcf",
"score": "0.59818745",
"text": "public Slot getSlot ()\r\n {\r\n return slot;\r\n }",
"title": ""
},
{
"docid": "636fdf41e8bb95e3200a74f93384b9be",
"score": "0.5922524",
"text": "Slot createSlot();",
"title": ""
},
{... |
19fcbee6ce3da69d4bb2b86f2b19c237 | native declaration : include\curl\curl.h:2004 enum values | [
{
"docid": "ecf48377058f27b3b333d605ad374c70",
"score": "0.62569475",
"text": "public static interface CURL_TLSAUTH {\n\t\t/** <i>native declaration : include\\curl\\curl.h:2005</i> */\n\t\tpublic static final int CURL_TLSAUTH_NONE = 0;\n\t\t/** <i>native declaration : include\\curl\\curl.h:2006</i> */\... | [
{
"docid": "cfac1770c7acf42060dd39de35ffdbe9",
"score": "0.7016177",
"text": "public static interface CURLUcode {\n\t\t/** <i>native declaration : include\\curl\\\\urlapi.h:8</i> */\n\t\tpublic static final int CURLUE_OK = 0;\n\t\t/**\n\t\t * 1<br>\n\t\t * <i>native declaration : include\\curl\\\\urlapi... |
72fc604ab3335f05d082e86702b9743a | Constructor con atributos propios (Clase Habitacion) | [
{
"docid": "05ced929d57c65e74cc41c9f0636ca1f",
"score": "0.65801466",
"text": "public Habitacion(int numeroCuarto, int numeroPersonas, Date fechaIngreso, Date fechaSalida) {\r\n this.numeroCuarto = numeroCuarto;\r\n this.numeroPersonas = numeroPersonas;\r\n this.fechaIngreso = fecha... | [
{
"docid": "a4a47be3d8ae61d24a261770b6e779df",
"score": "0.73225003",
"text": "public Anemometro() {\r\n\t \tsuper();\r\n\r\n\t\r\n\t}",
"title": ""
},
{
"docid": "254c55d33e75a5dfad0ec8771a056b47",
"score": "0.7232891",
"text": "public BusquedaDeHabitaciones() {\n }",
"title"... |
12b675df093964ab48a05acbc3d15a36 | Getter method for the COM property "Thumbnails" | [
{
"docid": "1bbbc9d3c44ebdc869bf56e6d5afb11d",
"score": "0.6509329",
"text": "@DISPID(37) //= 0x25. The runtime will prefer the VTID if present\r\n @VTID(83)\r\n boolean thumbnails();",
"title": ""
}
] | [
{
"docid": "4c162e89de117298a323079769cfa145",
"score": "0.7433795",
"text": "List<String> getThumbnails();",
"title": ""
},
{
"docid": "08457aafb1b161edb75c164a8efa7397",
"score": "0.7342171",
"text": "@XmlElementWrapper(name = \"thumbnails\")\n\t@XmlElements( { @XmlElement(name = \... |
cd06ed1f0cb1134a73df3ce12265c860 | String s = "abc" ; System.out.println(s.substring(1,3)); printTheSum(10.5, 20.9); printTheSum(123.9, 200.1); printTheSum(11.33, 44.1); printTheSum(11, 5); | [
{
"docid": "59834bb8a02efcb0a1490680c3e9e05b",
"score": "0.0",
"text": "public static void main(String[] args) {\n\t\treportName(\"Andy\",\"Smo\");\n\t\treverseString(\"Hello my dear, smart Andy. Wish you to lern java very succesfful!!!\");\n\n\t}",
"title": ""
}
] | [
{
"docid": "8109b1afc65d2542d497168ff2bb9175",
"score": "0.64201415",
"text": "@Test\n\tpublic void testSum() {\n\t\tStringNumberSumator addClass = new StringNumberSumator();\n\t\tassertEquals(\"67868778555572961\", addClass.sum(\"91686886861\", \"67868686868686100\"));\n\t\tassertEquals(\"2\", addClass... |
1f25340ba64d645239ab9016938db708 | This method was generated by MyBatis Generator. This method corresponds to the database table user | [
{
"docid": "20ec407bef650fa409922488b9c3f551",
"score": "0.0",
"text": "int insertSelective(User record);",
"title": ""
}
] | [
{
"docid": "338b235fc9a9d97f73cfe7c27dfc8ab6",
"score": "0.6867685",
"text": "@Override\n public List<User> queryAllUser() {\n try {\n // TODO Auto-generated method stub\n UserDao ud = MybatisUtil.getMapper(UserDao.class);\n List<User> list = ud.queryAllUser();... |
2df0792e84670fdd9c84239c93f01633 | The subnets for the endpoint to be deployed into. repeated string subnetIds = 7; | [
{
"docid": "aa711be24caba45321f91310f675a037",
"score": "0.56750554",
"text": "public com.google.protobuf.ByteString\n getSubnetIdsBytes(int index) {\n return subnetIds_.getByteString(index);\n }",
"title": ""
}
] | [
{
"docid": "89327fe2f63e6c9a233d9c8274621121",
"score": "0.72030854",
"text": "public String [] getSubnetIds() {\n return this.SubnetIds;\n }",
"title": ""
},
{
"docid": "f9d1cad1c78d498b3835e7c22e275f4a",
"score": "0.6812569",
"text": "public void setSubnetIds(String [] Su... |
b6bf078436db15b85c9a668ebebabf7e | Name of the Kafka user. string name = 1 [(.yandex.cloud.required) = true, (.yandex.cloud.pattern) = "[azAZ09_]", (.yandex.cloud.length) = "1256"]; | [
{
"docid": "28a7218fc9ddc82514ea1b11350526a9",
"score": "0.0",
"text": "public java.lang.String getName() {\n java.lang.Object ref = name_;\n if (!(ref instanceof java.lang.String)) {\n com.google.protobuf.ByteString bs =\n (com.google.protobuf.ByteString) ref;\n ... | [
{
"docid": "5a99b6f6ceed83b4d5056170c63904d0",
"score": "0.6330417",
"text": "private String createUserName(GoogleIdToken.Payload payload) {\n String userNameLetters = \"\" + ((String) payload.get(\"given_name\")).toLowerCase().charAt(0);\n String family_name = ((String) payload.get(\"fami... |
1d92b136ca11b15347b123411e47724c | why do this??? mBTAdapter.cancelDiscovery(); | [
{
"docid": "e8edadd9c44a09f28738c4dc8b7387aa",
"score": "0.0",
"text": "@Override\r\n public void run() {\n\r\n try {\r\n mSock.connect();\r\n } catch (IOException e) {\r\n try {\r\n mSock.close();\r\n } catch (... | [
{
"docid": "fcfc5caf18a7f066efcc6de0b2127179",
"score": "0.6906014",
"text": "private void stopDiscovery() {\n if (mDisposable != null) {\n mDisposable.dispose();\n }\n }",
"title": ""
},
{
"docid": "d6061702b240ffb4f3a490aaf953ad4c",
"score": "0.6802695",
... |
961401c092dd73f1b9823d74ba9abdcb | $ANTLR end "rule__Doozle__TargetAssignment_4" $ANTLR start "rule__Doozle__OnAssignment_6" InternalDsl.g:14587:1: rule__Doozle__OnAssignment_6 : ( RULE_STRING ) ; | [
{
"docid": "5bbc78cc8808a5fa151987fe1be4da93",
"score": "0.8313975",
"text": "public final void rule__Doozle__OnAssignment_6() throws RecognitionException {\r\n\r\n \t\tint stackSize = keepStackSize();\r\n \t\r\n try {\r\n // InternalDsl.g:14591:1: ( ( RULE_STRING ) )\r\n... | [
{
"docid": "3e48e50588ee79a2e5bd15f3021099ad",
"score": "0.7983089",
"text": "public final void rule__Doozle__TargetAssignment_4() throws RecognitionException {\r\n\r\n \t\tint stackSize = keepStackSize();\r\n \t\r\n try {\r\n // InternalDsl.g:14576:1: ( ( RULE_STRING ) )... |
9dddf938737c8bdbde459e14761a1f7a | Called by the OSGi framework when the bundle is stopped. | [
{
"docid": "75101315bfbf882f28e5085c2401a194",
"score": "0.6583705",
"text": "@Override\n public void stop(final BundleContext context) throws Exception\n {\n // close the configuration listener\n if (m_configurationListener != null) {\n m_configurationListener.close();\n ... | [
{
"docid": "5722d3c777506d4473346dea6519814e",
"score": "0.8226353",
"text": "@Override\n\tpublic void stop(BundleContext bundleContext) throws Exception {\n\t}",
"title": ""
},
{
"docid": "5722d3c777506d4473346dea6519814e",
"score": "0.8226353",
"text": "@Override\n\tpublic void sto... |
e1441939b29a9b1d666aba70867e8910 | This method returns all news entries for a given keyword. | [
{
"docid": "e2eb4ff7bbed4cf6e227bfbce54bbe2e",
"score": "0.7687893",
"text": "public synchronized static List<NewsPojo> readByKeyword(String keyword) {\r\n\t\tList<NewsPojo> entries = new LinkedList<NewsPojo>();\r\n\t\tfor(NewsPojo pojo : new LinkedList<NewsPojo>(database.values())) {\r\n\t\t\tfor(Strin... | [
{
"docid": "95be66a2ac52238cfb58825bf975771f",
"score": "0.70873046",
"text": "public List<Article> retrieveArticlesOfGivenkeyword(String keyword);",
"title": ""
},
{
"docid": "7902c38045e6bd03d5230446e94fdda0",
"score": "0.65824836",
"text": "public Map<String, Object> listByKeyword... |
30dd15ec9ce9af2384c9dfa93da2b91c | MongoDB host of the specified database. string host = 3 [(.yandex.cloud.required) = true, (.yandex.cloud.length) = "<=253"]; | [
{
"docid": "234e6071c78f268e1452b52c1571e7db",
"score": "0.0",
"text": "@java.lang.Override\n public java.lang.String getHost() {\n java.lang.Object ref = host_;\n if (ref instanceof java.lang.String) {\n return (java.lang.String) ref;\n } else {\n ... | [
{
"docid": "6d6e64334199d4a4d05ee9887b00f6e3",
"score": "0.6430559",
"text": "void setDBHost(String dbHost) {\n\n\t}",
"title": ""
},
{
"docid": "f62e687f62b54af23186da786d7444d5",
"score": "0.6010737",
"text": "public static String getDBHost()\n {\n return RTConfig.getStri... |
2df385a197612cf5003fc226401bc00d | Delivers the punch line. | [
{
"docid": "b045b5710b49cd0509d51e0ebc2f2a08",
"score": "0.0",
"text": "public synchronized String who() {\n if (state != JokeState.INPROGRESS) {\n throw new IllegalStateException(\"Command 'who' only valid in INPROGRESS state, current state is \" + state);\n }\n state = ... | [
{
"docid": "8c8bca53f32fbce7cad64c767a6d092d",
"score": "0.6372956",
"text": "@Override\n\tpublic void punch() {\n\t\t\n\t}",
"title": ""
},
{
"docid": "8c8bca53f32fbce7cad64c767a6d092d",
"score": "0.6372956",
"text": "@Override\n\tpublic void punch() {\n\t\t\n\t}",
"title": ""
... |
54202006df4f65760269bb4da674f336 | Used to validate if the input is integer | [
{
"docid": "6e6febcd04c94c319e856222bfec27d4",
"score": "0.71365803",
"text": "public boolean validateInteger(String inputValue){\n try{\n if(Integer.valueOf(inputValue)>=0) {\n return true;\n }else{\n return false;\n }\n }\n catch(NumberFormatException exception){\... | [
{
"docid": "7df9903c342ff8b484d3d3c0840ca97f",
"score": "0.7860263",
"text": "public boolean isInt(TextField input) {\r\n //Using Exception handling try catch to validate the input of a text field\r\n try {\r\n Integer.parseInt(input.getText());\r\n //return true if t... |
3b5cbb68576e877b67453c71c7c7e539 | get list of GeoItem. | [
{
"docid": "0c02079ee3297648cc13f6e3f97c8d43",
"score": "0.8166448",
"text": "public List<GeoItem> getItems(){\r\n\t\t\treturn items_;\r\n\t\t}",
"title": ""
}
] | [
{
"docid": "d30359ba20a31d3bb14fb1913406d621",
"score": "0.8158934",
"text": "public final List<GeoItem> getItems(){\r\n\t\treturn items_;\r\n\t}",
"title": ""
},
{
"docid": "444a968dbb9a7f2849afb994642dde74",
"score": "0.68833065",
"text": "java.util.List<ie.gmit.ds.Item> \n ge... |
0b1738b6f516321d11aee8a214f92b8b | Draw Image at given position | [
{
"docid": "97c4341eb42585ac6f3b6f2b8964975c",
"score": "0.63038796",
"text": "public void draw(ImageIcon img, double x, double y, double xalign, double yalign) {\n int\n ix = (int)(x*unitx - xalign*img.getIconWidth ()),\n iy = (int)(y*unity - yalign*img.getIconHeight());\n img.paintIcon... | [
{
"docid": "acc35da39b2515644987c84ca30420c8",
"score": "0.76627463",
"text": "public void draw() {\r\n StdDraw.picture(this.xxPos, this.yyPos, \"images/\" + this.imgFileName);\r\n }",
"title": ""
},
{
"docid": "4085d17a1bdaf5bf02ab6457df252ce8",
"score": "0.7587554",
"text... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "2958929017ceb3237cab9fc1df45db5e",
"score": "0.0",
"text": "public int getGroupCount() {\n\t\treturn groups.size();\n\t}",
"title": ""
}
] | [
{
"docid": "1acc57d42c31dee937ac33ea6f2a5b0b",
"score": "0.68399656",
"text": "@Override\r\n\tpublic void comer() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "118f2b8a20f48999973063ac332d07d3",
"score": "0.6563993",
"text": "@Override\r\n\t\t\tpublic void atras() {\n\r\n\t\t\t}",
... |
4316ec4d3bde696444bc48bc44a78475 | Initializing values for account ID and balance. | [
{
"docid": "aec8f887bad96e2b25e62b8ff56202f4",
"score": "0.72065985",
"text": "public Account(int someId, double someBalance) {\n \n id=someId;\n balance=someBalance;\n dateCreated=new Date();\n }",
"title": ""
}
] | [
{
"docid": "9164bcab9d815e0f272e9fb7b3382aba",
"score": "0.74347514",
"text": "Account(String accountID, int balance){\r\n // Account constructor here\r\n setAccountID(accountID);\r\n setBalance(balance);\r\n }",
"title": ""
},
{
"docid": "2ee060662f7bdf7c78664713d4cf... |
784e902ada45e150115800df7156e0ff | make decision of whether spot is now active | [
{
"docid": "b7704c6c575104b708c9d79d1cc9fdc7",
"score": "0.6959227",
"text": "private boolean makedecision(String unique, int mins, int dollar, int cent) {\n Cursor res = helperDB.getInfo(unique);\n if (res.getCount() <= 0) {\n res.close();\n insertdata(unique, mins, ... | [
{
"docid": "728896d5270a3cfa53b25567bf42655b",
"score": "0.6825903",
"text": "private void updateCurrentSpot() {\n\t\tint point = planStatus.currentPoint;\n\t\tint command = planStatus.currentCommand;\n\n\t\tif(new PointCommand(point, command).isGreaterThan(isPlayingNow)) {\n\t\t\tif(planStatus.currentS... |
548dc6e18844022e010ad31fd6ca5e9b | Services provided by the host. repeated .yandex.cloud.mdb.mongodb.v1.Service services = 7; | [
{
"docid": "746bf7f05afc1ef84d60b09d286ccf72",
"score": "0.0",
"text": "public Builder addAllServices(\n java.lang.Iterable<? extends yandex.cloud.api.mdb.mongodb.v1.ClusterOuterClass.Service> values) {\n if (servicesBuilder_ == null) {\n ensureServicesIsMutable();\n co... | [
{
"docid": "b867b1ba1c5b118cd4bc5ecc77642d21",
"score": "0.7190634",
"text": "yandex.cloud.api.mdb.mongodb.v1.ClusterOuterClass.Service getServices(int index);",
"title": ""
},
{
"docid": "e446c220a7ff8efeeecb9f4a675dca68",
"score": "0.69651145",
"text": "java.util.List<yandex.cloud.... |
e414fe177a1ba79279a0981fde4c1146 | Interface to extract partition field from split. | [
{
"docid": "21e06de7d6c5f25fd3ba6af18450743e",
"score": "0.7281291",
"text": "@FunctionalInterface\n@Internal\npublic interface PartitionFieldExtractor<T extends FileSourceSplit> extends Serializable {\n\n Object extract(T split, String fieldName, LogicalType fieldType);\n\n static PartitionFieldE... | [
{
"docid": "295cefb7056120a64aefdf7a7bd381bd",
"score": "0.6508827",
"text": "public int getPartition(InternalElement element);",
"title": ""
},
{
"docid": "e2a440e4b6748a6c298dfa8321e356b8",
"score": "0.6313091",
"text": "public ShardedDataCollection<T> partition(Splitter<T> splitte... |
0dba1530e5589f0b46376a94ddc89f26 | If you want the chart to be 3D, set to true. | [
{
"docid": "1e799c4ef271880c0d1f9ba3d3bf0d1d",
"score": "0.55629945",
"text": "public final void setThreeD(final boolean threeD) {\n this.threeD = threeD;\n }",
"title": ""
}
] | [
{
"docid": "e30c55371bf5069dbeb60d066a8b2c72",
"score": "0.68783826",
"text": "public boolean isIs3d () {\n\t\treturn is3d;\n\t}",
"title": ""
},
{
"docid": "8c9d9e9966c78d22c96a57e3cb26abad",
"score": "0.68236256",
"text": "public XSSFView3D(XSSFChart chart) {\r\n\t\tCTChart ctChart... |
efcecb5cf4e244cd945d2b96a6ea781e | var btn1 = document.getElementsByTagName('a')[1]; btn1.click() | [
{
"docid": "57d13a2dd4f08b50fcbcf5e987cabf13",
"score": "0.6458964",
"text": "@Test(description = \"Click with JS executor\")\n public void test3(){\n driver.get(\"http://practice.cybertekschool.com/dynamic_loading\");\n //Example 1 is a beginning of the phrase <a href='http:'>Example 1... | [
{
"docid": "3be16ce00bf889f7d66f78a7aec1f962",
"score": "0.6843664",
"text": "public void click();",
"title": ""
},
{
"docid": "7a51bdcad15954eb8129e4da5106fe52",
"score": "0.6807318",
"text": "public void click() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "d94aaea298392d... |
d6266b9969d0200310ea7e84dc78da6f | Tool we need to parse other packages | [
{
"docid": "32e1f2b3ab80594e743321a62e4ad2b8",
"score": "0.0",
"text": "private boolean isAppInstalled(String packageName){\n\t\tPackageManager pm = getPackageManager();\n\t\t// True/False variable set to false by default, show \"Not Installed\"\n\t\tboolean app_installed = false;\n\t\t// If the app isn... | [
{
"docid": "37af552e2d0e39b71633d471882af98e",
"score": "0.62568206",
"text": "public void extractPackage();",
"title": ""
},
{
"docid": "8c2877522401e79fb049b75494c95e10",
"score": "0.59904885",
"text": "@Test\n public void testPackageHeader() {\n checkDecls(getParser().pa... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "7ff8b184c17af59f3f62017132650174",
"score": "0.0",
"text": "@Override\r\n\tpublic void resume() {\n\r\n\t}",
"title": ""
}
] | [
{
"docid": "e5fa0eebc721dea67da872fd14413bc7",
"score": "0.69744676",
"text": "@Override\n\tpublic void formule() {\n\t\t\n\t}",
"title": ""
},
{
"docid": "8b7f87c22e268a87686c66398c2c442b",
"score": "0.6936331",
"text": "@Override\r\n\t\t\tpublic void atras() {\n\t\t\t\t\r\n\t\t\t}"... |
d8de0358d1a6f5fe5456dd9e46054d79 | / Intent intent = new Intent(this, LoginActivity.class); startActivity(intent); finish(); | [
{
"docid": "fadd369386aba78d0c222a813e2f0be7",
"score": "0.0",
"text": "public void UnauthorizedProcessing() {\n }",
"title": ""
}
] | [
{
"docid": "55f20dd3969d9c3e407a42404ae5023a",
"score": "0.85512507",
"text": "@Override\n public void onClick(View v) {\n intent = new Intent(Register.this, Login.class);\n finish();\n startActivity(intent);\n }",
"title": ""
},
... |
76068b2e346b33d166eca51314b0d393 | Find main child VerbPhrase in a Sentence (couldn't be rootNode) Could be the highest VerbPhrase in a tree or its child | [
{
"docid": "71ff6a09517db941f72854722bed907c",
"score": "0.6524802",
"text": "public static SentenceNode mainChildVerbPhrase(SentenceNode rootNode) {\t\r\n\t\treturn mainPhrase(rootNode, SentenceType.VERB_PHRASE, false);\r\n\t}",
"title": ""
}
] | [
{
"docid": "ad4974cd868df7ca8ba3842bb12de215",
"score": "0.59806997",
"text": "public static SentenceNode mainVerbPhrase(SentenceNode rootNode) {\t\r\n\t\treturn mainPhrase(rootNode, SentenceType.VERB_PHRASE, true);\r\n\t}",
"title": ""
},
{
"docid": "3ec497f32ec2838e3408410fca57537d",
"... |
4d8f4b91d800bde2e7068682f2af4704 | ComputerPart Created by Alexander on 2016/10/19. | [
{
"docid": "0b231f294457795ecb3581941cdde5c0",
"score": "0.5072752",
"text": "public interface ComputerPart {\n void accept(ComputerPartVisitor computerPartVisitor);\n}",
"title": ""
}
] | [
{
"docid": "b74512d9f1ecf708957b49eab3aec70d",
"score": "0.61156905",
"text": "public Parts getProcessor() {\n return new Parts(\"Intel P 3\");\n }",
"title": ""
},
{
"docid": "dc59d82fd9ae72f430a8454347511b53",
"score": "0.6043592",
"text": "private Part getPart() {\n ... |
29e1406d3305a3e5199faa329ea1c1ed | Set creature's health point | [
{
"docid": "ab9c1afc00bef118124c1ed9ded98bd0",
"score": "0.69781274",
"text": "public void setHealth(final int health) {\n this.health = health;\n }",
"title": ""
}
] | [
{
"docid": "cc24bfe6307bae6846be94608d85663e",
"score": "0.7288193",
"text": "public void setHealth(int amt);",
"title": ""
},
{
"docid": "085b0003e4df03179738500e7cef79c6",
"score": "0.71582955",
"text": "protected void setMyHealth(final int theHP) {\n super.setMyCharacter_He... |
93cd919cfc8c0e20eec6828a911c1b60 | optional string gameName = 9; | [
{
"docid": "2dbf7b604acccd3e956f04c29a743a26",
"score": "0.0",
"text": "public Builder clearGameName() {\n bitField0_ = (bitField0_ & ~0x00000100);\n gameName_ = getDefaultInstance().getGameName();\n onChanged();\n return this;\n }",
"title": ""
}
] | [
{
"docid": "f4b60924cae940c33c1454fd29a9c5e2",
"score": "0.7374353",
"text": "void setGameName(String gameName);",
"title": ""
},
{
"docid": "3240b1713333e7e6ab95f178c5fd90d6",
"score": "0.72878647",
"text": "String getGameName();",
"title": ""
},
{
"docid": "b20218bb7046... |
6e516cd1f2cfbd409d955e54c204a00c | If you want to display a UI message about adding or removing geofences, put it here. | [
{
"docid": "6a84666548319acdaca9d41d7145666f",
"score": "0.5369049",
"text": "private void handleGeofenceStatus(Context context, Intent intent) {\n\n\t\t}",
"title": ""
}
] | [
{
"docid": "857e03f76ed3d9220de6d4cf7b7b957a",
"score": "0.68702936",
"text": "public void addGeofencesButtonHandler() {\n if (!mGoogleApiClient.isConnected()) {\n Toast.makeText(getActivity(), getString(R.string.not_connected), Toast.LENGTH_SHORT).show();\n return;\n ... |
b4a7413953b1639ad054542d00355ee9 | Checks whether the 'TradeAmount' field has been set. | [
{
"docid": "bd0237e4f539c9dfad7641fb3e682ec2",
"score": "0.7573264",
"text": "public boolean hasTradeAmount() {\n return fieldSetFlags()[9];\n }",
"title": ""
}
] | [
{
"docid": "75829a7151e3435925df37710b46a23e",
"score": "0.7088409",
"text": "public boolean isSetAmount()\n {\n synchronized (monitor())\n {\n check_orphaned();\n return get_store().count_elements(AMOUNT$4) != 0;\n }\n }",
"title": ""
},
{
"d... |
ad139a2dd11c9c37620d1cd61ed58863 | Replace a term with its definition so that we do not have to handle defined terms later on. | [
{
"docid": "710a684d5132411f497b6a0a116dc0e2",
"score": "0.72644264",
"text": "private Term replaceWithDefinition(Term result) {\n if (result instanceof ApplicationTerm) {\n FunctionSymbol func = ((ApplicationTerm) result).getFunction();\n if (!func.isIntern() && func.getDefinition() != nul... | [
{
"docid": "061f2d9a062b6c3d2cf709742ddc311f",
"score": "0.63857406",
"text": "protected abstract void dealWithTerm(Term term);",
"title": ""
},
{
"docid": "28ffe6ea4dc1fc905e239694462a1169",
"score": "0.62928784",
"text": "public void xsetTerm(org.apache.xmlbeans.XmlString term)\n ... |
bf5cd04bee0acaece7a6bd716552f6c9 | Make the wizard configuration panel registered under the given configuration panel key the most top configuration panel. If no configuration panel is registered under the given key, nothing will happen. | [
{
"docid": "4e76110fd2bfac9a1fb9d2f625cb6284",
"score": "0.72520995",
"text": "public void showConfigurationPanel(String key) {\n \t\tif (key == null) return;\n \n \t\tIWizardConfigurationPanel configPanel = getConfigurationPanel(key);\n \t\tif (configPanel != null && configPanel.getControl() != null) {... | [
{
"docid": "46761a63c3f2f64f59bb793a5ed49e7e",
"score": "0.7205854",
"text": "public IWizardConfigurationPanel getConfigurationPanel(String key) {\n \t\tif (key == null) return null;\n \t\treturn configurationPanels.get(key);\n \t}",
"title": ""
},
{
"docid": "3fad75b811a49b3415919204f92781f... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "3713a2a02e38e681ce7b32e5fbd8a328",
"score": "0.0",
"text": "@Override\r\n public void onProviderDisabled(String provider) {\n\r\n }",
"title": ""
}
] | [
{
"docid": "3d9823aba51891281b4bbd4b1818b970",
"score": "0.6671074",
"text": "@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "0b5b11f4251ace8b3d0f5ead186f7beb",
"score": "0.6567672",
"text": "@Override\n\tpublic void comer() {\n\t\t\n\t}",
"ti... |
050cfb5d5368ac0ab90d4e10656ef4df | Returns true if two dataTypes have the same sourceArchive and the same UniversalID OR are equivalent | [
{
"docid": "ccf49cfe95087046aa19ba35d2e9885e",
"score": "0.6124965",
"text": "public static boolean isSameOrEquivalentDataType(DataType dataType1, DataType dataType2) {\n\t\t// if they contain datatypes that have same ids, then they represent the same dataType\n\t\tif (isSameDataType(dataType1, dataType... | [
{
"docid": "92e2b75334864a791b241463db28dbf9",
"score": "0.7200206",
"text": "public static boolean isSameDataType(DataType dataType1, DataType dataType2) {\n\t\tUniversalID id1 = dataType1.getUniversalID();\n\t\tUniversalID id2 = dataType2.getUniversalID();\n\t\tif (id1 == null || id2 == null) {\n\t\t\... |
20b7b37eaf7e09439636407b30b0bf29 | $ANTLR end "rule__EFloat__Group_4__1" $ANTLR start "rule__EFloat__Group_4__1__Impl" InternalHouseBuilder.g:5082:1: rule__EFloat__Group_4__1__Impl : ( ( '' )? ) ; | [
{
"docid": "4f390fbb0cd1c782de9f954ff022dbae",
"score": "0.7036321",
"text": "public final void rule__EFloat__Group_4__1__Impl() throws RecognitionException {\n\n \t\tint stackSize = keepStackSize();\n \t\n try {\n // InternalHouseBuilder.g:5086:1: ( ( ( '-' )? ) )\n ... | [
{
"docid": "c7b364b1d5068d90bdfa36be9f23571c",
"score": "0.77171403",
"text": "public final void rule__EFloat__Group__4() throws RecognitionException {\n\n \t\tint stackSize = keepStackSize();\n \t\n try {\n // InternalHouseBuilder.g:5020:1: ( rule__EFloat__Group__4__Impl... |
bbc2429da6261986f3f20682c177561e | seta o valor de usuSenha | [
{
"docid": "dffa24d2e90b20947c889737852f1f0d",
"score": "0.80879194",
"text": "public void setUsuSenha(String pUsuSenha){\n this.usuSenha = pUsuSenha;\n }",
"title": ""
}
] | [
{
"docid": "fa06e25976944f679936c95244a469a6",
"score": "0.73617387",
"text": "public void setSenha(java.lang.String param){\n \n this.localSenha=param;\n \n\n }",
... |
44a629d20642e01f13e28fac0ff38923 | The constructor of a PackageRenamer class. | [
{
"docid": "1681681c48ba9a2c36b76e80fddba88f",
"score": "0.7811788",
"text": "public PackageRenamer() {\r\n this(getDefaultPropertiesFileName());\r\n }",
"title": ""
}
] | [
{
"docid": "38eb582012635895563e5402fe72efbe",
"score": "0.6784988",
"text": "private Renamer(){}",
"title": ""
},
{
"docid": "8fa5699885498022030bc15b85a3d0ff",
"score": "0.6410993",
"text": "private SpecificPackage() {}",
"title": ""
},
{
"docid": "322c3c5c23e9776a8c989... |
f661363358d7809ceb4bb4d4bdf1fefe | Convierte un FilmType en un FilmTypeDto | [
{
"docid": "cfbcfaa02ef48e3a10b06b9168937357",
"score": "0.75241077",
"text": "public FilmTypeDto convertEntityToDto(FilmType entity){\n\t\tFilmTypeDto dto = new FilmTypeDto();\n\t\tif(entity!=null){\n\t\t\tdto.setId(entity.getId());\n\t\t\tdto.setVersion(entity.getVersion());\n\t\t\tdto.setDescription(... | [
{
"docid": "a49ff2fe92f4673873347449c7fd33f7",
"score": "0.73104364",
"text": "public FilmType convertDtoToEntity(FilmTypeDto dto){\n\t\tFilmType entity = new FilmType();\n\t\tif(dto!=null){\n\t\t\tentity.setId(dto.getId());\n\t\t\tentity.setVersion(dto.getVersion());\n\t\t\tentity.setDescription(dto.ge... |
1063448ed81debe936d8d0c39c90e5bd | Metodo usado para obtener los registros de determinada pagina del listado de clientes en base a los criterios enviados. | [
{
"docid": "e8aed70d5a66d20e68ec062d60c0f96e",
"score": "0.591594",
"text": "public static void getClientPageByAjax(HttpServletRequest request,\r\n\t\t\tHttpServletResponse response, AppController controller)\r\n\tthrows Exception{\r\n\t\t//obtenemos el numero de pagina a obtener\r\n\t\tint pageNumber =... | [
{
"docid": "aeb027e53c9ec740752dcfaae4d00337",
"score": "0.63892424",
"text": "@RequestMapping(\"/cargaCliente\")\n\t@ResponseBody\n\tpublic List<Cliente> listaCliente(String filtro){\n\t\tint page = 0;\n\t\tint size = 5;\n\t\tPageable paginacion = PageRequest.of(page, size);\n\t\tList<Cliente> lstClien... |
2f5bd91bd67f9fb0cebabcae9a322e22 | Called when preparing to save a ship structure. Use this to prevent jump during critical events/animations. | [
{
"docid": "c229c18df96d5ce4021b2dbf5e5debe9",
"score": "0.0",
"text": "boolean isJumpReady(Entity entity);",
"title": ""
}
] | [
{
"docid": "d7fa4b99a4bd7311e9e24f0c1d3c0d29",
"score": "0.60701007",
"text": "private void emergencySave() {\n // FIXME: GameModule and GameState need save methods which take a filename\n /* \n final GameModule mod = GameModule.getGameModule();\n if (mod != null) mod.save(false);\n \n ... |
608432fe5e39b8884e66a2422cc2854b | Get any custom extras that were set on this playback state. | [
{
"docid": "640d9e50bd27e350d940ba5d8b35bf34",
"score": "0.59691966",
"text": "public @Nullable Bundle getExtras() {\n return mExtras;\n }",
"title": ""
}
] | [
{
"docid": "d390cd8780c33abe66c2ce8189e3a88a",
"score": "0.6634455",
"text": "public P getExtras() {\n return _extras;\n }",
"title": ""
},
{
"docid": "9001a63b8554f093cf6ed14a908829fd",
"score": "0.65600955",
"text": "public java.util.Map<CharSequence,CharSequence> getE... |
24ad821eb050b9c12c5a7e799ddf744b | Displays the zoom menu at the position p in the coordinate space of euclidianView | [
{
"docid": "242d8b0fa8b656bbb478ab9c1009872d",
"score": "0.60183275",
"text": "public void showDrawingPadPopup(Component invoker, Point p) {\n // clear highlighting and selections in views\n euclidianView.resetMode();\n \n // menu for drawing pane context menu\n DrawingPa... | [
{
"docid": "8eed535a57df449c6d319c1d5d9d0b36",
"score": "0.6653514",
"text": "private void ZoomToPoint( Point p )\n\t{\n\t JViewport port = (JViewport)this.getParent();\n\t\tRectangle visible = port.getViewRect();\n\n port.setViewPosition(new Point((int)(p.getX() - visible.getWidth()/2.0), (in... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "221f8f1e4ecc31d6163990420dc77775",
"score": "0.0",
"text": "@Override\r\n\tprotected void onPostExecute(String result) {\n\t\tsuper.onPostExecute(result);\r\n\t\tdialog.dismiss();\r\n\t\tListener.ShowResponse(result);\r\n\t}",
"title": ""
}
] | [
{
"docid": "05a606445504484958a1c21e14b7198e",
"score": "0.69474965",
"text": "@Override\r\n\tpublic void sapace() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "8619203d4867f5c6d05eb9a5354405c0",
"score": "0.6920049",
"text": "@Override\n\t\tpublic void pintate() {\n\t\t\t\n\t\t}",
... |
5c2d710fd1d4c37171e62e5102e1452e | This method was generated by MyBatis Generator. This method corresponds to the database table xxd_power_group | [
{
"docid": "1b1fd21bf98ceea45ac054f510877818",
"score": "0.49126518",
"text": "@UpdateProvider(type=XxdPowerGroupSqlProvider.class, method=\"updateByPrimaryKeySelective\")\n int updateByPrimaryKeySelective(XxdPowerGroup record);",
"title": ""
}
] | [
{
"docid": "7cd13e7f1febbf2e934fdf8d9712d446",
"score": "0.73799676",
"text": "@Select({\n \"select\",\n \"id, name, is_abled, powers, create_uid, create_time\",\n \"from xxd_power_group\",\n \"where id = #{id,jdbcType=INTEGER}\"\n })\n @Results({\n @Result(colum... |
3e3b3d9aa2e11f9bac18047fefda9605 | Log error here since request failed | [
{
"docid": "de165274849d72f45312d788edd4fe2c",
"score": "0.0",
"text": "@Override\n public void onFailure(Call<TransactionResponse> call, Throwable t) {\n mListener.onTransactionPost(false, CONNECTIVITY_ERROR, sellingTransaction);\n }",
"title": ""
... | [
{
"docid": "6e74eabd9c1be6ea76b1a6f096399249",
"score": "0.74736977",
"text": "@Override\r\n\tpublic void requestFailure(HttpRequest paramHttpRequest, Error paramError) {\n\t\tlogger.info(paramError.getJson());\r\n\t}",
"title": ""
},
{
"docid": "b8dd6414951adcf46864a15d298d926f",
"score... |
22025410e8fcefd2976c7f9a1f753ada | Configuration and resource allocation for a MongoDB 4.2 cluster. .yandex.cloud.mdb.mongodb.v1.Mongodb4_2 mongodb_4_2 = 7 [json_name = "mongodb_4_2"]; | [
{
"docid": "0ca6ed9f4188ed1bd0a7bb9787f2adb5",
"score": "0.0",
"text": "@java.lang.Override\n public yandex.cloud.api.mdb.mongodb.v1.ClusterOuterClass.Mongodb4_2 getMongodb42() {\n if (mongodb42Builder_ == null) {\n if (mongodbCase_ == 7) {\n return (yandex.cloud.api.mdb.... | [
{
"docid": "ff548296d1d0fbdbb082996ecc5244d4",
"score": "0.72971845",
"text": "yandex.cloud.api.mdb.mongodb.v1.ClusterOuterClass.Mongodb4_0 getMongodb40();",
"title": ""
},
{
"docid": "bca2cf70eadd0db68db8eb33283f819f",
"score": "0.70476484",
"text": "yandex.cloud.api.mdb.mongodb.v1.... |
7de4f532d6f2bbbb5dd21b5834a52437 | Write your code here. | [
{
"docid": "1be90d414f0375652f4ff2e42a40363b",
"score": "0.0",
"text": "public static void findSums(BinaryTree root, int sum, List<Integer> result) {\n if(root==null) {\n return;\n }\n sum += root.value;\n if(root.left==null && root.right==null) {\n result.add(sum);\n return;\... | [
{
"docid": "f3cfb95cfb17fcd88ce2871511ceb2a6",
"score": "0.6692841",
"text": "private static void masterCode() {\r\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "fc7bd0f673b6dc458ca933b0fabf22ab",
"score": "0.6234055",
"text": "public void writeCode() {\n System.out.println(\"Devel... |
1c0c24ab4ede279297f7ec5e4132bddc | Gets the attribute value for Descriptionregions, using the alias name Descriptionregions. | [
{
"docid": "f8d9f030c150572f0f1041cdf4b02d6a",
"score": "0.75531226",
"text": "public String getDescriptionregions() {\n return (String) getAttributeInternal(DESCRIPTIONREGIONS);\n }",
"title": ""
}
] | [
{
"docid": "d9e5ee5d9862469eba64c88aafbda2f2",
"score": "0.6049739",
"text": "java.lang.String getRegion();",
"title": ""
},
{
"docid": "50e862195b9bb58ee1f50f9d430ae8fa",
"score": "0.6004291",
"text": "String getRegionName();",
"title": ""
},
{
"docid": "346aadb3545a74db... |
a23167e08a48c651ad3cc5bad85978e1 | Test case number: 152 / 10 covered goals: Goal 1. org.apache.commons.math.util.MathUtils.round(DI)D: rootBranch Goal 2. Branch org.apache.commons.math.util.MathUtils.round(DI)D: rootBranch in context: org.apache.commons.math.util.MathUtils:round(DI)D Goal 3. org.apache.commons.math.util.MathUtils.round(DI)D: Line 935 G... | [
{
"docid": "81eef6e836861d014088716b95fca8c0",
"score": "0.5393215",
"text": "@Test\n public void test152() throws Throwable {\n double double0 = MathUtils.round(2.2250738585072014E-308, 0);\n }",
"title": ""
}
] | [
{
"docid": "1f12cd61c90f13a31f69739a09156bfb",
"score": "0.60821414",
"text": "@Test\n public void test008() throws Throwable {\n double double0 = MathUtils.round(195.965588, 13);\n }",
"title": ""
},
{
"docid": "35144cdc862bcc5a65dea0c411a879de",
"score": "0.58927506",
"tex... |
77acaf5d8df63b8dd9206cdd832cf45c | repeated double askPrice = 3; | [
{
"docid": "c1e3ef3f462726f60109689ee5b79512",
"score": "0.6237365",
"text": "int getAskPriceCount();",
"title": ""
}
] | [
{
"docid": "4de58ed4c99f13cba83fd3bef27ca879",
"score": "0.6568177",
"text": "double getAskPrice(int index);",
"title": ""
},
{
"docid": "b555851f237469617ea1648b908e4047",
"score": "0.64835477",
"text": "public void setPrice(double d){ price = d;}",
"title": ""
},
{
"doc... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "313b434341da43e5ddf7ce39e125f641",
"score": "0.0",
"text": "@Override\r\n\tpublic List<Candidate> toModels(List<InsertCandidateRequest> objects) {\n\t\treturn null;\r\n\t}",
"title": ""
}
] | [
{
"docid": "fd7df110e087032be8c98522c4493f41",
"score": "0.6681592",
"text": "@Override\n public void otvori() {\n }",
"title": ""
},
{
"docid": "fd7df110e087032be8c98522c4493f41",
"score": "0.6681592",
"text": "@Override\n public void otvori() {\n ... |
099d4b157c39b3dba2b818a55942b913 | Checks whether the device currently has a network connection. | [
{
"docid": "54fea8bbefa3c440e015696adb0d2683",
"score": "0.0",
"text": "public static boolean isDeviceOnline(Context ctx) {\n ConnectivityManager connMgr =\n (ConnectivityManager) ctx.getSystemService(Context.CONNECTIVITY_SERVICE);\n NetworkInfo networkInfo = connMgr.getActi... | [
{
"docid": "6bcc8f2bc812fa8f651e42cd7dc44dd7",
"score": "0.8192676",
"text": "private boolean networkConnected() {\n ConnectivityManager cManager = (ConnectivityManager)getSystemService(Context.CONNECTIVITY_SERVICE);\n NetworkInfo nInfo = cManager.getActiveNetworkInfo();\n return nI... |
0e90f5a9a61b9c5aca54fd26a815dc5d | repeated .br.com.zup.edu.ListaChavesPixResponse.ChavePix chaves = 2; | [
{
"docid": "d725b3bea15264ba53c5409e5b5c6c8e",
"score": "0.6278921",
"text": "@java.lang.Override\n public java.util.List<? extends br.com.zup.edu.ListaChavesPixResponse.ChavePixOrBuilder> \n getChavesOrBuilderList() {\n return chaves_;\n }",
"title": ""
}
] | [
{
"docid": "218e0c54f4cecf9bd8d674744c900630",
"score": "0.6078204",
"text": "@java.lang.Override\n public br.com.zup.edu.ListaChavesPixResponse.ChavePixOrBuilder getChavesOrBuilder(\n int index) {\n return chaves_.get(index);\n }",
"title": ""
},
{
"docid": "770841f61ef8322c1e6b1c... |
ef8a474544d8ab3276c7faeef9156ff2 | A method that verifies a signature. | [
{
"docid": "a3496fd2ffbbb9a3a4cbafdb2732bfba",
"score": "0.7474153",
"text": "@FunctionalInterface\npublic interface SignatureVerifier {\n\n /**\n * Check if a signature is valid.\n *\n * @param signature the signature to check\n * @param bytes the data that was signed\n * @pa... | [
{
"docid": "32108f50e8d6937c9bc2ae1e6db3c331",
"score": "0.74085665",
"text": "boolean hasSignature();",
"title": ""
},
{
"docid": "32108f50e8d6937c9bc2ae1e6db3c331",
"score": "0.74085665",
"text": "boolean hasSignature();",
"title": ""
},
{
"docid": "32108f50e8d6937c9bc2... |
48a6dd3f288696be404795b2217b56e6 | Constructor this runs first | [
{
"docid": "56ea7df2b69bdc24c0411a02b09c5c3e",
"score": "0.0",
"text": "CharacterSelect() { \r\n super(\"Character Select\");\r\n this.thisFrame = this; \r\n \r\n //configure the window\r\n this.setSize(1800,900); \r\n this.setLocationRelativeTo(null); //start the frame in the cente... | [
{
"docid": "bde5f3a2215c80950a972a2c396ea45b",
"score": "0.73564255",
"text": "@Override void init() {\n }",
"title": ""
},
{
"docid": "96950fcd6668067c4f88772215663192",
"score": "0.72548103",
"text": "private void init() {\n\t\t\n\t\t\n\t}",
"title": ""
},
{
"docid... |
079a940755074ad511c68febb28bf081 | Represents the configuration of a single message. | [
{
"docid": "89135c60b50ae3faf605e5807e7be66e",
"score": "0.4931268",
"text": "public interface Message {\n\n\t/**\n\t * Represents the text of the message.\n\t */\n\tString getText();\n\n\t/**\n\t * Represents the kind of message. It could be useful for presentation\n\t * layer.\n\t */\n\tSeverityType g... | [
{
"docid": "127cc030b81199ed18622e6bb9f5ec8f",
"score": "0.63738465",
"text": "public static String getConfigMessage() {\n\t return getConfig() + \"/message\";\n }",
"title": ""
},
{
"docid": "36d3f93d2d8e9c44a36a7262504b0edd",
"score": "0.61476505",
"text": "public voi... |
801ae9a24c789ae789ee889e2cae8342 | main method to start java application | [
{
"docid": "37cd06eabbb6ab3ba5135f47684dd475",
"score": "0.0",
"text": "public static void main(String[] args) throws Exception {\r\n\t\t\r\n\t\t//validate argument\r\n\t\tif (args.length != 1){\r\n\t\t\tSystem.out.println(\"Usage: java ServerGUI <server port>\");\r\n\t\t\treturn;\r\n\t\t}\r\n\t\t\r\n\t... | [
{
"docid": "28b10a83103acb544a19549571ca5003",
"score": "0.7517752",
"text": "public static void main(String[] args) {\n\t\t\r\n\t\tStartApp();\r\n\t\t\t\r\n\t}",
"title": ""
},
{
"docid": "dfed6b0616bc419c7050fdc08532065d",
"score": "0.7484647",
"text": "public static void main(Stri... |
fe15917634ec951649328c130cd2598d | TODO: This may need to be richer so we keep the context path | [
{
"docid": "c9830829c844d6f3aaae254a53c0cbf4",
"score": "0.0",
"text": "@InputFiles\n\tpublic abstract ConfigurableFileCollection getSources();",
"title": ""
}
] | [
{
"docid": "84a6c652ecac988c92cff35a4c7134b8",
"score": "0.75380933",
"text": "String getContextPath();",
"title": ""
},
{
"docid": "38a600a33fa3b7ffd59316a9e89dbfd1",
"score": "0.72840524",
"text": "@Override\n\t\tpublic String getContextPath() {\n\t\t\treturn null;\n\t\t}",
"ti... |
69bd7fbaa38ed22ae5b199ff7891b3d8 | Get the provisioningState value. | [
{
"docid": "9dd6b54e3e5248358ebd7c9c99ce782c",
"score": "0.82280445",
"text": "public String provisioningState() {\n return this.provisioningState;\n }",
"title": ""
}
] | [
{
"docid": "6791d1b2a2253b0cd5e0c87c7ca84e80",
"score": "0.8168732",
"text": "public String provisioningState() {\n return this.innerProperties() == null ? null : this.innerProperties().provisioningState();\n }",
"title": ""
},
{
"docid": "6791d1b2a2253b0cd5e0c87c7ca84e80",
"sc... |
caa7c6c6562517640b1de476b6fc1549 | Method returns list of before sketch object | [
{
"docid": "4ded258838eabbaadcc71ac915e95075",
"score": "0.0",
"text": "public List<Object> getBeforeSketchListMax(String function, String jobLevel, int recordIndex) throws DAOException;",
"title": ""
}
] | [
{
"docid": "7d16066e52cc282a268e9605bea57a7d",
"score": "0.66637784",
"text": "private ArrayList<EffectItem> getSketch() {\n ArrayList<EffectItem> arrayList = new ArrayList<EffectTypeResource.EffectItem>();\n// int[] effects = {62, 61, 60, /* 7 */ 30, 31, 32, 33, 34, 35, 36, 37};\n// ... |
e6fe302b83d4e42d63e7467643aa390b | Return an AmusingPreciseNumber that is the absolute value of numb and leave numb unchanged. | [
{
"docid": "53d1f77a628b2357d61a10789ff000f8",
"score": "0.8576158",
"text": "public static AmusingPreciseNumber abs(AmusingPreciseNumber numb)\r\n\t{\r\n\t\tAmusingPreciseNumber absolute = new AmusingPreciseNumber(numb);\r\n\t\tabsolute.abs();\r\n\t\treturn absolute;\r\n\t}",
"title": ""
}
] | [
{
"docid": "ca3064f0ba203f6f6e6aa3ce9be1bc2c",
"score": "0.72675794",
"text": "public static AmusingPreciseNumber negate(AmusingPreciseNumber numb)\r\n\t{\r\n\t\tAmusingPreciseNumber negated = new AmusingPreciseNumber(numb);\r\n\t\tnegated.negate();\r\n\t\treturn negated;\r\n\t}",
"title": ""
},
... |
54e9f5bc4f3c489e2c086f7198fb989f | Stores all information about the entry type in preferences, with the tag given by number. | [
{
"docid": "9b29a0781f3448b733e195bb912019f0",
"score": "0.63928276",
"text": "public void storeCustomEntryType(CustomEntryType tp, int number) {\n\t\tString nr = \"\" + number;\n\t\tput(JabRefPreferences.CUSTOM_TYPE_NAME + nr, tp.getName());\n\t\tput(JabRefPreferences.CUSTOM_TYPE_REQ + nr, tp.getRequir... | [
{
"docid": "14e84e7390edffb2ba4b58ba4dfe2ca1",
"score": "0.57063496",
"text": "public void storePreferences(){\n prefs.putInt(prefsKey(),getBitValue());\n setModified(false);\n }",
"title": ""
},
{
"docid": "b9e8683a08ff4b79f37134eccb541188",
"score": "0.5556908",
"t... |
16fae05e2d278d19e72d42f5c0e21aca | id = usernameTextField.getText(), pw = passwordTextField.getText() | [
{
"docid": "44b8899f11afe87541595e581c298c02",
"score": "0.0",
"text": "public Boolean CheckCredentials(String id, String pw){\n \n readFile(\"Accounts.txt\");\n for(int i=0; i<tableRows.length; i++){ //for each row...\n String row = tableRows[i].toString().trim();\n ... | [
{
"docid": "002f109195353e6b506c7808109a2861",
"score": "0.7116491",
"text": "@Override\r\n public void onClick(View v) {\n if (!validatePassword() | !validateUsername()) {\r\n return;\r\n }\r\n\r\n ... |
2866df71421903b4a062cdde7502bd8f | Gets the new pass. | [
{
"docid": "6a45dd314d0916c5a8f3adaef9072e3b",
"score": "0.85145557",
"text": "public String getNewPass() {\n return this.newPass;\n }",
"title": ""
}
] | [
{
"docid": "bc3f342e4c950b69553db31923470878",
"score": "0.7585089",
"text": "public String getOldPass() {\n return this.oldPass;\n }",
"title": ""
},
{
"docid": "543af1f882ffa605df82b99b3ea822e8",
"score": "0.7549144",
"text": "public int getPass() {\n return pass_;\n... |
1ac6c9ecc05973946c69c2617d3a8af3 | Creates new form searchbycoveringpurity | [
{
"docid": "2e97e8ff60d4338656325be7d2d9c784",
"score": "0.5249219",
"text": "public searchbycoveringpurity() {\r\n \tsetTitle(\"ITEMIZATION - Search By Purity (Covering)\");\r\n \tsetIconImage(Toolkit.getDefaultToolkit().getImage(searchbycoveringpurity.class.getResource(\"/images/itemization_log... | [
{
"docid": "6d781e46f35717035c0e894b47148cc7",
"score": "0.61698955",
"text": "void searchPatient() {\n \t_searchViewStage = new Stage();\n \t\n\t\tSearchViewController<Patient> patientSearchViewController = new SearchViewController<Patient>(Patient.class);\n\t\tpatientSearchViewController.addCons... |
1922bbc5cbecb76b24158f51d56d89d9 | Returns the Gson instance used by the connection | [
{
"docid": "4b7e14491dee3c372a1a64d80c422f7f",
"score": "0.752388",
"text": "Gson getGson();",
"title": ""
}
] | [
{
"docid": "475edca253746992e14d3392bc403e32",
"score": "0.7790373",
"text": "public static GsonImpl get() {\n if (json == null) {\n //json = new FastJson();\n json = new GsonImpl();\n }\n return json;\n }",
"title": ""
},
{
"docid": "ee192a1a1b3... |
935cc44dbafde454099a848948e1851d | caja general ofcina tal | [
{
"docid": "c9d429020a76ba81ce6ab3d86c66056b",
"score": "0.0",
"text": "private void cargarComboCaja(){\r\n\t\ttry {\t\t\t\r\n\t\t\tLong oficinaId=((OficinaIf) this.getCmbOficina().getSelectedItem()).getId();\t\r\n\t\t\tSystem.out.println(\"OFICINA>\"+oficinaId);\r\n\t\t\tList listaPrecios = (List) Sess... | [
{
"docid": "3af1d4fc409dfa21196a10078858b3ff",
"score": "0.6398611",
"text": "private static void tecla() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "66d35f847e02793f3b05ca06dad0ab7b",
"score": "0.603308",
"text": "V afegir(K clau);",
"title": ""
},
{
"docid": "e8c159f9ce... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "cecafdaf1d270f5da514f86df2502090",
"score": "0.0",
"text": "@Override\n\tpublic boolean keyTyped(char character) {\n\t\treturn false;\n\t}",
"title": ""
}
] | [
{
"docid": "81005989525ec80103fbaf46f9c37779",
"score": "0.6694239",
"text": "@Override\n\tpublic void agit() {\n\n\t}",
"title": ""
},
{
"docid": "0b5b11f4251ace8b3d0f5ead186f7beb",
"score": "0.65686274",
"text": "@Override\n\tpublic void comer() {\n\t\t\n\t}",
"title": ""
},
... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "7317708cbcbc76fa1d1f4b01af103098",
"score": "0.0",
"text": "@Override\n\tprotected void onCreate(Bundle savedInstanceState) {\n\t\tsuper.onCreate(savedInstanceState);\n\t\tsetContentView(R.layout.help);\n\t\tfindViewById(R.id.Help_ExitButton).setOnClickListener(this);\n\t\tfindViewById(R.id.... | [
{
"docid": "b7c706d331e2b507ec0ff8404ad87dc7",
"score": "0.69742316",
"text": "@Override\r\n\t\t\tpublic void crispel() {\n\t\t\t\t\r\n\t\t\t}",
"title": ""
},
{
"docid": "76b3966c8e3f64884c4127d1a3df09a8",
"score": "0.68059677",
"text": "@Override\r\n\t\t\tpublic void maruti() {\n\t... |
5b30be86a95e4c325c600c0ca505cddc | List the feeds which this feed is following. | [
{
"docid": "2e9dfd79627aa38f328b5eb6aabe8394",
"score": "0.7610114",
"text": "List<FeedFollow> getFollowing() throws IOException, StreamClientException;",
"title": ""
}
] | [
{
"docid": "2ed3186d69995f7afbfe00e82affa13b",
"score": "0.7484138",
"text": "List<FeedFollow> getFollowing(FeedFilter filter) throws IOException, StreamClientException;",
"title": ""
},
{
"docid": "1f68ded23ff8ffb638f173d2ed569570",
"score": "0.7406551",
"text": "List<FeedFollow> ge... |
3b2f3fee11b074d535ac9e36e4db8a62 | / JADX WARNING: Removed duplicated region for block: B:24:0x004c A[SYNTHETIC, Splitter:B:24:0x004c] / Code decompiled incorrectly, please refer to instructions dump. | [
{
"docid": "08684608216a0a25eb9304a5930db2f6",
"score": "0.0",
"text": "public static java.lang.String getFileName(java.lang.String r10) {\n /*\n java.lang.String r1 = \"\"\n java.io.File r3 = new java.io.File\n r3.<init>(r10)\n r5 = 0\n java... | [
{
"docid": "9c8fcadc97a7f2dafc06991ee7cecaab",
"score": "0.5549786",
"text": "public void handlesBlockingRegionDrag() {\r\n \t\tObject[] cells = graph.getDescendants(graph.getSelectionCells());\r\n \t\t// Put cells not in a blocking region to back\r\n \t\tHashSet<Object> putBack = new HashSet<Object>();... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "93e94f13253a33688141feb5caceabed",
"score": "0.0",
"text": "@Override\n\tpublic Integer tenderDesignDelete(TenderDesign tenderDesign) {\n\t\treturn null;\n\t}",
"title": ""
}
] | [
{
"docid": "1acc57d42c31dee937ac33ea6f2a5b0b",
"score": "0.68399656",
"text": "@Override\r\n\tpublic void comer() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "0c69424878be03e50f19e2ca61ef640b",
"score": "0.68002176",
"text": "@Override\r\n\tpublic void leggi() {\n\t\t\r\n\t}",
"ti... |
d3ac542854b74f0c9152cce894ca845b | repeated .dstore.engine.MetaInformation meta_information = 2; | [
{
"docid": "402dd3b1dcd6dee124d06cde0329399f",
"score": "0.55095315",
"text": "public io.dstore.engine.MetaInformation.Builder addMetaInformationBuilder() {\n return getMetaInformationFieldBuilder().addBuilder(\n io.dstore.engine.MetaInformation.getDefaultInstance());\n }",
"t... | [
{
"docid": "9eb6bd4be12bb9ad5710f390745d0e11",
"score": "0.67620784",
"text": "io.dstore.engine.MetaInformation getMetaInformation(int index);",
"title": ""
},
{
"docid": "9eb6bd4be12bb9ad5710f390745d0e11",
"score": "0.67620784",
"text": "io.dstore.engine.MetaInformation getMetaInfor... |
263dcb9838302d75cdd3db372cfbdb5b | Inflate the layout for this fragment | [
{
"docid": "9e1c027381a4cee5fffbe07372f5dcaf",
"score": "0.0",
"text": "@Override\n public View onCreateView(LayoutInflater inflater, ViewGroup container,\n Bundle savedInstanceState) {\n View view = inflater.inflate(R.layout.fragment_blank, container, false);\n ... | [
{
"docid": "8b5df47011cc799d795dc7120e1c0c49",
"score": "0.68263656",
"text": "@Override\n public View onCreateView(LayoutInflater inflater, ViewGroup container, Bundle savedInstanceState) {\n return inflater.inflate(R.layout.kuliahfragisidata, container, false);\n }",
"title": ""
},
... |
da30534579fa862f8a2b57bae233f0d9 | Generates a new instance of a Divider item. | [
{
"docid": "38c1c240e37742e4eeb22dc248c5fd4a",
"score": "0.7674779",
"text": "public DividerApi newItem();",
"title": ""
}
] | [
{
"docid": "5cf2321c94e55768abca5a0eb6f6cc8c",
"score": "0.6995673",
"text": "public interface DividerApi extends DesignItemApi\n{\n /**\n * Generates a new instance of a Divider item.\n * @return the new Divider\n */\n public DividerApi newItem();\n}",
"title": ""
},
{
"do... |
49a613141457e3366104e9ee230917db | Constructor for the Section object. | [
{
"docid": "0b550137123a4fcc1e6c2a05e08f017f",
"score": "0.66714084",
"text": "public Section(String n, TrackModelPanel tmp, Line ln)\r\n\t{\r\n\t\tthis.secName = n;\r\n\t\tthis.tmp = tmp;\r\n\t\tbList = new ArrayList<Block>();\r\n\t\tthis.bList = new ArrayList<Block>();\r\n\t\tsecsComing = new ArrayLis... | [
{
"docid": "4c6823aed9c7691e4446064b7c80dbac",
"score": "0.7931723",
"text": "protected Section() {\n title = new Paragraph();\n numberDepth = 1;\n }",
"title": ""
},
{
"docid": "ff9ae572f5a40104ce15ca7c82e2f05c",
"score": "0.79276407",
"text": "public Section()\n {... |
59dd0a6c5cf26d61c52f9eb1f558d4f4 | Util method to write an attribute without the ns prefix | [
{
"docid": "6cf7f91717851719d66f413e948c381e",
"score": "0.0",
"text": "private void writeQNameAttribute(java.lang.String namespace, java.lang.String attName,\n javax.xml.namespace.QName qname, javax.xml.stream.XMLStreamWriter xmlWriter) throws javax.xml.strea... | [
{
"docid": "4032b8c44c9067682aec7c95df9e1e42",
"score": "0.7247223",
"text": "private void writeAttribute(java.lang.String namespace,java.lang.String attName,\r\n java.lang.String attValue,javax.xml.stream.XMLStreamWriter xmlWriter) throws javax.xml.stream.XMLStreamE... |
33f9b2d39091927d950a0150404bf876 | Generic method for calculating a screen coordinate from a geographic coordinate. | [
{
"docid": "51b1007bc244522d8cf5005e9a000743",
"score": "0.0",
"text": "private int coordPyGen(double lat, double top, double bottom, int vertMiddle, int pySize, double range) {\r\n\t\tif (vertMiddle > 0) {\r\n\t\t\tif (lat < bottom)\r\n\t\t\t\treturn (int) Math.round((double) (vertMiddle * (1 - (lat + ... | [
{
"docid": "3bce30f293309f5825c37ce73482e692",
"score": "0.67490643",
"text": "public Point getScreenCoordinate(double lat, double lon) {\n if(internalNative == null) {\n if(internalLightweightCmp != null) {\n Point p = internalLightweightCmp.getPointFromCoord(new Coord... |
1df06e7a0b17bf7664a2bd2d84fb4ff8 | minimum edges required to make all n nodes connected is n1; | [
{
"docid": "a51fe524f24183d4bdc054b90090cb44",
"score": "0.5588672",
"text": "public int makeConnected(int n, int[][] connections) {\n if(connections.length<n-1)return -1;\n \n\n List<Integer>[] graph=new ArrayList[n];\n for(int i=0;i<n;i++){\n graph[i]=new ArrayLi... | [
{
"docid": "82090d35f8cea796d7a53cf37501afec",
"score": "0.64550936",
"text": "int getGraphMin();",
"title": ""
},
{
"docid": "f755d0b159150af59f3f2dec66f5f62a",
"score": "0.6360062",
"text": "public ArrayList<Edge> connectVertex_firstNInThreshold(Vertex v, ArrayList<Vertex> graph, d... |
66355dd04e89a1ed107561768d5847ab | SliderWert hat sich geaendert | [
{
"docid": "e441b545684b71ab715874d11f97b2ab",
"score": "0.0",
"text": "@Override\n\t\t\tpublic void changed(ObservableValue<? extends Number> v,//\n\t\t\t\t\tNumber oldValue, Number newValue) {\n\t\t\t\tnotifer.run();\n\t\t\t}",
"title": ""
}
] | [
{
"docid": "4fe550d0cac5bcf020e6d918f1ddb44a",
"score": "0.70334727",
"text": "public void updateSlider() \n { \n /* [GNPP] you may comment out if not debugging. */\n //gnpp.updateSlider();\n }",
"title": ""
},
{
"docid": "d66dc769fe5df9b3c6bed256bbca55b0",
"score": "0.6729305",
... |
65af2e8880dd53911dc076278997338d | / Since the superclass is not abstract, this requires an explicit binding to the subclass config class else Guice will create a new instance of config | [
{
"docid": "6138ef66a5734db7278cc6a04256ba62",
"score": "0.5992532",
"text": "@Override\n protected void configure() {\n bind(ThirdEyeConfiguration.class).to(ThirdEyeDashboardConfiguration.class);\n bind(ThirdEyeDashboardConfiguration.class).toInstance(config);\n bind(TimeSeriesLoader.class).t... | [
{
"docid": "f8c1b80e443ae3f177288556b826c6f4",
"score": "0.660099",
"text": "@Override\n protected void configure() {\n bind(GenerationConfigSource.class).toInstance(generationConfigSource);\n\n // Bind providers - used to retrieve implementations based on user input\n bind(Decis... |
8682b3f64df9756f53e2f8913e46fbc1 | Return the number of elements currently in the queue. | [
{
"docid": "3b931dd8c9b2d6a264414a47064a8ca0",
"score": "0.0",
"text": "public int size();",
"title": ""
}
] | [
{
"docid": "9caf871036aedac15409b1d6943480fe",
"score": "0.8363061",
"text": "public int size() {\n return queue.size();\n }",
"title": ""
},
{
"docid": "114824896030a049bbd1e1b3b8a75723",
"score": "0.83550394",
"text": "public int size() {\n\t\treturn queue.size();\n\t}",
... |
ff8b8a1d6d8486364f1f8e3c87b98c41 | backtrack. for given combination, if number of ) > (, then discard the it | [
{
"docid": "6d834e6a023b3146dd25dcd10426ac95",
"score": "0.0",
"text": "public List<String> generateParenthesis(int n) {\n backTrack(0,0,\"\",n);\n return ans;\n }",
"title": ""
}
] | [
{
"docid": "484aff52d60275dd5a712d8610def3d3",
"score": "0.5677479",
"text": "Set<Set<T>> getAllBarelyPassingCombinations();",
"title": ""
},
{
"docid": "99a2e95f037bf436db3ee3d25af7e336",
"score": "0.5429457",
"text": "public static void main(String[] args) {\n Scanner scanne... |
481d167c9c533fc9653f69f53188ee3f | Should be serialized as "warnings" | [
{
"docid": "7ccdd1f19ce55b254fa50083e1e84521",
"score": "0.7101745",
"text": "String getWarningsString();",
"title": ""
}
] | [
{
"docid": "15b5bb9a0be549b7b3c8d4017e5f0059",
"score": "0.70417273",
"text": "@javax.annotation.Nullable\n @ApiModelProperty(value = \"Contains warnings about possible misuse.\")\n\n public Object getWarnings() {\n return warnings;\n }",
"title": ""
},
{
"docid": "eb87673dd07c7efdb746... |
21377f446d35c4a026e15d36b8a8745c | recogemos los parametros necesarios | [
{
"docid": "e4e6ef164b511981ad3c1601b56ca4f9",
"score": "0.0",
"text": "public String borrarVenta(){\n FacesContext facesContext = FacesContext.getCurrentInstance();\r\n HttpSession session = (HttpSession) facesContext.getExternalContext().getSession(false);\r\n String idVenta... | [
{
"docid": "25b01e1b9000cd5a750b185847405d80",
"score": "0.66812414",
"text": "@Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n // jika id kosong maka simpan, jika id ada nilainya maka ubah\n ... |