The essence of the problem is, given a class hierarchy like this:  class A {     protected void MethodToExpose()     {}      protected void MethodToHide(object param)     {} }  class B : A {     new private void MethodToHide(object param)     {}      protected void NewMethodInB()     {} }  class C : B {     public void DoSomething()     {         base.MethodToHide("the parameter"); // This still calls A.MethodToHide()         base.MethodToExpose(); // This calls A.MethodToExpose(), but that's ok         base.NewMethodInB();     } }   How can I prevent any classes that inherit from class "B" from seeing the method A.MethodToHide()?  In C++, this was easy enough by using a declaration such as class B : private A, but this syntax is not valid in C#.  For those interested (or wondering what I'm really trying to do), what we're trying to do is create a wrapper for for Rhino.Commons.NHRepository that hides the methods we don't want to expose to our group of developers, so we can have a cookie-cutter way of developing our app that new developers can easily follow.  So yes, I believe the "Is-A" test is valid for the whole chain (WidgetRepository Is-A BaseRepository Is-A NHRepository).  Edit:  I should have mentioned, for the sake of argument, that class A is an API class outside of our control.  Otherwise the problem gets considerably easier.
Suppose I have BaseClass with public methods A and B, and I create DerivedClass through inheritance.  e.g.  public DerivedClass : BaseClass {}   Now I want to develop a method C in DerivedClass that uses A and B.  Is there a way I can override methods A and B to be private in DerivedClass so that only method C is exposed to someone who wants to use my DerivedClass?
What are these stamps in my passport after I was advised to divert via the UK but didn't have a visa? I am from Myanmar. I was on my way to Venice from Brussels while holding Schengen visa (single entry). I bought a British Airways ticket to fly from Brussels to Venice. Unfortunately, on that day, all BA flights from Brussels were canceled. British Airway's customer service centre told me to go to from Brussels to London by train, where I could catch my flight to Venice. I took a taxi to Bruxelles-Midi train station and bought a ticket to London. A Brussels immigration officer inspected and approved my passport.   Then I had to to through UK Border Immigration. There, they said I can't enter to get my flight. Although I explained the situation with the airline and made clear of my destination (I already reserved my hotels in Venice, Switzerland and France as described in my travel itinerary), they detained me for some hours and also took my fingerprints on paper and photo.   They asked questions concerned about my finances and gave me a refusal letter for not having a transit visa. So I had to re-enter Brussels where the immigration officer put the below stamp in my passport. As I had a single entry Schengen visa, I had to buy another airline ticket to Venice and complete my Europe trip.   What do the stamps below mean on my passport?   Can they affect me and, if so, how and why, when I apply for another Schengen visa? What are the C++ rules for calling the base class constructor from a derived class? For example, I know in Java, you must do it as the first line of the subclass constructor (and if you don't, an implicit call to a no-arg super constructor is assumed - giving you a compile error if that's missing). Is it a weakness to use a single shared secret for protecting messages using a Encrypt-then-MAC scheme?    Assuming a system is using AES-256-CBC and a SHA1-HMAC and the same secret key for both operations.  Upon intercepting one of these messages and attacker could brute force this secret key by trying to solve the HMAC or by successfully decrypting the first block of the ciphertext.  Performing  a decryption on a single block of AES-256 should be a lighter operation than performing a SHA1-HMAC on a potentially large message.  Therefore AES-256 is ideal for a massively parallel brute-force attack and the use of the SHA1-HMAC doesn't hurt the system.  Is this approach sound, or is there an attack that has not been taken into consideration? I tried to install Ubuntu 12.10 with the Wubi installer while running Windows, because my PC does not accept my BootCD as a bootable medium.  But Wubi showed me this error:  Ubuntu-Installationsprogramm (X) Ein Fehler ist aufgetreten: Could not retrieve the required disk image files Weiter Informationen finden Sie in der Protokolldatei: c:\users\username\appdata\local\temp\wubi-12.10-rev273.log   What can I do, because I want to get rid of my Windows 7 and use the way better Ubuntu 12.10?  Thanks for your huge answer, now my next problem after trying to install wubi with the .iso is, that the same error shows up again and i am not shure which part of the errorreport you need.  Can you tell me? Because i'm not that good at linux. Question:      Let $p$ be any prime and $n \geq 3$. Show that there exists a non-abelian group of order $p^n$.    Attempt:   Take $n = 3$. Writing $\mathbb Z_p \times \mathbb Z_p = \{e, \alpha_1, \ldots, \alpha_{p^2 - 1}\}$ and considering $$\begin{align}\tau_{jk} : \mathbb Z_p \times \mathbb Z_p&amp;\to \mathrm {Aut} (\mathbb Z_p)\,\\e &amp;\mapsto id\\\alpha_j &amp;\mapsto id \\\alpha_i &amp;\mapsto \rho_k  \end{align}$$  $\forall i \neq j$ where $\rho_k : \mathbb Z_p \to \mathbb Z_p$ is such that $\rho_k (1) = k$, with $k \in \{2, \ldots, p-1\}$. Then we take the group $(\mathbb Z_p \times \mathbb Z_p) \ltimes_{\tau_{jk}} \mathbb Z_p$.   Then $$(\alpha_i , 2) \ltimes_{\tau_{jk}} (\alpha_i, 1) = (2\alpha_i, 1  + \tau_{jk} (\alpha_i)(2)) = (2\alpha_i , 1  +2 k)$$  and $$(\alpha_i , 1) \ltimes_{\tau_{jk}} (\alpha_i, 2) = (2\alpha_i, 1  + \tau_{jk} (\alpha_i)(2)) = (2\alpha_i , 1  +k)$$  taking $k = 1$ for example we have that the group $(\mathbb Z_p \times \mathbb Z_p) \ltimes_{\tau_{jk}} \mathbb Z_p$ is not abelian.    I was wondering if this is a good aproach. If not, is there an easier way to reach the result?  If this is the "best" way then would the higher cases ($n &gt; 3$) be more of a notation play game? I have the following code:  Using cmd As SqlCommand = Connection.CreateCommand     cmd.CommandText = "UPDATE someTable SET Value = @Value"     cmd.CommandText &amp;= " WHERE Id = @Id"     cmd.Parameters.AddWithValue("@Id", 1234)     cmd.Parameters.AddWithValue("@Value", "myValue")     cmd.ExecuteNonQuery End Using   I wonder if there is any way to get the final SQL statment as a String, which should look like this:  UPDATE someTable SET Value = "myValue" WHERE Id = 1234   If anyone wonders why I would do this:   for logging (failed) statements for having the possibility to copy &amp; paste it to the Enterprise Manager for testing purposes If $a,b$ are positive integers such that $\gcd(a,b)=1$, then show that $\gcd(a+b, a-b)=1$ or $2$. and $\gcd(a^2+b^2, a^2-b^2)=1$ or $2 $ If  $a,b$ are positive integers such that $\gcd(a,b)=1$, then show that $\gcd(a+b, a-b)=1$ or $2$ and $\gcd(a^2+b^2, a^2-b^2)=1$ or $2 $. Progress We have   $\gcd(a,b)=1\implies \exists u,v\in \mathbb Z$ such that $au+bv=1\implies a^2u'+bv'=1, u',v'\in \mathbb Z$. Let $\gcd(a+b, a-b)=d$. Then $\mid (a+b)x+(a-b)y, \forall x,y\in \mathbb Z$. How to show $\gcd(a+b, a-b)=1$ or $2$ and $\gcd(a^2+b^2, a^2-b^2)=1$ or $2 $. Image of the union is the union of the images $$ f\left(\bigcup\limits_{\lambda \in \wedge} A_{\lambda}\right) = \bigcup\limits_{\lambda \in \wedge} f(A_\lambda)$$  Let $b \in f(\bigcup\limits_{\lambda \in \wedge} A_{\lambda})$ $\rightarrow b=f(a)$ for some $a \in (\bigcup\limits_{\lambda \in \wedge} A_{\lambda})$.  Since $a \in (\bigcup\limits_{\lambda \in \wedge} A_{\lambda}) \rightarrow a \in A_{\lambda}$ for some $\lambda \in \wedge$.  Since $b=f(a)$, then $b \in f(A_{\lambda})$ for some $\lambda \in \wedge$.  $\rightarrow b \in \bigcup\limits_{\lambda \in \wedge} f(A_\lambda)$ $\rightarrow f(\bigcup\limits_{\lambda \in \wedge} A_{\lambda}) \subset \bigcup\limits_{\lambda \in \wedge} f(A_\lambda)$.  I used a similar argument to prove $\bigcup\limits_{\lambda \in \wedge} f(A_\lambda) \subset f(\bigcup\limits_{\lambda \in \wedge} A_{\lambda})$.  Which shows $ f(\bigcup\limits_{\lambda \in \wedge} A_{\lambda}) = \bigcup\limits_{\lambda \in \wedge} f(A_\lambda)$.  Please let me know if this is valid. How to sum data.frame column values? Is there a slowest rate of divergence of a series? $$f(n)=\sum_{i=1}^n\frac{1}{i}$$ diverges slower than $$g(n)=\sum_{i=1}^n\frac{1}{\sqrt{i}}$$ , by which I mean $\lim_{n\rightarrow \infty}(g(n)-f(n))=\infty$. Similarly, $\ln(n)$ diverges as fast as $f(n)$, as $\lim_{n \rightarrow \infty}(f(n)-\ln(n))=\gamma$, so they 'diverge at the same speed'.   I think there are an infinite number of 'speeds of divergence' (for example, $\sum_{i=1}^n\frac{1}{i^k}$ diverge at different rates for different $k&lt;1$). However, is there a slowest speed of divergence?  That is, does there exist a divergent series, $s(n)$, such that for any other divergent series $S(n)$, the limit $\lim_{n \rightarrow \infty}(S(n)-s(n))=\infty$ or $=k$? If so, are there an infinite number of these slowest series? Is there an SE for Cell-phones? Where would I ask a question pertaining to an ordinary phone? Or just cell phones in general? I saw Windows Phone while browsing the SE database, nothing else really popped out at me. Google didn't bring up anything either. Is that just too small a community to cover with SE? Is there a word for a person who gives out too many extraneous details? The difference between an analogy and a metaphor? Many a time I've asked what the difference is between an analogy and a metaphor. I've asked it to my teacher, on internet sites, to my parents, so on and so forth. I got a different answer every time, and I never fully grasped what the difference is, so what is the difference? Pytest is in PATH but not found Literature with Biber generates strange citations: firstnames appear erratically I had been using bibtex and then biblatex for quite some time. For the newest edition of my book I moved to biber. I happened t notice that firstnames are sometimes generated and sometimes not. Has this been observed by others?   I have tried to make a minimal example but without success. Using the following code, which shows all the commands related to biblatex I have in my preamble I could not get the firstnames to be shown. Even with the stylefile I made for this book (second line) the error did not occur.  I have a dropbox with the latex files for the book available. I can give access to these.   What do you propose?  \documentclass[fontsize=10pt,twoside]{scrbook} \usepackage{hormonbuch} \usepackage[%   style=authoryear%   ,natbib=true%   ,sorting=nyt,backend=biber,doi=false,isbn=false,url=false]{biblatex} \addbibresource{../Literatur/EndokrinologieKundeNourl.bib}  \renewcommand*{\bibpagespunct}{\addcolon} \DeclareFieldFormat{pages}{#1}  \renewrobustcmd*{\enquote}{}  \renewbibmacro{in:}{%       Herbert Voss auf http://tex.stackexchange.com/questions/10682/suppress-in-biblatex   \ifentrytype{article}{}{%   \printtext{\bibstring{in}\intitlepunct}}}  \renewbibmacro*{journal+issuetitle}{%   \usebibmacro{journal}%   \setunit*{\addspace}%   \iffieldundef{series}     {}     {\newunit      \printfield{series}%      \setunit{\addspace}}%   \usebibmacro{volume+number+eid}% %  \setunit{\addspace}%   \newunit}  \renewbibmacro*{volume+number+eid}{%   \printfield{volume}% %  \setunit{\addcolon\space}%   }% % \renewbibmacro*{note+pages}{%   \printfield{pages}%   \newunit} % \begin{document}  \citet{CRT+88,FDe+85} \citep{CRT+88,FDe+85} \cite{CRT+88,FDe+85}  \printbibliography  \end{document} $R^2$ of 1 but RMSE > 0 What is the earliest work considered to be Science Fiction? How can I use JavaScript on the client side to detect if the page was encrypted? Is it possible to detect, on the client side, whether the user is using an encrypted page or not?  Put another way -- I want to know if the URL of the current page starts with http or https. Possible to draw an Item in a Grid with only 3 sides of a Frame? i have a tiny little problem with xslt, js and html entities, eg. within a template:  &lt;script type="text/javascript"&gt;     &lt;xsl:value-of select="/some/node"/&gt;     for (var i = 0; i &amp;lt; 5; i++) {         //            ^^^ js error     } &lt;/script&gt;  &lt;script type="text/javascript"&gt;     &lt;xsl:value-of select="/some/node"/&gt;     for (var i = 0; i &lt; 5; i++) {         //            ^ xslt error     } &lt;/script&gt;  &lt;script type="text/javascript"&gt;     &lt;xsl:value-of select="/some/node"/&gt;     // &lt;![CDATA[     for (var i = 0; i &lt; 5; i++) {         //            ^ becomes &amp;lt;     }     // ]]&gt; &lt;/script&gt;   &lt;script type="text/javascript"&gt;     &lt;xsl:value-of select="/some/node"/&gt;     for (var i = 0; i &lt;xsl:value-of disable-output-escaping="yes" select="string('&amp;lt;')"/&gt; 5; i++) {         // works of course     } &lt;/script&gt;   does anyone have an idea where my problem could come from? i always thought the xslt processor would leave the content of a &lt;script/&gt; element unescaped when using the html output method ...  i run libxslt2 version 1.1.24 on OSX which was installed using macportsports ...