Skip to main content

Levels of exception-safety

There can be levels of exception safety requirements from a class/component/method:

* The basic exception guarantee: The invariants of the component are preserved, and no resources are leaked in the face of an exception.

* The strong exception guarantee: The operation has either completed successfully or thrown an exception, leaving the program state exactly as it was before the operation started. (commit-or-rollback semantics.)

* The no-throw exception guarantee: The operation will not throw an exception.

* The exception-neutrality: In a generic component, we usually have an additional expectation of exception-neutrality, which means that exceptions thrown by a component's type parameters (template parameter) should be propagated, unchanged, to the component's caller.

----
SRC: http://www.boost.org/more/generic_exception_safety.html

Comments

Anonymous said…
Pod people
Can you hear the beer? Tom Maxedon, 32, Traci Lutton, 30, and Jeffrey Meyer, 42, talk about microbrewed beer and interview a band while recording Meyer's award-winning podcast, "The Good Beer Show," at the ...
Hi, I was just blog surfing and found you! If you are interested, go see my make money related site. It is special to me plus you may find something of interest.This has a great business opportunity as well
Irresistible blog. I look for blogs like this one
when time allows me to. I enjoyed the site and I'll
check it next time!
Check out my coupon 1800contacts blog, you won't be sorry!
Astonshing blog. I relished in the site and you
know I will be going to it again! Surfing the internet
hepls me to find blogs that arfe just as good.
Please consider looking at my blog.
outa-time said…
Fine blog. I found your site suitable for another
visit! And when I'm able to surf the web, I look for
blogs as great as your work.
Go and click my 1800contacts web coupon code blog.
Excellent blog. It was so great and I bet I will
go back to it! I get to look online for blogs like
yours is a blessing.
Go by and hit my coupon codes 1800contacts blog, you'll be glad you did.
Inspiring blog. I love finding blogs this good on
the internet, when I have the time. I'm going to go
back to it!
Please come by and see my 1800contacts coupon codes blog.
Delightful blog. I devote my spare time just
looking for great blogs such as yours. I treasure this
site and will go back!
I want you to stop and compare with my 1800contacts com coupon blog.
Nice blog. I seen the site and I adored the work,
that I want to visit it more each day! I like
searching for blogs that have the same content like
this one!
Please examine my coupon codes 1800contacts blog as soon as you can.
Fine blog. I found your site suitable for another
visit! And when I'm able to surf the web, I look for
blogs as great as your work.
Please examine my 1800contacts web coupon code blog as soon as you can.
Awesome blog. I'm loving the site and I have to
return there soon! Going online, when I have the time,
I look for blogs close to your work!
No matter when you are, just stop by and check for my coupon 1800contacts blog site.
stunned said…
Excellent blog. It was so great and I bet I will
go back to it! I get to look online for blogs like
yours is a blessing.
Stop by and visiit my 1800contacts coupon code blog!
Astonshing blog. I relished in the site and you
know I will be going to it again! Surfing the internet
hepls me to find blogs that arfe just as good.
Please take a journey to my risk of plastic surgery blog.
Excellent blog. Your site was great and will be
finding it again!  I surf the net for blogs like
yours.
Sweetie, go and search my ear plastic surgery blog for what you need.
manho valentine said…
Astonshing blog. I relished in the site and you
know I will be going to it again! Surfing the internet
hepls me to find blogs that arfe just as good.
Please consider looking at my blog.
thanks you!
gclub

Popular posts from this blog

Multi-dimensional arrays in C++11

What new can be said about multi-dimensional arrays in C++? As it turns out, quite a bit! With the advent of C++11, we get new standard library class std::array. We also get new language features, such as template aliases and variadic templates. So I'll talk about interesting ways in which they come together.

It all started with a simple question of how to define a multi-dimensional std::array. It is a great example of deceptively simple things. Are the following the two arrays identical except that one is native and the other one is std::array?

int native[3][4];
std::array<std::array<int, 3>, 4> arr;

No! They are not. In fact, arr is more like an int[4][3]. Note the difference in the array subscripts. The native array is an array of 3 elements where every element is itself an array of 4 integers. 3 rows and 4 columns. If you want a std::array with the same layout, what you really need is:

std::array<std::array<int, 4>, 3> arr;

That's quite annoying for two r…

Understanding Fold Expressions

C++17 has an interesting new feature called fold expressions. Fold expressions offer a compact syntax to apply a binary operation to the elements of a parameter pack. Here’s an example. template <typename... Args> auto addall(Args... args) { return (... + args); } addall(1,2,3,4,5); // returns 15. This particular example is a unary left fold. It's equivalent to ((((1+2)+3)+4)+5). It reduces/folds the parameter pack of integers into a single integer by applying the binary operator successively. It's unary because it does not explicitly specify an init (a.k.a. identity) argument. So, let add it. template <typename... Args> auto addall(Args... args) { return (0 + ... + args); } addall(1,2,3,4,5); // returns 15. This version of addall is a binary left fold. The init argument is 0 and it's redundant (in this case). That's because this fold expression is equivalent to (((((0+1)+2)+3)+4)+5). Explicit identity elements will come in handy a little la…

Folding Monadic Functions

In the previous two blog posts (Understanding Fold Expressions and Folding Functions) we looked at the basic usage of C++17 fold expressions and how simple functions can be folded to create a composite one. We’ll continue our stride and see how "embellished" functions may be composed in fold expressions.

First, let me define what I mean by embellished functions. Instead of just returning a simple value, these functions are going to return a generic container of the desired value. The choice of container is very broad but not arbitrary. There are some constraints on the container and once you select a generic container, all functions must return values of the same container. Let's begin with std::vector.
// Hide the allocator template argument of std::vector. // It causes problems and is irrelevant here. template <class T> struct Vector : std::vector<T> {}; struct Continent { }; struct Country { }; struct State { }; struct City { }; auto get_countries…