Category:Free Pascal: Difference between revisions
Content deleted Content added
Created page with "{{language programming paradigm|object-oriented}} {{language programming paradigm|imperative}} {{implementation|Object Pascal}}" |
More information added. |
||
Line 1: | Line 1: | ||
{{Language|Free Pascal |
|||
|strength=strong |
|||
|safety=safe}} |
|||
{{Compiler}} |
|||
{{language programming paradigm|object-oriented}} |
{{language programming paradigm|object-oriented}} |
||
{{language programming paradigm|imperative}} |
{{language programming paradigm|imperative}} |
Latest revision as of 12:06, 11 January 2015
![Language](http://static.miraheze.org/rosettacodewiki/thumb/2/27/Rcode-button-language-crushed.png/64px-Rcode-button-language-crushed.png)
This programming language may be used to instruct a computer to perform a task.
Type safety: | Safe |
---|---|
Type strength: | Strong |
See Also: |
|
Free Pascal is an example of a compiler. You may find the programming tasks that have been solved using it here.
Free Pascal is an implementation of Object Pascal.
Other implementations of Object Pascal.
Pages in category "Free Pascal"
The following 180 pages are in this category, out of 180 total.
A
B
C
- Calculating the value of e
- Call a function
- Casting out nines
- Changeable words
- Character codes
- Circular primes
- Closures/Value capture
- Code Golf: Code Golf
- Collect and sort square numbers in ascending order from three lists
- Colorful numbers
- Command-line arguments
- Common sorted list
- Composite numbers k with no single digit factors whose factors are all substrings of k
- CRC-32
- Cross compilation
D
- Date format
- Day of the week of Christmas and New Year
- Days between dates
- De Polignac numbers
- Deceptive numbers
- Define a primitive data type
- Delete a file
- Determine if a string is numeric
- Digital root/Multiplicative digital root
- Dijkstra's algorithm
- Disarium numbers
- Distance and Bearing
- Doubly-linked list/Element removal
E
F
- Fairshare between two and more
- Fibonacci sequence
- Find common directory path
- Find largest left truncatable prime in a given base
- Find prime n such that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- Find the last Sunday of each month
- Fixed length records
- Forbidden numbers
- Formatted numeric output
- Free Pascal
- Function definition
G
I
L
M
N
- N-queens minimum and knights and bishops
- N-smooth numbers
- Naming conventions
- Narcissistic decimal number
- Native shebang
- Nested function
- Non-decimal radices/Input
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers which are not the sum of distinct squares
- Numbers which are the cube roots of the product of their proper divisors
P
- Pairs with common factors
- Pan base non-primes
- Pandigital prime
- Parallel calculations
- Penholodigital squares
- Pick random element
- Population count
- Positive decimal integers with the digit 1 occurring exactly twice
- Prime numbers whose neighboring pairs are tetraprimes
- Prime reciprocal sum
- Prime triangle
R
S
- Sattolo cycle
- Scope modifiers
- Search a list of records
- Self-hosting compiler
- SEND + MORE = MONEY
- SHA-256
- SHA-256 Merkle tree
- Shape-Machine
- Shell one-liner
- Show ASCII table
- Show the (decimal) value of a number of 1s appended with a 3, then squared
- Sieve of Eratosthenes
- Sieve of Pritchard
- Singly-linked list/Reversal
- Sisyphus sequence
- Smallest power of 6 whose decimal expansion contains n
- Smallest square that begins with n
- Sort three variables
- Sphenic numbers
- Stack
- String prepend
- Substring
- Sudan function
- Sum data type
- Sum of divisors