How can I prevent other programmers from violating
encapsulation by seeing the private parts of my class?
Answer / abalonesoft
Not worth the effort — encapsulation is for code, not people.
It doesn't violate encapsulation for a programmer to see the
private and/or protected parts of your class, so long as
they don't write code that somehow depends on what they saw.
In other words, encapsulation doesn't prevent people from
knowing about the inside of a class; it prevents the code
they write from becoming dependent on the insides of the
class. Your company doesn't have to pay a "maintenance cost"
to maintain the gray matter between your ears; but it does
have to pay a maintenance cost to maintain the code that
comes out of your finger tips. What you know as a person
doesn't increase maintenance cost, provided the code you
write depends on the interface rather than the implementation.
Besides, this is rarely if ever a problem. I don't know any
programmers who have intentionally tried to access the
private parts of a class. "My recommendation in such cases
would be to change the programmer, not the code" [James
Kanze; used with permission].
| Is This Answer Correct ? | 0 Yes | 0 No |
Explain pointer. What are function pointers in C?
What is spaghetti programming?
Explain what is the most efficient way to store flag values?
#include<conio.h> #include<stdio.h> void main() { int i; if(1,0,2,3) { printf("if"); } else { printf("else"); } getch(); } Can any body tell the answer of this question with explanation?
Write a program to print fibonacci series without using recursion?
Without using main fn and semicolon,print remainder for a given number in C language
DIFFERNCE BETWEEN THE C++ AND C LANGUAGE?
How do I determine whether a character is numeric, alphabetic, and so on?
how to convert an char array to decimal array
What would happen to X in this expression: X += 15; (assuming the value of X is 5)
What is the difference between exit() and _exit() function in c?
3. When do you say that a digraph is acyclic A)if and only if its first search does not have back arcs B)a digraph is acyclic if and only if its first search does not have back vertices C)if and only if its first search does not have same dfnumber D)None of these