• Announcements

    • khawk

      Download the Game Design and Indie Game Marketing Freebook   07/19/17

      GameDev.net and CRC Press have teamed up to bring a free ebook of content curated from top titles published by CRC Press. The freebook, Practices of Game Design & Indie Game Marketing, includes chapters from The Art of Game Design: A Book of Lenses, A Practical Guide to Indie Game Marketing, and An Architectural Approach to Level Design. The GameDev.net FreeBook is relevant to game designers, developers, and those interested in learning more about the challenges in game development. We know game development can be a tough discipline and business, so we picked several chapters from CRC Press titles that we thought would be of interest to you, the GameDev.net audience, in your journey to design, develop, and market your next game. The free ebook is available through CRC Press by clicking here. The Curated Books The Art of Game Design: A Book of Lenses, Second Edition, by Jesse Schell Presents 100+ sets of questions, or different lenses, for viewing a game’s design, encompassing diverse fields such as psychology, architecture, music, film, software engineering, theme park design, mathematics, anthropology, and more. Written by one of the world's top game designers, this book describes the deepest and most fundamental principles of game design, demonstrating how tactics used in board, card, and athletic games also work in video games. It provides practical instruction on creating world-class games that will be played again and again. View it here. A Practical Guide to Indie Game Marketing, by Joel Dreskin Marketing is an essential but too frequently overlooked or minimized component of the release plan for indie games. A Practical Guide to Indie Game Marketing provides you with the tools needed to build visibility and sell your indie games. With special focus on those developers with small budgets and limited staff and resources, this book is packed with tangible recommendations and techniques that you can put to use immediately. As a seasoned professional of the indie game arena, author Joel Dreskin gives you insight into practical, real-world experiences of marketing numerous successful games and also provides stories of the failures. View it here. An Architectural Approach to Level Design This is one of the first books to integrate architectural and spatial design theory with the field of level design. The book presents architectural techniques and theories for level designers to use in their own work. It connects architecture and level design in different ways that address the practical elements of how designers construct space and the experiential elements of how and why humans interact with this space. Throughout the text, readers learn skills for spatial layout, evoking emotion through gamespaces, and creating better levels through architectural theory. View it here. Learn more and download the ebook by clicking here. Did you know? GameDev.net and CRC Press also recently teamed up to bring GDNet+ Members up to a 20% discount on all CRC Press books. Learn more about this and other benefits here.
Sign in to follow this  
Followers 0
jwezorek

remove_if-like behavior maps?

7 posts in this topic

So is there an idiomatic way to remove all items from a map for which some predicate is true?

 

std::remove_if "removes" items by moving them to the end of a collection and then returns an iterator to the first of the "removed" items so you can erase them or do whatever you want to do. This doesn't work for maps because maps are ordered and therefore you can't just arbitrarily move their contents around.

 

Is there some way of doing this with standard library algorithms? I just wrote a function but it seemed weird that I had to.

 

Also does anyone else find remove_if broken? I mean why not just get rid of it and have erase_if? Or at least have erase_if and remove_if?

Edited by jwezorek
0

Share this post


Link to post
Share on other sites

So is there an idiomatic way to remove all items from a map for which some predicate is true?
 
std::remove_if "removes" items by moving them to the end of a collection and then returns an iterator to the first of the "removed" items so you can erase them or do whatever you want to do. This doesn't work for maps because maps are ordered and therefore you can't just arbitrarily move their contents around.
 
Is there some way of doing this with standard library algorithms? I just wrote a function but it seemed weird that I had to.

There are no immediate functions in the standard library to do that as far as I am aware. It should, however, be fairly trivial to just make a simple loop and erase elements yourself. Since map iterators are not invalidated on erase, you don't need much effort to keep the loop valid like when you iterate over and erase from, say, a vector.

 

Also does anyone else just find remove_if broken? I mean why not just get rid of it and have erase_if? Or at least have erase_if and remove_if?

remove_if serves a purpose when the container itself cannot be modified. For example, you can call remove_if on a static array to partition its content into a part with the remaining part and the removed part, and the return value is the pointer to where the second partition starts. An erase_if equivalent would not work on a static array.

 

Since erase_if can easily be implemented in terms of remove_if and erase, the function itself is not really something fundamental on the same level as remove_if and erase. Although I could definitely agree that it would be nice to have, since remove_if is often called with erase.

2

Share this post


Link to post
Share on other sites


For example, you can call remove_if on a static array to partition its content into a part with the remaining part and the removed part, and the return value is the pointer to where the second partition starts.

Couldn't you use std::stable_partition instead?

 

Unless I'm missing something fundamental, they do the same thing in this case.

0

Share this post


Link to post
Share on other sites
No, partition() or stable_partition() will leave the part at and after the returned iterator as being completely filled with elements not satisfying the predicate. However, remove_if() gives no guarantee whatsoever about the contents of those elements. They may or may not satisfy the predicate.
0

Share this post


Link to post
Share on other sites

I use this function in my code:

//Removes all occurances of elements in the map that have a value that returns true for 'predicate'.
template<typename MapType, typename PredicateFunc>
void MapRemoveValues(MapType &map, PredicateFunc predicate)
{
	for(auto it = std::begin(map); it != std::end(map); )
	{
		if(predicate(it->second))
		{
			it = map.erase(it);
		}
		else
		{
			++it;
		}
	}
}

Just make the predicate take *it instead of it->second.

 

[b][Edit:][/b] Whoops, skimming too much. Didn't see you said you already wrote a function.

Edited by Servant of the Lord
1

Share this post


Link to post
Share on other sites

Since erase_if can easily be implemented in terms of remove_if and erase, the function itself is not really something fundamental on the same level as remove_if and erase. Although I could definitely agree that it would be nice to have, since remove_if is often called with erase.

 

After thinking this all over, my opinion is that erase_if -- or something equivalent -- is fundamental precisely because you cannot implement erase_if-type functionality in terms of  erasing items that you moved around unless the underlying data structure you are working with is vector-like.

 

Fixed sized arrays wouldn't work -- without broadening the semantics of a legal implementation of erase_if --, yes, but then maps don't work with the remove/erase idiom. It is like the authors of the standard library give primacy to vector-like data structures; that when we say such-and-such is fundamental there is a tacit clause like such-and-such is fundamental for vectors and lists.

Edited by jwezorek
0

Share this post


Link to post
Share on other sites

No, partition() or stable_partition() will leave the part at and after the returned iterator as being completely filled with elements not satisfying the predicate. However, remove_if() gives no guarantee whatsoever about the contents of those elements. They may or may not satisfy the predicate.

Hang on...

remove_if() doesn't guarantee that all the items after the returned iterator satisfy the predicate? Or it doesn't guarantee that all items which satisfy the predicate will be after the returned iterator? Either definition seems problematic.

I'm assuming you mean that it doesn't actually swap the items into the slots beyond the returned iterator, and the contents of those items may or may not be valid? Edited by swiftcoder
0

Share this post


Link to post
Share on other sites

std::remove_if() has no guarantees whatsoever about whether or not elements at or after the iterator returned by std::remove_if() satisfy or don't satisfy the predicate passed to std::remove_if(). The contents of those elements will be valid in the sense they can be properly destroyed (assuming that the copy assignment/move assignment operator are implemented correctly).

1

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!


Register a new account

Sign in

Already have an account? Sign in here.


Sign In Now
Sign in to follow this  
Followers 0