Find which dynamically created button has been clicked
Event binding on dynamically created elements?
blink code(escape code) has been removed? Fastest way to remove non-numeric characters from a VARCHAR in SQL Server I'm writing an import utility that is using phone numbers as a unique key within the import.  I need to check that the phone number does not already exist in my DB. The problem is that   phone numbers in the DB could have things like dashes and parenthesis and possibly other things. I wrote a function to remove these things, the problem is that it is slow and with thousands of records in my DB and thousands of records to import at once, this process can be unacceptably slow. I've already made the phone number column an index.  I tried using the script from this post:   But that didn't speed it up any.  Is there a faster way to remove non-numeric characters? Something that can perform well when 10,000 to 100,000 records have to be compared.  Whatever is done needs to perform fast.  Update Given what people responded with, I think I'm going to have to clean the fields before I run the import utility.   To answer the question of what I'm writing the import utility in, it is a C# app. I'm comparing BIGINT to BIGINT now, with no need to alter DB data and I'm still taking a performance hit with a very small set of data (about 2000 records).   Could comparing BIGINT to BIGINT be slowing things down?  I've optimized the code side of my app as much as I can (removed regexes, removed unneccessary DB calls). Although I can't isolate SQL as the source of the problem anymore, I still feel like it is. How do i test capacitors? I've just gotten through replacing capacitors on a trio of dead LCD screens (nothing's blown up yet, so far) - they either had one or two capacitors on their inverter circuit SLIGHTLY bloated, and not quite leaky. I ended up replacing all capacitors of the same brand/'colour', even the ones that looked fine, in case.  Now, checking a bad resistor is simple - i can use a standard multimeter to test it, and i tend to check my solders with the continuity testing option of the multimeter.  How would i test a capacitor ? Is there some standard, common way to test one? I'hv seen every 2 pin SMPS AC to DC adapters shows a little high voltage respective to the ground on the out put, on both + and GND wires(or more if more wires present).  This voltage is high enough to light small neon bulbs or a line tester, but very low current, barely could be felt. This voltage vanishes if I connect the output to ground somehow, e.g. touch it while standing on floor bare foot.  As the size of the adapter increases, the AC voltage and current increases. When laptop adapters are powered from a ungrounded AC outlet, they gives reasonable shock from the 19V DC(or whatever else) output.  Perhaps this is the reason why many 3 pronged laptop adapter carries a warning CONNECT ONLY TO GROUNDED OUTLET Connecting to a grounded outlet magically vanishes the high voltage.  I am aware about the EMI filtering capacitor connected between high voltage and low voltage ground, I tried to solve this by removing them, but this trick is not working.   Why and how this mysterious AC voltage is created ?  Is it harmful to sensitive electronics components ? Is there any way to solve this without grounding the DC output side ? Nowhere monotonic continuous function Does there exist a nowhere monotonic continuous function from some open subset of $\mathbb{R}$ to $\mathbb{R}$? Some nowhere differentiable function sort of object? What's the term for using the wrong word because it sounds the same? I was reading about various terms for incorrect words, but they didn't seem to fit.  I saw a post where someone said "what do you like to do when you're board?".  That kind of thing.  Also, would that be considered a mistake in grammar?  I didn't think so, but my friend insists it is.  I'm not sure if there even is a word for that kind of mistake, but was just curious about it.  Thanks! How to distribute objects in a circular pattern on a surface (Radial Array, Polar Array) What would be the easiest way to view classes, methods, properties, etc. inside a jar file? I'm looking for something equivalent to the very useful  Lutz Roeder .NET Reflector  - for Java I have a Canon 7D, which has a crop factor of 1.6x.  When using a Canon EF-S lens I get the focal length stated on the lens, when using a Canon EF lens I get the focal length times 1.6 when used on the APS-C body. At least that's what I thought.  I just compared two lenses:   Canon EF-S 15-85mm f3.5-5.6 Canon EF 70-200mm f4   .  The top photo is shot with the 15-85, the bottom photo with the 70-200 - both lenses are set to 70mm. Now why do they look the same?  I thought I would get 112-320mm (70mm*1.6 crop factor). What did I misunderstand about the crop factor calculation? Lightroom also displays the photos as having "70mm" and not 112mm. Does anyone know how to get your business map location displayed in the right hand sidebar of the Google search results page? As in the screenshot below:      I already added my business to this link: .  Is adding detail in above link enough or do I need to change my website coding? Use sub and superscript as [optional] parameters for macro help with some Hilbert style proofs in a propositional logic axiom system. I'm very new to classical propositional logic, and my lecturer is using a system with the following axioms:  A1. X→(Y→X)  A2. (X→(Y→Z))→((X→Y)→(X→Z))  A3. (¬Y→¬X)→(X→Y)  Use uniform substitution and Modes Ponens (MP) as rule of inference. Deduction Theorem also allowed.  I'd like to deduce the following:  (a) X, Y ⊢ ¬(X→(¬Y)) (conjunction, but expressed in terms of NOT and IMPLIES)  (b) X→((X→Y)→Y)  (c) (X→Y)→(((¬Y)→X)→Y)  (d) (((¬Y)→X)→Y)→(X→Y)  Remark: The last two are to show that the axiom (A3) can be replaced with a different axiom:  B3. (¬Y→¬X)→(((¬Y)→X)→Y).  Solution: Bram28 proves (b) and (c) below. I demonstrate (a) and (d).  (d) is alright; first, I claim that X, ((¬Y→X)→Y) ⊢ Y.  Axiom (A1) gives ⊢X→(¬Y→X) so that ((¬Y→X)→Y)⊢X→Y by Hypothetical Syllogism (HS), which Bram28 shows to be valid.  Now that we have ((¬Y→X)→Y)⊢X→Y just apply the deduction theorem to get what we want: ⊢((¬Y→X)→Y)→(X→Y).  (a) is slightly trickier. Axiom (A1) gives ⊢ Y→(X→Y) so that X, Y ⊢ (X→Y).  Next, by part (b), we have as a theorem that ⊢X→((X→¬Y)→¬Y).  Therefore X, Y ⊢(X→¬Y)→¬Y.  But ⊢(¬¬(X→¬Y))→(X→¬Y) by DN Elim, which Bram28 shows to be valid.  By HS, X, Y ⊢(¬¬(X→¬Y))→¬Y.  By Axiom (A3) and MP, X, Y ⊢(Y→¬(X→¬Y)).  Also, rather trivially X, Y ⊢Y.  Finally by MP we conclude X, Y ⊢¬(X→¬Y) as required. $f \in {\mathscr R[a,b]} \implies f $ has infinitely many points of continuity. Cursor hitting "border" between differently sized monitors I'm not sure if I'll be to explain this right. I have a dual monitor display on Windows 7 and my left monitor (laptop) has a lower vertical resolution than the right monitor (regular LCD monitor). So obviously, if I stick these monitors together, there's a part in the upper-left corner of my LCD monitor where cursor cannot go to the other monitor. I remember there was a trick to make this gap disappear, and make it seem like the monitors are of equal height.  Any suggestions?  By the way, I am also using UltraMon. How do I remove objects from an array in Java? Given an array of n Objects, let's say it is an array of strings, and it has the following values:  foo[0] = "a"; foo[1] = "cc"; foo[2] = "a"; foo[3] = "dd";   What do I have to do to delete/remove all the strings/objects equal to "a" in the array? Mouse cursor flickering and disappearing I cant use lhopital's rule here is my attempt:  Limit of $(\frac{n^{2}-2n+1}{n^{2}-4n+2})^{n}$ =$e^{\lim_{n\to \infty} n\times \ln(\frac{1 -2-n +\frac{1}{n^{2}}}{1 -\frac{4}{n} +\frac{2}{n^{2}}})}$ I got stuck here Limited options in a certain area? Ok so i am a bit of a noob in blender, so I need help with this.  I am trying to texture something, but there is no texture button where there should be, because the blender edge window cuts it off here's a picture Duplicate:    I want an pseudo random number generator that can generate numbers with no repeats in a random order. For example: random(10) might return 5, 9, 1, 4, 2, 8, 3, 7, 6, 10 Is there a better way to do it other than making the range of numbers and shuffling them about, or checking the generated list for repeats?  Edit: Also I want it to be efficient in generating big numbers without the entire range.  Edit: I see everyone suggesting shuffle algorithms. But if I want to generate large random number (1024 byte+) then that method would take alot more memory than if I just used a regular RNG and inserted into a Set until it was a specified length, right? Is there no better mathematical algorithm for this. Why couldn't Voldemort view the prophecy without Harry's help?