Datasets:
naufalso
/
cybersec-topic-classification-dataset

Dataset card Data Studio Files
xet
Community
2
text
stringlengths
3
1.74M
label
class label
2 classes
source
stringclasses
3 values
How do I clear Software Center history?. <p>I have old Software Center history and I would like to clear it all.</p> <p>I tried</p> <pre><code>sudo rm -rf /var/log/apt/history.log /var/log/dpkg.log </code></pre> <p>but it did not work.</p>
0non-cybersec
Stackexchange
How to include a hash of a source file in the final PDF file?. <p>Suppose I've got a poem.tex source file. </p> <p>Is there a way to include a hash of the source file as text in the final PDF? I usually use <code>pdflatex</code> to generate PDF files.</p> <p>I am looking for something like the result of <code>shasum poem.tex</code>, looking like this: </p> <blockquote> <p>c0c0fa9a776ea1891264c884e0e69dbde6142c4a,</p> </blockquote> <p>being added somewhere to the body of the output file of the <code>pdflatex poem.tex</code> command.</p> <p>Is there an easy way to do it? </p>
0non-cybersec
Stackexchange
Are Your Children Making You Feel Guilty Right After Your Separation?.
0non-cybersec
Reddit
Boing Boing!.
0non-cybersec
Reddit
Toggling touch sensitivity for WACOM CTH-300 Bamboo Pad. <p>Under Ubuntu 14.10, I am having trouble configuring a wireless <strong>WACOM CTH-300 Bamboo Pad</strong> to toggle touch sensitivity on and off. At this point, the pen and tablet work as expected (mouse movement, pressure sensitivity, etc), and touch sensitivity is enabled as well (both single and multi-finger gestures work as expected). </p> <p>However, upon running <code>xsetwacom --list devices</code> in a terminal, the following is returned:</p> <pre><code>Wacom Co.,Ltd. Bamboo Pad, wireless stylus id: 12 type: STYLUS Wacom Co.,Ltd. Bamboo Pad, wireless eraser id: 16 type: ERASER Wacom Co.,Ltd. Bamboo Pad, wireless pad id: 17 type: PAD </code></pre> <p>...and nothing is stated about a <code>TOUCH</code> device. All of the previous answers I have stumbled upon suggest some sequence of <code>xsetwacom</code> commands to turn the <code>TOUCH</code> option off, but I do not know where to begin when that option isn't even listed.</p> <p>I am worried that my extensive hacking and package-installing to get the product fully functional in the first place is the cause of this current weird behavior. The WACOM tab in System Settings still states that no tablet is detected.</p> <p>Is there any reliable way to toggle touch sensitivity on and off for this product? I plan to have the functionality turned on and off frequently. </p>
0non-cybersec
Stackexchange
Can I use NRPT table on Windows Server 2012 R2 to override default DNS server settings for specific domains?. <p>I have domain-joined Windows Server 2012 R2 that I need to point to a non-default DNS server to resolve names under a certain internal domain not resolvable by AD. Is it possible to use NRPT (Name Resolution Policy Table) in Local Computer Policy for that? I tried to add a rule for "Generic DNS Server" bit it didn't seem to work. </p>
0non-cybersec
Stackexchange
Why does my program keep getting stuck while running the mandelbrot brainf*** program?. <p>I wanted to improve my C skills, so I search some program's ideas.</p> <p>Someone propose to create a simple Brainf*** interpreter and then a compiler. So here I am.</p> <p>I created the interpreter and it works as expected, except with the Mandelbrot program:</p> <pre><code>A mandelbrot set fractal viewer in brainfuck written by Erik Bosman +++++++++++++[-&gt;++&gt;&gt;&gt;+++++&gt;++&gt;+&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;++++++&gt;---&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+++++++++++++++[[ &gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]+[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;-]+[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-]&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-]+ &lt;&lt;&lt;&lt;&lt;&lt;&lt;+++++[-[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt; &gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;[-]+[&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-]&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt; &gt;&gt;&gt;&gt;&gt;[-]+&lt;&lt;&lt;&lt;&lt;&lt;++++[-[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;+++++++[-[-&gt;&gt;&gt; &gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;[[-]&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt; &gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;+&lt;&lt;&lt;+&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt; [&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;+&lt;&lt;&lt;+&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt; &lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;+&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+++++++++++++++[[ &gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]+&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;-]+[ &gt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;-&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;[ -&lt;&lt;+&gt;&gt;]&lt;&lt;[-&gt;&gt;+&gt;&gt;+&lt;&lt;&lt;&lt;]+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt; &lt;&lt;[&gt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt; [&gt;[-]&lt;-&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;+&gt;[&lt;-&gt;-&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;]&lt;[-&gt;+&lt;]&gt;&gt;&gt;&gt;]&lt;&lt;&lt;[-&gt;&gt;&gt;+&lt;&lt;&lt;]&lt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt; &gt;&gt;&gt;&gt;[&gt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;-&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;+ &lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;[-&lt;&lt;&lt;+&gt;&gt;&gt;]&lt;&lt;&lt;[-&gt;&gt;&gt;+&gt;+&lt;&lt;&lt;&lt;]+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt; &gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt;&gt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;&lt; +&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt;[-]&lt;-&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;+&gt;[&lt;-&gt;-&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;]&lt;[-&gt;+&lt;]&gt;&gt;&gt;&gt;]&lt;&lt;&lt;[-&gt;&gt;&gt;+&lt;&lt; &lt;]&lt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt; &gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+++++++++++++++[[&gt;&gt;&gt;&gt; &gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;-]+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt; &lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;[-&lt;&lt;&lt;-&gt;&gt;&gt;]+&lt;&lt;&lt;[-&gt;&gt;&gt;-&gt;[-&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt; &lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;[-]+&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;+&lt;]]+&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;-&gt;&gt;&gt;&gt;]+&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;-&lt;[-&lt;&lt;&lt;+&gt;&gt;&gt;]&lt;&lt;&lt;[-&gt; &gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;[-]+&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;[-]+&lt;]]+&gt;[-&lt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt; &lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;+&gt;&gt;&gt;-&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+++++++++++++++++++ +++++++&gt;&gt;[-&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;+&lt;&lt;[-]&lt;&lt;]&gt;&gt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&lt;[-&lt;+&gt;&gt;&gt;&gt;+&lt;&lt;[-]]&gt;[-&lt;&lt;[-&gt;+&gt;&gt;&gt;- &lt;&lt;&lt;&lt;]&gt;&gt;&gt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;[-]&gt;[-]&gt;[-]&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;[-]&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt; [-&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;+&lt;&lt;&lt;+&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt; &lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+++++++++++++++[[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]+&gt;[- ]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;-]+[&gt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt; &lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;-&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;[-&lt;&lt;+&gt;&gt;]&lt; &lt;[-&gt;&gt;+&gt;+&lt;&lt;&lt;]+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt;[-&gt;&gt;&gt;&gt; &gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt;[-]&lt;-&gt;&gt;&gt; [-&lt;&lt;&lt;+&gt;[&lt;-&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;[-&gt;+&lt;]&gt;&gt;&gt;]&lt;&lt;[-&gt;&gt;+&lt;&lt;]&lt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;[-&lt; &lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;+&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt; ]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;-&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;[-&lt;&lt;+ &gt;&gt;]&lt;&lt;[-&gt;&gt;+&gt;&gt;+&lt;&lt;&lt;&lt;]+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt; [-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt;[- ]&lt;-&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;+&gt;[&lt;-&gt;-&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;]&lt;[-&gt;+&lt;]&gt;&gt;&gt;&gt;]&lt;&lt;&lt;[-&gt;&gt;&gt;+&lt;&lt;&lt;]&lt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt; [&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt; ]&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt; &gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;++++++++ +++++++[[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;-]+[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;+ &gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;+&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;[ -]&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;+&gt;[-&lt;-&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;]&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;+&lt;++&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;[-&lt; &lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;]&lt;-&gt;+&gt;]&lt;[-&gt;+&lt;]&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;[-]&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;-&gt;&gt;&gt;&gt;]+&lt;&lt;&lt;&lt; [-&gt;&gt;&gt;&gt;-&gt;&gt;&gt;&gt;&gt;[&gt;&gt;[-&lt;&lt;-&gt;&gt;]+&lt;&lt;[-&gt;&gt;-&gt;[-&lt;&lt;&lt;+&gt;&gt;&gt;]&lt;&lt;&lt;[-&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;[-] +&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;+&lt;]]+&gt;&gt;&gt;[-&lt;&lt;&lt;-&gt;&gt;&gt;]+&lt;&lt;&lt;[-&gt;&gt;&gt;-&lt;[-&lt;&lt;+&gt;&gt;]&lt;&lt;[-&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt; &lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;[-]+&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;[-]+&lt;]]+&gt;[-&lt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt; [&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;+&gt;&gt;&gt;&gt;&gt;[&gt;+&gt;&gt;[-&lt;&lt;-&gt;&gt;]&lt;&lt;[-&gt;&gt;+&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt; &lt;&lt;&lt;+&lt;[&gt;[-&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&gt;&gt;&gt;+&lt;&lt;&lt;]&lt;]&gt;[-&gt;&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt; &lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;]&gt;[-&gt;&gt;&gt;&gt;+&lt;&lt;&lt;[-&gt;&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;]&gt;[-&gt;&gt;&gt;+&lt;&lt;&lt;]&lt;&lt; &lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;[-]&lt;&lt;&lt;&lt;]&gt;&gt;&gt;[-&lt;&lt;&lt;+&gt;&gt;&gt;]&lt;&lt;&lt;[-&gt;&gt;&gt;+&gt;&gt;&gt;&gt;&gt;&gt;[&gt;+&gt;[-&lt;-&gt;]&lt;[-&gt;+&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt; &lt;&lt;&lt;&lt;&lt;+&lt;[&gt;[-&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;[-&gt;&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;]&gt;]&lt;[-&gt;&gt;&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt; &lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;]&gt;&gt;[-&gt;&gt;&gt;+&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;]&lt;[-&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt; ]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;]]&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;+&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt; [&gt;[-&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&gt;&gt;&gt;+&lt;&lt;&lt;]&lt;]&gt;[-&gt;&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt; +&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;]&gt;[-&gt;&gt;&gt;&gt;+&lt;&lt;&lt;[-&gt;&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;]&gt;[-&gt;&gt;&gt;+&lt;&lt;&lt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt; &lt;&lt;&lt;&lt;&lt;]]&gt;[-]&gt;&gt;[-]&gt;[-]&gt;&gt;&gt;&gt;&gt;[&gt;&gt;[-]&gt;[-]&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;[-&lt; &lt;&lt;&lt;+&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;+&lt;&lt;&lt;+&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+++++++++++++++[ [&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]+&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;-]+ [&gt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;-&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;[-&gt;&gt; [-&lt;&lt;+&gt;&gt;]&lt;&lt;[-&gt;&gt;+&gt;+&lt;&lt;&lt;]+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt; &lt;[&gt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[ &gt;[-]&lt;-&gt;&gt;&gt;[-&lt;&lt;&lt;+&gt;[&lt;-&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;[-&gt;+&lt;]&gt;&gt;&gt;]&lt;&lt;[-&gt;&gt;+&lt;&lt;]&lt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[ &gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt; &gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;[-]&gt;&gt;&gt;&gt;+++++++++++++++[[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;-&lt;&lt;&lt;&lt;&lt; &lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;-]+[&gt;&gt;&gt;[-&lt;&lt;&lt;-&gt;&gt;&gt;]+&lt;&lt;&lt;[-&gt;&gt;&gt;-&gt;[-&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt; &lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;[-]+&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;+&lt;]]+&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;-&gt;&gt;&gt;&gt;]+&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;-&lt;[- &lt;&lt;&lt;+&gt;&gt;&gt;]&lt;&lt;&lt;[-&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;[-]+&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;[-]+&lt;]]+&gt;[-&lt;[&gt;&gt; &gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;[-&lt;&lt;&lt;+&gt;&gt;&gt;]&lt;&lt;&lt;[-&gt;&gt;&gt;+&gt;&gt;&gt;&gt;&gt;&gt;[&gt;+&gt;&gt;&gt; [-&lt;&lt;&lt;-&gt;&gt;&gt;]&lt;&lt;&lt;[-&gt;&gt;&gt;+&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&lt;[&gt;[-&gt;+&gt;[-&lt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt; +&gt;&gt;]&lt;]&gt;[-&lt;&lt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;]&gt;&gt;[-&lt;+&gt;&gt;[-&lt;&lt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;]&gt; [-&lt;&lt;+&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]]&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;+&gt;&gt;&gt;&gt;&gt;[&gt;+&gt;&gt;[-&lt;&lt;-&gt;&gt;]&lt;&lt;[-&gt;&gt;+&lt;&lt;]&gt;&gt; &gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&lt;[&gt;[-&gt;+&gt;&gt;[-&lt;&lt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;+&gt;]&gt;]&lt;[-&lt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt; &gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;]&gt;&gt;&gt;[-&lt;&lt;+&gt;[-&lt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;]&lt;[-&lt;+&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt; ]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;[-]&gt;[-]&gt;[-]&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;[-]&gt;[-]&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt; &lt;+&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;+&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;+&gt;[-&lt;-&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt; &gt;]&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;+&lt;++&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;]&lt;-&gt;+&gt;&gt;]&lt;&lt;[-&gt;&gt;+&lt;&lt;]&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;+&lt;&lt; &lt;&lt;&lt;]+&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;-&gt;&gt;&gt;&gt;]+&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;-&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;[-&lt;&lt;&lt;-&gt;&gt;&gt;]+&lt;&lt;&lt;[-&gt;&gt;&gt;-&lt;[-&lt;&lt;+&gt;&gt;]&lt;&lt;[-&gt;&gt;+&lt;&lt; &lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;[-]+&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;+&lt;]]+&gt;&gt;[-&lt;&lt;-&gt;&gt;]+&lt;&lt;[-&gt;&gt;-&gt;[-&lt;&lt;&lt;+&gt;&gt;&gt;]&lt; &lt;&lt;[-&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;[-]+&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;[-]+&lt;]]+&gt;[-&lt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt; &lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;[-&lt;&lt;&lt;+&gt;&gt;&gt;]&lt;&lt;&lt;[-&gt;&gt;&gt;+&gt;&gt;&gt;&gt;&gt;&gt;[&gt;+&gt;[-&lt;-&gt;]&lt;[-&gt;+ &lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&lt;[&gt;[-&gt;&gt;&gt;&gt;+&lt;&lt;[-&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&gt;&gt;&gt;+&lt;&lt;&lt;]&gt;]&lt;[-&gt;&gt;&gt;- &lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;]&gt;&gt;[-&gt;&gt;+&lt;&lt;&lt;[-&gt;&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;]&lt;[-&gt;&gt;&gt;+&lt;&lt;&lt; ]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;[-]&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;+&lt;&lt;&lt;&lt;&lt;]]&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;+&gt; &gt;&gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;+&gt;&gt;&gt;&gt;&gt;[&gt;+&gt;&gt;[-&lt;&lt;-&gt;&gt;]&lt;&lt;[-&gt;&gt;+&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&lt;[&gt;[-&gt;&gt;&gt;&gt;+&lt;&lt;&lt;[-&gt;&gt;&gt;- &lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&gt;&gt;+&lt;&lt;]&lt;]&gt;[-&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;]&gt;[-&gt;&gt;&gt;+&lt;&lt;[ -&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;]&gt;[-&gt;&gt;+&lt;&lt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]]&gt;&gt;&gt;&gt;[-]&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;+&gt;&gt; &gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;+&gt;[-]&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;+&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt; &gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt;[-&gt;&gt;&gt;&gt;+&lt;&lt;&lt;[-&gt;&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&gt;&gt;+&lt;&lt;]&lt;]&gt;[-&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt; &lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;]&gt;[-&gt;&gt;&gt;+&lt;&lt;[-&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;]&gt;[-&gt;&gt;+&lt;&lt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt; &lt;&lt;&lt;&lt;]]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;[-]&gt;[-]&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;[-]&gt;[-]&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;+ &gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;+&lt;&lt;&lt;+&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt; ]&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;+&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+++++++++++++++[[&gt;&gt;&gt;&gt; &gt;&gt;&gt;&gt;&gt;]+&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;-]+[&gt;+&gt;&gt; &gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;-&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;[-&lt;&lt;+ &gt;&gt;]&lt;&lt;[-&gt;&gt;+&gt;&gt;+&lt;&lt;&lt;&lt;]+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt; [-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt;[- ]&lt;-&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;+&gt;[&lt;-&gt;-&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;]&lt;[-&gt;+&lt;]&gt;&gt;&gt;&gt;]&lt;&lt;&lt;[-&gt;&gt;&gt;+&lt;&lt;&lt;]&lt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt; [&gt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;-&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt; &lt;&lt;[-&gt;&gt;&gt;[-&lt;&lt;&lt;+&gt;&gt;&gt;]&lt;&lt;&lt;[-&gt;&gt;&gt;+&gt;+&lt;&lt;&lt;&lt;]+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt; &gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt;&gt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;&lt;+&gt;&gt;&gt; &gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt;[-]&lt;-&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;+&gt;[&lt;-&gt;-&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;]&lt;[-&gt;+&lt;]&gt;&gt;&gt;&gt;]&lt;&lt;&lt;[-&gt;&gt;&gt;+&lt;&lt;&lt;]&lt;+ &lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt; &gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+++++++++++++++[[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt; &gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;-]+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;] &gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;[-&lt;&lt;&lt;-&gt;&gt;&gt;]+&lt;&lt;&lt;[-&gt;&gt;&gt;-&gt;[-&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt; ]&gt;&gt;&gt;&gt;[-]+&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;+&lt;]]+&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;-&gt;&gt;&gt;&gt;]+&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;-&lt;[-&lt;&lt;&lt;+&gt;&gt;&gt;]&lt;&lt;&lt;[-&gt;&gt;&gt;+&lt; &lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;[-]+&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;[-]+&lt;]]+&gt;[-&lt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt; &gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;-&gt;&gt;[-&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;+&lt;&lt;[-]&lt;&lt;]&gt;&gt;]&lt;&lt;+&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt; -&gt;&gt;&gt;&gt;]+&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;.&gt;&gt;]&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;.&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;&gt;&gt;[ &gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;[-]&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;[-]&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt; [&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;+++++++++++[-[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;&gt;&gt;&gt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt; &lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;+[-]&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt; &lt;&lt;&lt;&lt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-]+&gt;&gt;&gt;]&lt;&lt;&lt;&lt; &lt;&lt;&lt;&lt;&lt;&lt;]]&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&gt;&gt;[&gt;+&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;-&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;[-&gt;&gt;&gt; &gt;+&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt;&gt;&gt;&gt;&gt;[-&gt;&gt;+&lt;&lt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt; &lt;&lt;&lt;&lt;[&gt;[-]&lt;-&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;[&lt;-&gt;-&lt;&lt;&lt;+&gt;&gt;&gt;]&lt;[-&gt;+&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;]&lt; +&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;-&lt;&lt;&lt;&lt;[-]+&lt;&lt;&lt;]+&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;-&gt;&gt;&gt;&gt;&gt;&gt;&gt;]+&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;-&gt;&gt;[&gt;&gt; &gt;&gt;&gt;[-&gt;&gt;+&lt;&lt;]&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt;[-]&lt;-&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;[&lt;-&gt;-&lt;&lt;&lt;+&gt;&gt;&gt;]&lt;[-&gt;+&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt; &lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;]&lt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;+++++[-[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;&gt;&gt;&gt;+&lt;&lt;&lt; &lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;-&gt;&gt;&gt;&gt;&gt;]+&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;-&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt; &lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;[-]+&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;+&lt;]]+&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt; &lt;&lt;&lt;&lt;&lt;&lt;-&gt;&gt;&gt;&gt;&gt;&gt;&gt;]+&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;-&lt;&lt;[-&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt; &lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;[-]+&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;[-]+&lt;]]+&gt;[-&lt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt; &lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;[-]&lt;&lt;&lt;+++++[-[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;&gt;&gt;&gt;-&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt; &lt;&lt;]]&gt;&gt;&gt;]&lt;&lt;&lt;&lt;.&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;[-]&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;++++++++++[-[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt; &gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;&gt;&gt;&gt;&gt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt; &lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+[-]&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt; &gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-]+&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt; &lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&gt;[&gt;+&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;-&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt; &gt;&gt;]&lt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt;&gt;&gt;&gt;&gt;&gt;[-&gt;&gt;+&lt;&lt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt;[-]&lt;- &gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;[&lt;-&gt;-&lt;&lt;+&gt;&gt;]&lt;[-&gt;+&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;+&lt;&lt;&lt;&lt;&lt;&lt; &lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;-&lt;&lt;&lt;&lt;&lt;[-]+&lt;&lt;&lt;]+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;-&gt;[&gt;&gt;&gt; &gt;&gt;&gt;[-&gt;&gt;+&lt;&lt;]&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&gt;[-]&lt;-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;[&lt;-&gt;-&lt;&lt;+&gt;&gt;]&lt;[-&gt;+&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt; &lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&lt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;+++++[-[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;&gt;&gt;&gt;&gt; +&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;-&gt;&gt;&gt;&gt;&gt;&gt;]+&lt; &lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;-&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt; &lt;&lt;]&gt;&gt;&gt;&gt;[-]+&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;+&lt;]]+&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;[-&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt; -&lt;&lt;[-&lt;&lt;&lt;&lt;&lt;&lt;+&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;[-&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;[-]+&gt;&gt;&gt;&gt;&gt;&gt;[&gt;&gt;&gt;&gt;&gt;&gt; &gt;&gt;&gt;]&gt;[-]+&lt;]]+&gt;[-&lt;[&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;[-]&lt;&lt;&lt;++++ +[-[-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;+&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;]&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;]&gt;&gt;&gt;&gt;&gt;-&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;-&lt;&lt;&lt;&lt;&lt;&lt;[&lt;&lt;&lt;&lt; &lt;&lt;&lt;&lt;&lt;]]&gt;&gt;&gt;] </code></pre> <p>I don't understand why, but my program keeps getting stuck in some sort of endless loop. I try to debug it using gdb but it's hard to find the right breakpoint in order to see why it stuck.</p> <p>The program is as follows:</p> <pre class="lang-c prettyprint-override"><code>#include &lt;stdio.h&gt; #include &lt;stdlib.h&gt; // Brainfuck instructions // &gt; Math stuff #define INCR '+' // +1 on current MS #define DECR '-' // -1 on current MS // &gt; Memory slot stuff #define FORW '&gt;' // Go to next MS #define BACK '&lt;' // Go to previous MS // &gt; Logic stuff #define SJMP '[' // Loop till current MS value is equal to zero #define EJMP ']' // Jump to the beginning of the loop // &gt; I/O stuff #define PRTC '.' // Print character with MS value as ASCII code #define GETC ',' // Get an user input ASCII character code typedef unsigned char byte; // The brainfuck program struct typedef struct { byte *values; int size; int index; byte *loops_starts; int loop_size; int loop_index; } BrainfuckProgram; void initialize(BrainfuckProgram *bfp) { bfp-&gt;values = malloc(bfp-&gt;size * sizeof(*bfp-&gt;values)); bfp-&gt;loops_starts = malloc(bfp-&gt;size * sizeof(*bfp-&gt;loops_starts)); } int allocate_values(BrainfuckProgram *bfp) { byte *newMem = realloc(bfp-&gt;values, bfp-&gt;size * sizeof(byte)); if (!newMem) { return 1; } bfp-&gt;values = newMem; return 0; } int allocate_new_loop(BrainfuckProgram *bfp) { byte *newMem = realloc(bfp-&gt;loops_starts, bfp-&gt;loop_size * sizeof(byte)); if (!newMem) { return 1; } bfp-&gt;loops_starts = newMem; return 0; } void set_value(BrainfuckProgram *bfp, byte value) { int tempValue = value &lt; 0 ? 255: value % 256; *(bfp-&gt;values + bfp-&gt;index) = tempValue; } int get_value(BrainfuckProgram *bfp) { return *(bfp-&gt;values + bfp-&gt;index); } // FILE functions int get_file_name(int argc, char *argv[], char** fname) { if (argc == 1) { printf("File name is missing\n"); return 1; } *fname = argv[1]; return 0; } int get_file_size(FILE *file) { fseek(file, 0L, SEEK_END); int size = ftell(file); rewind(file); return size; } // Main function int main(int argc, char *argv[]) { // Vector part BrainfuckProgram bfp = { .values = NULL, .size = 1, .index = 0, .loops_starts = NULL, .loop_index = 0, .loop_size = 0 }; initialize(&amp;bfp); // FILE Part char* fname = NULL; int error = get_file_name(argc, argv, &amp;fname); if (error) { goto exit; } // Create file variable FILE *fin = NULL; fin = fopen(fname, "r"); int size = get_file_size(fin); // Create a char array of the right size byte *prog = NULL; prog = malloc(size * sizeof(*prog)); // Read 1 byte size times fread(prog, 1, size, fin); for (int i = 0; i &lt; size; i++) { byte current = *(prog+i); switch (current) { case INCR: set_value(&amp;bfp, get_value(&amp;bfp) + 1); break; case DECR: set_value(&amp;bfp, get_value(&amp;bfp) - 1); break; case FORW: // if index+1 == size then we are at the // last element of the vector cause // size = index - 1 if (bfp.index+1 == bfp.size) { bfp.size++; int error = allocate_values(&amp;bfp); if (error) { printf("an error occured while forwarding pointer"); goto close; } } bfp.index++; break; case BACK: // bfp.index == 0 then !bfp.index == true if (!bfp.index) { printf("can go back from index 0\n"); goto close; } bfp.index--; break; case SJMP: if (bfp.loop_index == bfp.size) { bfp.loop_size++; int error = allocate_new_loop(&amp;bfp); if (error) { printf("an error occured while forwarding pointer"); goto close; } } bfp.loop_index++; *(bfp.loops_starts + bfp.loop_index) = i; break; case EJMP: if (bfp.loop_index == -1) { printf("cannot go back"); goto close; } if (get_value(&amp;bfp) != 0) { i = *(bfp.loops_starts + bfp.loop_index); } else { bfp.loop_index--; } break; case PRTC: printf("%c", get_value(&amp;bfp)); break; case GETC: ; // Semicolon here because of the label error byte buf; scanf("%c", &amp;buf); set_value(&amp;bfp, buf); break; } } close: fclose(fin); exit: ; return 0; } </code></pre> <p>I'd like to have some C related advice on what I have done wrong too.</p>
0non-cybersec
Stackexchange
Tracking. If a gmail id is used to send a mail can it be traced back to the device used to send it? I know that header from the email contains the originating ip as of google server but they must be having the record of the email which the servers recieve. And if the gmail account is deleted do google still keep ip address records for that email?
1cybersec
Reddit
Recursion not available, but still gives answer. <p>I tried to dig a domain on a non-recursive DNS server. From what I know (so far), a non recursive DNS is not supposed to answer what they are not authoritative for.</p> <p>For example :</p> <pre><code>[root@dhcppc14 vwxyz]# dig muse.mu @202.159.36.218 ; &lt;&lt;&gt;&gt; DiG 9.8.2rc1-RedHat-9.8.2-0.30.rc1.el6_6.3 &lt;&lt;&gt;&gt; muse.mu @202.159.36.218 ;; global options: +cmd ;; Got answer: ;; -&gt;&gt;HEADER&lt;&lt;- opcode: QUERY, status: NOERROR, id: 46239 ;; flags: qr rd; QUERY: 1, ANSWER: 1, AUTHORITY: 0, ADDITIONAL: 0 **;; WARNING: recursion requested but not available** ;; QUESTION SECTION: ;muse.mu. IN A ;; ANSWER SECTION: **muse.mu. 3600 IN A 162.249.109.50** ;; Query time: 253 msec ;; SERVER: 202.159.36.218#53(202.159.36.218) ;; WHEN: Sat Jun 27 05:58:14 2015 ;; MSG SIZE rcvd: 41 </code></pre> <p>Could you explain what exactly happened?</p> <p>Thanks,</p>
0non-cybersec
Stackexchange
Methods to Estimate Optimal Distance Measure for Multidimensional Data Set. <p>My problem at hand pertains to choosing a distance measure for use in locally weighted regression. In my particular problem, I have a data set that is upwards of 10 dimensions, where the variables have different units (think distances, speeds, angles).</p> <p>The way I am formulating the problem is along the following lines:</p> <p>First, given some matrix $M$, we will compute a local Least Square solution, given some local set of data about $\textbf{x}$ defined as $\lbrace \left(\textbf{x}_i, y_i\right)\rbrace_{i=1}^N$, using the following:</p> <p>$$ \beta^*(\textbf{x},M) = \text{arg}\min_{\beta} \frac{1}{2N} \sum_{i=1}^N \text{d}(\textbf{x}_i,\textbf{x},M) \left(f(\textbf{x}_i, \beta) - y_i\right)^2$$</p> <p>Given that:</p> <p>\begin{align} \text{d}(\textbf{u},\textbf{v},M) &amp;= \sqrt{(\textbf{u}-\textbf{v})^TM^TM(\textbf{u}-\textbf{v})}\\ f(\textbf{x},M) &amp;= \sum_{j=1}^p\beta_j(\textbf{x},M)\phi_j(\textbf{x}) \end{align}</p> <p>Then, we wish to find $M$ such that this solution is minimized at a set of separate training points, $\lbrace \left(\hat{\textbf{x}}_i,\hat{y}_i \right) \rbrace_{i=1}^P$, defined as:</p> <p>\begin{align} M^{*} &amp;= \arg \min_{M} \frac{1}{2P} \sum_{i=1}^P \left(f(\hat{\textbf{x}}_i, \beta^*(\hat{\textbf{x}}_i,M)) - \hat{y}_i\right)^2 \end{align}</p> <p>where $\text{d}(\cdot,\cdot,\cdot)$ is the distance measure for the data set based on some weighting matrix $M$, $\mathbf{\beta}_j(\textbf{x},M)$ is the $j^{th}$ term in the local least square coefficient solution based on some weighting matrix $M$, and $\phi_j$ is the $j^{th}$ basis function used to represent the unknown function locally. The whole point of this is to construct a distance measure that can be used with a whole dataset $D$ and allow for an efficient and accurate non-parametric representation. Note as well that this distance measure would come into play using a KD-Tree for finding the local dataset used in the local Least Square solution.</p> <p>Based on this formulation, the optimization problem for $M^*$ appears non-convex, so I would like to know if there's any other approaches that might be better? I haven't had much success thus far finding any information, though I might not know the right thing to search for.</p> <p>I want to note that I actually have tried scaling each term of the vector, based on the variance in its possible values, and this did not really work robustly enough. I should also note for the angular measurements, I actually find the smallest signed angle difference in the $(\textbf{u}-\textbf{v})$ operation (ie $359^o-6^o=-7^o)$.</p>
0non-cybersec
Stackexchange
Firefox redirecting to other webpages and Adobe Flash Player plugin update button redirects to other webpage (not the adobe offical page). <p>When I try to update the Adobe Flash Player plugin for Firefox by clicking on the button for updating the plugin, it redirects to itsmyviews.com. In addition, when I visit the any site, my browser transfers data from nexac.com, itsmyviews.com and many other sites which I can not read because they are changing quickly. It also attempts to connect to bh.contextweb.com, s7.addthis.com and many other sites. When I visit the any webpage an advertisement covers the whole windows when I try to close that ad then that tab of the browser automatically disappear. Screen Shot of my PC. <a href="https://i.stack.imgur.com/K3EPe.png" rel="nofollow noreferrer">https://i.stack.imgur.com/K3EPe.png</a></p>
1cybersec
Stackexchange
IIS 6.5 application hangs - strange behavior. <p>Ok, here are the symptoms in chronological order:</p> <p>(iis 6.5 - asp.net 2.0 - windows server 2003)</p> <ul> <li>Application pool drops all requests. (dropped, and abandoned by reqQueue)</li> <li>Trying to log into application from VPN connection only shows hourglass, never loads</li> <li>Logging into the server and opening app on local host: applications in app pool run fine</li> <li>Reset app pool</li> <li>Application runs again for 5 minutes then starts hanging again.</li> <li>Create a new app pool</li> <li>Move the application to this pool.</li> <li>Application runs again for 5 minutes then starts hanging again in new app pool.</li> <li>Restart the server</li> <li>Applications run for about a week until same scenario restarts again</li> </ul> <p>This was not happening until recently about a week after a new release was installed and deployed on the server. Minor coding changed were implemented. </p> <ul> <li>Changed the redirection of my login page from a 'Server.Transfer' to a 'Response.Redirect'</li> <li>Added a section to grab data from the DB to a asp:label. </li> </ul> <p>Stuff that hasn't worked:</p> <ul> <li>Creating new app poool</li> <li>Recycling App Pool</li> <li>Restarting App Pool</li> </ul> <p>More Strange behavior:</p> <ul> <li>Windows Installer now freezing up and not allowing me to install a text .msi i created</li> <li>Screen hangs when I try to add a new Performance Counter</li> </ul> <p>Error logs not showing any thing that i can see to cause this problem. I will add more details if I think they can help. </p>
0non-cybersec
Stackexchange
Execute commands coming from a serial port. <p>I have some hardware that is sending commands over /dev/ttyACM0 every once in a while and I'd like to execute them in a terminal. For example, if the ascii "ls" comes over /dev/ttyACM0, I'd like to have a terminal actually run that. Is there some command-line-fu I can use to do that?</p>
0non-cybersec
Stackexchange
Any Red5 Working Example Project for 0.9 release. <p>I'm trying to find 1, just 1, working sample project for Red5 that's updated to work against the latest 0.9 release without missing jars and other nonsense. </p> <p>Right now, it's at v0.9 and the libs are different from other versions. They have 5 pathetic examples on their website, but all were built with the older versions. For these 5 old examples, I could use the Add External JARS feature to try and add libs from previous versions, they don't mention which versions they were built against and I'm not going to try each previous version to see which works (I already did and nothing works). They don't seem to be putting any effort into updating or marketing their open source project.</p> <p><strong>Anyone who's more intelligent and can shed some light on behalf of these fools?</strong></p>
0non-cybersec
Stackexchange
sed command to exclude specific lines in file between range of pattern. <p>I want to do substitution using sed command, but also this should not get applied to specific range of lines matching some pattern/word.</p> <p>File has below lines:</p> <pre class="lang-none prettyprint-override"><code>startline1 top nice good bad nice nice verybad Extremely bad bad nice endline1 nice </code></pre> <p>Trail from my end: <strong><code>sed -i '/startline1/,/endline1/ s/nice/decent/'</code></strong> The substitute must happen between <code>startline1</code> and <code>endline1</code> But must exclude the update between <code>bad</code> and <code>verybad</code> words</p> <p>With the above command I get result as below:</p> <pre class="lang-none prettyprint-override"><code>startline1 top decent good bad decent decent verybad Extremely bad bad decent endline1 nice </code></pre> <ul> <li>This will do a replacement between only <code>startline1</code> and <code>endline1</code>, which is as expected.</li> <li>But now I don't want the update to happen between <code>bad</code> and <code>verybad</code>.</li> </ul> <p><strong>Expected Result:</strong></p> <pre class="lang-none prettyprint-override"><code>startline1 top decent good bad nice nice verybad Extremely bad bad decent endline1 nice </code></pre> <p>Any suggestion on this would be of help.</p>
0non-cybersec
Stackexchange
Not my cat, but this is too awesome not to post!.
0non-cybersec
Reddit
What did you eat today. I had lentils, carrots, a vegan burger, an avacado, a banana, and an apple. I ate all of this in one meal at 4pm and that's it for the day. I feel that I had lots of energy all day from not having to digest breakfast. r/omeod r/omad
0non-cybersec
Reddit
How do I left-justify the date in document class letter?. <p>Really basic question, but I'm having trouble finding documentation. How can I left-justify the date in <code>\documentclass{letter}</code>?</p>
0non-cybersec
Stackexchange
Greenland in March; according to the flight attendant, it's usually too cloudy to see it this clearly [3024x4032][OC].
0non-cybersec
Reddit
What does this turing machine do?. <p>The following turing machine has the only accepting state $q_1$. Its initial state is $q_0$. The input consists of elements from $\{0,1\}$. My exercise says that I have to interpretate the input of the machine as a binary number. Which mathematical question does the machine answer then?</p> <p>What I see: From the initial state the machine goes to the right end of the input, without changing something. Then it goes to the left site, replacing every character by a blank. In the end, the output is blank. Whether the machine accepts the input or not depends on the state, in which it reaches the left end. So the machine is actually just a state-to-state-maze. I drew an according graph of it. Allthough it seems that the structure of the machine is very simple, I can't find a very "simple" answer about what the machine answers.</p> <p>Thanks in advance!</p> <p><a href="https://i.stack.imgur.com/OONgP.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/OONgP.png" alt="Transition table of the turing machine."></a></p>
0non-cybersec
Stackexchange
Recovering truncated file. <p>I'm in a peculiar situation. While editing a Perl program I accidentally truncated the file to zero length (using an Emacs lisp code I was developing). I need to recover that program... How do I that ?</p> <p>I tried debugfs utility but that was of no help cuz the program wasn't deleted but truncated to zero length &amp; then saved by the lisp code without a prompt.</p>
0non-cybersec
Stackexchange
Greatest Ever Crowd Catch?.
0non-cybersec
Reddit
Cheap protein $1 off farmland pork. Look for these if your supermarket (southeast idaho here) carries farmland pork products they pop up every 3 months and they don't look like coupons they look like recipe cards that most people ignore but when you open them up they have $1 off 1 package $2 off 2 packages and $3 off 3 packages of farmland fresh pork products. I trick it and buy the individually wrapped pork steaks so I end up getting $1 off each one and end up with pork steaks for pocket change. http://imgur.com/z9JFUoR
0non-cybersec
Reddit
Nathan Fillion via Twitter - @tradertiki: ...my wife and I just named our son Malcolm Reynolds....” He will be amazing & adored, then Fox will cancel him after 14 eps..
0non-cybersec
Reddit
Collection Equality is Hard.
0non-cybersec
Reddit
Pages with dynamically loaded content and SEO. <p>This question is not bound to a particular web technology. If I load a page that is basically a blank shell and on page load I start getting all the content from the server with ajax requests, won't the page appear as a contentless page to crawlers like Google's?</p> <p>I've seen that an increasing number of pages do this, basically they just load up super fast with only a "Loading" indicator and then they gradually assemble the content. How does this work with SEO?</p> <p>Thanks.</p>
0non-cybersec
Stackexchange
Blanco - Calypso (Full Album).
0non-cybersec
Reddit
Firebase retrieve the user data stored in local storage as firebase:authUser:. <p>I am working with Firebase and AngularJS. I am using Auth authentication for google login and i completed the process.Now i need to retrieve the user data that is stored in local storage like firebase:authUser:.</p> <p>Once i login with google account in local storage you have firebase:authUser:.created and i need to fetch these details.</p> <p>I used the following method to store user data </p> <pre><code>firebase.database().ref('users/' + user.uid).set ({ name: user.displayName, email: user.email, token: token }); </code></pre>
0non-cybersec
Stackexchange
ITAP of Los Angeles smog.
0non-cybersec
Reddit
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application. I need to scale my app adding some spot instances that EB do not support.</p> <p>So I create a second autoscaling from a launch configuration with spot instances. The autoscaling use the same load balancer created by beanstalk.</p> <p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p> <p>This work fine, but:</p> <ol> <li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p> </li> <li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p> </li> </ol> <p><strong>UPDATE</strong></p> <p>Elastic Beanstalk add support to spot instance since 2019... see: <a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
0non-cybersec
Stackexchange
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application. I need to scale my app adding some spot instances that EB do not support.</p> <p>So I create a second autoscaling from a launch configuration with spot instances. The autoscaling use the same load balancer created by beanstalk.</p> <p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p> <p>This work fine, but:</p> <ol> <li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p> </li> <li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p> </li> </ol> <p><strong>UPDATE</strong></p> <p>Elastic Beanstalk add support to spot instance since 2019... see: <a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
0non-cybersec
Stackexchange
If I got a loan and didn't use all the money (e.g. a loan of $17,000 and only $13,000 is used) could the portion I didn't use go back to paying off the debt?.
0non-cybersec
Reddit
Access modifiers in combination of interpreter pattern with template method pattern. <p><strong>Motivation:</strong> (Skip to "The Problem" if you don't need motivation for it)</p> <p>As a project for myself, I'm writing an expression parser for certain kinds of mathematical expressions, and I'm using the interpreter pattern (as it often is used) for my Expression classes. </p> <p>At the same time, I'm <em>also</em> using the template method pattern for certain operations I wanna do on my Expressions. My use of the template method pattern is where the template method is "public", but the primitive operations called by the template method should not be "public" to the user. (This is how I learnt it, and this feels like it makes the most sense for my program.) </p> <p>The specific example I was dealing with was trying to simplify an expression; there are several different simplification functions (let us call them simplify1, simplify2, and so on) I used, and each are called inside the Expression class (for example, one of my simplification functions evaluates all constant expressions, e.g. 1+2^(2*3) simplifies to 65, another simplification function simplifies repeated operations, eg. x+(3+x^2) simplifies to x+3+x^2). The way this works in each of the Expression subclasses which are non-terminal is that there are recursive calls to the contained expressions, until a terminal "Constant" or "Variable" is reached.</p> <p>Now, the problem is that these different simplification functions <em>should</em> be hidden from the user; the interface should only allow a call to the template method "simplify", which calls all the different simplification functions as needed. Initially, I thought that making those simplify functions "protected" would solve the problem. That is, in my child classes, I would have "simplify1", "simplify2" and so on overridden, and then in the parent expression class, "simplify" would call "simplify1", then "simplify2", and so on, and "simplify" itself would be public. However, the problem is that in non-terminal classes (an expression that itself contains expressions), having a protected modifier on simplify1, simplify2, and so on, <em>does not allow</em> it to call simplify1, simplify2, etc. on the contained expressions.</p> <p><strong>The Problem:</strong></p> <p>Abstracting away the motivation ("Expression" becomes "Parent", the different derived expression classes are the "Child" classes ("ChildC" specifically is a non-terminal expression), "simplify" becomes "publicFoo", and "simplify1" and "simplify2" become "foo1" and "foo2" respectively), I want code that behaves like this:</p> <pre><code>class Parent { //abstract expression protected: virtual void foo1() = 0; //primitive operation, don't wanna give access to public virtual void foo2() = 0; //primitive operation, don't wanna give access to public public: void publicFoo(){ //template method this -&gt; foo1(); this -&gt; foo2(); //maybe does other things too }; // this is what the user will call }; class ChildA: public Parent { //terminal expression protected: void foo1() override; //whatever implementation void foo2() override; //whatever implementation }; class ChildB: public Parent{ //terminal expression protected: void foo1() override; //whatever implementation void foo2() override; //whatever implementation }; class ChildC: public Parent { //non terminal expression std::vector&lt;Parent*&gt; parents; protected: void foo1() override { for ( auto p: parents){ p-&gt;foo1(); //calls correct foo1 depending on what p truly is (this does not compile) } } void foo2() override { for ( auto p: parents){ p-&gt;foo2(); //calls correct foo2 depending on what p truly is (this does not compile) } } }; </code></pre> <p>So, the problem here is that "protected" actually <em>doesn't</em> allow calling foo1 or foo2 on arbitrary Parent type objects, only on ChildC objects, and the compiler gives me errors saying "'foo1' is a protected member of 'Parent'" and "'foo2' is a protected member of 'Parent'". It <em>feels</em> like what I want is a modifier that's something like "semi-protected", which allows access for a derived class to call semi-protected functions of any kind of parent object.</p> <p><strong>Temporary Solution:</strong></p> <p>My current solution to this is to simply make the ChildC (in the example above) a friend class to Parent, and then make foo1 and foo2 private (because ChildC, as a friend, can access those anyway). However, in my time using C++, I've learnt that friend classes are usually discouraged and are considered bad style (or something of the sort). And in general, the solution doesn't feel as nice as it could be, because I don't need ChildC to have <em>that</em> much access to Parent's members. </p> <p><strong>Question:</strong></p> <p>Thus, my question is, is there a nicer way to combine these patterns while ensuring that the primitive operations with the template method pattern remain hidden to the user?</p>
0non-cybersec
Stackexchange
My Walmart receipt was printed on Target paper..
0non-cybersec
Reddit
Years later, Former Jets great Mark Gastineau wants full credit for NFL’s single-season sack record..
0non-cybersec
Reddit
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application. I need to scale my app adding some spot instances that EB do not support.</p> <p>So I create a second autoscaling from a launch configuration with spot instances. The autoscaling use the same load balancer created by beanstalk.</p> <p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p> <p>This work fine, but:</p> <ol> <li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p> </li> <li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p> </li> </ol> <p><strong>UPDATE</strong></p> <p>Elastic Beanstalk add support to spot instance since 2019... see: <a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
0non-cybersec
Stackexchange
bash script error when running executing openvpn service. <p>I am trying to develop a bash script that calls a service from within:</p> <pre><code>#!/bin/bash interface=dev0 mycommand="sudo openvpn --config '/etc/openvpn/optionFile.ovpn'" $mycommand </code></pre> <p>When I run the script I get the following error:</p> <pre><code>Options error: In [CMD-LINE]:1: Error opening configuration file: '/etc/openvpn/optionFile.ovpn' </code></pre> <p>The permissions to the file are also set correctly and I am executing the file as root</p>
0non-cybersec
Stackexchange
Damn....
0non-cybersec
Reddit
[Fresh Album] CyHi The Prynce - No Dope On Sundays.
0non-cybersec
Reddit
Sharing components between modules. <p>In my project, I have the main app module, which has dependencies on submodules I added for my project, let's say one is for a custom alert dialog, another for custom views, etc...</p> <p>How can I get a reference of a value in a submodule from the main app module? As an example, the custom alert dialog which has a layout xml needs to take a color value which is found in the main app module.</p> <p>I tried to add the main app module as a dependency in the submodule but that definitely won't work since there will be a circular dependency.</p>
0non-cybersec
Stackexchange
Equality-preserving embeddings of finite trees. <p>For finite trees $T_{1}$ and $T_{2}$ labelled by elements of some infinite set $S$, (we may assume that $S=\mathbb{N}$ without loss of generality), we define an equality-preserving embedding $f$ to be an embedding of $T_{1}$ into $T_{2}$ in the usual graph-theoretical sense (i.e. a homeomorphism) with the extra condition that $l_{1}(x)=l_{1}(y)$ implies $l_{2}(f(x))=l_{2}(f(y))$ for all vertices $x,y$ of $T_{1}$ (where $l_{1}$, $l_{2}$ are the labelling function for $T_{1}$ and $T_{2}$, respectively). We say that $T_{1}$ is an equalitiy-preserving minor of $T_{2}$, written $T_{1}\prec_{ep}T_{2}$ iff there is an equality-preserving embedding $f:T_{1}\rightarrow T_{2}$. (Note that we do not demand that differently labelled vertices are mapped to differently labelled vertices.)</p> <p>Is $\prec_{ep}$ a well-quasi-ordering or even a better-quasi-ordering on the set of finite trees labelled by natural numbers? (This holds, of course, by Kruskal's theorem if we replace $S$ with a finite set.)</p> <p>Edit: Considering only well-quasi-orderings for the moment, one can also model this as follows: Given a tree $T$, we introduce for each label $c$ a new vertex $v_{c}$, join it to all vertices of $T$ that have this label and forget about the labels. That makes the question almost an instance of the graph minor theorem (stating that the finite graphs are wqo under the minor relation) but for the fact that the embeddings must map extra vertices to extra vertices and tree vertices to tree vertices. This would follow if the graph minor theorem would continue to hold for graphs coloured with finitely many (in fact merely $2$) colours.</p>
0non-cybersec
Stackexchange
An little idea for Riot next year - Advent Calendar sale!. So I'm sitting up late watching IPL5 and in the break I was surfing the web. And find that many stores have an sale on some products everyday til December 24th (we celebrate chistmas on the 24th in Sweden) and was thinking Riot should do the same with a champion and/or skin everyday. Sounds like a sweet idea? I want this becouse I don't have a chocolate calandar anymore :(
0non-cybersec
Reddit
Rick and Morty Exquisite Corpse | Rick and Morty | Adult Swim.
0non-cybersec
Reddit
PKC McEliece + $S$ + $P$. <p>I am trying implement the <a href="http://en.wikipedia.org/wiki/McEliece_cryptosystem" rel="nofollow">McEliece crytosystem</a> in SAGE. My question is How I will be able to choose the appropriate matrix $S$ and $P$?. I ask this because when I trying obtain the vector $\hat{m}=mS$ in $\hat{G}\hat{m} = Decoding(c)$ I get: matrix equation has no solutions, even after verify that $G$ is full rank.</p>
0non-cybersec
Stackexchange
The Only People I Feel Are Truly My Friends Are Podcasters.. Pretty much just the title
0non-cybersec
Reddit
My Brother is Bankrupting the Imperial Treasury.
0non-cybersec
Reddit
Sri Lanka : Exit flight needed?. Hi. Im heading to Sri Lanka for 10 weeks. Going to extend my visa as soon as I arrive in Colombo. Will my airline make a fuss that my return flight is beyond the 30 day initial visa when I try to check in? I called them but the customer service don't seem to really know. Anyone had any experience with this? Thanks.
0non-cybersec
Reddit
I could use someone to talk to.. Anyone want to message and chat, listen, give advice, let me bounce ideas at them later on today? I have a few things I've been struggling with mentally lately. Edit: Wow, thanks so much you guys. I'll message a couple of you, and thanks so much for sharing links and offering your attention, I've never felt so welcome in a sub!
0non-cybersec
Reddit
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application. I need to scale my app adding some spot instances that EB do not support.</p> <p>So I create a second autoscaling from a launch configuration with spot instances. The autoscaling use the same load balancer created by beanstalk.</p> <p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p> <p>This work fine, but:</p> <ol> <li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p> </li> <li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p> </li> </ol> <p><strong>UPDATE</strong></p> <p>Elastic Beanstalk add support to spot instance since 2019... see: <a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
0non-cybersec
Stackexchange
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application. I need to scale my app adding some spot instances that EB do not support.</p> <p>So I create a second autoscaling from a launch configuration with spot instances. The autoscaling use the same load balancer created by beanstalk.</p> <p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p> <p>This work fine, but:</p> <ol> <li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p> </li> <li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p> </li> </ol> <p><strong>UPDATE</strong></p> <p>Elastic Beanstalk add support to spot instance since 2019... see: <a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
0non-cybersec
Stackexchange
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application. I need to scale my app adding some spot instances that EB do not support.</p> <p>So I create a second autoscaling from a launch configuration with spot instances. The autoscaling use the same load balancer created by beanstalk.</p> <p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p> <p>This work fine, but:</p> <ol> <li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p> </li> <li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p> </li> </ol> <p><strong>UPDATE</strong></p> <p>Elastic Beanstalk add support to spot instance since 2019... see: <a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
0non-cybersec
Stackexchange
I upgraded my family’s Hulu account to “no commercials” without telling my parents, who pay for it.. There was zero point to having Hulu with commercials, and I was over it. They won’t notice.
0non-cybersec
Reddit
How many eggs a day is too many?. They are just cheap fast and delicious but I know they are full of fat and cholesterol so should I be limiting myself. Right now I’m at 7-9 whole eggs a day
0non-cybersec
Reddit
My First Lady head. Done by Andy Canino at Dedication Tattoo in Denver..
0non-cybersec
Reddit
LearnProgramming: Changes are Coming!. We asked, you answered, and now it's our turn again to get some work done. In the near future there are going to be some changes to the LearnProgramming community. Some will start today, and some will start as soon as we have time to implement them. The changes we're making are to ensure that LearnProgramming remains a useful, friendly, and helpful community for people to learn all aspects of software development, from code and syntax, to frameworks and algorithms. #### **Self-Posts Only**: Starting today, LearnProgramming will only allow Self Posts. This means that no Karma will be received for anything posted in this subreddit. Feel free to make a Self Post about an external resource (blog, documentation, etc), but try to be verbose and describe the content if you can. #### **Reporting and Rules**: New rules will be implemented in the near future. Many subreddits have strict posting guidelines, and we will be adopting some form of a ruleset. The new rules will be posted in the sidebar. If you feel that a post has broken a rule, please report it and the moderation staff will remove or approve it accordingly. #### **User Flair**: There was a lot of discourse and questions about whether we should implement user flair, and if we do, what sort of data should be displayed. As a trial run, we've decided that we're going to allow users to edit their own flair, and flair will be used to display your **points of interest**. This is in no way a statement of qualification, and if it is used as such, it will be removed. The point of flair on LearnProgramming is to provide a convenient way for like-minded community members to find eachother. This will (hopefully) give members an easy way to find open source projects, mentors, partners, and resources. User Flair will be implemented in the near future once an appropriate style/template has been figured out. #### **This isn't Rent-a-Coder**: While this is going to be one of the official rules, it goes without saying that offering any type of reward (be it monetary or otherwise) is strictly prohibited on this subreddit. This is not a place to find cheap labour, it is a place to learn. Please let us know via comments on this post what you think of these changes, and suggest new and alternative ones if possible. The moderator staff are here to serve you guys, so let us know how we're doing.
0non-cybersec
Reddit
The definition of "stud". Probably not great at pillow talk however..
0non-cybersec
Reddit
How long does it take for an iptables rule to apply?. <p>How long does it take for an iptables rule to apply?</p> <p>I use a script with the code below in an attempt to block hosts, but they don't appear to take immediately. Is there some delay, is iptables not working or is the code just plain wrong?</p> <pre><code>#!/bin/sh echo $1 &gt;&gt; /etc/dropped_hosts iptables -A INPUT -s $1 -j DROP iptables -A OUTPUT -d $1 -j DROP </code></pre>
0non-cybersec
Stackexchange
How is a public scriptable site like codepad or ideone manages it&#39;s sandboxing?. <p>I've researched this stuff a lot in the recent months but I can't grasp any solid basis on how they achieve running unsafe scripts in so many languages without a problem!</p> <p>I'm sure they are running virtual machines since language specific sandboxes won't cut it, but what about white listing every language?</p> <p>There has to be another restraint I'm not seeing.</p>
0non-cybersec
Stackexchange
How do you programmatically set focus to the SelectedItem in a WPF ListBox that already has focus?. <p>We want to set the <code>SelectedItem</code> of a <code>ListBox</code> programmatically and want that item to then have focus so the arrow keys work relative to that selected item. Seems simple enough.</p> <p>The problem however is if the <code>ListBox</code> already has keyboard focus when setting <code>SelectedItem</code> programmatically, while it does properly update the <code>IsSelected</code> property on the <code>ListBoxItem</code>, it <em>doesn't</em> set keyboard focus to it, and thus, the arrow keys move relative to the previously-focused item in the list and not the newly-selected item as one would expect.</p> <p>This is very confusing to the user as it makes the selection appear to jump around when using the keyboard as it snaps back to where it was before the programmatic selection took place.</p> <p>Note: As I said, this only happens if you programmatically set the <code>SelectedItem</code> property on a <code>ListBox</code> that already has keyboard focus itself. If it doesn't (or if it does but you leave, then come right back), when the keyboard focus returns to the <code>ListBox</code>, the correct item will now have the keyboard focus as expected.</p> <p>Here's some sample code showing this problem. To demo this, run the code, use the mouse to select 'Seven' in the list (thus putting the focus on the <code>ListBox</code>), then click the 'Test' button. Finally, tap the 'Alt' key on your keyboard to reveal the focus rect. You will see it's still actually on 'Seven' and if you use the up and down arrows, they are relative to that row, not 'Four' as a user would expect.</p> <p>Note that I have <code>Focusable</code> set to <code>false</code> on the button as not to rob the listbox of focus when pressing it. If I didn't have this, the <code>ListBox</code> would lose focus when you click the button, and thus, when focus returned to the ListBox, it would be on the correct item.</p> <p>XAML file:</p> <pre><code>&lt;Window x:Class="Test.MainWindow" xmlns="http://schemas.microsoft.com/winfx/2006/xaml/presentation" xmlns:x="http://schemas.microsoft.com/winfx/2006/xaml" Width="525" Height="350" WindowStartupLocation="CenterScreen" Title="MainWindow" x:Name="Root"&gt; &lt;DockPanel&gt; &lt;Button Content="Test" DockPanel.Dock="Bottom" HorizontalAlignment="Left" Focusable="False" Click="Button_Click" /&gt; &lt;ListBox x:Name="MainListBox" /&gt; &lt;/DockPanel&gt; &lt;/Window&gt; </code></pre> <p>Code-behind:</p> <pre><code>using System.Collections.ObjectModel; using System.Windows; namespace Test { public partial class MainWindow : Window { public MainWindow() { InitializeComponent(); MainListBox.ItemsSource = new string[]{ "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight" }; } private void Button_Click(object sender, RoutedEventArgs e) { MainListBox.SelectedItem = MainListBox.Items[3]; } } } </code></pre> <p>Note: Some have suggested to use <code>IsSynchronizedWithCurrentItem</code>, but that property synchronizes the <code>SelectedItem</code> of the <code>ListBox</code> with the <code>Current</code> property of the associated view. It isn't related to focus as this problem still exists.</p> <p>Our work-around is to temporarily set the focus somewhere else, then set the selected item, then set the focus back to the <code>ListBox</code> but this has the undesireable effect of us having to make our <code>ViewModel</code> aware of the <code>ListBox</code> itself, then perform logic depending on whether or not it has the focus, etc. (i.e. you wouldn't want to simply say 'Focus elsewhere then come back here, if 'here' didn't have the focus already as you'd steal it from somewhere else.) Plus, you can't simply handle this through declarative bindings. Needless to say this is ugly.</p> <p>Then again, 'ugly' ships, so there's that.</p>
0non-cybersec
Stackexchange
I love drawing with this pen, there’s something about the casual simplicity of it. No erasing, no shading tools, just lines..
0non-cybersec
Reddit
A$AP Rocky - Peso.
0non-cybersec
Reddit
Non-Haken hyperbolic 3-manifolds without nonorientable surfaces. <p>It is well known that there exist infinitely many (non homeomorphic) non-Haken closed hyperbolic 3-manifolds. These can be obtained for example doing Dehn surgery on the figure eight knot complement. However, these manifolds may contain embedded nonorientable closed surfaces.</p> <p>So, my question is:</p> <p>Are there infinitely many (non homeomorphic) non-Haken closed hyperbolic 3-manifolds, which does not contain embedded nonorientable closed surfaces?</p>
0non-cybersec
Stackexchange
Group completion of labelled configuration space on Euclidean spaces. <p>In the lecture notes <a href="http://www.math.uchicago.edu/~may/BOOKS/homo_iter.pdf" rel="nofollow">The Homology of $\mathcal{C}_{n+1}$-spaces, $n\geq 0$, F. Cohen</a>, page 225 -226, it is obtained that there is a group completion on homology $$ \alpha_n: C(\mathbb{R}^n;X)\to \Omega^n\Sigma^n X.$$ Moreover, I find that $$ \Omega^n\Sigma^nS^0=\Omega^n S^n=\bigsqcup_{q\in \mathbb{Z}}\{f\in [S^n,S^n]_*\mid \deg (f)=q\}. $$ Let $$ \{f\in [S^n,S^n]_*\mid \deg (f)=q\}=\Omega_q^nS^n$$ then $$ \Omega^n\Sigma^nS^0=\bigsqcup_{q\in\mathbb{Z}}\Omega_q^nS^n. $$ I find in some references that $$ C(\mathbb{R}^n;S^0)=\bigsqcup_{k\geq 0}F(\mathbb{R}^n,k)/\Sigma_k. $$ Let $\alpha_{n,k}$ be the restriction of $\alpha_n$ to $F(\mathbb{R}^n,k)/\Sigma_k$.</p> <p><strong>Question:</strong> I want to obtain the ring structure of $H^*(F(\mathbb{R}^n,k)/\Sigma_k;\mathbb{Z}_2)$. Is there any way to obtain it? Do we have a well-defined map $$\alpha_{n,k}: F(\mathbb{R}^n,k)/\Sigma_k\to\Omega_k^nS^n$$ that induces a ring isomorphism $$ H^*(\Omega_k^nS^n;\mathbb{Z}_2)\to H^*(F(\mathbb{R}^n,k)/\Sigma_k;\mathbb{Z}_2)? $$</p>
0non-cybersec
Stackexchange
Issue migrating MVC3 Application to MVC4: Compiler Error Message: CS1513: } expected. <p>This is a really weird error, I think it may be a razor bug. I'm using VS 2012, MVC4, Framework 4.5.</p> <p>Following these instructions: <a href="http://www.asp.net/whitepapers/mvc4-release-notes#_Toc303253806">http://www.asp.net/whitepapers/mvc4-release-notes#_Toc303253806</a> I created a new MVC4 project and then I copied all my code (controllers, views, viewmodels) to it from the MVC3 project.</p> <p>Eveything worked just fine, until I tested one View which has a custom helper and inside it it has one <code>foreach</code>, one <code>switch</code>, three <code>if</code> statements and then I call some other custom helpers in there too.</p> <p>It's exactly the same code in both projects, in MVC3 it works, but in MVC4 it shows this message:</p> <pre><code>Compiler Error Message: CS1513: } expected </code></pre> <p>So I tried adding one curly bracket but it shows the same error, so I keep adding brackets and it won't stop telling me the same thing.</p> <p>I googled this issue but I just found this question with no answer: <a href="http://www.1771.in/asp-net-mvc-4-issues-migrating-mvc3-view-in-vs-2012-rc.html">http://www.1771.in/asp-net-mvc-4-issues-migrating-mvc3-view-in-vs-2012-rc.html</a></p> <p>has anyone experienced this issue?</p>
0non-cybersec
Stackexchange
Looks like Night Mode will come to iOS.
0non-cybersec
Reddit
Epsilon-Delta Proof at infinity. <p>Let $n \in \mathbb{N}$ and $y \in \mathbb{R}$ and $0&lt;y&lt;1$. Let also be $f(y)=y^n$ and $g(y)=y^{n+1}$.</p> <p>$$ \lim_{n \to \infty} \cfrac{f(y)}{g(y)} = L $$</p> <p>What is the value of $L$ using the epsilon-delta definition of limit?</p> <hr> <p>Edit</p> <p>Consider $n \in \mathbb{R}$</p>
0non-cybersec
Stackexchange
Blursed impregnation.
0non-cybersec
Reddit
Upward continued fractions. <p>Has anybody seen "upward continued fractions", such as $$ \frac{1+\large{\frac{1+\large{\frac{1+...}{a_2}}}{a_1}}}{a_0} \quad? $$</p> <p>These can be formed, for any real number $x$ with $0&lt;x\le 1$, by defining $x_0:=x$ and inductively $$ a_n:=\lfloor{x_n}\rfloor+1\qquad\text{and}\qquad x_{n+1}:=a_nx_n-1. $$ It is easy to check that $1\le a_1\le a_2\le a_3\le\dots$, and that the sequence of $a_i$'s is eventually constant if and only if $x$ is rational. This procedure yields expressions like the one displayed above, since $$ x = \frac{1+x_1}{a_0}=\frac{1+\large{\frac{1+x_2}{a_1}}}{a_0} =\frac{1+\large{\frac{1+\Large{\frac{1+x_3}{a_2}}}{a_1}}}{a_0} = \cdots $$ I looked for these in google, wikipedia, and standard texts like Perron's, but couldn't find them. Have they been studied? I ask because a high school student invented these before my eyes today, and I'd like to tell him what he's rediscovered (assuming that in fact these have been studied before).</p>
0non-cybersec
Stackexchange
Found on snapchat. Gotta start ‘em off young.
0non-cybersec
Reddit
Maybe not as old school at a lot of pictures here, but this is my grandparent's first dance as husband and wife in 1967..
0non-cybersec
Reddit
Clinton is Getting More Money From Bush, Kasich and Christie Donors Than Trump [OC].
0non-cybersec
Reddit
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application. I need to scale my app adding some spot instances that EB do not support.</p> <p>So I create a second autoscaling from a launch configuration with spot instances. The autoscaling use the same load balancer created by beanstalk.</p> <p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p> <p>This work fine, but:</p> <ol> <li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p> </li> <li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p> </li> </ol> <p><strong>UPDATE</strong></p> <p>Elastic Beanstalk add support to spot instance since 2019... see: <a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
0non-cybersec
Stackexchange
Barroso's successor: the runners and riders .
0non-cybersec
Reddit
VSS Hardware Provider. <p>I have a Windows Server 2003 Marjority Node Set Cluster. There are VDisks from our EVA8000 connected. From these VDisks I would like to create Snapshots using VSS. The Snapshots should appear in the “Previous Versions” tab from the Properties from a folder. So a user can restore his data independently.</p> <p>I’ve installed the HP VSS Hardware Provider on one Node. So I’m able to create Snapshots with the command “vshadow –p” from the VSS SDK.</p> <p>Now I don’t think it is very thoughtfully to install on every Client (Windows XP) the SDK that a user can make restores from his data with a vshadow command. This method is not very easy to use and I don’t think that every user can handle this.</p> <p>Now my Questions: 1. Is there a possibility for the EVA8000 that the snapshots appear under "previous versions"? 2. Is there a possibility that the Snapshots which were created with the RSM appear in Windows as a Shadow Copy?</p> <p>I’m grateful for every hint.</p> <p>Best regards</p>
0non-cybersec
Stackexchange
Should we always unit test bugs when correcting them?. <p>When correcting bugs, it is encouraged where I work to first write a test that fails with the given bug, and then to fix the code until the test passes. This follows TDD practices, and is supposed to be good practice, but I noticed it tends to produce cryptic tests that come really close to the implementation.</p> <p>For instance, we had a problem when a job was sent, reached a certain state, was aborted, and retried. To reproduce this bug, a massive test was written with thread synchronization in it, lots of mocking and stuff... It did the job, but now that I am refactoring the code, I find it very tempting to just remove this mammoth, since it would really require a lot of work (again) to fit the new design. And it's just testing one small feature in a single specific case.</p> <p>Hence my question : how do you test for bugs that are tricky to reproduce ? How do you avoid creating things that test the implementation, and hurt refactoring and readability ?</p>
0non-cybersec
Stackexchange
Change mapping of function keys on a Mac keyboard. <p>I don't use dashboard much, the hardkey for dashboard is mostly useless for me, is there anyway to associate the dashboard key to some other operations like show 'Spaces'</p>
0non-cybersec
Stackexchange
Prove Existence of a Circle. <p>There are two circles with radius $1$, $c_{A}$ and ${c}_{B}$. They intersect at two points $U$ and $V$. $A$ and $B$ are two regular $n$-gons such that $n &gt; 3$, which are inscribed into $c_{A}$ and ${c}_{B}$ so that $U$ and $V$ are vertices of $A$ and $B$.</p> <p>Then suppose a third circle, $c$, with a radius of $1$ is to be placed so that it intersects $A$ at two of its vertices $W$ and $X$ and intersects $B$ at two of its vertices $Y$ and $Z$.</p> <p>Details and Assumptions:</p> <ol> <li><p>Assume that $U,V,W,X,Y,Z$ are all distinct points.</p></li> <li><p>$U$ lies outside of $c$.</p></li> <li><p>$V$ lies inside of $c$.</p></li> </ol> <p>Given all of these details, prove that there exists a regular $2n$-gon which comprises of $W,X,Y,Z$ as its 4 vertices.</p> <p><img src="https://i.stack.imgur.com/wRp1R.png" alt="Figure for n=12"></p> <p><img src="https://i.stack.imgur.com/2tAJZ.png" alt="Figure for n=15"></p>
0non-cybersec
Stackexchange
What are your best ideas for dates that you haven't had a chance to implement?.
0non-cybersec
Reddit
Cable stocks fall after Obama backs Net Neutrality.
0non-cybersec
Reddit
Apple Working With American Express on iPhone 6 Mobile Payments.
0non-cybersec
Reddit
Did the North American Natives give Europeons any foreign diseases?. We know Europeans brought over smallpox which killed millions of first nations. But did it work vise versa at all?
0non-cybersec
Reddit
Run a shell script with an html button. <p>I want to launch a bash script when a button is pressed on a website. This is my first attempt:</p> <pre><code>&lt;button type="button" onclick="/path/to/name.sh"&gt;Click Me!&lt;/button&gt; </code></pre> <p>But no luck. Any suggestions?</p>
0non-cybersec
Stackexchange
Tom Broke My Cake.
0non-cybersec
Reddit
How to completely disable NDK support in Android Studio. <p>We have a multi-platform project, with native support, that we are developing in Android Studio using libgdx. We have builds working for Desktop, IOS, Android, Android Wear, and HTML5.</p> <p>On each of these platforms, we have a different "native" plugin that we are using: a static .a native library on IOS, a .dll on Windows, a bunch of .so files in Android, and a Javascript library on HTML5. All of these, except for the HTML5 version, are built on separate platforms so can't possibly be built by the same Android Studio NDK build.</p> <p>The problem is that for each of the .java files that declare JNI routines, Android Studio 1.4.x wants to find the source files, but those source files can't possibly be compiled in the IOS project, and likewise for the PC project when running on a Mac.</p> <p>The standard solution on SO is to add </p> <pre><code>sourceSets { main { jni.srcDirs = [] //disable automatic ndk-build } } </code></pre> <p>To the android{} section, but this ONLY works for the Android, Android Wear launcher projects, and NOT Desktop, IOS, HTML5, etc.</p> <p>I just want Android Studio to give up on trying to compile NDK, because it can't possibly be done on non-Android projects. Other than finding a downgrade somewhere, how do I do that?</p> <p>Thanks!</p>
0non-cybersec
Stackexchange
Anyone with experience on pomeranian/border collie mixes?. I'm thinking about rescuing one from a local shelter but I have some questions about the breed mix. It will be a puppy so I know it will be hyper but will this particular breed need stimulation all day? I live in an apartment and I work a 8-5 job but with my previous dog I would take her out in the morning, come home for lunch to be with her, and take her out to walk after I got off work. I'm afraid a border collie mix might not take well to an apartment though. Any advice is appreciated. Thanks!
0non-cybersec
Reddit
Adaptation of argument list by inserting () has been deprecated. <p>I'm just in the process of upgrading from Scala 2.10.x to 2.11.2 and I'm receiving the following warning with the following code:</p> <pre><code> override def validateKey(key: String): Either[InvalidKeyError, Unit] = keys.contains(key) match { case true =&gt; Right() case false =&gt; Left(InvalidKeyError(context, key)) } </code></pre> <blockquote> <p>Adaptation of argument list by inserting () has been deprecated: this is unlikely to be what you want. signature: Right.apply[A, B](b: B): scala.util.Right[A,B] given arguments: after adaptation: Right((): Unit)</p> </blockquote> <p>I am able to solve this by changing the "true" case statement to:</p> <pre><code>case true =&gt; Right(()) //() is a shortcut to a Unit instance </code></pre> <p>Is this the proper way to address this warning?</p> <p><strong>Edit</strong>: perhaps a "why we have to do this now" type answer would be appropriate, my cursory investigation seems to indicate that Scala inserting "Unit" when it thinks it needs to causes <em>other problems</em></p>
0non-cybersec
Stackexchange
How do you style the HTML5 form validation messages?. <p>Say you have some HTML like this:</p> <pre><code>&lt;form&gt; &lt;input placeholder="Some text!" required&gt; &lt;input type="email" placeholder="An Email!" required&gt; &lt;input type="submit" value="A Button!"&gt; &lt;/form&gt; </code></pre> <p>Because of the <code>required</code> attributes, newer Webkits and Firefoxes show a validation message next to the field if you leave it blank.</p> <p>They respond to being styled by a rule such as:</p> <pre><code>div { font: Helvetica; } </code></pre> <p>But I can't find a more specific selector for them. Does anyone know what selector is used, or will be used, or even a bug report for webkit/gecko relating to this?</p> <p>( JSFiddle showing that they can be styled with a div selector: <a href="http://jsfiddle.net/p7kK5/" rel="noreferrer">http://jsfiddle.net/p7kK5/</a> )</p>
0non-cybersec
Stackexchange
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application. I need to scale my app adding some spot instances that EB do not support.</p> <p>So I create a second autoscaling from a launch configuration with spot instances. The autoscaling use the same load balancer created by beanstalk.</p> <p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p> <p>This work fine, but:</p> <ol> <li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p> </li> <li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p> </li> </ol> <p><strong>UPDATE</strong></p> <p>Elastic Beanstalk add support to spot instance since 2019... see: <a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
0non-cybersec
Stackexchange
Terminology: words with only terminals vs. words which can contain nonterminals. <p>In the context of formal grammars, is there a standard terminology to distinguish</p> <ul> <li><p>words (i.e., finite sequences of letters/tokens) which only contain terminal letters/tokens, and</p></li> <li><p>words which may contain nonterminals?</p></li> </ul> <p>I prefer to use the term "word", unqualified, to refer to the former, because I am discussing various ways to produce words over a fixed alphabet $\Sigma$ (of terminals!), the set of nonterminals can vary from grammar to grammar, so words over them only make sense for a particular grammar. But I would still like to have a term to refer to words which may contain nonterminals: how should I best call them?</p> <p>"Nonterminal words" isn't a good term because they might turn out to have only terminals; "possibly nonterminal words" or "not necessarily terminal words" is too long and syntactically awkward. "Word over $\Sigma\cup N$" is, of course, perfectly clear, but sometimes one doesn't want to introduce any symbols. What other options are available? From <a href="https://cs.stackexchange.com/questions/2868/how-to-call-something-that-can-be-either-a-terminal-or-a-nonterminal">this related question</a> I'm thinking maybe "symbol string" or "symbol word", but I'm not sure whether it's sufficiently distinctive. Some other possibilities are "generalized word" or perhaps "form" since the generalized words which can be derived from a grammar are called "sentential forms". Any other idea?</p>
0non-cybersec
Stackexchange
What's better at math than you a retarded Asian April fooly!. Gotcha Burn April fooly
0non-cybersec
Reddit
Hey Buddies keep the Social Distancing....
0non-cybersec
Reddit
How to setup YugabyteDB as eventually consistent distributed key-value database?. <p>I'm launching a startup company providing Web SaaS (<a href="https://tuilder.com/" rel="nofollow noreferrer">https://tuilder.com/</a>). Big plans and potential.</p> <p>I'm interested in global replication with YugaByte. At the moment I have built an abstraction over BadgerDB, a Key-Value database written in GoLang. Our abstraction maintains indexes, is kind of graphql-ish, and extremely FAST. Is it possible to use YugaByte DB with global replication as a Key Value store?</p> <p>I'm aiming for the performance of KeyValue, Globally Distributed.</p> <p>As I understand the speed of writes decreases with each additional replicated node. Is that right? Is it possible to instead favour speed and have an eventually-consistent model across the nodes instead? We are building JAM stack. So we need an authentication layer on the server between YugaByte and the client, ideally this layer would provide the same abstraction we currently have written in Go.</p> <p>What about load-balancing between nodes routing requests to the closest geographical location?</p> <p>Is this all possible with YugaByte Platform?</p>
0non-cybersec
Stackexchange
PHPStorm change color for diff gutter and collapse arrows in editor. <p>I recently switched to a dark theme ( Earthsong ) and have noticed in the editor that I can not see the expand/collapse arrows and the clickable "diff" link that goes to the <strong>left</strong> of the line numbers in the editor (not the line showing a line change to the right of the editor screen). Any one know how to change the color of the two? Searched online and nothing.</p>
0non-cybersec
Stackexchange
HTML5 drag and copy?. <p>I've seen some working code for HTML5 drag and drop but has anyone an example of a drag and copy? I want to drag an element onto a drop element but only copy the element to this location.</p>
0non-cybersec
Stackexchange
Ubuntu 12.04 (Lubuntu), Manage Networks, Panel Icon, Incoming Traffic. Why?. <p>Manage Networks, Panel Icon, it shows constant incoming traffic, not outgoing, just incoming packets, but I am not surfing internet, or doing any updates, I am basically not using internet, so why I got incoming traffic?</p> <p>Whether is a bad guys intrusion or not, looks like Ubuntu 12.04 (Lubuntu) its blocking it, somehow, but I am not shure.</p> <p>I thought that there should be no traffic at all, in outgoing and incoming connections, if I am not using internet at all.</p> <p>How do I stop this traffic?</p> <p>It something I should be worried about, in terms od security?</p>
0non-cybersec
Stackexchange
sp00ky.
0non-cybersec
Reddit
[WP] You work as a therapist for the God of Death. Today is your first day of work..
0non-cybersec
Reddit
When your gf asks why theres paper on your meat.
0non-cybersec
Reddit
horizontal only webkit scrollbar style css. <p>this is custom scrollbar in css</p> <p><div class="snippet" data-lang="js" data-hide="false"> <div class="snippet-code"> <pre class="snippet-code-css lang-css prettyprint-override"><code> /* Gmail style scrollbar */ ::-webkit-scrollbar { width: 12px } ::-webkit-scrollbar-thumb { border-width: 1px 1px 1px 2px } ::-webkit-scrollbar-track { border-width: 0 } ::-webkit-scrollbar { height: 16px; overflow: visible; width: 16px; } ::-webkit-scrollbar-button { height: 0; width: 0; } ::-webkit-scrollbar-track { background-clip: padding-box; border: solid transparent; border-width: 0 0 0 4px; } ::-webkit-scrollbar-track:horizontal { border-width: 4px 0 0 } ::-webkit-scrollbar-track:hover { background-color: rgba(220, 172, 0, .05); box-shadow: inset 1px 0 0 rgba(220, 172, 0, .1); } ::-webkit-scrollbar-track:horizontal:hover { box-shadow: inset 0 1px 0 rgba(220, 172, 0, .1) } ::-webkit-scrollbar-track:active { background-color: rgba(220, 172, 0, .05); box-shadow: inset 1px 0 0 rgba(220, 172, 0, .14), inset -1px 0 0 rgba(220, 172, 0, .07); } ::-webkit-scrollbar-track:horizontal:active { box-shadow: inset 0 1px 0 rgba(220, 172, 0, .14), inset 0 -1px 0 rgba(220, 172, 0, .07) } ::-webkit-scrollbar-thumb { background-color: rgba(220, 172, 0, .2); background-clip: padding-box; border: solid transparent; border-width: 1px 1px 1px 6px; min-height: 28px; padding: 100px 0 0; box-shadow: inset 1px 1px 0 rgba(220, 172, 0, .1), inset 0 -1px 0 rgba(220, 172, 0, .07); } ::-webkit-scrollbar-thumb:horizontal { border-width: 6px 1px 1px; padding: 0 0 0 100px; box-shadow: inset 1px 1px 0 rgba(220, 172, 0, .1), inset -1px 0 0 rgba(220, 172, 0, .07); } ::-webkit-scrollbar-thumb:hover { background-color: rgba(220, 172, 0, .4); box-shadow: inset 1px 1px 1px rgba(220, 172, 0, .25); } ::-webkit-scrollbar-thumb:active { background-color: rgba(220, 172, 0, 0.5); box-shadow: inset 1px 1px 3px rgba(220, 172, 0, 0.35); } ::-webkit-scrollbar-track { border-width: 0 1px 0 6px } ::-webkit-scrollbar-track:horizontal { border-width: 6px 0 1px } ::-webkit-scrollbar-track:hover { background-color: rgba(220, 172, 0, .035); box-shadow: inset 1px 1px 0 rgba(220, 172, 0, .14), inset -1px -1px 0 rgba(220, 172, 0, .07); } ::-webkit-scrollbar-thumb { border-width: 0 1px 0 6px } ::-webkit-scrollbar-thumb:horizontal { border-width: 6px 0 1px } ::-webkit-scrollbar-corner { background: transparent } body::-webkit-scrollbar-track-piece { background-clip: padding-box; background-color: #f5f5f5; border: solid #fff; border-width: 0 0 0 3px; box-shadow: inset 1px 0 0 rgba(220, 172, 0, .14), inset -1px 0 0 rgba(220, 172, 0, .07); } body::-webkit-scrollbar-track-piece:horizontal { border-width: 3px 0 0; box-shadow: inset 0 1px 0 rgba(220, 172, 0, .14), inset 0 -1px 0 rgba(220, 172, 0, .07); } body::-webkit-scrollbar-thumb { border-width: 1px 1px 1px 5px } body::-webkit-scrollbar-thumb:horizontal { border-width: 5px 1px 1px } body::-webkit-scrollbar-corner { background-clip: padding-box; background-color: #f5f5f5; border: solid #fff; border-width: 3px 0 0 3px; box-shadow: inset 1px 1px 0 rgba(220, 172, 0, .14); }</code></pre> <pre class="snippet-code-html lang-html prettyprint-override"><code>&lt;p&gt;Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas. Vestibulum tortor quam, feugiat vitae, ultricies eget, tempor sit amet, ante. Donec eu libero sit amet quam egestas semper. Aenean ultricies mi vitae est. Mauris placerat eleifend leo. Quisque sit amet est et sapien ullamcorper pharetra. Vestibulum erat wisi, condimentum sed, commodo vitae, ornare sit amet, wisi. Aenean fermentum, elit eget tincidunt condimentum, eros ipsum rutrum orci, sagittis tempus lacus enim ac dui. Donec non enim in turpis pulvinar facilisis. Ut felis. Praesent dapibus, neque id cursus faucibus, tortor neque egestas augue, eu vulputate magna eros eu erat. Aliquam erat volutpat. Nam dui mi, tincidunt quis, accumsan porttitor, facilisis luctus, metus&lt;/p&gt; &lt;p&gt;Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas. Vestibulum tortor quam, feugiat vitae, ultricies eget, tempor sit amet, ante. Donec eu libero sit amet quam egestas semper. Aenean ultricies mi vitae est. Mauris placerat eleifend leo. Quisque sit amet est et sapien ullamcorper pharetra. Vestibulum erat wisi, condimentum sed, commodo vitae, ornare sit amet, wisi. Aenean fermentum, elit eget tincidunt condimentum, eros ipsum rutrum orci, sagittis tempus lacus enim ac dui. Donec non enim in turpis pulvinar facilisis. Ut felis. Praesent dapibus, neque id cursus faucibus, tortor neque egestas augue, eu vulputate magna eros eu erat. Aliquam erat volutpat. Nam dui mi, tincidunt quis, accumsan porttitor, facilisis luctus, metus&lt;/p&gt;</code></pre> </div> </div> </p> <p>I use the above code to beautify my scroll bar, but I do not want to style my vertical bar. </p> <p>I tried to remove the tags which don't contain 'horizontal' but it doesn't work.</p>
0non-cybersec
Stackexchange
Using Chernoff&#39;s inequality to give a bound on a probability given the MGF. <blockquote> <p>Let $G$ be a $\text{Gamma}(k,2)$ random variable. Its MGF is $\left(1-\frac{t}{2}\right)^{-k}$ for $t &lt; 2$. Using Chernoff's inequality, give a bound on the probability, $$P(G &gt; 1)$$</p> </blockquote> <p><strong>My attempt:</strong></p> <p>$$P(G &gt; 1) = P\left(e^{tX} \ge e^{t}\right)\le\frac{E\left[e^{tX}\right]}{e^{t}}$$ by Chernoff's bound. $E[e^{tX}] = MGF = (1-\frac{t}{2})^{-k}$ so we have</p> <p>$$P(G &gt; 1) \le \frac{(1-\frac{t}{2})^{-k}}{e^{t}}$$</p> <p>From here I'm not sure what to do next, do I just leave it as this or is there more that needs to be done? if anyone can help me with this that would be really appreciated.</p>
0non-cybersec
Stackexchange