Using itertools and permutation() to get all unique combinations of two lists is easy. For instance, if I had: ['a', 'b'] [1, 2]  I could easily get: [   [('a',1),('b',2)],   [('a',2),('b',1)] ]  However, what I really want is to allow duplicate pairings. Each item in the larger list will be unique, but the number of combinations would be exponential, since the same item in the first list could get assigned to multiple items in the second list. So for the two lists above, I would get: [   [('a',1),('a',2)],   [('a',1),('b',2)],   [('b',1),('a',2)]   [('b',1),('b',2)] ]  If I had three items in each of the two lists, I would end up with 27 results. What would be the best approach to this?
How can I get the Cartesian product (every possible combination of values) from a group of lists?  Input:   somelists = [    [1, 2, 3],    ['a', 'b'],    [4, 5] ]   Desired output:  [(1, 'a', 4), (1, 'a', 5), (1, 'b', 4), (1, 'b', 5), (2, 'a', 4), (2, 'a', 5) ...]
Cron fails with exit status 127 Why has a circle when the point light through my glass？ I found there is a circle when the point light through my glass material using the circle render.  How could I solve it? Background reflected in glossy glass, but I didn't set it I've made a roughness 0 glass pane, when I'm in lookdev mode it's reflecting a background that I didn't put there. I know I could just ignore it, but I'd rather be able to see what it'll mostly look like when I'm in the later stages. I also just want to know how on Earth I managed to set this background without realising it  Reflection completely ignores any objects I put in front of it. If I placed this glass inside my house, it would still just reflect trees (This is the point where I felt I couldn't ignore it - reflections are going to play a big part in my project and I don't want to be in render mode all the time)  The nodes are the default glass BSDF, except I set roughness to 0  The glass is set to 20mm thick, if that makes a difference  The background moves with my perspective and moves when I relocate the glass  I have a few HDRI's on my PC, but none look remotely like this   Also, I'm using cycles as I find Evee buggy as hell What control type should I use - Image, MediaElement, etc.? This error message is being presented, any suggestions?     Allowed memory size of 33554432 bytes exhausted (tried to allocate   43148176 bytes) in php Will cases with front USB port support USB 3.0? (1) Does he not know? (2) Doesn't he know?  I don't usually see and hear questions formed in the first style. I was even surprised to know that it is grammatically correct. And actually it is the most &quot;proper&quot; way to form an interrogative sentence.  shows that the first style was much more popular before than now. What are your suggestions on choosing between these styles? And I will probably add the third one.  (3) He does not know?  EDIT: The answers have explained how to form a question, but have not actually provided an account on the usage of the first two forms. Especially I'm interested in the first form: does it sound formal, is it used in speech or only in writing, et cetera. Converting/using ArcGIS *.style file for/in QGIS (QML or SLD)? I have downloaded a dataset from a government organisation. it comes with a .style file.  I use QGIS 1.8 on windows 7.    Is there a way to use the .style file as a qml or sld? I have tried simply changing the extension but to no avail. Dense sets in Hilbert space of square summable sequences? Let $l^2 = \{x = (x_n)| x_n \in \mathbb{R}, \sum_{n=1}^{\infty} x_n^2 &lt; \infty\}$  be the Hilbert space of square summable sequences and let $e_k$ denote the $k^{th}$ co-ordinate vector (with $1$ in $k^{th}$ place, $0$ elsewhere). Which of the following subspaces is NOT dense in $l^2$?   span$\{e_1-e_2, e_2-e_3, \ldots\}$ span$\{2e_1-e_2, 2e_2-e_3, \ldots\}$ span$\{e_1-2e_2, e_2-2e_3, \ldots\}$  span$\{e_2, e_3, \ldots\}$   By definition, we have to prove that for any $x \in l^2$ and for any $\epsilon &gt; 0$, there exists $y$ in the respective sets such that $\|x-y\| &lt; \epsilon$. How to proceed further? If development on the Stack Exchange iOS/Android apps has ceased indefinitely, what should we do to their bug reports and feature requests? It's been a while since the Stack&nbsp;Exchange team last had an iOS or Android developer, and the development job on the apps have not had any insights for years.  That, however, doesn't deny the fact that there are still many users to them. As a consequence, people are continuing to submit bug reports and sometimes feature requests about them.  If development on iOS/Android apps has ceased indefinitely, what should we do to their bug reports and feature requests?  Are we going to keep them with the hope that development on apps will resurrect one day, or just ignore them and telling users that development has frozen? Fix corrupt NTFS partition without Windows MY NTFS Partition has gotten corrupt somehow (it's a relic from the days when I had Windows installed).     I'm putting the debug output of fdisk and blkid .  At the same time, any OS is unable to mount my root partition, which is located next to my NTFS partition. I'm not sure if this has anything to do with it, though. I get the following error while trying to mount my root partition (sda5)  mount: wrong fs type, bad option, bad superblock on /dev/sda5,        missing codepage or helper program, or other error        In some cases useful info is found in syslog - try        dmesg | tail  or so  ubuntu@ubuntu:~$ dmesg | tail [ 1019.726530] Descriptor sense data with sense descriptors (in hex): [ 1019.726533]         72 03 11 04 00 00 00 0c 00 0a 80 00 00 00 00 00  [ 1019.726551]         1a 3e ed 92  [ 1019.726558] sd 0:0:0:0: [sda]  Add. Sense: Unrecovered read error - auto reallocate failed [ 1019.726568] sd 0:0:0:0: [sda] CDB: Read(10): 28 00 1a 3e ed 40 00 01 00 00 [ 1019.726584] end_request: I/O error, dev sda, sector 440331666 [ 1019.726602] JBD: Failed to read block at offset 462 [ 1019.726609] ata1: EH complete [ 1019.726612] JBD: recovery failed [ 1019.726617] EXT4-fs (sda5): error loading journal   When I open gparted (using live CD), I get an exclamation next to my NTFS drive which states   Is there a way to run chkdsk without using windows ?  My attempt to run fsck results in the following :  ubuntu@ubuntu:~$ sudo fsck /dev/sda fsck from util-linux-ng 2.17.2 e2fsck 1.41.14 (22-Dec-2010) fsck.ext2: Superblock invalid, trying backup blocks... fsck.ext2: Bad magic number in super-block while trying to open /dev/sda  The superblock could not be read or does not describe a correct ext2 filesystem.  If the device is valid and it really contains an ext2 filesystem (and not swap or ufs or something else), then the superblock is corrupt, and you might try running e2fsck with an alternate superblock:     e2fsck -b 8193 &lt;device&gt;   Update: I was able to fix the NTFS partition running chkdsk off Hiren's BootCD, but it seems that the superblock problem still remains.  Update 2: Fixed superblock issue using e2fsck -c /dev/sda5 The only thing I need is an exact copy of an existing shapefile in the same directory with a different name.  I have tried:   arcpy.CopyFeatures_management (ORLinks, MyLinks) #ORLinks: old links, MyLinks: new links   but for some reason, I cant make it a feature layer using:  arcpy.MakeFeatureLayer_management(MyLinks, 'MyLinks')   Error Encountered:  Error: Failed to execute. Parameters are not valid. ERROR 000732: Input Features: Dataset  M:\RAIL\Rail2.0.shp does not exist or is not supported Failed to execute (MakeFeatureLayer). How can I split an equation over two (or more) lines What can I do to give the players the same feel their characters would have about wilderness travel? I want to write a query like this:  SELECT o.OrderId, MAX(o.NegotiatedPrice, o.SuggestedPrice) FROM Order o   But this isn't how the MAX function works, right?  It is an aggregate function so it expects a single parameter and then returns the MAX of all rows.     Does anyone know how to do it my way? Which algorithm does the JavaScript Array#sort() function use?  I understand that it can take all manner of arguments and functions to perform different kinds of sorts, I'm simply interested in which algorithm the vanilla sort uses. What does it mean for two objects to "touch"? If you've ever been annoyingly poked by a geek, you might be familiar with the semi-nerdy obnoxious response of      "I'm not actually touching you! The electrons in the atoms of my   skin are just getting really close to yours!"   Expanding on this a little bit, it seems the obnoxious geek is right. After all, consider Zeno's paradox. Every time you try to touch two objects together, you have to get them halfway there, then quarter-way, etc. In other words, there's always a infinitesimal distance in between the two objects.   Atoms don't "touch" each other; even the protons and neutrons in the nucleus of an atom aren't "touching" each other.  So what does it mean for two objects to touch each other?   Are atoms that join to form a molecule "touching"? I suppose the atoms are touching, because their is some overlap, but the subatomic particles are just whizzing around avoiding each other. If this is the case, should "touching" just be defined relative to some context? I.e, if I touch your hand, our hands are touching, but unless you pick up some of my DNA, the molecules in our hands aren't touching? And since the molecules aren't changing, the atoms aren't touching either?  Is there really no such thing as "touching"? Does the rotation of the earth dramatically affect airplane flight time? Say I'm flying from Sydney, to Los Angeles (S2LA), back to Sydney (LA2S).  During S2LA, travelling with the rotation of the earth, would the flight time be longer than LA2S on account of Los Angeles turning/moving away from our position?  Or, in the opposite direction, would the flight to Sydney be faster since the Earth turns underneath us and moves Sydney closer?  ===   Please ignore jet stream effects and all other variables; this is a control case in an ideal environment. By "dramatically" I suppose I mean a delay of 1 hour or more. For a book cover, I want to write the title vertically (like in Japanese, but using English text):           T T        I H        T I  I  M  L S  S  Y  E   How do I do this without jumping through a host of \vbox and \hboxes? Can I use Gödel numbers to make a proof?