This code sample generates Pascal's triangle as jagged 2D list (list of lists).
19 people like thisPosted: 13 years ago by Dmitry Soshnikov
Today, 11. february 2011, is a palindromic day according to the European date format (day/month/year). This snippet collects all the palindromic dates until 31 dec. 9999. They are 366, a surprisingly low number.
13 people like thisPosted: 13 years ago by Francesco De Vittori
This snippet is helpfull in the following cases: 1) After a consolidation operation using the fold function we need to know how many elements have been processed. 2) A consolidation operation needs to use the index of each of the elements processed and we don't want to use the mapi function first. 3) A combination of the above. Since the following snippet just adds a wrapper to the existing Fold function we can repeat the approach for arrays and sequences (including the plinq ones)
31 people like thisPosted: 13 years ago by Horacio Nuñez
A JoinList is a variation on the list type that offers a constant time append operation.
5 people like thisPosted: 12 years ago by Ryan Riley
These are F# solutions of Ninety-Nine Haskell Problems which are themselves translations of Ninety-Nine Lisp Problems and Ninety-Nine Prolog Problems. The solutions are hidden so you can try to solve them yourself.
34 people like thisPosted: 12 years ago by Cesar Mendoza
These are F# solutions of Ninety-Nine Haskell Problems which are themselves translations of Ninety-Nine Lisp Problems and Ninety-Nine Prolog Problems. The solutions are hidden so you can try to solve them yourself.
6 people like thisPosted: 12 years ago by Cesar Mendoza
Find what's been added, removed or changed between two lists (perfom a diff between two lists of items).
4 people like thisPosted: 9 years ago by Daniel Bradley
This code sample generates Pascal's triangle as jagged 2D list (list of lists). It takes 0.5 sec to generate 3000 rows (vs 16 sec for http://fssnip.net/23). Tip: try to avoid of using "list1 @ list2" construction.
13 people like thisPosted: 13 years ago by Shamil Sayfutdinov
Returns the pascal triangle in a 2D list . This snippet computes rows translating the 'visual' method taught at school into Lists and the usage of map2 function. It takes almost 5 seconds to compute 5000 rows.
20 people like thisPosted: 13 years ago by Horacio Nuñez
This is to demonstrate that: (1) there are many ways to solve the same problems; (2) operators can be grouped together into data structures and act as data; (3) you can have fun in F# in many ways.
57 people like thisPosted: 13 years ago by Dmitry Soshnikov
Euler #5 solution
4 people like thisPosted: 12 years ago by Michael Falanga
These are F# solutions of Ninety-Nine Haskell Problems which are themselves translations of Ninety-Nine Lisp Problems and Ninety-Nine Prolog Problems. The solutions are hidden so you can try to solve them yourself.
7 people like thisPosted: 12 years ago by Cesar Mendoza
Merges two sorted lists by a key.
4 people like thisPosted: 12 years ago by Simon Weijgers
Creates a jagged 2d list of Pascal's Triangle.
2 people like thisPosted: 4 years ago by Kayden Tebau