{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:25:41Z","timestamp":1750307141624,"version":"3.41.0"},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Inroads"],"published-print":{"date-parts":[[2011,12]]},"abstract":"<jats:p>Facilities such as templates, STL, and Boost libraries are popular sources for generic programming and present a high-level view of the machine to the students of programming. The approach presented in this paper emphasizes on a different method of type independent programming that presents a lower-level view of the machine to the students. The merit of this approach is that students will gain some insight into the implementation of generics and better understand the underlying constructs available to them. Programming in this task becomes innovative and more challenging and enriches in-debt knowledge of the students in underlying layers in certain courses of computer science, and potentially contributes to computing education. Prospective C++ built-in constructs (other than templates) were studied to obtain their feasibility of how each or a combination of them can be employed to write data-type independent programs. Several code segments were developed and tested to confirm the genericness and applicability of each of them individually or as a combination.<\/jats:p>","DOI":"10.1145\/2038876.2038890","type":"journal-article","created":{"date-parts":[[2012,10,15]],"date-time":"2012-10-15T19:22:23Z","timestamp":1350328943000},"page":"38-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A special type-independent programming approach using available underlying constructs in a programming language"],"prefix":"10.1145","volume":"2","author":[{"given":"Iraj","family":"Danesh","sequence":"first","affiliation":[{"name":"Alabama State University, Montgomery, Alabama"}]}],"member":"320","published-online":{"date-parts":[[2011,12]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Abrahams David Generic Programming 2006 http:\/\/www.boost.org\/more\/generic_programming.html.  Abrahams David Generic Programming 2006 http:\/\/www.boost.org\/more\/generic_programming.html."},{"key":"e_1_2_1_2_1","first-page":"757","author":"Deitel P. J.","year":"2008","journal-title":"Upper Saddle River: Prentice Hall"},{"key":"e_1_2_1_3_1","unstructured":"Douglas Gregor an Introduction to Generic Programming 10\/13\/2007 http:\/\/www.generic-programming.org\/about\/intro\/.  Douglas Gregor an Introduction to Generic Programming 10\/13\/2007 http:\/\/www.generic-programming.org\/about\/intro\/."},{"key":"e_1_2_1_4_1","unstructured":"Drozdek Adam Data Structures and Algorithms in C++ Boston: Brooks\/Cole 2001 pp 19 20.   Drozdek Adam Data Structures and Algorithms in C++ Boston: Brooks\/Cole 2001 pp 19 20."},{"key":"e_1_2_1_5_1","first-page":"217","author":"Malik D. S.","year":"2003","journal-title":"Thomson"},{"key":"e_1_2_1_6_1","unstructured":"Tanenbaum Andrews S. Structured Computer Organization Englewood Cliffs: Prentice Hall 2006 pp 5 6.   Tanenbaum Andrews S. Structured Computer Organization Englewood Cliffs: Prentice Hall 2006 pp 5 6."},{"key":"e_1_2_1_7_1","unstructured":"Wikipedia the free encyclopedia Generic Programming 10\/11\/2006 http:\/\/en.wikipedia.org\/wiki\/Generic_Programming.  Wikipedia the free encyclopedia Generic Programming 10\/11\/2006 http:\/\/en.wikipedia.org\/wiki\/Generic_Programming."}],"container-title":["ACM Inroads"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2038876.2038890","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2038876.2038890","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:53Z","timestamp":1750240133000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2038876.2038890"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["10.1145\/2038876.2038890"],"URL":"https:\/\/doi.org\/10.1145\/2038876.2038890","relation":{},"ISSN":["2153-2184","2153-2192"],"issn-type":[{"type":"print","value":"2153-2184"},{"type":"electronic","value":"2153-2192"}],"subject":[],"published":{"date-parts":[[2011,12]]},"assertion":[{"value":"2011-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}