Category:Jq: Difference between revisions
Content deleted Content added
Category:Programming paradigm/Tacit |
→jq Modules at rosettacode.org: MRG32k3a Combined Recursive Pseudo-Random Number Generator |
||
(11 intermediate revisions by the same user not shown) | |||
Line 2:
|site=http://stedolan.github.io/jq}}
{{language programming paradigm|Functional}}
[https://en.wikipedia.org/wiki/Jq_(programming_language) jq] is a [[functional programming]] language that is oriented towards processing text files or [[JSON]]. jq is also the name of [https://stedolan.github.io/jq a portable executable] that compiles and runs jq programs. A [[Go]] implementation, [https://github.com/itchyny/gojq gojq], is also available; and [https://github.com/01mf02/jaq jaq] implements a large subset of jq in [[Rust]].
jq was originally designed and developed by Stephen Dolan.
==jq Modules at rosettacode.org==
* [[:Category:Jq/assert.jq|assert.jq]] - module to support assertions
* [[:Category:Jq/bitwise.jq|bitwise.jq]] - bit streams, bit arrays, and integers
* [[:Category:Jq/fibonacci.jq|fibonacci.jq]] - Fibonacci sequence and Fibonacci coding
* [[:Category:Jq/peg.jq|peg.jq]] - Parsing Expression Grammar foundations
* [[:Category:Jq/polynomials.jq|polynomials.jq]] - polynomials as JSON arrays
* [[:Category:Jq/Date.jq|Date.jq]] - Gregorian calendar from the year 1
* [[:Category:Jq/MRG32k3a.jq|MRG32k3a.jq]] - MRG32k3a Combined Recursive Pseudo-Random Number Generator
* [[:Category:Jq/RealSet.jq|RealSet.jq]] - Union of finite real intervals
==Todo==
[[Tasks_not_implemented_in_jq]]
[[Category:Programming paradigm/Tacit]]
|
Revision as of 09:25, 11 June 2024
![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.
Official website |
---|
See Also: |
|
---|
jq is a functional programming language that is oriented towards processing text files or JSON. jq is also the name of a portable executable that compiles and runs jq programs. A Go implementation, gojq, is also available; and jaq implements a large subset of jq in Rust.
jq was originally designed and developed by Stephen Dolan.
jq Modules at rosettacode.org
- assert.jq - module to support assertions
- bitwise.jq - bit streams, bit arrays, and integers
- fibonacci.jq - Fibonacci sequence and Fibonacci coding
- peg.jq - Parsing Expression Grammar foundations
- polynomials.jq - polynomials as JSON arrays
- Date.jq - Gregorian calendar from the year 1
- MRG32k3a.jq - MRG32k3a Combined Recursive Pseudo-Random Number Generator
- RealSet.jq - Union of finite real intervals
Todo
Subcategories
This category has the following 2 subcategories, out of 2 total.
@
- Jq User (2 P)
J
- Jq/assert.jq (1 P)
Pages in category "Jq"
The following 200 pages are in this category, out of 1,199 total.
(previous page) (next page)M
- Mayan calendar
- Mayan numerals
- Maze generation
- McNuggets problem
- Menu
- Merge and aggregate datasets
- Mertens function
- Metallic ratios
- Mian-Chowla sequence
- Middle three digits
- Mind boggling card trick
- Minimal steps down to 1
- Minimum multiple of m where digital sum equals m
- Minimum number of cells after, before, above and below NxN squares
- Minimum numbers of three lists
- Minimum positive multiple in base 10 using only 0 and 1
- Minimum primes
- Modified random distribution
- Modular arithmetic
- Modular exponentiation
- Modular inverse
- Monads/List monad
- Monte Carlo methods
- Monty Hall problem
- Mosaic matrix
- Most frequent k chars distance
- Motzkin numbers
- Move-to-front algorithm
- Multi-dimensional array
- Multifactorial
- Multiline shebang
- Multiple distinct objects
- Multiple regression
- Multiplication tables
- Multiplicative order
- Multiplicatively perfect numbers
- Multisplit
- Munchausen numbers
- Munching squares
- Mutual recursion
- Möbius function
N
- N'th
- N-body problem
- N-grams
- N-queens problem
- N-smooth numbers
- Named parameters
- Names to numbers
- Naming conventions
- Narcissistic decimal number
- Native shebang
- Natural sorting
- Negative base numbers
- Neighbour primes
- Nested function
- Nested templated data
- Next highest int from digits
- Next special primes
- Nice primes
- Nim game
- Non-continuous subsequences
- Non-decimal radices/Convert
- Non-decimal radices/Input
- Nonoblock
- Nonogram solver
- Nth root
- Null object
- Number names
- Number reversal game
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers in base-16 representation that cannot be written with decimal digits
- Numbers k such that the last letter of k is the same as the first letter of k+1
- Numbers which are not the sum of distinct squares
- Numbers which are the cube roots of the product of their proper divisors
- Numbers whose binary and ternary digit sums are prime
- Numbers whose count of divisors is prime
- Numbers with equal rises and falls
- Numbers with prime digits whose sum is 13
- Numbers with same digit set in base 10 and base 16
- Numeric separator syntax
- Numerical integration
- Numerical integration/Adaptive Simpson's method
- Numerical integration/Gauss-Legendre Quadrature
- NYSIIS
O
- O'Halloran numbers
- Odd and square numbers
- Odd squarefree semiprimes
- Odd words
- Old lady swallowed a fly
- Old Russian measure of length
- One of n lines in a file
- One-dimensional cellular automata
- Operator precedence
- Optional parameters
- Orbital elements
- Order by pair comparisons
- Order disjoint list items
- Order two numerical lists
- Ordered partitions
- Ordered words
- Ormiston pairs
- Overloaded operators
- Own digits power sum
P
- P-value correction
- Padovan sequence
- Pairs with common factors
- Palindrome dates
- Palindrome detection
- Palindromic gapful numbers
- Palindromic primes
- Palindromic primes in base 16
- Pandigital prime
- Pangram checker
- Paraffins
- Parse an IP Address
- Parse command-line arguments
- Parsing/RPN calculator algorithm
- Parsing/RPN to infix conversion
- Partial function application
- Partition an integer x into n primes
- Partition function P
- Pascal matrix generation
- Pascal's triangle
- Pascal's triangle/Puzzle
- Password generator
- Pathological floating point problems
- Peaceful chess queen armies
- Peano curve
- Pell's equation
- Penholodigital squares
- Penrose tiling
- Penta-power prime seeds
- Pentagram
- Pentomino tiling
- Perceptron
- Perfect numbers
- Perfect shuffle
- Perfect totient numbers
- Periodic table
- Perlin noise
- Permutation test
- Permutations
- Permutations by swapping
- Permutations with repetitions
- Permutations with some identical elements
- Permutations/Derangements
- Permutations/Rank of a permutation
- Permuted multiples
- Pernicious numbers
- Phrase reversals
- Pi
- Pick random element
- Pierpont primes
- Piprimes
- Pisano period
- Playing cards
- Plot coordinate pairs
- Pointers and references
- Poker hand analyser
- Polymorphism
- Polynomial derivative
- Polynomial long division
- Polynomial regression
- Polynomial synthetic division
- Population count
- Positive decimal integers with the digit 1 occurring exactly twice
- Power set
- Practical numbers
- Pragmatic directives
- Price fraction
- Price list behind API
- Primality by trial division
- Primality by Wilson's theorem
- Prime conspiracy
- Prime decomposition
- Prime numbers p for which the sum of primes less than or equal to p is prime
- Prime numbers which contain 123
- Prime numbers whose neighboring pairs are tetraprimes
- Prime reciprocal sum
- Prime triangle
- Prime triplets
- Prime words
- Primes - allocate descendants to their ancestors
- Primes which contain only one odd digit
- Primes whose first and last number is 3
- Primes whose sum of digits is 25
- Primes with digits in nondecreasing order
- Primes: n*2^m+1
- Primorial numbers
- Print debugging statement
- Print itself
- Priority queue
- Probabilistic choice
- Problem of Apollonius
- Product of divisors
- Product of min and max prime factors
- Program termination
- Proper divisors
- Pseudo-random numbers/Combined recursive generator MRG32k3a