![]() |
Chilkat HOME Android™ AutoIt C C# C++ Chilkat2-Python CkPython Classic ASP DataFlex Delphi DLL Go Java 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++) Determine the Number of Unseen Email MessagesDemonstrates how to determine how many unseen messages exist in an email account on an IMAP server. Note: This example requires Chilkat v11.0.0 or greater.
#include <CkImapW.h> #include <CkMessageSetW.h> void ChilkatSample(void) { bool success = false; // This example requires the Chilkat API to have been previously unlocked. // See Global Unlock Sample for sample code. CkImapW imap; // Connect to an IMAP server. // Use TLS imap.put_Ssl(true); imap.put_Port(993); success = imap.Connect(L"imap.example.com"); if (success == false) { wprintf(L"%s\n",imap.lastErrorText()); return; } // Login success = imap.Login(L"***",L"***"); if (success == false) { wprintf(L"%s\n",imap.lastErrorText()); return; } // Select an IMAP mailbox success = imap.SelectMailbox(L"Inbox"); if (success == false) { wprintf(L"%s\n",imap.lastErrorText()); return; } // After selecting the mailbox. the total number of emails // is immediately available: int totalNum = imap.get_NumMessages(); wprintf(L"Num messages = %d\n",totalNum); // To determine the number of unseen messages, a call // to Search is required, which returns the set of UIDs // of all unseen messages. // We can choose to fetch UIDs or sequence numbers. bool fetchUids = true; CkMessageSetW messageSet; success = imap.QueryMbx(L"UNSEEN",fetchUids,messageSet); if (success == false) { wprintf(L"%s\n",imap.lastErrorText()); return; } unsigned long numUnseen = messageSet.get_Count(); wprintf(L"%u\n",numUnseen); wprintf(L"UIDs ----\n"); // Display the UIDs int i = 0; while (i < messageSet.get_Count()) { wprintf(L"%u\n",messageSet.GetId(i)); i = i + 1; } // Disconnect from the IMAP server. success = imap.Disconnect(); } |
© 2000-2025 Chilkat Software, Inc. All Rights Reserved.