Pattern check returning false javascript/typescript I am trying to validate if a string I entered matches the date format 'MM/yyyy'  Below is a sample of the code I am using for the same:  var date='05/2016' var patt= new RegExp('^((0[1-9])|(1[0-2])|[1-9])\/(\d{4})$'); patt.test(date);   However the above code is returning false.  I tried running it with the regex checker:   The pattern seems to be working fine.  Could someone please let me know what is missing.
JavaScript RegExp objects I try to write a simple Markdown parser in JavaScript. Therefore I want to check for the [link content][link id] syntax. I use the following code:  data = data.replace( /\[(.*?)\][ ]*\[([0-9]+)\]/g, '&lt;a href="$2"&gt;$1&lt;/a&gt;' );   It works well, but now I want to do this with a RegExp object. So I set up the following bit of code:  var r = new RegExp( '\[(.*?)\][ ]*\[([0-9]+)\]', 'g' ); data = data.replace( r, '&lt;a href="$2"&gt;$1&lt;/a&gt;' );   But it doesn't work. It even says that my regular expression (which works since the first example does a good job) is invalid:     unmatched ) in regular expression   I think it must have to do with some RegExp-object peculiarities I am not aware of. What am I doing wrong and how can the problem be solved?
Expressing hourly temporal recurrence What is the most idiomatic way to put into words a situation where a recurring event happens every hour at a certain minute. For example, consider that some event takes place at the tenth minute of each hour: 0:10AM, 1:10AM, 2:10AM, ...  My first ideas were "every hour at the tenth minute" or "every hour at minute 10". Are these options idiomatic and if not, what would be an idiomatic way of expressing this matter? Prove that $ S=\{0\}\cup\left(\bigcup_{n=0}^{\infty} \{\frac{1}{n}\}\right)$ is a compact set in $\mathbb{R}$, but $\bigcup_{n=0}^{\infty} \{\frac{1}{n}\}$ is not a compact set.   (Can we use definition of compact set for this problem? ) How do you compute negative numbers to fractional powers? I have seen some comments and speculations about the robot having an off switch or whatever. But I want to know if there is any source material or comment from the author on how they managed to pass the exam.  I have only seen the actual author's comment on Mineta:     But I was wondering if there are author notes for the other characters. I have a Nexus 7 (2013) and a Moto X (2014) running Lollipop. On both of these, if I get a heads-up notification (i.e., those that show up on top of the screen when the device is unlocked) and swipe down on it with 2 fingers, it 'breaks' further heads-up notifications:   I can't tap on them to open the responsible app For, e.g., an incoming phone call with 'answer' and 'dismiss' buttons, tapping the buttons does nothing. I can't answer phone calls anymore!   I can still swipe to the side to dismiss the notifications, and they still disappear on their own after a few seconds. I haven't been able to find a way to get the correct behavior back aside from a restart.  Yeah, the obvious workaround is to not two-finger swipe on them, but it's second nature as that same gesture expands notifications in other contexts.  I'm guessing the problem is generic, but I've triggered it on Hangouts and Phone notifications.  Do others experience the same thing? Any known 'fixes' aside from restarting? We sometimes buy trout from a local breeder who'll get them fresh out of the water for us, and then cook them a few hours later. They taste great, but the flesh tends to fall apart in a way that doesn't happen with fish from the super market. It's often barely even possible to get them out of the pot without them completely coming apart. We tried leaving them in the fridge for a day so they wouldn't be quite as just-killed-an-hour-ago-fresh, but that didn't help.   We usually prepare them by cooking them in simmering (not boiling) water.  Is there some way to prevent this? How to say that something is (not) random I want to compare two things, one of which is random and the other is not, in favor of the latter. I'd like to do it in a more sophisticated way than simply using the word "random".  Like, for example,     In this case, your pay will not depend on the roll of the dice.   But Google Ngrams doesn't find a single occurrence of "depend on the roll of the dice", so I guess there's something wrong with this particular phrase. What would be a better substitute? The question is raised from the viewpoint of a foreign language learner.  -ed is known to be added to a verb to mean past tense or past participle, but some phrases like four-legged animals, winged birds, are in the form of noun+-ed, why is it so? What is the logic behind such a structure? I have a .txt file with numbers ordered like this (on the same row):  106849_01373    106849_01967    106850_00082    23025.7_01059      I would like to convert them like that:  106849_01373 106849_01967 106850_00082 23025.7_01059   I have no idea which command to use. Can somebody help me with this? Proof that every repeating decimal is rational How can I convert raster (stream segments result of a watershed analysis) to vector polylines, preferably shapefile. In ArcGIS this is easily acomplished with the Raster to Polyline tool.  I only see Polygonize (Raster to Vector) tool under the Raster -> Conversion menu. Intersection of two lists in Bash the least possible value for :$ \lfloor \frac{a+b}{c}\rfloor +\lfloor \frac{b+c}{a} \rfloor+\lfloor \frac{c+a}{b} \rfloor $ If we know that for every $a,b,c&gt;0$ ,how we can find  the least possible value for :  $$ \lfloor \frac{a+b}{c}\rfloor +\lfloor \frac{b+c}{a} \rfloor+\lfloor \frac{c+a}{b} \rfloor $$ "Total number of votes for 'N' answers" is wrong in "Deleted Recent Answers" Below are the two screenshots. First one shows the number of votes          In above image a post which was deleted shown ) votes. Now in below image which is actual post deleted is having 1 vote. SFDX Pull error: Entity of type 'ListView' named XXX cannot be found While trying to pull changes from a scratch org (sfdx force:source:pull, tried with and without -f), I'm getting this error:     Entity of type 'ListView' named 'Note_Relation__c.My_Notes' cannot be found.   I do have a custom object Note_Relation__c, and it exists both locally and in the scratch org.  However, it's not an object that is normally accessed directly.  It has no tab, and should have no list views.  Nonetheless, I've checked the object's list view (via prefix, e.g., /a0D in both Classic and LEX view), and I can find no list views at all.  I've also tried adding an entry to .forceignore:  force-app/main/default/objects/Note_Relation__c/listViews/My_Notes.listView   This has no effect either.  At this point, I'm stuck with a bunch of config changes in a scratch org that I cannot pull.  I can find no references to this error message with scratch orgs.  Has anyone seen this issue?  Edit to clarify: I tried the .forceignore line based on what I think the file name should be; I have no force-app/main/default/objects/Note_Relation__c/listViews directory locally.  Edit 2: Workaround:  I found a workaround that doesn't make sense to me, but it works.  I'm not adding it as an answer yet because I'm not sure what's happening.  The workaround is to add the following line to .forceignore  Note_Relation__c.My_Notes   Even though this isn't a DX filepath, it's the name from the error message, and it seems to work. Periodic function implies periodic primitive? If $f$ is a periodic function with $T = \pi$, does that mean that $F$ (a primitive of $f$) has the same period ? What about the inverse implication (periodic primitive implies periodic function) ? I am trying to make a callout to AWS S3 using named credentials and Apex  The named credential is set up as follows  Label: AWS S3 Name: AWS_S3 URL: https://bucket-name.s3.amazonaws.com - Certificate: Identity Type: Named Principal Authentication Protocol: AWS Signature Version 4 AWS Access Key: AKIAxxxxxx AWS Secret Access Key: xxxxxx AWS Region: ap-southeast-2 AWS Service: s3 - Generate Authorization header: true Merge fields in header: false Merge fields in body: false   The Apex class is very simple  HttpRequest req = new HttpRequest(); req.setEndpoint('callout:AWS_S3'); req.setMethod('GET');                        Http http = new Http(); HTTPResponse res = http.send(req);                 System.debug(res.getBody()); return res.getBody();   The response body contains the following:     SignatureDoesNotMatchThe request signature we calculated does not match the signature you provided. Check your key and signing method.AKIAxxxxx   I have used the same bucket, endpoint and credentials using Postman and am able to successfully return the list of objects in the bucket so it is not an IAM permissions issue  There have been a couple of similar questions on stackexchange but unfortunately they do not provide any resolution or assistance in this case:    I've tried looking for code samples or further pointers in the Apex documentation but it doesn't really give any further guidance on how to proceed or correctly set this up so I'm a bit stuck I'm studying for qualifying exams and ran into this problem.  Show that if $\{a_n\}$ is a nonincreasing sequence of positive real numbers such that $\sum_n a_n$ converges, then $\lim_{n \rightarrow \infty} n a_n = 0$.  Using the definition of the limit, this is equivalent to showing \begin{equation} \forall \varepsilon &gt; 0 \; \exists n_0 \text{ such that } |n a_n| &lt; \varepsilon \; \forall n &gt; n_0 \end{equation} or \begin{equation} \forall \varepsilon &gt; 0 \; \exists n_0 \text{ such that } a_n &lt; \frac{\varepsilon}{n} \; \forall n &gt; n_0 \end{equation} Basically, the terms must be bounded by the harmonic series. Thanks, I'm really stuck on this seemingly simple problem! I can't distinguish the difference in meaning between these  two sentences.   It really doesn't matter.  It doesn't  really matter.    It seems that there is a nuanced difference, but I cannot see what this is. $$T(n) = \sqrt{n} T \left(\sqrt n \right) + n$$  Master method does not apply here. Recursion tree goes a long way. Iteration method would be preferable.  The answer is $Θ (n \log \log n)$.  Can anyone arrive at the solution.