![]() |
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
(Go) 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.
success := false zip := chilkat.NewZip() // Open an existing ZIP archive. success = zip.OpenZip("c:/temp/example.zip") if success == false { fmt.Println(zip.LastErrorText()) zip.DisposeZip() return } // A ZIP archive may contain zero entries. if zip.NumEntries() == 0 { fmt.Println("The ZIP archive is empty.") zip.CloseZip() zip.DisposeZip() return } // ------------------------------------------------------------ // Get the first ZIP entry. // // EntryAt(0,entry) initializes the ZipEntry object so that // it represents the first entry in the ZIP archive. // entry := chilkat.NewZipEntry() success = zip.EntryAt(0,entry) if success == false { fmt.Println(zip.LastErrorText()) zip.DisposeZip() entry.DisposeZipEntry() return } // ------------------------------------------------------------ // Iterate through all ZIP entries. // // GetNext updates the same ZipEntry object so that it // represents the next entry in the ZIP archive. // for (success == true) { if entry.IsDirectory() == true { fmt.Println("[Directory] ", entry.FileName()) } else { fmt.Println("[File] ", entry.FileName()) } // Advance to the next entry. success = entry.GetNext() } zip.CloseZip() fmt.Println("Done.") zip.DisposeZip() entry.DisposeZipEntry() |
||||
© 2000-2026 Chilkat Software, Inc. All Rights Reserved.