How to define Static member of a class
Undefined reference to static class member
'Search on Yammer' link in search center refiners I have a heavily branded site I'm working on and can't find where the "Search on Yammer" link is being populated from. It appears within the search refiner/filter web part in the left column but none of the display templates reference this.   I'd like to be able to customize the link, placement on the page, etc. without resorting to jQuery to move elements around the page.     And the markup coming through looks like this. The refiners themselves come through a series of display templates but the Yammer link is nowhere that I can see in any of them.   &lt;div webpartid="f09e98eb-6dc3-4a9b-8dbf-65d0fbc7b7c3" haspers="false" id="WebPartWPQ4" width="100%" class="ms-WPBody " allowdelete="false" style=""&gt;     &lt;div class="ms-ref-ctrl"&gt;         &lt;div class="ms-ref-refiner"&gt;             &lt;div id="Container"&gt;                 &lt;h2 class="ms-displayInline"&gt;                     &lt;a class="ms-ref-name ms-displayInlineBlock ms-srchnav-link-selected ms-link" href="javascript:void(window.open(                     'https://www.yammer.com/search?trk_event=o365_search&amp;amp;search='+                     encodeURIComponent(Srch.ScriptApplicationManager.get_current().queryGroups.                     Default.dataProvider.get_currentQueryState().k),'_blank'));" title="Open a new tab to search for this on Yammer"&gt;Search on Yammer&lt;/a&gt;                 &lt;/h2&gt;             &lt;/div&gt;         &lt;/div&gt;     &lt;/div&gt; &lt;/div&gt; &lt;div componentid="ctl00_SPWebPartManager1_g_f09e98eb_6dc3_4a9b_8dbf_65d0fbc7b7c3_csr" id="ctl00_SPWebPartManager1_g_f09e98eb_6dc3_4a9b_8dbf_65d0fbc7b7c3_csr"&gt;             ... refiners populated through display templates ... &lt;/div&gt; Remove password from an Excel Document I'm providing internal support and one of our users has managed to put a password on an excel file by accident, I've done the proper checks to make sure that the user should have access to the document and now want to know what the recommendation for removing a password from an Excel document.  For what its worth, the password appears after Excel opens but before you can see any data in excel. I was thinking about writing a partial derivative macro that has a similar syntax to the . ()  The syntax could be like this:   \D{f}{x} expands to \frac{\partial f}{\partial x} \D{f}{x,y} expands to \frac{\partial^2 f}{\partial x\,\partial y} \D{f}{{x,2},y} expands to  \frac{\partial^3 f}{\partial x^2\,\partial y} et cetera for any number of derivatives.   Bonus points for an optional argument so that for instance   \D[subscript]{f}{{x,2},y} expands to f_{xxy}   I looked at the  package but the syntax is a little tedious.  For instance, to get \frac{\partial^3 f}{\partial x^2\,\partial y} with that package I would need to do \md{f}{3}{x}{2}{y}{}.  And it doesn't generalize to three variables.  Before I dive in I thought I'd ask the hive and see what's been done. If $P(x^5)+xQ(x^5)+x^2R(x^5)=(x^4+x^3+x^2+x+1)S(x)$ , then prove that $P(x)$ is divisible by $x-1$ $P,Q,R,S$ are polynomials such that: $P(x^5)+xQ(x^5)+x^2R(x^5)=(x^4+x^3+x^2+x+1)S(x)$ , then prove that $P(x)$ is divisible by $x-1$   I thought a lot on this but no result!! By the way,one idea is to insert some values for $x$ and try to produce a system of equations for the given polynomials,but I'm not sure it works. Escaped line break tag in tooltip on election page Notation: Why write the differential first? A library to convert ANSI escapes (terminal formatting/color codes) to HTML I'm looking for a code library that converts ANSI escape sequences into HTML color, via plain  tags or CSS. For example, something that would convert this:  ESC[00mESC[01;34mbinESC[00m ESC[01;34mcodeESC[00m ESC[01;31mdropbox-lnx.x86-0.6.404.tar.gzESC[00m ESC[00mfooESC[00m  Into this:  &lt;span style="color:blue"&gt;bin&lt;/span&gt; &lt;span style="color:blue"&gt;code&lt;/span&gt; &lt;span style="color:red"&gt;dropbox-lnx.x86-0.6.404.tar.gz&lt;/span&gt; foo   Converting breaks into &lt;br/&gt; isn't necessary, it's just the escape codes that I don't know. I could hack it together myself, but I'd probably miss something important like underlines or mess up how background colors work. I'd rather just sit on top of someone else's code.  Does such a tool (command line linux) or library (perl, python, or ruby preferably) exist? How can I get a significant overall ANOVA but no significant pairwise differences with Tukey's procedure? I performed with R an ANOVA and I got significant differences. However when checking which pairs were significantly different using the Tukey's procedure I did not get any of them. How can this be possible?  Here is the code:  fit5_snow&lt;- lm(Response ~ Stimulus, data=audio_snow) anova(fit5_snow)  &gt; anova(fit5_snow) Analysis of Variance Table  Response: Response           Df Sum Sq Mean Sq F value  Pr(&gt;F)   Stimulus   5  73.79 14.7578  2.6308 0.02929 * Residuals 84 471.20  5.6095                   --- Signif. codes:  0 '***' 0.001 '**' 0.01 '*' 0.05 '.' 0.1 ' ' 1   df&lt;-df.residual(fit5_snow) MSerror&lt;-deviance(fit5_snow)/df  comparison &lt;-  HSD.test(audio_snow$Response, audio_snow$Stimulus, df, MSerror, group=FALSE)  &gt; comparison &lt;-  HSD.test(audio_snow$Response, audio_snow$Stimulus, df, MSerror, group=FALSE)  Study:  HSD Test for audio_snow$Response   Mean Square Error:  5.609524   audio_snow$Stimulus,  means                  audio_snow.Response   std.err replication snow_dry_leaves            4.933333 0.6208034          15 snow_gravel                6.866667 0.5679258          15 snow_metal                 6.333333 0.5662463          15 snow_sand                  6.733333 0.5114561          15 snow_snow                  7.333333 0.5989409          15 snow_wood                  5.066667 0.7713110          15  alpha: 0.05 ; Df Error: 84  Critical Value of Studentized Range: 4.124617   Comparison between treatments means                                Difference   pvalue sig        LCL      UCL snow_gravel - snow_dry_leaves  1.9333333 0.232848     -0.5889913 4.455658 snow_metal - snow_dry_leaves   1.4000000 0.588616     -1.1223246 3.922325 snow_sand - snow_dry_leaves    1.8000000 0.307012     -0.7223246 4.322325 snow_snow - snow_dry_leaves    2.4000000 0.071587   . -0.1223246 4.922325 snow_wood - snow_dry_leaves    0.1333333 0.999987     -2.3889913 2.655658 snow_gravel - snow_metal       0.5333333 0.989528     -1.9889913 3.055658 snow_gravel - snow_sand        0.1333333 0.999987     -2.3889913 2.655658 snow_snow - snow_gravel        0.4666667 0.994348     -2.0556579 2.988991 snow_gravel - snow_wood        1.8000000 0.307012     -0.7223246 4.322325 snow_sand - snow_metal         0.4000000 0.997266     -2.1223246 2.922325 snow_snow - snow_metal         1.0000000 0.855987     -1.5223246 3.522325 snow_metal - snow_wood         1.2666667 0.687424     -1.2556579 3.788991 snow_snow - snow_sand          0.6000000 0.982179     -1.9223246 3.122325 snow_sand - snow_wood          1.6666667 0.393171     -0.8556579 4.188991 snow_snow - snow_wood          2.2666667 0.103505     -0.2556579 4.788991 Generic solution to prevent a long cron job from running in parallel? I am looking for a simple and generic solution that would allow you to execute any script or application in crontab and prevent it from running twice.  The solution should be independent on the executed command.  I assume it should look like lock &amp;&amp; (command ; unlock) where lock will return false if there was another lock.  The second part would be like if it acquired the lock, run command and unlock after command is executed, even if it returns error. How to check iOS version? When the trace of the Frobenius homomorphism is zero? Let's consider an elliptic curve over a finite field $\mathbb F_p$.  The trace of the Frobenius homomorphism is defined as:  $$a_p=p+1-\#E(\mathbb F_p)$$  See for example .  I read that this value is zero if and only if the elliptic curve is supersingular. Unfortunately there is no proof give. So I am looking for a proof of this. (For example a good reference). Simple prime number generator in Python Could someone please tell me what I'm doing wrong with this code? It is just printing 'count' anyway.  I just want a very simple prime generator (nothing fancy).   import math  def main():     count = 3     one = 1     while one == 1:         for x in range(2, int(math.sqrt(count) + 1)):             if count % x == 0:                  continue             if count % x != 0:                 print count          count += 1 SQL - Order by with alphanumeric characters How do I fix these M4 macro errors? I am trying to compile  but when I run ./autogen.sh the script terminates with these errors  Checking for required M4 macros...   libtool.m4 not found   glib-gettext.m4 not found   intltool.m4 not found   pkg.m4 not found   gtk-doc.m4 not found   yelp.m4 not found ***Error***: some autoconf macros required to build mate-desktop   were not found in your aclocal path, or some forbidden   macros were found.  Perhaps you need to adjust your   ACLOCAL_FLAGS?   What do I need to do to get rid of these errors? I tired installing the latest versions of inittool, glib, gtk, yelp, etc... but I still get the macros errors. Let $q: \mathbb{N} \to \mathbb{Q}$ be a bijection and denote the image of $k \in \mathbb{N}$ by $q_k$.  Let $f: \mathbb{R} \to (0,1)$, $$ f(x) = \underset{q_k \leq x}{\sum_{k \in \mathbb{N}}} 2^{-k} $$  Show that:  1) $f$ is strictly increasing  2) $f$ is continuous at $x$ iff $x \in \mathbb{R} \setminus \mathbb{Q}$.  My work:  Let $x, y \in \mathbb{R}$, $x &lt; y$. Then there exists $q_n \in \mathbb{Q}$ s.t. $x &lt; q_n &lt; y$. Now $$ f(x) = \underset{q_k \leq x}{\sum_{k \in \mathbb{N}}} 2^{-k} &lt; \underset{q_k \leq x}{\sum_{k \in \mathbb{N}}} 2^{-k} + 2^{-n} \leq \underset{q_k \leq y}{\sum_{k \in \mathbb{N}}} 2^{-n} = f(y) $$ so $f$ is strictly increasing.  I think my proof of 1) is ok, but how can I prove 2)? Show $\mathbb{Q}[\sqrt[3]{2}]$ is a field by rationalizing Package in Java Let $(X,d)$ be a metric space. How to prove that for any closed $A$ a function $d(x,A)$ is continuous - I know that it is even Lipschitz continuous, but I have a problem with the proof:  $$ |d(x,a) - d(y,a)| \leq d(x,y) $$ for any $a\in A$ - but we cannot just replace it by $|d(x,A) - d(y,A)|\leq d(x,y)$ since the minimum (or infimum in general) can be attained in different points $a\in A$ for $x$ and $y$, so we only have that $$ |d(x,A)-d(y,A)|\leq d(x,y)+\sup\limits_{a,b\in A}d(a,b) $$ which does not mean continuity. I know you can export the asset as a PSD and open it in Photoshop. Is there a more seamless way?  Update:  I'm an idiot.  Someone else created the logo, and the shadow was it's own layer on multiply and not a normal drop shadow effect. Update to Windows 10: What is going to happen to my data and apps? I have Windows 8.1 Update, if I update to Windows 10 when it becomes available what is going to happen to my data and apps?  Of course I have to do a backup, but I wonder if the data will be overwritten or not.