A matching mother or father field identifies a child. In Haskell:
children :: Database -> Person -> [Person]
children db p = unique [baby | (baby,mother,father) <- db,
                              mother == p || father == p]
Duplicate removal handles repeated certificates and children recorded in more than one matching row. Thus
(1)
The displayed set describes membership; the implementation returns its entries as a list in first certificate order.

Ancestors (13)

  1. ii
  2. a
  3. 3
  4. Functional programming, data structures and algorithms, procedural programming, and digital hardware
  5. 2003
  6. Past exam of the year 1 of the computer science course of the University of Oxford
  7. Year 1 of the computer science course of the University of Oxford
  8. Computer science course of the University of Oxford
  9. Undergraduate course of the University of Oxford
  10. Course of the University of Oxford
  11. University of Oxford
  12. List of universities
  13. Home

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version