Accessing member of compound literal using Visual Studio
Compound literals in MSVC
Remember last selected items per page in global search What is the best word describing the nature of expiring in a short amount of time, connoting "losing public attention"? Is there an adjective that describes the nature of expiring, connoting a sense of losing public attention, in a very short amount of time? For example,  In a fast-paced era, news articles are ____. During the 1990s, compared with traditional technologies, computer  technologies are ___; for example, a new generation of CPU technologies usually comes out every one to two years.  (I thought about &quot;perishable,&quot; but it does not seem connoting &quot;losing public attention.&quot;) Tikz, Tree without overlaps I'm trying to get a nice tree without the overlaps, can anyone help me to improve my code?  \documentclass{standalone} \usepackage{amssymb} \usepackage{amsmath} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage{dsfont} \usepackage{tikz} \usetikzlibrary{shapes} \usetikzlibrary{graphs}  \begin{document}       \begin{tikzpicture}[baseline,level/.style={level distance=20mm, sibling distance =35mm/#1},scale=1]         \node [ellipse split, draw] {$s_1&lt;s_2$\nodepart{lower}\tiny $(s_1,s_2,s_3,s_4)$}             child{ node [ellipse split, draw] {$s_1&lt;s_2$\nodepart{lower}\tiny $(s_1,s_2,s_3,s_4)$}                 child{ node [ellipse split, draw] {$s_1&lt;s_2$\nodepart{lower}\tiny $(s_1,s_2,s_3,s_4)$}                     child{ node [rectangle, draw] {$(s_1,s_2,s_3,s_4)$}}                     child{ node [ellipse split, draw] {$s_1&lt;s_2$\nodepart{lower}\tiny $(s_1,s_2,s_3,s_4)$}                         child{ node [rectangle, draw] {$(s_1,s_2,s_3,s_4)$}}                         child{ node [ellipse split, draw] {$s_1&lt;s_2$\nodepart{lower}\tiny $(s_1,s_2,s_3,s_4)$}                             child{ node [rectangle, draw] {$(s_1,s_2,s_3,s_4)$}}                             child{ node [rectangle, draw] {$(s_1,s_2,s_3,s_4)$}}                         }                     }                 }                    child{ node [ellipse split, draw] {$s_1&lt;s_2$\nodepart{lower}\tiny $(s_1,s_2,s_3,s_4)$}                     child{ node [ellipse split, draw] {$s_1&lt;s_2$\nodepart{lower}\tiny $(s_1,s_2,s_3,s_4)$}                         child{ node [rectangle, draw] {$(s_1,s_2,s_3,s_4)$}}                         child{ node [ellipse split, draw] {$s_1&lt;s_2$\nodepart{lower}\tiny $(s_1,s_2,s_3,s_4)$}                             child{ node [rectangle, draw] {$(s_1,s_2,s_3,s_4)$}}                             child{ node [ellipse split, draw] {$s_1&lt;s_2$\nodepart{lower}\tiny $(s_1,s_2,s_3,s_4)$}                                 child{ node [rectangle, draw] {$(s_1,s_2,s_3,s_4)$}}                                 child{ node [rectangle, draw] {$(s_1,s_2,s_3,s_4)$}}                             }                         }                     }                     child{ node [ellipse split, draw] {$s_1&lt;s_2$\nodepart{lower}\tiny $(s_1,s_2,s_3,s_4)$}                         child{ node [rectangle, draw] {$(s_1,s_2,s_3,s_4)$}}                         child{ node [ellipse split, draw] {$s_1&lt;s_2$\nodepart{lower}\tiny $(s_1,s_2,s_3,s_4)$}                             child{ node [rectangle, draw] {$(s_1,s_2,s_3,s_4)$}}                             child{ node [ellipse split, draw] {$s_1&lt;s_2$\nodepart{lower}\tiny $(s_1,s_2,s_3,s_4)$}                                 child{ node [rectangle, draw] {$(s_1,s_2,s_3,s_4)$}}                                 child{ node [rectangle, draw] {$(s_1,s_2,s_3,s_4)$}}                             }                         }                     }                 }             };     \end{tikzpicture} \end{document} BOOLEAN FUNCTIONS: generate a function $f: \{0, 1\}^n \rightarrow \{0, 1\}$ from a $n \times n$ S-Box I want to calculate the hamming weight of a S-Box using this formula: $\text{hw}(f) = \sum_{x=0}^{2^n-1} f(x)$. Where $f: \{0, 1\}^n \rightarrow \{0, 1\}$  My problem is that I don't know how to get the $f$-function.  I found that helpful paper: . At Page 9 (18) boolean functions are described. But she only prints the truth table (Table 2.1) without describing her $f$-function. She only says $f$ is a linear function, therefore I think $f$ depends on my S-Box?  For example, if I have this $2 \times 2$ S-Box:  0    1    2    3  1    3    0    2    $00 \rightarrow 01\\ 01  \rightarrow 11\\ 10  \rightarrow 00\\ 11  \rightarrow 10$  What are the $f$-functions and what is the hamming weight? I'm wondering how it is correct to structure sentence and what punctuation should be used. In particular, is the next sentence correct:     I was wondering if there's any progress on the issue.    Or should I put a question mark in the end of it. Also, can it be restructured to:     I was wondering: is there any progress on the issue? Resize images in PHP without using third-party libraries? What's the best way of replacing a plug or switch in a house with aluminum wiring? I am trying to find a book (young adult) where the devil is the protaganist, and other gods appear as characters I believe it was written by a teenager, and might have a sequel.   It has been many years since I read it, but I believe it had the devil acting like a regular human. He wasn't evil. I think it incorporated a lot of (gods/characters) norse, roman, Christian, and pagan. What will I miss out on if I play Diablo 3 without Reaper of Souls? I own the base game of Diablo 3.  I didn't really like the "post-Inferno" content of the game, so I stopped playing shortly after I curb-stomped the final boss for the n-th time.    I understand now that a lot of things have changed in the base game.  There's also an expansion.  I don't plan to purchase the expansion, but some of these changes sound like they could make the game more fun for me.  I can guess that probably the new character and act are expansion-only content.  I know I'm probably , but if I go back and play now, what else will I be missing out on if I don't have the expansion? I need to get a nice picture about how electron moves around nucleus? I find concept of probability and orbitals quite difficult to understand? Generic flatness on modules I am looking for a stronger notion of generic flatness. Let $A$ be a Noetherian ring, $M$ a finitely generated module over $A$. Suppose there exists a maximal ideal $m$ of $A$ such that $M_m$ (the localization of $M$ at $m$) is $A_m$-flat (here $A_m$ is the localization of $A$ at $m$). Does there exist an open neighbourhood $U$ of $\mathrm{Spec}(A)$ containing the point corresponding to $m$ such that for all point (not necessarily closed) $u \in U$, the localization of $\tilde{M}$ (the coherent sheaf corresponding to the module $M$) at $u$ is $\mathcal{O}_{U,u}$-flat i.e., $\tilde{M}|_U$ is $\mathcal{O}_U$-flat? GParted can't resize partition, but unallocated partition is available Isle vs. Island Some islands are called isle like "Isle of Man", "Isle of Tortuga" and the "British Isles". Other islands are called island, like "Island of Malta" or "Island of Cyprus".  What is the difference between the words? How to know if a land mass confined by water is called an isle or an island? So far, I know if $p$ is a rational prime, then $(1)$ if $p\equiv 3\mod4$, then $p$ is prime in $\mathbb{Z}[i]$. $(2)$ If $p\equiv1\mod4$  then $p=π_1 π_2$ where $π_1 $ and $π_2$ are conjugate, Then $π_1 $ and $π_2$ are primes in $\mathbb{Z}[i]$. $(3)$ $2=(1+i)(1-i)$, then $(1+i)$and$(1-i)$ are primes in $\mathbb{Z}[i]$.  What's are all the prime elements in Gaussian integers $\mathbb{Z}[i]$? For example, $-3$ are prime in $\mathbb{Z}[i]$, but not in the above $3$ cases. A Python module and package loading confusion Why can I put an electrolytic capacitor on AC? I have seen here and there schematics with electrolytic capacitors put on AC. And this sounds weird to me.  Electrolytic capacitors have a polarity, right? If we invert the polarities on DC, bad things happen. As far as I understand, AC inverts polarity every now and then (commonly 50Hz). Why can we put such capacitors on AC without damaging them?  Example:    from demonstration here: Combinatorial Proof Question: Vandermonde convolution identity I'm really iffy on combinatorial proofs in general and now that there is a sum, it's just confused me even more. Can someone try and walk me through this proof?  $$ \binom{m + n}{r} = \sum_{k=0}^r \binom{m}{k}\binom{n}{r - k} $$ I thought of this a while ago, but can't make up a proof or a counterexample. Does anyone know more about this?  $$\sqrt{a+b}  \le \sqrt a + \sqrt b , \forall a,b \in \mathbb R_+$$  Moreover, what happens with more variables? Say:  $$\sqrt{x_1+x_2+...+x_n} \le \sqrt x_1 +\sqrt x_2 + ... + \sqrt x_n $$  with $ x_i \in\mathbb R_+ \forall i \in \{1,2,...,n\} $  Or when $i = \mathbb N$  PS: I tried looking on the internet for this but I don't know how I would call this. Safari Extension to Manage Tabs? How to move Applications from phone to SD Card?