Bibliography.recursive_islessFunction
recursive_isless(a::Entry, b::Entry, fields::Tuple{Symbol},
depth::Int = 0)

Helper function for sort_bibliography!.

This function allows recursive checking if a < b with descending importance. The importance set for the comparison is defined by the argument fields. This argument is a tuple consisting of symbols denoting the fields of the data type BibInternal.Entry. The ordering implies the importance.

The depth argument is purely for iterating/recursive purposes.

source
Bibliography.selectMethod
select(
bibliography::DataStructures.OrderedDict{String,Entry},
selection::Vector{String};
complementary::Bool = false
)

Select a part of a bibliography based on a given selection set of keys. If complementary is true, selection designates which entries will not be kept. By default, complementary is set to false.

source
Bibliography.sort_bibliography!Function
sort_bibliography!(
bibliography::DataStructures.OrderedDict{String,Entry},
sorting_rule::Symbol = :key
)

Sorts the bibliography in place.

The sorting order can be set by specifying the sorting_rule. The sorting is implemented via isless() functions. For detailed insight have a look at the isless() implementation of Julia and BibInternal.jl.

Supported symbols for sorting_rule are:

• :key (default): sort by bibliography keys e.g. BibTeX keys or :id
• the sorting rules defined in sorting_rules
Note:

The sorting is not following explicitly bibliographic alphabetizing conventions. It follows standard comparator behaviour implied by the implemented isless() functions (string comparators).

source
Bibliography.xnamesFunction
xnames(entry, editors = false; names = :full)

Format the name of an Entry for web export.

Arguments:

• entry: an entry
• editors: true if the name describes editors
• names: :full (full names) or :last (last names + first name abbreviation)
source