Protected Means, we can access this member only in a deriving class, and internal means we can access this member in any type in the same assembly using a object. So can I consider a Protected Internal member as a public member in the same assembly. and as a protected member in the different assembly.  EDIT:  namespace pracConsole     { class Class1 {     protected internal int val;     public int hello()     {         Console.WriteLine("This is method pracConsole.hello");         Console.ReadLine();         return 1;      } } class program {     static void Main(string[] args)     {         Class1 _class1 = new Class1();         _class1.val = 3;         _class1.hello();         Console.ReadLine();     } }   }  See I am able to access, protected internal in a non deriving class...so its working as public in same assembly..what do you say.
Can someone please explain the difference between the protected and protected internal modifiers in C#? It looks like their behavior is identical.
I just did my first install of any Linux OS, and I accidentally selected "Desktop GUI" in the install, but I want to build everything myself. Is there any way by which I can remove the GUI environment without re-installing OS? At the very end of Deathly Hallows, after Harry repaired his own wand with the Elder Wand, he tells Dumbledore's Portrait in the office:     “I’m putting the Elder Wand,” he told Dumbledore, who was watching him with    enormous affection and admiration, “back where it came from. It can stay there. If I die a    natural death like Ignotus, its power will be broken, won’t it? The previous master will    never have been defeated. That’ll be the end of it.   Now, this seems incredibly foolish to me.  "The previous master will never have been defeated" would only have been assuredely true if Harry had died right after depositing the Elder Wand back into Dumbledore's Tomb.   If not, Harry (the Wand owner) would still be alive, and at the risk of being Disarmed (as was shown with Harry and Draco Malfoy, it doesn't matter if the Elder Wand's owner is defeated by death or simple disarming, AND it's not even required that the Disarming would involve the Elder Wand!).  So, if Harry merely put the Elder Wand back into the Tomb, and some years later, someone would disarm him (or, even worse, kill him) - then that someone would become the Elder Wand owner, either by accident or by design:    By accident - Harry is likely to get into plenty of magical duels in the future. Even discounting friendly one (teaching people the Expelliramus), he plans on becoming an Auror!  By design - plenty of people have been in the Great Hall hearing Harry explaining to Voldemort that he, Harry, was now the owner of the Elder Wand, so the fact of his ownership would most assuredly NOT remain a secret, inviting countless people tempted by owning the Deathstick to hunt Harry down. Oh, and the location is now also known!   So "its power will be broken" is quite unlikely to come true!  Is Harry hopelessly wrong? Or am I missing something in the above logic? Was this addressed in canon/JKR info? Why is this CW post saying 36% unknown? Looking at         it says "36% unknown". No user by the name of 'unknown' appears in the  ()  What madness is this? Who is this 'unknown' you speak of? What are the applications of the ## preprocessor operator and gotchas to consider? As mentioned in many of my previous questions, I'm working through K&amp;R, and am currently into the preprocessor. One of the more interesting things &mdash; something I never knew before from any of my prior attempts to learn C &mdash; is the ## preprocessor operator. According to K&amp;R:     The preprocessor operator ##   provides a way to concatenate actual   arguments during macro expansion. If a   parameter in the replacement text is   adjacent to a ##, the parameter is   replaced by the actual argument, the   ## and surrounding white space are   removed, and the result is re-scanned.   For example, the macro paste   concatenates its two arguments:      #define  paste(front, back)  front ## back      so paste(name, 1) creates the token   name1.   How and why would someone use this in the real world? What are practical examples of its use, and are there gotchas to consider? When would you use a voltage regulator vs a resistor voltage divider?  Are there any uses for which a resistor divider is particularly bad? I'm looking at creating a basic ORM (purely for fun), and was wondering, is there a way to return the list of tables in a database and also the fields for every table?  Using this, I want to be able to loop through the result set (in C#) and then say for each table in the result set, do this (e.g. use reflection to make a class that will do or contain xyz).  Further to this, what are some good online blogs for SQL Server? I know this question is really about using system SPs and databases in Sql Server, and I am ok with general queries, so I'm interested in some blogs which cover this sort of functionality.  Thanks How to change the title of ToC? I need to change default title of ToC. Is it possible with titlesec package? Here is my MWE:  \documentclass{book}  \usepackage{titlesec} \titleformat{\chapter}{\normalfont\Large\scshape}{\thechapter}{1em}{} \vspace{6pt}]  \usepackage{lipsum}   %-------------------------------------------------------------------------  \begin{document}   \newpage \thispagestyle{empty} \tableofcontents \thispagestyle{empty} \newpage \thispagestyle{empty}  \setcounter{footnote} {0}\chapter*{{\fontsize{11}{14}\selectfont\normalfont{Author1} \\ {\scshape\Large Title}}} \addcontentsline{toc}{chapter}{\normalsize\normalfont{Author1} \\ \normalfont\scshape{Title}} \thispagestyle{empty} \Author{Author1} \Title{Title} \lipsum \newpage \thispagestyle{empty}    \end{document} What are nodes, and how do I use them? I'm a bit new to Blender, and in trying to learn more, I've stumbled across nodes.  What are nodes, and how do I use them? Direction arrows on a circle I would like to plot circle (or another curve) with positive direction (and show it wit arrows).  This plots the circle  \documentclass{article} \usepackage{tikz} \RequirePackage{pgfplots} \usetikzlibrary{shadows} \usetikzlibrary{shapes} \usetikzlibrary{decorations} \usepackage{verbatim} \usepackage[active,tightpage]{preview} \PreviewEnvironment{tikzpicture} \setlength\PreviewBorder{5pt} \begin{document} \begin{tikzpicture}     \begin{axis}[             xmin=-1.5,xmax=2.5,ymin=-1.5,ymax=1.5,             axis lines=center,             ticks=none,             unit vector ratio*=1 1 1,            ]                   \addplot [very thick, smooth, domain=(0:2*pi)] ({1.+cos(deg(x))},{sin(deg(x))});        \addplot[only marks,mark=*] coordinates{(1,0)};         \end{axis} \end{tikzpicture} \end{document}   And I want to add arrows like that    Would you advise me how to add such arrows? Space $\mathcal{L}^p(X, \Sigma, \mu)$ is separable iff $(\Sigma, \rho_\Delta)$ is separable Let $A = \mathbb{Z}$, $B = [−1, \pi]$, $C = (2, 7)$. List all elements of $A \cap (B^c \cap C)$. After working it out on a number line, I got: $\{4, 5, 6\}$.  As it stands, the expression contains the integers that do not belong to the set $B$ that cross into $C$. This would result in $4, 5, 6$. Number $7$ would not be included because of the soft brackets surrounding $C = (2, 7)$. Is this correct? How to extend the background of an image? Consider the Fibonacci numbers $F(0) = 0; F(1)=1; F(n) = F(n-1) + F(n-2)$.  Prove by induction that for all $n&gt;0$,  $$F(n-1)\cdot F(n+1)- F(n)^2 = (-1)^n$$  I assume $P(n)$ is true and try to show $P(n+1)$ is true, but I got stuck with the algebra. How do we reach $P(n+1)$ from $P(n)$? Also, strong induction may be used instead. Proof of an inequality by induction: $(1 + x_1)(1 + x_2)...(1 + x_n) \ge 1 + x_1 + x_2 + ... + x_n$ Let $n \in \mathbb N^+$. Show that if $x_1, x_2, ... , x_n$ are $n$ real numbers such that $-1 \le x_i \le 0$ for each $1 \le i \le n$, then $$(1 + x_1)(1 + x_2)...(1 + x_n) \ge 1 + x_1 + x_2 + ... + x_n$$  I am using a proof by induction, but I am unable to complete it. I would appreciate any tips on how I could finish the proof.   Incomplete Proof Let $P(n)$ be the proposition that $(1 + x_1)(1 + x_2)...(1 + x_n) \ge 1 + \sum_{i = 1} ^ n x_i$. When $n = 1$, LHS = RHS = $1 + x_i$. Clearly $1 + x_i \ge 1 + x_i$ and so $P(1)$ is true. Assume that $P(k)$ is true, i.e. $(1 + x_1)(1 + x_2)...(1 + x_k) \ge 1 + \sum_{i=1}^k x_i$. Case 1 Suppose $x_{k + 1}  = -1$. Then $1 + x_{k + 1} = 0$, hence LHS = $(1 + x_1)(1 + x_2)...(1 + x_k)(1 + x_{k+1}) = 0$. RHS = $1 + x_1 + x_2 + ... + x_k - 1 = x_1 + x_2 + ... + x_k$ which is always nonpositive since each $x_i$ is nonpositive. Hence RHS $\le 0$ and so LHS $\ge$ RHS. Case 2 Suppose $x_{k+1} = 0$. Then $1 + x_{k+1} = 1$, hence multiplying it to LHS does not change anything. Also, adding $x_{k+1}$ to RHS does not change anything. Therefore, LHS $\ge$ RHS still holds. Case 3 Suppose $-1 &lt; x_{k+1} &lt; 0$. Then $0 &lt; 1 + x_{k+1} &lt; 1$. Adding $x_{k+1}$ to RHS makes the RHS smaller since $x_{k+1}$ is negative. If LHS $= 0$, then multiplying $1 + x_{k+1}$ to LHS does not change anything, and so LHS $\ge$ RHS holds. If LHS > $0$, then multiplying $1 + x_{k+1}$ to LHS makes the LHS smaller since $0 &lt; 1 + x_{k+1} &lt; 1$. In this case LHS $\ge$ RHS does not necessarily hold? ... datetime.parse and making it work with a specific format Find highest level of a hierarchical field: with vs without CTEs Is there a package that automatically inserts the ToC level of the reference I inserted?  Section 1.1 \label{a} Subsection 1.1.1 \label{b} Subsection 1.1.2  \label{c}   So that the text:  Blah \superref{a} and \superref{b} and \superref{c}   becomes:  Blah Section 1.1 and Subsection 1.1.1 and Subsection 1.1.2   So that it automatically adapts if I change the level of a label? Why doesn't the definition of a category require an explicit notion of morphisms equality? I am learning basics of the category theory (CT).  I do understand that CT is a modern powerful framework to describe various branches of mathematics in a unified way.  I do admit that category's definition tells a lot about the whole thing and focuses on the most important properties, shadowing unnecessary details. However, the more I go forward, the more it feels like it should explicitly require a notion of morphisms equality (like it does with morphism composition). It feels so because equality or inequality of morphisms arises everywhere, since the very beginning: any commutative diagram eventually reduces to an equality of two different paths and many other things involve equality as well. Even composition is defined grounding upon an (implicit) equality!  I'll try to give an example of my concern. Consider $\mathbb{SET}$. Its objects are sets and morphisms are functions. Now, let's recall that functions are sets as well - to be more precise, a function $f : A \mapsto B$ is a subset of a $A \times B$ obeying certain properties, which I omit. Thus, one could argue that $f$ is both a morphism between objects $A, B \in Obj(\mathbb{SET})$ and an object defined as a set of pairs $\{ (a_1 \in A, b_1 \in B), ..., (a_n \in A, b_n \in B) \}$ and those are equal because both are essentially exactly the same thing.  I hope my concern is clear and I need some kind of "conceptual insight" from knowledgeable people to move forward. Please give me the right perspective. I currently have an ec2 &quot;t2.nano&quot; instance up and running. I would like to switch to a &quot;t2.micro&quot;. In order to do that, I need to stop the instance. But I would lose my IPv4 address in the process. And I do not want that (because I have several ssh tunnels up and running from rasps in the wild that are currently hard coded to connect to this IPv4 address). I decided to create an Elastic IP address. But I understand that by creating an Elastic IP address and assigning it to my current ec2 instance, I would lose my current IPv4 address too. Is it possible to create an Elastic IP address from the current IPv4 address of my ec2 instance? If so, how can I do this operation? How do you post to an iframe? How do you post data to an iframe?