At the moment I can get the results I need with two seperate SELECT statements SELECT COUNT(rl.refBiblioID) FROM biblioList bl LEFT JOIN refList rl ON bl.biblioID = rl.biblioID GROUP BY bl.biblioID SELECT GROUP_CONCAT( CONCAT_WS( ':', al.lastName, al.firstName ) ORDER BY al.authorID ) FROM biblioList bl LEFT JOIN biblio_author b...
Hi everyone, Given 2 arrays Array1 = {a,b,c...n} and Array2 = {10,20,15....x} .. how can i generate all possible combination as Strings a(i) b(j) c(k) n(p) where 1 <= i <= 10, 1 <= j <= 20 , 1 <= k <= 15, .... 1 <= p <= x such as a1 b1 c1 .... n1 a1 b1 c1..... n2 ...... ...... a10 b20 c15 nx (last combination) So in all t...
I was given a puzzle as a present. It consists of 4 cubes, arranged side by side. The faces of each cube are one of four colours. To solve the puzzle, the cubes must be orientated so that all four cubes' tops are different, all their fronts are different, all their backs are different and all their bottom's are different. The left and r...
Given two lists, I can produce a list of all permutations the Cartesian Product of these two lists: permute :: [a] -> [a] -> [[a]] permute xs ys = [ [x, y] | x <- xs, y <- ys ] Example> permute [1,2] [3,4] == [ [1,3], [1,4], [2,3], [2,4] ] How do I extend permute so that instead of taking two lists, it takes a list (length n) of list...
There are two tables: table A and table B. They have the same columns and the data is practically identical. They both have auto-incremented IDs, the only difference between the two is that they have different IDs for the same records. Among the columns, there is an IDENTIFIER column which is not unique, i.e. there are (very few) record...
I'm looking for an example of how, in Ruby, a C like language, or pseudo code, to create the Cartesian product of a variable number of arrays of integers, each of differing length, and step through the results in a particular order: So given, [1,2,3],[1,2,3],[1,2,3]: [1, 1, 1] [2, 1, 1] [1, 2, 1] [1, 1, 2] [2, 2, 1] [1, 2, 2] [2, 1, 2]...
hi, I came across a specific problem and looking for some algorithm for it. The problem to solve is as described below. Let's say we have combinations like below 1 - 3 - 5 1 - 4 - 5 1 - 8 - 5 2 - 4 - 5 3 - 4 - 5 2 - 4 - 7 These combinations were generated from given sets, in this particular case let's say from {1},{3,4,8},{5} ...
On reading the documentation of the MySQL join commands, it looks like all the joins are analogous to , by simply finding the Cartesian product and then selecting from that result. Is this an accurate assumption? Should I instead write my own sub-queries and select from those? ...
I have 2 variables - a and b. I need to fill up k places using these variables. So if k = 3 output should be [a,a,a], [a,a,b] , [a,b,a], [b,a,a], [a,b,b], [b,a,b], [b,b,a] and [b,b,b] Input - k Output - All the combinations How do I code this in Python? Can itertools be of any help here? ...
Dear all, Given a variable that takes on, say, three values, I'm trying to generate all possible combinations of, say, triplets of these variables. While this code does the trick, site_range=[0,1,2] states = [(s0,s1,s2) for s0 in site_range for s1 in site_range for s2 in site_range] it's somewhat, uhm, clumsy, and is only getting...
As the title states, does Ruby allow Cartesian product types? I can't find anything on it anywhere. Thanks ...