Principles in C++

 
One Definition Rule

Rule of three

Tagged Constructors

  Small object optimization(https://riptutorial.com/cplusplus/example/31654/small-object-optimization)

Empty Base Class Optimization

Optimizing by executing less code

Expression templates

Fold Expressions

Perfect forwarding

Returning several values

continuation passing style

Function Object Consumer

Returning several values from a function

Argument Dependent Name Lookup

A moved-from optional

Constexpr unions

Deferred argument evaluation

Preconditions

Empty list initialization

Intuitive interface

The inline keyword as ODR guard dismisser

noexcept destructors

Inadvertent conversions

conditional copy constructor

String’s interface

Efficient optional values

Overload resolution

Sessions and object lifetimes

Competing constructors

Toggles in functions

Compile-time string concatenation

A friendly type predicate

Requires-expression

Ordering by constraints

Reflection for aggregates

Placement new operator in C++

Policy based Design

partial function application

Two Pointers Technique

pure functions

https://www.geeksforgeeks.org/pure-functions/

trivial classes in c++

two phase constructors

functors/Function Objects

immutable objects

Currying 
https://stackoverflow.com/questions/152005/how-can-currying-be-done-in-c#:~:text=%22Currying%22%20is%20the%20process%20of,)(short%2C%20bool)%20.

https://habr.com/en/post/436488/

SOLID design principle

  • Single responsibility principle.
  • Open closed principle.
  • Liskov substitution principle.
  • Interface segregation.
  • Dependency inversion.

    https://www.ritambhara.in/open-close-principle/




    Template based datastructure creation
     https://stackoverflow.com/questions/10950828/simulation-of-templates-in-c-for-a-queue-data-type

Comments

Post a Comment

Popular posts from this blog

VECPP.c

#include <tape_t.h> #include <string_t.h> #include <tuple_t.h> #include <bool_t.h> /**** first design #include, #define VAR, #define FUNC() and #ifdef, #elif and #endif *****/ enum MacroType {     define_t,     include_t,     line_t,     undef_t,     error_tt,     pragma_t,     defined_t,     if_t,     ifdef_t,     ifndef_t,     elif_t,     else_t,     endif_t,     COMPILER_DATA,     UNDEFINED,     MAX_TYPE }; MacroType getIndexFromStr(string_t s) {     string_t tmp;     char* arr[13] = { "define","include","line","undef","error","pragma","defined","if","ifdef","ifndef","elif","else","endif" };     for(int i=0; i< 13; i++)     {         tmp = string(arr[i]);         if((compare(tmp,s)) == 0)         ...
Read more

Comparision with Quick Sort

 #include <iostream> #include <vector> #include <map> #include <climits> #include <chrono>  // Added for timing using namespace std; using namespace std::chrono;  // Added for chrono #define MAP_SIZE USHRT_MAX #define OFFSET MAP_SIZE/2 void Map_sort(vector<int> &nums) {     vector<int> temp;     int arr[MAP_SIZE] = {0};     int maxElement = SHRT_MIN;     int minElement = SHRT_MAX;          for(int i=0; i<nums.size(); i++) {         if(nums[i] > maxElement) maxElement = nums[i];         if(nums[i] < minElement) minElement = nums[i];         arr[nums[i]+OFFSET]++;     }          int j=0;     for(int i=minElement; i<= maxElement; i++) {         if(arr[i+OFFSET] >= 1) {              for(int coun...
Read more

Interview questions

Orion Innovations class A {           public:     A()     {         printf("A def ctor\n");     }     ~A()     {         printf("~A def dector\n");     }     char ac; }; static A statObject; int main() {     printf("Size of A = %d\n", sizeof(A));     printf("main()\n"); } //===================== //output: here // A def ctor Size of A = 1 main() ~A def dector struct A {     A() { cout << "A" << endl; }     ~A() { cout << "~A" << endl; } }; struct B {     B() { cout << "B" << endl; }     ~B() { cout << "~B" << endl; } }; struct D {     D( D& d ) { cout << "&D" << endl; }     D() { cout << "D" <...
Read more