Chilkat HOME .NET Core C# Android™ AutoIt C C# C++ Chilkat2-Python CkPython Classic ASP DataFlex Delphi ActiveX Delphi DLL Go Java Lianja Mono C# Node.js Objective-C PHP ActiveX PHP Extension Perl PowerBuilder PowerShell PureBasic Ruby SQL Server Swift 2 Swift 3,4,5... Tcl Unicode C Unicode C++ VB.NET VBScript Visual Basic 6.0 Visual FoxPro Xojo Plugin
(Unicode C++) Zip and Keep OpenSee more Zip ExamplesZip a directory tree by calling WriteZip instead of WriteZipAndClose. When WriteZip is called, the created zip is automatically opened and the zip object contains references to the compressed zip entries (mapped entries) contained within the .zip.
#include <CkZipW.h> #include <CkZipEntryW.h> void ChilkatSample(void) { // This example assumes the Chilkat API to have been previously unlocked. // See Global Unlock Sample for sample code. CkZipW zip; bool success; const wchar_t *zipPath = L"c:/temp/myFiles.zip"; // Initialize the zip object, which also sets the FileName property to the path of the zip to be created. zip.NewZip(zipPath); // Append references to files to be zipped. bool recurse = true; success = zip.AppendFiles(L"c:/temp/files_to_zip/*",recurse); if (success == false) { wprintf(L"%s\n",zip.lastErrorText()); return; } // Write the .zip, but don't close the zip file. // The zip file we just created is automatically opened and the zip object // now contains entries that are contained within the zip. (They are memory-mapped entries) success = zip.WriteZip(); if (success == false) { wprintf(L"%s\n",zip.lastErrorText()); return; } wprintf(L"Successfully created %s\n",zipPath); // Let's look at what's in the .zip we just created.. int numEntries = zip.get_NumEntries(); int i = 0; CkZipEntryW *entry = 0; while (i < numEntries) { entry = zip.GetEntryByIndex(i); if (entry->get_IsDirectory()) { wprintf(L"%d: %s (directory)\n",i,entry->fileName()); } else { wprintf(L"%d: %s\n",i,entry->fileName()); } delete entry; i = i + 1; } // Close the zip file when finished. zip.CloseZip(); } |
© 2000-2024 Chilkat Software, Inc. All Rights Reserved.