Skip to content

Commit

Permalink
Merge pull request #478 from mbertucci47/typo
Browse files Browse the repository at this point in the history
fix small typos
  • Loading branch information
plk authored Jun 9, 2024
2 parents 8743daa + 5f85a86 commit 7219040
Show file tree
Hide file tree
Showing 26 changed files with 51 additions and 51 deletions.
2 changes: 1 addition & 1 deletion bin/biber
Original file line number Diff line number Diff line change
Expand Up @@ -696,7 +696,7 @@ be obtained with the B<--show-tmp-dir> option.
=item B<--noxname>
Disable exended name processing in bibtex data sources. Can be useful if
Disable extended name processing in bibtex data sources. Can be useful if
you don't use this and it causes problems due to auto-detection of extended
name format.
Expand Down
6 changes: 3 additions & 3 deletions data/bcf.xsl
Original file line number Diff line number Diff line change
Expand Up @@ -636,7 +636,7 @@
<div class="key"><u>Key</u>
<ul>
<li><b>Heading key</b>: Label parts are concatenated together in part order shown</li>
<li><b>Labelpart key</b>: <span class="la_final">Final label, no more parts are considered</span>. &quot;namecount=n<xsl:text disable-output-escaping="yes">&amp;rarr;</xsl:text><span class="la_fieldkey">field</span>&quot; - conditional name <span class="la_fieldkey">field</span>part, only used if there as many names as specified by the range n. Substring specification: &quot;<span class="la_substring">&gt;&gt;&gt;</span><span class="la_fieldkey">field</span>&quot; = use three chars from left side of field. &quot;<span class="la_fieldkey">field</span><span class="la_substring">&lt;&lt;</span>&quot; = use two chars from right side of field. &quot;<span class="la_fieldkey">field</span><span class="la_substring">v/n</span>&quot; = variable-width substring, max n chars. &quot;<span class="la_fieldkey">field</span><span class="la_substring">vf/n</span>&quot; = variable-width substring fixed to same length as longest string occuring at least n times. &quot;<span class="la_fieldkey">field</span><span class="la_substring">l</span>&quot; = list scope disambiguation where the label as a whole is unique, not necessarily the individual parts. &quot;<span class="la_fieldkey">field</span><span class="la_names">&quot;=range</span>=only use the names in the specified range to form the labelpart. &quot;<span class="la_fieldkey">field</span><span class="la_namessep">(string)</span>&quot;=use string as separator between all names. <span class="la_final"><xsl:text disable-output-escaping="yes">&amp;otimes;</xsl:text></span> = supress alphaothers</li>
<li><b>Labelpart key</b>: <span class="la_final">Final label, no more parts are considered</span>. &quot;namecount=n<xsl:text disable-output-escaping="yes">&amp;rarr;</xsl:text><span class="la_fieldkey">field</span>&quot; - conditional name <span class="la_fieldkey">field</span>part, only used if there as many names as specified by the range n. Substring specification: &quot;<span class="la_substring">&gt;&gt;&gt;</span><span class="la_fieldkey">field</span>&quot; = use three chars from left side of field. &quot;<span class="la_fieldkey">field</span><span class="la_substring">&lt;&lt;</span>&quot; = use two chars from right side of field. &quot;<span class="la_fieldkey">field</span><span class="la_substring">v/n</span>&quot; = variable-width substring, max n chars. &quot;<span class="la_fieldkey">field</span><span class="la_substring">vf/n</span>&quot; = variable-width substring fixed to same length as longest string occurring at least n times. &quot;<span class="la_fieldkey">field</span><span class="la_substring">l</span>&quot; = list scope disambiguation where the label as a whole is unique, not necessarily the individual parts. &quot;<span class="la_fieldkey">field</span><span class="la_names">&quot;=range</span>=only use the names in the specified range to form the labelpart. &quot;<span class="la_fieldkey">field</span><span class="la_namessep">(string)</span>&quot;=use string as separator between all names. <span class="la_final"><xsl:text disable-output-escaping="yes">&amp;otimes;</xsl:text></span> = suppress alphaothers</li>
</ul>
</div>
</xsl:if>
Expand Down Expand Up @@ -1032,7 +1032,7 @@
<xsl:for-each select="/bcf:controlfile/bcf:datamodel/bcf:entrytypes/bcf:entrytype">
<tr>
<td><xsl:value-of select="./text()"/></td>
<!-- Save a varible pointing to the entrytype node -->
<!-- Save a variable pointing to the entrytype node -->
<xsl:variable name="entrynode" select="current()"/>
<!-- Fields which are valid for this entrytype -->
<td>
Expand Down Expand Up @@ -1258,7 +1258,7 @@
</tbody>
</table>
<xsl:for-each select="/bcf:controlfile/bcf:section[@number != '0']">
<!-- Save a varible pointing to the section number -->
<!-- Save a variable pointing to the section number -->
<xsl:variable name="secnum" select="./@number"/>
<h4>Section <xsl:value-of select="$secnum"/></h4>
<table>
Expand Down
2 changes: 1 addition & 1 deletion data/schemata/bcf.rnc
Original file line number Diff line number Diff line change
Expand Up @@ -121,7 +121,7 @@ start =
# the option into on reading it
attribute backendin {xsd:string}?,
# Applies to ENTRY, NAMELIST and NAME scope
# Determines whether biber will write the option to its ouput (e.g.
# Determines whether biber will write the option to its output (e.g.
# .bbl) because biblatex needs to know the value.
attribute backendout {xsd:boolean}?,
xsd:string
Expand Down
2 changes: 1 addition & 1 deletion data/schemata/bcf.rng
Original file line number Diff line number Diff line change
Expand Up @@ -242,7 +242,7 @@
<optional>
<!--
Applies to ENTRY, NAMELIST and NAME scope
Determines whether biber will write the option to its ouput (e.g.
Determines whether biber will write the option to its output (e.g.
.bbl) because biblatex needs to know the value.
-->
<attribute name="backendout">
Expand Down
2 changes: 1 addition & 1 deletion data/schemata/config.rnc
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@ start =
# the option into on reading it
attribute backendin {xsd:string}?,
# Applies to ENTRY, NAMELIST and NAME scope
# Determines whether biber will write the option to its ouput (e.g.
# Determines whether biber will write the option to its output (e.g.
# .bbl) because biblatex needs to know the value.
attribute backendout {xsd:boolean}?,
xsd:string
Expand Down
2 changes: 1 addition & 1 deletion data/schemata/config.rng
Original file line number Diff line number Diff line change
Expand Up @@ -38,7 +38,7 @@
<optional>
<!--
Applies to ENTRY, NAMELIST and NAME scope
Determines whether biber will write the option to its ouput (e.g.
Determines whether biber will write the option to its output (e.g.
.bbl) because biblatex needs to know the value.
-->
<attribute name="backendout">
Expand Down
8 changes: 4 additions & 4 deletions doc/biber.tex
Original file line number Diff line number Diff line change
Expand Up @@ -98,7 +98,7 @@ \section{Important Changes}\label{special}
things like incompatible changes which users should be aware of.

\minisec{2.15}
The BBLXML output format is deprected and will be removed in version 4. It
The BBLXML output format is deprecated and will be removed in version 4. It
is rarely used and is not worth the overhead of test complications.

Datamodel override via the user configuration file has been made more
Expand Down Expand Up @@ -2431,7 +2431,7 @@ \subsection{The Data Model}\label{ref:datamodel}
datamodel changes in XML in the \biber config file. This is a matter of
choice and/or convenience since the datamodel \TeX\ macro interface simply
results in XML definitions in the \opt{.bcf} anyway and these latter are
overriden by the XML definitions in the \biber config file. For example, to
overridden by the XML definitions in the \biber config file. For example, to
add a new name list field \bibfield{DIRECTOR} to \bibfield{VIDEO} entry
types, you can either use the \biblatex macros \cmd{DeclareDatamodelFields}
and \cmd{DeclareDatamodelEntryfields} in your document or put the following
Expand Down Expand Up @@ -2463,7 +2463,7 @@ \subsection{Tool Mode}\label{ref:tool}
defaulting to a \bibtex file called «\file{<datasource>\_bibertool.bib}» if
the options \opt{--output-file} and \opt{--output-format} are not specified.

Tool mode is useful if you need to programatically change your datasource
Tool mode is useful if you need to programmatically change your datasource
using the semantics provided by \biber or if you would like to convert your
data to a different format. For example, you could choose to reencode your
datasource by turning all UTF-8 characters into \latex\ macros:
Expand Down Expand Up @@ -2718,7 +2718,7 @@ \subsection{Tool Mode}\label{ref:tool}
\end{itemize}

Tool mode can also be used to convert between datasource
formats. For example, if you wish to covert a \bibtex format data file to
formats. For example, if you wish to convert a \bibtex format data file to
the experimental \texttt{biblatexml} XML format, you can do:

\begin{verbatim}
Expand Down
4 changes: 2 additions & 2 deletions etc/definitions.bib
Original file line number Diff line number Diff line change
Expand Up @@ -43,7 +43,7 @@ @string{fundmath
@string{gc = "Graphs and Combinatorics"}
@string{ic = "Information and Control"}
@string{ic2 = "Information and Computation"}
@string{ietc = "IEEE Transations on Computers"}
@string{ietc = "IEEE Transactions on Computers"}
@string{ieeetc = "IEEE Transactions on Computers"}
@string{ieeetcs = "IEEE Transactions on Circuits and Systems"}
@string{ieeetct = "IEEE Transactions on Circuit Theory"}
Expand Down Expand Up @@ -546,7 +546,7 @@ @string{wg07
@string{wg08 = "Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2008"}
@string{wg09 = "Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2009"}

% Stings for the names of Springer LNCS proceedings
% Strings for the names of Springer LNCS proceedings
@string{lncs52 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 52"}
@string{lncs172 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 172"}
Expand Down
24 changes: 12 additions & 12 deletions etc/papers.bib
Original file line number Diff line number Diff line change
Expand Up @@ -196,7 +196,7 @@ @incollection{AgrawalKR93
title = {Cutting down on fill using nested dissection: provably good elimination orderings},
booktitle = {Graph Theory and Sparse Matrix Computation},
editor = {A. George and J. Gilbert and J. W. H. Liu},
series = {IMA Volumes in Mathematics and its Applicatins},
series = {IMA Volumes in Mathematics and its Applications},
publisher = {Springer-Verlag}, year = 1993, volume = 56, pages = {31-55}}

%Ah
Expand Down Expand Up @@ -1085,7 +1085,7 @@ @inproceedings{BerryBC99
author = {A. Berry and J.-P. Bordat and O. Cogis},
title = {Generating all the minimal separators of a graph},
editor = {Peter Widmayer and Gabriele Neyer and Sephan Eidenbenz},
booktitle = wg99, publsiher = lncs1665, year = 1999, pages = {167-172}}
booktitle = wg99, publisher = lncs1665, year = 1999, pages = {167-172}}

%Berry 2000
Expand Down Expand Up @@ -2906,7 +2906,7 @@ @inproceedings{CanoM94
title = {Heuristic algorithms for the triangulation of graphs},
editor = {B. Bouchon-Meunier and R. R. Yager and I. A. Zadeh},
booktitle = {Advances in Intelligent Computing, Selected Papers from the 5th
International Conference on Precessing and Management of Uncertainty in
International Conference on Processing and Management of Uncertainty in
Knowledge-Based Systems IPMU94},
year = 1994, pages = {98-107},
publisher = lncs945}
Expand Down Expand Up @@ -4778,7 +4778,7 @@ @article{Djelloul09
@article{Djidjev82,
author = {Hristo N. Djidjev},
title = {On the problem of partititioning planar graphs},
title = {On the problem of partitioning planar graphs},
journal = sjadm, volume = 3, year = 1982, pages = {229-240}}

@inproceedings{Djidjev88,
Expand Down Expand Up @@ -5038,7 +5038,7 @@ @article{DowneyM07
@article{DowneyFMR08,
author = {Rodney G. Downey and Michael R. Fellows and Catherine McCartin and Frances A. Rosamond},
title = {Paramterized approximation of dominating set problems},
title = {Parameterized approximation of dominating set problems},
journal = ipl, volume = 109, year = 2008, pages = {68-70}}

%Dr
Expand Down Expand Up @@ -5975,7 +5975,7 @@ @article{FernandezBacaM93
@article{FernandezBacaS94,
author = {David Fern\'{a}ndez-Baca and Giora Slutzki},
title = {Parametic Problems on Graphs of Bounded Treewidth},
title = {Parametric Problems on Graphs of Bounded Treewidth},
journal = ja, volume = 16, pages = {408-430}, year = 1994}

@inproceedings{FernandezBacaS94a,
Expand Down Expand Up @@ -6240,7 +6240,7 @@ @article{FominG00
@techreport{FominT02,
author = {F. V. Fomin and D. M. Thilikos},
title = {New upper bounds on the decomposability of planar graphs and fixed
paramater algorithms},
parameter algorithms},
year = 2002,
institution = {Universitat Polit\`ecnica de Catalunya},
number = {LSI-02-56-R},
Expand Down Expand Up @@ -6486,7 +6486,7 @@ @inproceedings{FortnowS08
author = {Lance Fortnow and Rahul Santhanam},
title = {Infeasibility of instance compression and succinct {PCPs} for {NP}},
booktitle = stoc08, year = 2008, pages = {133-142},
publisher = {ACM Press}, addres = {New York}}
publisher = {ACM Press}, address = {New York}}

@article{FortuneHW80,
author = {S. Fortune and J. E. Hopcroft and J. Wyllie},
Expand Down Expand Up @@ -8333,7 +8333,7 @@ @article{HeggernesL06
@inproceedings{HeggernesV06,
author = {Pinar Heggernes and Yngve Villanger},
title = {Simple and efficient modifications of elimination orderings},
booktitle = {Proceedings of the 7th International Conference on Appied Parallel Computing, PARA 2004},
booktitle = {Proceedings of the 7th International Conference on Applied Parallel Computing, PARA 2004},
year = 2006, publisher = lncs3732, pages = {788-797}}

%Heggernes 2008
Expand Down Expand Up @@ -9517,7 +9517,7 @@ @article{Kierstead00

@article{KiersteadT01,
author = {H. A. Kierstead and W. T. Trotter},
title = {Competive colorings of oriented graphs},
title = {Competitive colorings of oriented graphs},
journal = ejc, volume = 8, number = 2, year = 2001, pages={R12}}

%Kik
Expand Down Expand Up @@ -11549,7 +11549,7 @@ @inproceedings{Moehring90
author = {Rolf H. M{\"{o}}hring},
title = {Graph Problems Related to Gate Matrix Layout and {PLA}
Folding},
booktitle = {Computational Graph Theory, Comuting Suppl. 7},
booktitle = {Computational Graph Theory, Computing Suppl. 7},
editor = {E. Mayr and H. Noltemeier and M. Sys{\l}o},
publisher = {Springer Verlag}, pages = {17-51}, year = 1990}

Expand Down Expand Up @@ -12283,7 +12283,7 @@ @article{PawagiGR87
@book{Pearl88,
author = {J. Pearl},
title = {Probablistic Reasoning in Intelligent Systems: Networks of Plausible
title = {Probabilistic Reasoning in Intelligent Systems: Networks of Plausible
Inference},
publisher = {Morgan Kaufmann}, year = 1988, address = {Palo Alto}}

Expand Down
2 changes: 1 addition & 1 deletion etc/tugboat.bib
Original file line number Diff line number Diff line change
Expand Up @@ -13031,7 +13031,7 @@ @Article{Anonymous:TB8-2-219
journal-URL = "http://www.tug.org/TUGboat/",
}

@Article{Anonymou:TB8-2-220,
@Article{Anonymous:TB8-2-220,
author = "Anonymous",
title = "{PROTEXT IV, Boston, Mass., 22--24 October 1987}",
journal = j-TUGboat,
Expand Down
4 changes: 2 additions & 2 deletions lib/Biber.pm
Original file line number Diff line number Diff line change
Expand Up @@ -859,7 +859,7 @@ sub parse_ctrlfile {
}
Biber::Config->setblxoption(undef, 'sortingtemplate', $sortingtemplates);

# DATAMODEL schema (always global and is an array to accomodate multiple
# DATAMODEL schema (always global and is an array to accommodate multiple
# datamodels in tool mode)

# Because in tests, parse_ctrlfile() is called several times so we need to sanitise this here
Expand Down Expand Up @@ -4845,7 +4845,7 @@ sub get_dependents {
get_dependents($self, $new_deps, $keyswithdeps) if $new_deps->@*;

# Now remove any missing entries from various places in all entries we have flagged
# as having dependendents. If we don't do this, many things fail later like clone creation
# as having dependents. If we don't do this, many things fail later like clone creation
# for related entries etc.
foreach my $keywithdeps ($keyswithdeps->@*) {
foreach my $missing_key ($missing->@*) {
Expand Down
2 changes: 1 addition & 1 deletion lib/Biber/Config.pm
Original file line number Diff line number Diff line change
Expand Up @@ -161,7 +161,7 @@ sub _initopts {
# Command-line overrides everything else
foreach my $copt (keys $opts->%*) {
# This is a tricky option as we need to keep non-overriden defaults
# If we don't we can get errors when contructing the sorting call to eval() later
# If we don't we can get errors when constructing the sorting call to eval() later
if (lc($copt) eq 'collate_options') {
my $collopts = Biber::Config->getoption('collate_options');
my $copt_h = eval "{ $opts->{$copt} }" or croak('Bad command-line collation options');
Expand Down
4 changes: 2 additions & 2 deletions lib/Biber/DataModel.pm
Original file line number Diff line number Diff line change
Expand Up @@ -721,7 +721,7 @@ sub field_is_skipout {
=head2 check_mandatory_constraints
Checks constraints of type "mandatory" on entry and
returns an arry of warnings, if any
returns an array of warnings, if any
=cut

Expand Down Expand Up @@ -786,7 +786,7 @@ sub check_mandatory_constraints {
=head2 check_conditional_constraints
Checks constraints of type "conditional" on entry and
returns an arry of warnings, if any
returns an array of warnings, if any
=cut

Expand Down
2 changes: 1 addition & 1 deletion lib/Biber/Entry/Name.pm
Original file line number Diff line number Diff line change
Expand Up @@ -173,7 +173,7 @@ sub get_hashid {

sub get_namepart {
my ($self, $namepart) = @_;
# prevent warnings when concating arbitrary nameparts
# prevent warnings when concatenating arbitrary nameparts
return $self->{nameparts}{$namepart}{string} || '';
}

Expand Down
2 changes: 1 addition & 1 deletion lib/Biber/Input/file/biblatexml.pm
Original file line number Diff line number Diff line change
Expand Up @@ -1438,7 +1438,7 @@ sub _changenode {
# set attribute value
if ($n->nodeType == XML_ATTRIBUTE_NODE) {
if ($nodeval) {
$$error = "Tried to replace '$xp_target_s' Atribute node with complex data";
$$error = "Tried to replace '$xp_target_s' Attribute node with complex data";
return 0;
}
$n->setValue(NFC($value));
Expand Down
4 changes: 2 additions & 2 deletions lib/Biber/Input/file/bibtex.pm
Original file line number Diff line number Diff line change
Expand Up @@ -152,7 +152,7 @@ sub extract_entries {
}

# Text::BibTeX can't be controlled by Log4perl so we have to do something clumsy
# We can't redirect STDERR to a variable as libbtparse doesnt' use PerlIO, just stdio
# We can't redirect STDERR to a variable as libbtparse doesn't use PerlIO, just stdio
# so it doesn't understand this. It does understand normal file redirection though as
# that's standard stdio.
# The Log4Perl setup outputs only to STDOUT so redirecting all STDERR like this is
Expand Down Expand Up @@ -1924,7 +1924,7 @@ sub parsename_x {
# Generate any stripped information
(my $s, $namec{$np}) = remove_outer($namec{$np});

# Protect spaces inside {} when splitting to produce intials
# Protect spaces inside {} when splitting to produce initials
my $part = $namec{$np};
if ($s) {
$part = $namec{$np} =~ s/\s+/_/gr;
Expand Down
6 changes: 3 additions & 3 deletions lib/Biber/Internals.pm
Original file line number Diff line number Diff line change
Expand Up @@ -772,7 +772,7 @@ sub _process_label_attributes {
}

# Now set a new global index for the name part index which is the maximum of those
# occuring above a certain threshold
# occurring above a certain threshold
foreach my $s (keys %$lcache) {
foreach my $ind (keys %$is) {
next unless $indices{$s} == $ind;
Expand Down Expand Up @@ -1322,7 +1322,7 @@ sub _sort_citeorder {
return $ko || $biborder;
}
}
# otherwise, we need to take account of citations with simulataneous order like
# otherwise, we need to take account of citations with simultaneous order like
# \cite{key1, key2} so this tied sorting order can be further sorted with other fields
# Note the fallback of '' - this is for auto-generated entries which are not cited
# and so never have a keyorder entry
Expand Down Expand Up @@ -1731,7 +1731,7 @@ sub _liststring {

# These should be symbols which can't appear in lists and which sort before all alphanum
# so that "Alan Smith" sorts after "Al Smith". This means, symbols which normalise_string_sort()
# strips out. Unfortuately, this means using punctuation and these are by default variable
# strips out. Unfortunately, this means using punctuation and these are by default variable
# weight and ignorable in DUCET so we have to redefine these these symbols after loading DUCET
# when sorting so that they are non-ignorable (see Biber.pm)
my $lsi = '!'; # list separator, internal
Expand Down
2 changes: 1 addition & 1 deletion lib/Biber/LaTeX/Recode.pm
Original file line number Diff line number Diff line change
Expand Up @@ -249,7 +249,7 @@ sub latex_decode {

# Hacky - specially protect {\X} which is a simple protection as in
# TITLE = {Part {I}}
# Can't do this using the seperators above as these are stripping around \X
# Can't do this using the separators above as these are stripping around \X
# later to avoid breaking capitliastion/kerning with spurious introduced/retained
# braces
# Using the VLB method from the link below, this is equivalent to:
Expand Down
2 changes: 1 addition & 1 deletion lib/Biber/Output/base.pm
Original file line number Diff line number Diff line change
Expand Up @@ -362,7 +362,7 @@ sub create_output_section {
my $secnum = $Biber::MASTER->get_current_section;
my $section = $Biber::MASTER->sections->get_section($secnum);

# We rely on the order of this array for the order of the ouput
# We rely on the order of this array for the order of the output
foreach my $k ($section->get_citekeys) {
# Regular entry
my $be = $section->bibentry($k) or biber_error("Cannot find entry with key '$k' to output");
Expand Down
Loading

0 comments on commit 7219040

Please sign in to comment.