Click here to Skip to main content
Click here to Skip to main content
Add your own
alternative version

Primel: C++ Infinite List Library in Policy-based Design

, 7 Sep 2013 BSD
An infinite list seen in Haskell. Moreover, you can choose its concurrent behavior through the policy.

Revisions


  

Compare Revision Minor Date Status Editor
18 - publicly available No 7-Sep-13 14:45 Available Deeksha Shenoy
Updates in content. Changes: 27
17 No 7-Sep-13 14:05 Available Deeksha Shenoy
Updates in content. Changes: 62
15 No 7-Sep-13 13:07 Pending T. Ogawa 2012
BUG FIX of main2.c
13 No 6-Sep-13 22:52 Pending T. Ogawa 2012
Bug in main2.c of upload.zip
12 No 6-Sep-13 17:35 Available Smitha Vijayan
Updates in content.
11 No 6-Sep-13 14:37 Pending T. Ogawa 2012
class PrimelTreePointer is added. It is for parse tree.
10 No 7-Jan-13 14:00 Available Smitha Vijayan
Updates in content.
9 No 7-Jan-13 13:10 Pending T. Ogawa 2012
Add the explanations of the keywords 'infinite list' 'list comprehension' 'in order' 'lazy'
7 No 9-Dec-12 5:52 Pending T. Ogawa 2012
'infinite list' is correct
5 No 8-Dec-12 16:28 Pending T. Ogawa 2012
UPLOAD FILE
4 No 8-Dec-12 11:57 Available Smitha Vijayan
Updates in content.
3 No 8-Dec-12 9:21 Pending T. Ogawa 2012
Updates in content.
2 No 6-Dec-12 13:43 Available Smitha Vijayan
Updates in content. 89 changes had been made.
1 No 6-Dec-12 12:42 Pending T. Ogawa 2012
Initial creation

License

This article, along with any associated source code and files, is licensed under The BSD License

Share

About the Author

T. Ogawa 2012
Software Developer
Japan Japan
I'm an old programer. My Skill starts from i8085 assembler
coding. The Object oriented programing is over 20 years
and I achived the Policy based programing. Latest interests
are pthreads and pararell programings.

| Advertise | Privacy | Terms of Use | Mobile
Web01 | 2.8.141216.1 | Last Updated 7 Sep 2013
Article Copyright 2012 by T. Ogawa 2012
Everything else Copyright © CodeProject, 1999-2014
Layout: fixed | fluid