![]() |
Chilkat HOME Android™ AutoIt C C# C++ Chilkat2-Python CkPython Classic ASP DataFlex Delphi DLL Go Java JavaScript Node.js Objective-C PHP Extension Perl PowerBuilder PowerShell PureBasic Ruby SQL Server Swift Tcl Unicode C Unicode C++ VB.NET VBScript Visual Basic 6.0 Visual FoxPro Xojo Plugin
(Unicode C++) Iterate Through ZIP Entries Using EntryAt and ZipEntry.GetNextSee more Zip ExamplesThis example demonstrates how to iterate through all entries in a ZIP archive using:
The example prints each ZIP entry's stored filename and whether the entry is a file or directory. This approach is useful when sequentially processing ZIP entries without repeatedly calling Suppose the ZIP archive contains: The example iterates through each entry in the order stored within the ZIP archive.
#include <CkZipW.h> #include <CkZipEntryW.h> void ChilkatSample(void) { bool success = false; CkZipW zip; // Open an existing ZIP archive. success = zip.OpenZip(L"c:/temp/example.zip"); if (success == false) { wprintf(L"%s\n",zip.lastErrorText()); return; } // A ZIP archive may contain zero entries. if (zip.get_NumEntries() == 0) { wprintf(L"The ZIP archive is empty.\n"); zip.CloseZip(); return; } // ------------------------------------------------------------ // Get the first ZIP entry. // // EntryAt(0,entry) initializes the ZipEntry object so that // it represents the first entry in the ZIP archive. // CkZipEntryW entry; success = zip.EntryAt(0,entry); if (success == false) { wprintf(L"%s\n",zip.lastErrorText()); return; } // ------------------------------------------------------------ // Iterate through all ZIP entries. // // GetNext updates the same ZipEntry object so that it // represents the next entry in the ZIP archive. // while ((success == true)) { if (entry.get_IsDirectory() == true) { wprintf(L"[Directory] %s\n",entry.fileName()); } else { wprintf(L"[File] %s\n",entry.fileName()); } // Advance to the next entry. success = entry.GetNext(); } zip.CloseZip(); wprintf(L"Done.\n"); } |
||||||
© 2000-2026 Chilkat Software, Inc. All Rights Reserved.