StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
3552730
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2010-08-24T00:29:50.110
FavoriteCount
0
LastActivityDate
2010-08-24T00:29:50.110
LastEditDate
LastEditorUserId
0
OwnerUserId
39375
ParentId
3552145
PostTypeId
2
Score
0
ViewCount
0
LastEditorDisplayName
text
Body
With the code, I understand what you're going for now. I'd do it pretty much the first way you suggest: each time through the outer loop, make a temporary copy of the <code>current_partition</code> data structure, and then work on that, discarding it at the end. You said that the problem with that would be that you couldn't use an iterator into the original map to find the element you ought to be working on. That's true; you can't do that directly. But it's a map. The element you're working on will have a key which will be the same in any copy of the data structure, so you can use that to create an iterator to the element that you ought to be working on in the copy. For instance: <pre><code>std::map<int,int> current_partition = bitset_to_map(centre->second->bit_partitions); int num_parts = (std::max_element(current_partition.begin(), current_partition.end(),value_comparer))->second; for (std::map<int,int>::iterator itr = current_partition.begin(); itr != current_partition.end(); ++itr) { // Make a temporary copy of the map. Iterators between the original and the copy aren't // interchangeable, but the keys are. std::map<int,int> tmp_current_partition = current_partition; // Use the iterator itr to get the key for the element you're working on (itr->first), // and then use that key to get an equivalent iterator into the temporary map using find() std::map<int,int>::iterator tmp_itr = tmp_current_partition.find(itr->first); // Then just replace current_partition with tmp_current_partition and // itr with tmp_itr in the remainder (hopefully I didn't miss any) for (int next_part = 0; next_part<num_parts+1; ++next_part) { if (next_part != tmp_itr->second) { int current_part = tmp_itr->second; tmp_itr->second = next_part; std::vector<int> first_changed_part, last_changed_part; for (std::map<int,int>::iterator new_itr = tmp_current_partition.begin(); new_itr != tmp_current_partition.end(); ++new_itr) { if (new_itr->second == current_part) first_changed_part.push_back(new_itr->first); if (new_itr->second == next_part) last_changed_part.push_back(new_itr->first); } } } } </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POHow to iterate through map, modify map but restore at each iteration?
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USTyler McHenry
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.