The solution proposed in the  does not seem to work for me as you can see below..    I have a rather huge list (2500 items) on SharePoint 2013 and I would like to get an idea of how many items that meets selected criterias, but I'm unable to get it working like i would like.  I know the itemcount endpoint, however that only returns the total amount of items in the list and I cannot seem to filter that.  I've tried this which I have found somewhere on this site:  _api/web/lists(guid'D38E6516-FB4F-4FCF-9E29-4FEC9CE06D2B')/Items/$count?&amp;$filter=startswith(Title,'T757388')   But that only returns an error.  If I was dealing with a small list I would just make a normal Query and Count the items in the array, but the payload size exceeds the limit if I try this.  Anybody able to cast some light on this?
I am attempting to return an integer (itemcount) of the items within a SP2013 list. I have done this easily using the stock standard json method. However I have a need of counting the splist items which contain a certain value. My silly knowledge immediately lead me to try and use filtering with the ItemCount parameter only to find out that it will always still return the count for all items and it will completely ignore the filter. I have searched for a way of doing this but have found absolutely nothing other than a single page with a comment stating that it is not possible with the REST api and that it can ONLY be done using CSOM.  My question is, firstly, is it true that there is NO way to filter itemcount with REST? If so, how else can I obtain my item count using this type of filtering? (Examples or sources will help vastly) Thanks.  Below is my attempted request:  var itemid = item.id;           MyService.ensureFormDigest(function (fDigest) {               $http.get(                   MyService.appWebUrl + '/_api/web/Lists/getbytitle(\'Items\')/ItemCount?$filter=SubjectsID eq' + itemid,                   {                       headers: {                           'Accept': 'application/json; odata=verbose',                           'X-RequestDigest': fDigest                       }                   }).success(function (d) {                       item.itemcode = d.d.ItemCount;                       alert(item.itemcode);                       callback();                   }).error(function (er) {                       alert("Error getting List Item Count: " + er);                   });           });       }   On another note, I was advised to try it as such: /Items?$filter=SubjectsID eq 3&amp;$select=Id  Then in the JS, in my success method:  data.d.results.length
Let us go   is a correct construction in the English language and definitely not:     Let we go   However, the question is: since us is an object-case pronoun, what is the subject of this sentence? How to create a soft or symbolic link? A shrinking map that is not a contraction no fixed point. Working from Munkres.  Show that $f: \mathbb{R}\to \mathbb{R}$ given by $f(x) = [x+\sqrt{(x^2+1)}]/2$ is a shrinking map that is not a contraction that has no fixed point.   I figured out the fixed point part but have no clue how to show the other part.  For the fixed point part $$f(x) = x \Leftrightarrow x = [x+\sqrt{(x^2+1)}]/2$$  then $$2x = x + \sqrt{(x^2+1)}$$ $$x = \sqrt{(x^2+1)}$$ $$ x^2 = x^2+1$$  Which is a contradiction.   Thanks in advance. For each $y \in \mathbb{R}$ either no $x$ with $f(x) = y$ or two such values of $x$. Show that $f$ is discontinuous. This is from Apostol's Mathematical Analysis.  Let $f$ be a function defined in $[0, 1]$ such that for each real number $y$ either there is no value of $x \in [0, 1]$ such that $f(x) = y$ or there are exactly two such values of $x$. Prove that a) $f$ must be discontinuous on $[0, 1]$. b) $f$ has an infinite number of discontinuities in $[0, 1]$.  Long back I had tried to solve the problem. I reasoned for a) as follows: Suppose that $f$ is continuous and let $m, M$ be its minimum and maximum values on $[0, 1]$. Clearly if $m = M$ then $f$ is constant and clearly for every $x \in [0, 1]$ we have $f(x) = m = M$ which contradicts given property of $f$. So we must have $m &lt; M$. Clearly there are now four distinct points $a, b, c, d$ in $[0, 1]$ such that $f(a) = f(b) = m, f(c) = f(d) = M$. By checking possible linear orderings of $a, b, c, d$ I could find a find a value of $y \in (m, M)$ for which there exist more than 2 values of $x$ such that $f(x) = y$. However this approach looks very clumsy and I suspect much simpler and easier proof is possible. Part b) seemed bit complex and my only guess was that probably $f$ was discontinuous on each subinterval of $[0, 1]$ but I could not prove this claim (may be the claim is wrong!). Perhaps there is a simpler solution to this part of the problem. Apostol's also asks to provide an example of such a function. Any hints on the overall problem will be appreciated.  Update: After looking at Marc's answer, I think I have found a way to show that there are infinitely many discontinuities. Earlier the solution was a part of the question itself but it made the question look quite lengthy hence I moved it to a separate answer. Why does adding a curve modifier move my object to the center of the curve? I'm using a curve modifier and an array modifier. My object is at one end of the curve but as soon as I choose the curve for the curve modifier it moves to the center. How can I fix the problem so that I can have the array going from one end of the curve to the other? Can we raise the bar for reputation for late answers to bypass the review queue? I would like to raise the bar for late answers to enter the Late Answers Review Queue to 50 rep, which is the threshold after which users gain the ability to comment. Here are some answers that were posted by users with between 10 to 50 rep (yes, there's a little selection bias to be sure. I suspect most/all of these will be 10k links only by the time you're reading this. Note, all of these are from the last 5 hours.  These are all from Stack Overflow, where I have the most experience, but since Late Answers have a much higher probability to be bad across all stacks, I think this applies generally. Also, I have bolded all the users references to the inability to comment, that were not in their original answers:    (23 rep)     Solution provide by @brandonyang works for me too! (I can't add comments in a response 'cause my low reputation, sorry).   (47 rep)     I tried your answer but it doesn't work in office 365 outlook online. Do you have any suggestions?   (26 rep)     My question is somehow related to the same issue. I am fairly new to C# and have been doing JAVA for quite a long time. When I am coding in C# with .Net framework 4.5.1 using visual studio 2013, I get errors for using certain libraries but I donot know which dll should I reference in my project How do C# people figure that out? For example I wanted to code to draw an ellipse and needed system.Windows.Media and System.Windows.Controls both of which were giving me errors, after googling for quite sometime I got to know that we need to reference PresentationFramework.dll, is this the only way to figure it out?      PS >> I am unable to post this as a comment hence putting it as answer.      Thanks.   (19 rep)     i like  video. It explains the differences between int and Integer and cautions of using Integer   (21 rep)     I have a question, i am actually trying to copy the database from Prod server to test server ( SQL server 2008R2). I am wondering would it copy the users logins, roles and permission as well ?      I know I suggested 50 rep above, but while I was compiling that, I . Perhaps it should be 100 rep, not 50. I am less confident about this, but I thought I'd add it as an addendum for discussion.     The answer posted  is the simplest solution that you are looking for to solve your problem, so take a look ;) Proving that free modules are flat (without appealing projective modules) Suppose $R\neq 0$ is a commutative ring with $1$. Let $M$ be a free $R$-module. I would like to prove that $M$ is a flat $R$-module. Everywhere I have looked (mostly online) this is proved by first proving that every free module is projective, and then proving that every projective module is flat. Unfortunately, Atiyah &amp; Macdonald's "Introduction to Commutative Algebra" (Chapter 2) does not discuss projective modules. But the result that every free module is flat comes very handy in the exercises.   So my question is,     Is it possible to prove that every free module is flat just by   definitions and without appealing to projective modules?   Thanks! A field that is conservative must have a curl of zero everywhere. However, I was wondering whether the opposite holds for functions continuous everywhere: if the curl is zero, is the field conservative? Can someone please give me an intuitive explanation and insight into this, and if it is true, why? Also, please try to not be too rigorous (only in grade 9). Why won't my follower follow me after the "A Night to Remember" quest line? At the end of the "A Night to Remember" quest line, my follower came with me when I was teleported to the Misty Grove. Once there, I told my follower to wait.  Now, when I was teleported back to the real world, my follower's not with me: presumably because he's still waiting at the Misty Grove. I've waited for some time and still he hasn't come back.  How can I get my follower back? Rewrite rules goes away In particular, I am referring to the Pearson product-moment correlation coefficient. How do I expire by type in .htaccess for remote loaded Google fonts? Is it possible to set expire by type for remote fonts or Google analytics? I'm getting this report from GTMetrix and everything I've tried isn't working. Suggestions?  There are 4 static components without a far-future expiration date. http://fonts.googleapis.com/css?family=Open+Sans:300 http://fonts.googleapis.com/css?family=Roboto&amp;subset=latin,latin-ext http://www.google-analytics.com/ga.js http://www.google-analytics.com/analytics.js   All of my other expires are working fine.  But apparently this type of thing isn't right?  ExpiresByType application/x-font-woff "access 1 year" ExpiresByType application/font-woff "access 1 year"   What should I do? I am writing my CV using moderncv package, everythig is nice but I have a problem with \cventry command. I have something like this:   (it means 2010 - now)  I would want to have this in one line, rather than in two lines. I tried looking into the moderncv style files but with no success. What can I do to achieve the effect I want? Separability over intersection of intermediate fields Let $E\mathop{/}F$ be a finite-degree normal extension of fields. Let $K$ and $L$ be intermediate fields (that is, $F\subseteq K\subseteq E$ and $F\subseteq L\subseteq E$) such that $E$ is separable over both $K$ and $L$. Show that $E$ is separable over $K\cap L$.   So I was thinking that if $f=\min_{K\cap L}(\alpha)$. Then $\min_{K}(\alpha)$ divides $f$. But if $f$ has repeated roots then I don't see what goes wrong.   Thanks! If $f'$ is bounded, then $f$ is uniformly continuous Let $f\colon(a,b) \to \mathbb R$ be differentiable and suppose that there exists an $M&gt;0$ such that $|f&#39;(x)| \leq M$ for all $x$ in $(a,b)$. Prove that $f$  is uniformly continuous. Can Europeans reset their "time in Canada" clock by visiting the US? If a Swiss citizen comes to Canada and stays for 6 months, can they travel to USA for example, for a short period of time, and then return to Canada for another 6 months?  How long must they stay out of Canada before returning? Is every discrete absolute value non-archimedean? I've been reading Milne's notes on absolute values and local fields (Chapter 7 of the book on algebraic number theory), and a possibly minor point is confusing me.   On page 126, Milne writes, "$K$ is a field complete with respect to a discrete absolute value $|\cdot|$..." and then he talks about things that only make sense for non-archimedean absolute values, like the ring of integers and its maximal ideal.   Is every discrete absolute value on a field $K$ also non-archimedean? This would explain a lot, but I also suspect that it is not true, because I can't find any statement of this fact anywhere.  EDIT: An absolute value is discrete if the value group $|K^\times|$ is a discrete subgroup of the multiplicative group $\mathbb{R}_{&gt;0}$. An absolute value is non-archimedean if it satisfies the stronger triangle inequality $$ |x+y| \le \max (|x|,|y|) $$ or equivalently if the set $\{|1|,|1+1|,|1+1+1|,\ldots\}$ is a bounded subset of $\mathbb{R}$. mean value theorem question I was trying to solve the following:  Given: $0 &lt; a &lt; b$ and $n&gt;1$, prove: $$na^{n-1}(b-a) &lt; b^n-a^n &lt; nb^{n-1}(b-a)$$  I managed to get this far using the mean value theorem: $$a^n(b-a)&lt;b^n -a^n&lt;b^n (b-a)$$ Any idea how to continue? What are the prerequisites for studying mathematical logic? I am looking to study mathematical logic, however, I find that introductory books are very daunting, which kind of disheartens me. You see, slowly but surely, I started to realize that the maths which I have learned did not just pop out of thin air, but is a collection of systems, which must of been developed via some other system, i.e, maths did not develop itself.  So I began to look into the origins of mathematics, and read that it was developed via a type of logic, which exists sort of by 'default', via a set of axioms, and then of course I looked up the definition of axioms.   So given that I'd be studying a type of logic whose origins are self evident axioms, naturally I believed there would be no prerequisites. However, in looking up mathematical logic, I have come across things such as Boolean algebra, sets, first order logic, some other type of logic, called 'traditional logic', as well as references to a sort of calculus, though not in a mathematical sense, I think.  So all in all, I am trying to develop a type of mental spider web, and I am trying to find out the strands which lye at the absolute bounds so that I may learn this mystique logic. Though I have no idea where to start.  Side note: This is the book I have started reading:   Credit goes to Wolfgang Rautenberg. Hero rescues a minor deity, granted a wish of small value; gets a girl As a high school student just starting in science fiction, I read a short story collection in paperback that included this story – not quite a short-short, but not very long either.  I think that it was written by a familiar author, since the collection was one of those “Best Of…” anthologies.    Our hero is a sympathetic young guy trying to get ahead, in love with a beautiful neighbor, but hopeless in love.  He rescues a miniature Minor Deity (and I've forgotten the mechanism – rescued from a cat perhaps?) and gets a wish in return.  The catch is that since this is only a minor deity, the value of the wish is small – and I forget the actual value, perhaps $2.49.  He asks for help winning at the races to help get the girl – and the minor deity says sure, but the payoff can only be $2.49.  How about help rescuing her from a calamity like an earthquake?  Sure, but the total damage can only be $2.49. Other alternatives are discussed, but the value can only be $2.49. Frustrated, our hero thinks about the problem, but the Minor Deity thinks he has a solution.    Later that evening, the girl knocks on the door, he opens it to her welcoming arms, and the night passes.  The next morning, our hero finds a small clipping on the floor, an article stating the latest estimates of the total value of the elements in the human body were… $2.49.  (The whole story was building to that punch line.)