Chilkat Examples

ChilkatHOMEAndroid™Classic ASPCC++C#Mono C#.NET Core C#C# UWP/WinRTDataFlexDelphi ActiveXDelphi DLLVisual FoxProJavaLianjaMFCObjective-CPerlPHP ActiveXPHP ExtensionPowerBuilderPowerShellPureBasicPythonRubySQL ServerSwiftTclUnicode CUnicode C++Visual Basic 6.0VB.NETVB.NET UWP/WinRTVBScriptXojo PluginNode.jsExcel

Ruby Examples


ASN.1
Amazon S3
Amazon S3 (new)
Amazon SES
Amazon SNS
Amazon SQS
Async
Azure Cloud Storage
Azure Service Bus
Bounced Email
Box
CSR
CSV
Certificates
Compression
DKIM / DomainKey
DSA
Diffie-Hellman
Digital Signatures
Dropbox
ECC
Email Object
Encryption
FTP
Facebook
Firebase
GeoOp
Google APIs
Google Calendar
Google Cloud Storage
Google Drive
Gzip
HTML-to-XML/Text
HTTP
HTTP Misc
IMAP
JSON
JSON Web Encryption (JWE)
JSON Web Signatures (JWS)
JSON Web Token (JWT)

Java KeyStore (JKS)
MHT / HTML Email
MIME
Microsoft Graph
NTLM
OAuth1
OAuth2
OneDrive
OpenSSL
Outlook
PEM
PFX/P12
POP3
PRNG
PayPal
Peoplevox
QuickBooks
REST
RSA Encryption
SCP
SFTP
SMTP
SSH
SSH Key
SSH Tunnel
SharePoint
Shopify
Socket/SSL/TLS
Spider
Stream
Stripe
SugarCRM
Tar Archive
Twitter
VoiceBase
Walmart
WebSocket
XML
XML Digital Signatures
XMP
Xero
Zip
curl
eBay

 

 

 

(Ruby) Xero Build Hashtable of Account Codes

To create a new account, a unique and unused account Code would need to be selected. How do we know what account Codes already exist? One way of finding out is to download the complete set of Accounts every time. Another way is to download once, and keep a local hash table of the account Codes. This makes it possible to find a new and unused Code without having to continually fetch data from the Xero server.

Note: Requires Chilkat v9.5.0.64 or greater.

Chilkat Ruby Downloads

Ruby Library for Linux and MAC OS X

require 'chilkat'

#  Note: Requires Chilkat v9.5.0.64 or greater.

#  This requires the Chilkat API to have been previously unlocked.
#  See Global Unlock Sample for sample code.

rest = Chilkat::CkRest.new()

#  Before sending REST API calls, the REST object needs to be
#  initialized for OAuth1.
#  See Xero 2-Legged OAuth1 Setup for sample code.

#  Assuming the REST object's OAuth1 authenticator is setup, and the initial
#  connection was made, we may now send REST HTTP requests..

#  -----------------------------------------------------
#  Get the full list of accounts.
sbXml = Chilkat::CkStringBuilder.new()
success = rest.FullRequestNoBodySb("GET","/api.xro/2.0/Accounts",sbXml)
if (success != true)
    print rest.lastErrorText() + "\n";
    exit
end

#  A 200 response is expected for actual success.
if (rest.get_ResponseStatusCode() != 200)
    print sbXml.getAsString() + "\n";
    exit
end

#  Iterate over the accounts, and build a Hashtable where the
#  key is the account Code, and the value is the XML record for the account.
htAccounts = Chilkat::CkHashtable.new()

bAutoTrim = false
xml = Chilkat::CkXml.new()
xml.LoadSb(sbXml,bAutoTrim)
xml.put_EmitXmlDecl(false)
xml.put_EmitCompact(true)

#  How many accounts exist?
numAccounts = xml.NumChildrenAt("Accounts")
print "numAccounts = " + numAccounts.to_s() + "\n";

i = 0
while i < numAccounts
    xml.put_I(i)
    hashKey = xml.getChildContent("Accounts|Account[i]|Code")
    #  Update the xml object's internal reference to the i'th account record.
    notUsed = xml.chilkatPath("Accounts|Account[i]|$")

    print "hash key = " + hashKey + "\n";
    if (i < 5)
        #  Show a few of the values..
        print xml.getXml() + "\n";
    end

    htAccounts.AddStr(hashKey,xml.getXml())

    #  Update the xml object's internal reference to the XML root node.
    xml.GetRoot2()
    i = i + 1
end

#  At this point the Hashtable is built.
#  Save the Hashtable to a file.  This will be used in subsequent requests
#  when we need to find a unique/unused Code, or if we want to get
#  the account information from the local hash table.
htXmlSb = Chilkat::CkStringBuilder.new()
htAccounts.ToXmlSb(htXmlSb)
success = htXmlSb.WriteFile("qa_cache/xero_accounts_by_code.xml","utf-8",false)

print "success = " + success.to_s() + "\n";

 

© 2000-2016 Chilkat Software, Inc. All Rights Reserved.