Feed Item Query Language (FIQL) is a simple, URI-friendly query language for filtering entries of web feeds.
This module provides the utility to generate valid FIQL query strings by using a JSON objects or the custom classes provided.
$ npm install fiql-query-builderFIQL query strings can be produced by supplying a JSON object, or using the Node classes provided.
// var json = ...;
// Using require()
var fiqlQueryBuilder = require('fiql-query-builder');
fiqlQueryBuilder.convertFromJson(json);
// Using ES6 import
import { convertFromJson } from 'fiql-query-builder';
convertFromJson(json);| Object Key | Children | Description |
|---|---|---|
| custom_operator |
|
Define a custom basic operator |
| equals |
|
Produces an equality operator (==) |
| not_equals |
|
Produces an inequality operator (!=) |
| less_than |
|
Produces an less than operator (=lt=) |
| less_than_or_equal |
|
Produces an less than or equal operator (=le=) |
| greater_than |
|
Produces an greater operator (=gt=) |
| greater_than_or_equal |
|
Produces an greater than or equal operator (=ge=) |
| in |
|
Produces an in operator (in) |
| out |
|
Produces an out operator (out) |
| Object Key | Children | Description |
|---|---|---|
| custom_expression |
|
Define a custom boolean expression |
| and |
|
Combines child array with an and operator (;) |
| or |
|
Combines child array with an or operator (,) |
| Object Key | Children | Description |
|---|---|---|
| group |
|
Wraps an expression in parentheses |
// var node = ...
// Using require()
var fiqlQueryBuilder = require('fiql-query-builder');
fiqlQueryBuilder.convertFromNode(node);
// Using ES6 import
import { convertFromNode, EqNode, AndNode, OpNode } from 'fiql-query-builder';
convertFromNode(node);The query param is built by traversing the object tree recursively, so a LeafNode is used to represent a primitive value.
| Param | Type | Description |
|---|---|---|
| value | string |
The string value |
A generic operator
| Param | Type | Description |
|---|---|---|
| selector | LeafNode |
The left-hand side of the operator |
| operator | string |
The custom operator |
| args | GroupNode | LeafNode | ExpNode | OpNode |
The child node for operator (right-hand side) |
Standard operator classes have been provided, and can be instantiated using ClassName(selector, args).
- Equality (
==) :EqNode - Inequality (
!=) :NeqNode - Less than (
=lt=) :LtNode - Less than or equal to (
=le=) :LeNode - Greater than (
=gt=) :GtNode - Greater than or equals to (
=ge=) :GeNode - In (
=in=) :InNode - Not in (
=out=) :NotInNode
A generic boolean expression
| Param | Type | Description |
|---|---|---|
| operator | string |
The custom operator |
| children | Node[] |
The child nodes for the expression |
Standard boolean expression classes have been provided, and can be instantiated using ClassName(children).
- And (
;) :AndNode - Or (
,) :OrNode
Used to wrap parentheses around a boolean expression.
| Param | Type | Description |
|---|---|---|
| exp | ExpNode |
The boolean expression to wrap parentheses around |
var eqJson = convertFromJson({
equals : {
selector: 'foo',
args: 'bar'
}
});
// eqJson = foo==barvar customOperatorJson = convertFromJson({
custom_operator : {
operator: '¬',
selector: 'foo',
args: 'bar'
}
});
// customOperatorJson equals: foo¬bar var andJson = convertFromJson({
and : [
{
equals: {
selector: 'foo',
args: 'bar'
}
},
{
not_equals: {
selector: 'baz',
args: 'qux'
}
}
]
});
// andJson equals: foo==bar;baz!=quxvar customExpressionJson = convertFromJson({
custom_expression : {
operator: '*',
children: [
{
equals: {
selector: 'foo',
args: 'bar'
}
},
{
not_equals: {
selector: 'baz',
args: 'qux'
}
}
]
}
});
// customExpressionJson equals: foo==bar*baz!=quxvar groupJson = convertFromJson({
equals : {
selector: 'k',
args: {
group : {
and : [
{
less_than: {
selector: 'foo',
args: 'bar'
}
},
{
not_equals: {
selector: 'baz',
args: 'qux'
}
}
]
}
}
}
});
// groupJson equals: k==(foo=lt=bar,baz!=qux)var eqNode = convertFromNode(
new EqNode(
new LeafNode('foo'),
new LeafNode('bar')
)
);
// eqNode = foo==barvar customOperatorNode = convertFromNode(
new OpNode(
new LeafNode('foo'),
'¬',
new LeafNode('bar')
)
);
// customOperatorNode equals: foo¬bar var andNode = convertFromNode(
new AndNode([
new EqNode(
new LeafNode('foo'),
new LeafNode('bar')
),
new NeqNode(
new LeafNode('baz'),
new LeafNode('qux')
)
])
);
// andNode equals: foo==bar;baz!=quxvar customExpressionNode = convertFromNode(
new ExpNode('*', [
new EqNode('foo', 'bar'),
new NeqNode('baz', 'qux')
])
);
// customExpressionNode equals: foo==bar*baz!=quxvar groupNode = convertFromNode(
new EqNode(
new LeafNode('k'),
new GroupNode(
new AndNode([
new LtNode(
new LeafNode('foo'),
new LeafNode('bar')
),
new NeqNode(
new LeafNode('baz'),
new LeafNode('qux')
)
])
)
)
);
// groupNode equals: k==(foo=lt=bar,baz!=qux)This project is licensed under MIT License