I'm playing on a server where hoppers move one stack of items at a time, instead of just 1 item. I want to make a sorting system, but because of changes to hopper mechanics, normal sorting systems don't work. I've tried asking friends and other people on the server, and looking up different tutorials, but every time, I find the same problem. Hope someone in here can help me. If you have any questions or need further details, i will answer/provide them, as good as i can!
Problem Currently, I am playing on a server where hoppers transport items at the rate of 64 items a second, and this has proved very difficult to build a sorter for. I'm not at all proficient in Redstone building but have tried building basic sorters and ones that I have found on YouTube and I haven't gotten anything to work. Solution Hopefully one of you is really good at Redstone and can help me design a sorter that can work under these conditions. (I need the sorter that can sort items while I AFK kill witches with a looting 47 sword P.S. most of the problem is with the sorter itself because no items will stay in the sorter hopper (bc the whole stack goes into the chest so the hopper doesn't have anything to go off of to sort) so any solution to that would be helpful as well.
File upload to Heroku not working I want to change the key bindings on some of the keys on my keyboard.  I want some to run commands and others to activate different keys.  What applications can I use to do this?      Index:       (from within System Settings)             I'm still looking for answers using dconf and any other method. Consider a partial function $f$ that is defined only for a few values of its domain (my exact use case is $\delta$ transition functions in automata). One can 'complete' it by saying $$g(x)=0\iff f(x) \text{ is not defined.}$$  Is there a symbol to mean "undefined"? Would it be correct, or accurate, to write $\nexists f(x)$? Double calculation producing odd result How to change the camera from Landscape to Portrait I need a way to render a picture that is longer heighth-wise than width-wise. Changing the scale of the camera does nothing. I've been told to look in the scene focus settings, and I didn't see anything. Is there a way to change the shape of the rendered image? Is the tag info page not available on mobile theme? I was surfing SO on my iPhone, and wanted to see the info (tag-wiki) page for a tag, but didn't find it. Clicking on the tag always leads to the list of question, and there is no other link to the tag wiki. Is it not available on the mobile site? Restrict the scope of a command to the execution of another command General solution of expected value of E(f(X))? This is maybe a trivial question I came up while solving a few examples and understanding Markov/Chebyshev inequalities and subsequently in evaluating Chernoff bounds. Suppose $X$ is a random variable with some distribution $p$ and we need to evaluate $\mathbb{E}[f(X)]$. Here, $f(X)$ may or may not have the same distribution as $X$. In my case, if $f(X) = e^{sX}$, where $s&gt;0$. I would work out this problem by letting $Z = e^{sX}$ and   $\mathbb{E}[f(X)] = \mathbb{E}[Z] = \int_{\infty}^{\infty}z \hspace{0.2em}p(z)dz$.   Now I find the distribution of $Z$ as: $P\{ Z \leq z \} \implies P\{ e^{sX} \leq z \} \implies P\{ X \leq \frac{\log(z)}{s}\} = \int_{-\infty}^{\frac{\log(z)}{s}}x.p(x)dx $  thereby substituting this into the expectation one gets $\mathbb{E}[Z] = \int_{\infty}^{\infty}z\hspace{0.2em} \left(\int_{-\infty}^{\frac{\log(z)}{s}}x\hspace{0.2em}p(x)dx\right)^{\prime} dz$  According to the Law of Unconscious Statistician , this approximates distribution of $Z$ as $p$. I understand the backward proof through calculus, I don't follow the measure theory approach. For example I don't follow how this works if say $X \sim Gamma$. Is there a source I can read through for someone with no measure theory background? Existence of a Pivot Point in Euclidean Geometry In geometry there is a term called a pivot point. There exists a pivot point 'P' in the interior of a convex polyhedron in a euclidean space if and only if every single line through 'P' contains exactly zero or two vertices of the polyhedron.  I asked one of my professors, but he gave me a very narrow example of a cube, but I want to know the maximum number of pivot points that exist in a polyhedron. Can someone please help me prove how many exist? I'm using code that I found on the .  The only problem is it uses external DLL calls that don't work in mono.  I was wondering if anyone knew of a way to accomplish the same thing as that code, but will run in both Windows using .net, and Linux using mono?  Edit:  Clarifying what I'm trying to do: I'm making a .  The program sits in the system tray and when the user presses the hot-key, it will pop up all the gadgets.  So the program doesn't have focus, so typically it won't catch any keystrokes, so I'm using the low-level keyboard hook and I hook the two keys that the user defines as the hot-keys.  But I'm using a Windows DLL call for that, which doesn't work in Linux using mono.  So I'm wondering if there's a way to do the same thing, but will run in Linux using mono? "At least one" - singular or plural subject? On all of the other SOFU sites a downvote means The question is unclear or not useful.  However, here on meta, a downvote has become a sign of I don't agree with the question, suggestion, feature request, bug, etc. being described in the question.   What does a downvote on Meta really mean? What other reasons do people downvote on Meta? Why is it okay for meta to redefine the meaning of the downvote?  The tooltips and instructions are all the same here on meta.   Note: I'm not saying I disagree with the practice, just curious. A formal name for "smallest" and "largest" partition Consider a set $A=\{1,2,3,4,5\}$, is there any terminology for the following partitions of $A$ ?  (1) $A=\{ \{1\},\{2\},\{3\},\{4\},\{5\} \}$  (2) $A=\{\{1,2,3,4,5\}\}$. How do I simplify: $$\sum_{r = 0}^{\lfloor \frac{k}{2} \rfloor} \dbinom{k}{2r} \cdot \dbinom{n-k}{k-2r}?$$ Basically, the sum is: $\dbinom{k}{0} \cdot \dbinom{n-k}{k} + \dbinom{k}{2} \cdot \dbinom{n-k}{k-2} + \dbinom{k}{4} \cdot \dbinom{n-k}{k-4} \cdots.$ This seems very similar to Vandermonde's Identity but because we skip two everytime instead of one, I don't see how I can apply it to this problem. Integral vanishes on all intervals implies the function is a.e. zero I am having trouble with the following problem:      $f:\mathbb{R}\to \mathbb{R}$ is a measurable function such that for all $a$:   $$\int_{[0,a]}f\,dm=0.$$   Prove that $f=0$ for $m$ almost every $x$ (here $m$ is the Lebesgue measure).    I have no problem proving this for $f$ non-negative, or under the assumption that $f$ is integrable. But the question only assumes that $f$ is measurable and no more.  My idea was the usual thing; we look at the set of points where $f$ is positive and negative and assume one of these has measure greater than zero. Then I wanted to estimate one of these by an open set, look at the integral on the open set and show that it had to be greater than zero, a contradiction. But a key part of this attack is the assumption of the absolute continuity of the integral, which only holds in the case where $f$ is integrable.  Alternatively, if it were integrable one could simply estimate $f$ by a continuous function, where the result is quite obvious.  Ultimately we are going to show that $f$ is integrable, but it is not clear to me how to show this before showing it is zero a.e. So there must be a simpler way. Does anyone have suggestions? Is it possible to create image data and save to a file from a script I'm currently trying to extract textures from a binary file, and ideally I'd like to save each texture to a file or embed in the .blend file. However, before saving an image, I need to be able to create an image in memory from an array of pixel data.  The PIL library contains the kinds of functions I need to use, but it is not included with Blender. Is there anything similar to PIL in Blender? bpy.ops.image seems to be close to what I need, but lacks necessary pixel set/manipulation functions. Is it possible to see own 'review queue audits' results? I completed recently a few review audits, some of them I passed, some I failed.  Is there a place I could (easily) find these results? In ZF, how would the structure of the cardinal numbers change by adopting this definition of cardinality? In ZFC, a good way of ordering sets by cardinality is by leveraging the notion of an injection. We define: $$X \lesssim Y \leftrightarrow \mbox{ there exists an injection } X \rightarrow Y.$$  Alternatively, we can leverage the notion of a partial surjection, by which I mean a partial function that hits every point of its codomain at least once.  $$Y \succsim X \leftrightarrow \mbox{ there exists a partial surjection } Y \rightarrow X.$$  Now in ZFC, these approaches are equivalent, in the sense that $$X \lesssim Y \iff Y \succsim X.$$  But if we just consider ZF (that is, we drop choice) then the equivalence breaks down. However, we've still got the forward implication, because the converse of an injection is always a partial surjection.  A specific question. Define that two sets are weakly equipotent iff $X \succsim Y$ and $Y \succsim X$. Question: does weak equipotence imply genuine equipotence? I'm guessing "no."  A general question: In broad terms, how would the structure of the cardinal numbers in ZF be altered by adopting $\succsim$ rather than $\lesssim$ as the fundamental order relation, and taking equality of cardinal numbers to correspond to weak equipotence of sets? I'm guessing this would hide a lot of the (usually very complicated) structure of the cardinal numbers in ZF.  Remark. The order symbols can be written \lesssim and \succsim. What "allocation unit size" should I use for a drive with a single NTFS partition? I'm formatting a 1TB external hard drive as a single NTFS partition.  This drive is mainly meant for storing media.  Should I choose something other than the default allocation unit size?  The options range from 512 bytes to 64K.  Are there any guidelines that I should use with partitions storing other data?  Should I stop poking around and just leave it at "default"? A new environment based on enumerate I have defined the following simple environment:  \newenvironment{renumerate}{\begin{enumerate}\raggedright}{\end{enumerate}}   I wonder how the above can be modified to use with, say, the following:  \begin{renumerate}[label=\color{blue}10.\theenumi] \item blah \item blah \end{renumerate}   The options given in [] are not known in advance.