Talk:Queue/Definition: Difference between revisions
m
Forgot to sign.
(Calling '''Nirs''') |
m (Forgot to sign.) |
||
Line 1:
The last line of the task description states ''Define the data structure for a FIFO element. Said element should contain a data member capable of holding a numeric value, and the link to the next element should be mutable.'' The Python example first provided does not satisfy this requirement. It seems that the Python example should be expanded to include a definition of the data structure for a FIFO element.
- [[Waldorf|Waldorf]] 4 November 2007
: Python's dequeue looks like it implements generic programming; The data structure that would need to be defined is actually internal to the dequeue class. In my opinion, languages which have (either through built-in features or public libraries) features that simplify the implementation of the task should have those features demonstrated in examples. In this case, I would suggest exempting Python from the task requirement. Considering the FIFO data structure is a fairly generic and common one, I would ask '''Nirs''' if that requirement is necessary, or if it could be reworded. --[[User:Short Circuit|Short Circuit]] 19:20, 4 November 2007 (MST)
* The Python example is usage of language/library features, whereas the Ada example is of implementation; these are both useful things to have. I suggest that the task be rewritten to allow for both implementation and usage examples, or that they be split into two task pages.
| |||