X-Git-Url: http://git.pippins.net/embedvideo/.git/static/gitweb.js?a=blobdiff_plain;f=main.cpp;h=8540adfb56c480db0d6284b3811bafd051773ec2;hb=ddc36cb7ada4575030f31894eba76c3fc96e2826;hp=2323efe3295da8031ab88a111b590f38a8a6787d;hpb=ce454c7d92e63a941a1277406e466005d74eb148;p=backups%2F.git

diff --git a/main.cpp b/main.cpp
index 2323efe..8540adf 100644
--- a/main.cpp
+++ b/main.cpp
@@ -64,25 +64,25 @@ void partition_sets( const SET &current, const SET &old,
                      SET &added, SET &common, SET &old_common, SET &deleted  ) {
   FileDataNameCmp cmp;
 
-  set_difference( current.begin(), current.end(),
-                  old.begin(),     old.end(),
-                  inserter( added, added.begin() ),
-                  cmp );
-
-  set_difference( old.begin(),     old.end(),
-                  current.begin(), current.end(),
-                  inserter( deleted, deleted.begin() ),
-                  cmp );
-
-  set_union(      current.begin(), current.end(),
-                  old.begin(),     old.end(),
-                  inserter( common, common.begin() ),
-                  cmp );
-
-  set_union(      old.begin(),    old.end(),
-                  common.begin(), common.end(),
-                  inserter( old_common, old_common.begin() ),
-                  cmp );
+  set_difference(   current.begin(), current.end(),
+                    old.begin(),     old.end(),
+                    inserter( added, added.begin() ),
+                    cmp );
+
+  set_difference(   old.begin(),     old.end(),
+                    current.begin(), current.end(),
+                    inserter( deleted, deleted.begin() ),
+                    cmp );
+
+  set_intersection( current.begin(), current.end(),
+                    old.begin(),     old.end(),
+                    inserter( common, common.begin() ),
+                    cmp );
+
+  set_intersection( old.begin(),    old.end(),
+                    common.begin(), common.end(),
+                    inserter( old_common, old_common.begin() ),
+                    cmp );
 }
 
 template<class INT>
@@ -154,51 +154,53 @@ int main() {
 
   // Now find the list of files to backup.
   file_set backups;
-  insert_iterator<file_set> backups_i( backups, backups.begin() );
 
   // backup all added files
-  copy( added.begin(), added.end(), backups_i );
+  copy( added.begin(), added.end(), inserter( backups, backups.begin() ) );
 
   // Track the total size of added files
   unsigned long long added_blocks, added_bytes;
   sizes( added.begin(), added.end(), added_blocks, added_bytes );
 
-  file_vector modified_files;
+  file_vector modified_v;
   // Backup files that have been modified
   file_set::iterator i = common.begin(), j = old_common.begin();
   for( ; i != common.end(); ++i, ++j ) {
     (*i)->setLastBackupDate( (*j)->getLastBackupDate() );
 
-    if( needs_backup( *j, *i ) ) modified_files.push_back( *i );
+    if( needs_backup( *j, *i ) ) modified_v.push_back( *i );
   }
 
-  copy( modified_files.begin(), modified_files.end(), backups_i );
+  copy( modified_v.begin(), modified_v.end(), inserter( backups, backups.begin() ) );
 
   // Track the total size of modified files
   unsigned long long modified_blocks, modified_bytes;
-  sizes( modified_files.begin(), modified_files.end(), modified_blocks, modified_bytes );
+  sizes( modified_v.begin(), modified_v.end(), modified_blocks, modified_bytes );
 
-  // Now, sort the backups by filesize and build a list that'll fit on a DVD
+  // Now, sort the backups by filesize (decreasing) and build a list that'll fit
+  // on a DVD
   file_vector backups_s;
   copy( backups.begin(), backups.end(), back_inserter( backups_s ) );
 
   FileDataSizeCmp sizecmp;
-  sort( backups_s.begin(), backups_s.end(), sizecmp );
+  sort( backups_s.rbegin(), backups_s.rend(), sizecmp );
 
   file_set final;
-  unsigned long long space = 0x100000000ULL; // After looking at how big the ISO can be and how many 1K blocks are left after formatting the filesystem I decided on an even 4GB target
+  unsigned long long space = 0x100000000ULL;
 
   insert_iterator<file_set> final_i( final, final.begin() );
 
   // Copy files over until full or out of files
   bool complete
-    = copy_until_full( backups_s.rbegin(), backups_s.rend(), final_i, space );
+    = copy_until_full( backups_s.begin(), backups_s.end(), final_i, space );
 
   // Track the size filled up by essential backups
   unsigned long long essential_blocks, essential_bytes;
   sizes( final.begin(), final.end(), essential_blocks, essential_bytes );
 
-  // Now, sort the non-backed-up list by last_backup_date and back-fill
+  // Now, sort the non-backed-up list by last_backup_date, then by filesize
+  // (decreasing) and back-fill.  This should minimize the number of DVDs in the
+  // collection left with actual content.
   if( 0 != space ) {
     file_vector leftovers;
     FileDataNameCmp cmp;
@@ -208,7 +210,10 @@ int main() {
                     cmp );
 
     FileDataLastBackupCmp lastbackupcmp;
-    sort( leftovers.begin(), leftovers.end(), lastbackupcmp );
+    // Achieve 'last back date then by filesize' by first sorting by filesizing
+    // and then running stable sort by last backup date.
+    sort(        leftovers.rbegin(), leftovers.rend(), sizecmp );
+    stable_sort( leftovers.begin(),  leftovers.end(),  lastbackupcmp );
 
     copy_until_full( leftovers.begin(), leftovers.end(), final_i, space );
   }