What I want to do is use a variable with window.location.href.indexOf() This is my code right now, I want to be able to shorten it.  var urls  = [ 'https://www.example.com/'  ,'https://www.example2.com/'  ,'https://www.example3.com/'   ,'https://www.example4.com/' ,'https://www.example5.com/' ];    // if ((window.location.href.indexOf(""+urls+"") &gt; -1) Does not work if ( (window.location.href.indexOf("https://www.example.com/") &gt; -1) || (window.location.href.indexOf("https://www.example2.com/") &gt; -1) || (window.location.href.indexOf("https://www.example3.com/") &gt; -1) || (window.location.href.indexOf("https://www.example4.com/") &gt; -1) || (window.location.href.indexOf("https://www.example5.com/") &gt; -1)    ) { //do stuff  }   I've included what I've tried in the code but it doesn not work. javascript and jquery both work for me
What is the most concise and efficient way to find out if a JavaScript array contains a value? This is the only way I know to do it: function contains(a, obj) {     for (var i = 0; i &lt; a.length; i++) {         if (a[i] === obj) {             return true;         }     }     return false; }  Is there a better and more concise way to accomplish this?
Error message on Terminal launch Intuition behind the Definition of Conditional Probability (for 2 Events) What is some intuitive insight regarding the conditional probability definition: $P(A\mid B) = \large \frac{P(A \cap B)}{P(B)}$ ? I am looking for an intuitive motivation. My textbook merely gives a definition, but no true development of that definition. Hopefully that's not too much to ask. "I use to", or "I used to" Which is the correct sentence, if there is a correct one?     I use to be a hitman.        I used to be a hitman.   I've read the second sentence recently in a book, but I was sure it should be I use to be a hitman. How to download Ubuntu over an unreliable connection How do I find out which process is locking a file using .NET? Time-ordered operator in Srednicki , "Note that the operators are in time order...we can insert $T$ without changing anything". This I agree with. But then on the next paragraph he states "The time order operator $T$, moves all...where they annihilate...". How correct is this paragraph? Is equation (5.14) always valid? Is equation (5.14) the reason why the time-ordering symbol $T$ appears all over the place in QFT?  The equations I'm referring to are (braket package available?):   $$\langle f|i\rangle = \langle0|~a_{1'}(+\infty)a_{2'}(+\infty)a_{1}^\dagger(-\infty)a_{2}^\dagger(-\infty)~|0\rangle \tag{5.13} $$  and since time goes from right to left inside the braket we put the $T$-symbol  $$\langle f|i\rangle = \langle 0|T ~a_{1'}(+\infty)a_{2'}(+\infty)a_{1}^\dagger(-\infty)a_{2}^\dagger(-\infty)~|0\rangle \tag{5.14} $$   without changing anything.   After this, the $T$-symbol appears everywhere! Make a computer act as a virtual USB device for other equipments Nominate for Reopening Shows Duplicate Message Boxes I've had my HTC Desire for a couple of months now and it is awesome! (A huge improvement to my previous phone... Nokia 3315)  Though recently, I've realised that the phone semi-freezes more and more often - ie. when swiping between homescreens it will either pause/freeze and I will have to re-swipe to get it to change screens. Or worse, it just won't respond to any further swipes and I have to lock the screen then unlock to get the phone back into action.  Got quite annoyed at this (was probably happening once or twice a day) so I thought it might help to turn it off and on again. So I did - not sure if it was a placebo effect but it seems to have helped a bit?  So given that this is my first smartphone, I was wondering if it is 'normal' to need to restart the phone every so often. If so, how often is 'normal'? If not, what can I do to diagnose/fix this problem? Rising edge pulse detector from logic gates The circuits I describe are entirely made of 7400 series logic gates (7402, 7404 and 7408 ic). I'm trying to build a rising (positive) edge pulse detector using logic gates.  The following circuit should work in theory:   (see )  I do not expect the short output to be seen through a LED so, to test it, I make it trigger an SR latch to its up state:    However, it doesn't have effect on the latch. So I added an inductor to delay the input to the NOT gates in the pulse detector circuit and it worked:   But now I can see the short flashing output through a LED which I should not because it would mean it is too long to work with a circuit like that:   Which intends to toggle the D Latch output on each clock rising edge (Note that this is a D Latch not a D Flip-flop)  And anyway there is no place for inductors in integrated circuits so there must be a way to do this only with logic gates. Can someone solve this mystery?  BTW It does not show in my schematics but I did put 10K pull-down resistors where there might be floating pins. Help ID this plant, quite possibly a weed I found this plant near my South Indian home in , India. Most probably it could be some sort of weed. Anyhoo, is this plant of any medical or commercial value? Is it a remedy for something?   It has a white tap root with little veins off the main root It has a really small yellow flower It's leaves are similar to that of a clover, except for that it has three to five leaves        Merci d'avance!  (P.S. Forgive me if this is some very common plant that I should know about, I'm in 7th grade.) Congruent Modulo $n$: definition In an Introduction to Abstract Algebra by Thomas Whitelaw, he gives examples of the congruence mod operation, such as $13 \equiv5 \pmod4$,  and $9 \equiv -1 \pmod 5$. But when I first learned about the modulo operation my junior year, I would have told you that $13 \equiv 1 \pmod 4$, and that $9 \equiv 4 \pmod 5$.     Is this just a difference in the definition of modulo? Or is this pretty typical (to not take it to the largest factor, or one over)? How to run a LaunchAgent that runs a script which causes failures because of System Integrity Protection After upgrading to Mojave, my rsync based backup script run via a launch agent in ~/Library/LaunchAgents, could no longer read some directories in ~/Library. Distance between points along polyline ArcGIS for Desktop? I'm using ArcGIS 10.3 (Desktop), and I'm trying to measure the distance between points following a path determined by a set of polylines.  Hand measurement is not a viable option-- there are ~7500 points, and my polyline set is the global coastline.  The ultimate goal is to get the spacing of these points along the polylines, so that I can analyze this with respect to a few other variables.   I can read python-- with a bit of effort-- but not write or edit it, so code-based solutions will not be particularly useful to me.  I have tried using the linear referencing tools-- I snapped the points to the lines, then transformed the polylines to routes and used 'locate features'-- but because my points are not (entirely) ordered along the path, using the difference between  linear reference locations of subsequent points yields some fairly unlikely answers.  In addition, spot checks of (hand-measured, using the built-in path length measuring tool) point-to-point along-polyline distance yield different answers than given by the corresponding linear references for the point pair. (Some of the answers were close enough that they could very well be measurement error on my part, but others were nearly 20%, despite my having zoomed in and snapped the measurement cursor to the polyline, proceeding vertex-to-vertex.)  Sorting first by linear distance seems to fix the first problem, but in light of the second one, I remain skeptical of this process.   I then tried simply splitting the polylines into segments ('split line at point') using the (snapped) points as the dividers, with the eventual goal of finding the segment length with the calculate geometry feature.  This produced gibberish. I'm not sure what criteria ArcGIS used to split the lines, but it wasn't the point set I provided.  Segments in the resulting shapefile ran right through tens of points, only to terminate at a place with no point. (Also, there were segments utterly empty of points...you get the gist.) I reiterate that the pointset was specifically snapped to the polylines, so this problem shouldn't be caused by excessive distance between the point and the polyline.  I'm at a bit of a loss, here: could someone point out where I might have gone astray and/or suggest a solution?  Or, failing that, a new method that I could try?  It seems like a fairly basic (not necessarily simple, but fundamental) analysis to do with geographic data, and I don't understand why it has presented so many difficulties. Order of general- and special linear groups over finite fields. Let $\mathbb{F}_3$ be the field with three elements. Let $n\geq 1$. How many elements do the following groups have?   $\text{GL}_n(\mathbb{F}_3)$ $\text{SL}_n(\mathbb{F}_3)$   Here GL is the , the group of invertible n×n matrices, and SL is the , the group of n×n matrices with determinant 1. Proving the two given vectors are orthogonal Quantum entanglement vs classical analogy Consider that we have two balls, one white and one black, and two distant observers A and B with closed eyes. We give the first ball to the observer A and the second ball to the observer B. The observers don't know the exact color (state) of their balls, they know only the probability of having one or another color, until they look at them (measure). If the observer A looks at his ball he will see its color, which is white, so he immediately knows the color of the second ball. Lets call this “classical entanglement”.  My question is: What is the difference between this “classical entanglement” and the quantum entanglement, for example, of two entangled electrons with opposite spins states? Can this analogy be used to explain the quantum entanglement? Getting code onto a microcontroller I have broken open a few circuits of some electronics (DVD player, handheld game device) and I can see the microcontrollers in them. However, I have no idea how they get their programs onto them! There is no micro usb or usb plug anywhere on them! How would they have gotten their program onto there? Roots of a functionwith condition $\int_0^\pi f(x) \sin x dx = \int_0^\pi f(x) \cos x dx =0.$ Let $f:[0,\pi] \rightarrow \Bbb R$ be a continuous function which satisfies $\int_0^\pi f(x) \sin x dx = \int_0^\pi f(x) \cos x dx =0.$ Show that $f$ has at least two roots. Number of ring homomorphisms from $\mathbb Z_{12}$ to $\mathbb Z_{28}$. Question:      Find the number of non trivial ring homomorphisms from $\mathbb Z_{12}$ to $\mathbb Z_{28}$. ($f$ is not necessarily unitary, i.e., $f(1)$ need not be $1$.)    Suppose $f$ is a ring homomorphism from $\mathbb Z_{12}$ to $\mathbb Z_{28}$.  Consider $f$ as a additive group homomorphism.  Let $k= |\ker f|$ and  $ t = |\operatorname{im}(f)|$. Then $k\mid 12$ and $t\mid 24$ and $kt=12$, by first isomorphism  theorem of groups.  There are two possibilities $k=3$, $t=4$   and $k=6$, $t=2$.  For the first case $f$ should map $1$ to an element of the subgroup generated by $7$ as there is a unique subgroup of $\mathbb Z_{28}$ of order $4$ generated by $7$. For the second case $1$ has to map to $14$, for the same reasoning.  So there are at most two ring homomorphisms from $\mathbb Z_{12}$ to $\mathbb Z_{28}$. Question is how to check the possible maps which are ring homomorphisms.  Thanks.