in an analogous manner. We used our adaptive integration techniques to estimate â« i ( x)dx . Algorithms Associative Arrays Aloysius G. OâRithm An associative array is a data structure, together with some access methods, that allows us as programmers to place and access data items by name rather than explicitly by position. Such arrays are implemented as a primitive type in some other programming languages (in K and in PostScript, for instance, where they are called dictionaries, and in Lisp, where they are called association lists); in some languages (Java, C, C++) they are available through libraries (and are frequently called hash tables, after a particular method of implementation). Clearly, nonAPL programmers find them useful. Both APL2 and J obtained answers for a tolerance of 1e_6 but failed when a tolerance of 1e_7 was requested, APL2 with a workspace full error and J with a limit error. Using 1e_6, the answers agreed and both used 873 subintervals. APL2 took 0.31 seconds while J took 0.29 seconds. Interestingly, Mathematica, gave an error message that the desired tolerance had not been met and then gave an answer only correct to 3 decimal places. While the differences in timing may
End of preview. The entire article is 3 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/associative-arrays-jq4t5Q93X9
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Associative arrays
O'Rithm, Aloysius G.
Follow ACM SIGAPL APL Quote Quad
, Volume 32 (3)
Association for Computing Machinery – Mar 1, 2002
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
