Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with tuples
Search options answers only
not deleted
user 19530
1
vote
Tuples with more criteria
Edit:
If you are sure that you cannot hold all the tuples in memory but can hold all the selected tuples in memory, you can chunk the list. … _] := OddQ@Last@First@pr && EvenQ@Last@Last@pr
getTuples[ids_, crit_] := Select[Tuples[chunks[[ids]]], crit]
ParallelMap[getTuples[#, multcrit] &, Tuples[idxs, n]] (* can catenate this *)
What you really …
- 13.8k
3
votes
Delete duplicates in tuples
pts = Subdivide[-1, 1., 40] (* your example has this the same for all *)
prs = Tuples[{pts, pts}] (* all possible pairs *)
sames = Join[#, #] & /@ prs
xxyy01 = Subsets[prs, {2}] (* all possible pair …
- 13.8k