Skip site navigation (1)Skip section navigation (2)

FreeBSD Manual Pages

  
 
  

home | help
"glEdgeFlag(3), glEdgeFlagv(3)
flag edges as either boundary or nonboundary
XkbFreeKeyboard(3)
Destroys either an entire XkbDescRec or just some of its members
byobu(1)
wrapper script for seeding a user's byobu configuration and launching a text based window manager (either screen or tmux)
claref(l), CLAREF(l)
applie one or several Householder reflectors of size 3 to one or two matrices (if column is specified) on either their rows or columns
co(1)
Copyright [co] 2004-2014 Free Software Foundation, Inc. This file is part of the gdiffmk utility, which is part of groff, a free software project. You can redistribute and/or modify gdiffmk under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. gdiffmk is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see <http://www.gnu.org/licenses/>. . au This document was written and is maintained by MBianchi@Foveal.com Mike Bianchi
dlaref(l), DLAREF(l)
applie one or several Householder reflectors of size 3 to one or two matrices (if column is specified) on either their rows or columns
extconv(1)
convert a TeX document in either Big 5+ or GBK encoding into `preprocessed' form
invert_raw_image(1)
invert 2D image along either or both axes
load_grx_or_bios_font(3)
Loads either a BIOS or GRX format font. Allegro game programming library
pcgecon(l), PCGECON(l)
estimate the reciprocal of the condition number of a general distributed complex matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm, using the LU factorization computed by PCGETRF
pclapiv(l), PCLAPIV(l)
applie either P (permutation matrix indicated by IPIV) or inv( P ) to a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting
pclapv2(l), PCLAPV2(l)
applie either P (permutation matrix indicated by IPIV) or inv( P ) to a M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting
pclarf(l), PCLARF(l)
applie a complex elementary reflector Q to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
pclarz(l), PCLARZ(l)
applie a complex elementary reflector Q to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
pctrcon(l), PCTRCON(l)
estimate the reciprocal of the condition number of a triangular distributed matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm
pdgecon(l), PDGECON(l)
estimate the reciprocal of the condition number of a general distributed real matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm, using the LU factorization computed by PDGETRF
pdlapiv(l), PDLAPIV(l)
applie either P (permutation matrix indicated by IPIV) or inv( P ) to a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting
pdlapv2(l), PDLAPV2(l)
applie either P (permutation matrix indicated by IPIV) or inv( P ) to a M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting
pdlarf(l), PDLARF(l)
applie a real elementary reflector Q (or Q**T) to a real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
pdlarz(l), PDLARZ(l)
applie a real elementary reflector Q (or Q**T) to a real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
pdtrcon(l), PDTRCON(l)
estimate the reciprocal of the condition number of a triangular distributed matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm
psgecon(l), PSGECON(l)
estimate the reciprocal of the condition number of a general distributed real matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm, using the LU factorization computed by PSGETRF
pslapiv(l), PSLAPIV(l)
applie either P (permutation matrix indicated by IPIV) or inv( P ) to a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting
pslapv2(l), PSLAPV2(l)
applie either P (permutation matrix indicated by IPIV) or inv( P ) to a M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting
pslarf(l), PSLARF(l)
applie a real elementary reflector Q (or Q**T) to a real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
pslarz(l), PSLARZ(l)
applie a real elementary reflector Q (or Q**T) to a real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
pssyntrd(l), PSSYNTRD(l)
i a prototype version of PSSYTRD which uses tailored codes (either the serial, SSYTRD, or the parallel code, PSSYTTRD) when the workspace provided by the user is adequate
pstrcon(l), PSTRCON(l)
estimate the reciprocal of the condition number of a triangular distributed matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm
pzgecon(l), PZGECON(l)
estimate the reciprocal of the condition number of a general distributed complex matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm, using the LU factorization computed by PZGETRF
pzlapiv(l), PZLAPIV(l)
applie either P (permutation matrix indicated by IPIV) or inv( P ) to a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting
pzlapv2(l), PZLAPV2(l)
applie either P (permutation matrix indicated by IPIV) or inv( P ) to a M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting
pzlarf(l), PZLARF(l)
applie a complex elementary reflector Q to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
pzlarz(l), PZLARZ(l)
applie a complex elementary reflector Q to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
pztrcon(l), PZTRCON(l)
estimate the reciprocal of the condition number of a triangular distributed matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm
sc_BcastState(3), sc::BcastState(3)
This creates and forwards/retrieves data from either a BcastStateRecv or a BcastStateSend depending on the value of the argument to constructor
sc_DistShellPair(3), sc::DistShellPair(3)
Distributes shell pairs either statically or dynamically
slaref(l), SLAREF(l)
applie one or several Householder reflectors of size 3 to one or two matrices (if column is specified) on either their rows or columns
uncat(1)
continuously reads stdin, splits up the data either by timeout or number of bytes read to process it
zlaref(l), ZLAREF(l)
applie one or several Householder reflectors of size 3 to one or two matrices (if column is specified) on either their rows or columns
Bio::Tools::Run::Phylo::Phylip::Neighbor(3)
Wrapper for the phylip program neighbor by Joseph Felsenstein for creating a phylogenetic tree(either through Neighbor or UPGMA) based on protein distances based on amino substitution rate. 14 Nov 2002 Shawn Works with Phylip version 3.6
Font::TTF::Mort::Chain(3)
Chain Mort subtable for AAT n .SS "$t->new" .SS "$t->new" Subsection "$t->new" n .SS "$t->read($fh)" .SS "$t->read($fh)" Subsection "$t->read($fh)" Reads the chain into memory n .SS "$t->out($fh)" .SS "$t->out($fh)" Subsection "$t->out($fh)" Writes the table to a file either from memory or by copying n .SS "$t->print($fh)" .SS "$t->print($fh)" Subsection "$t->print($fh)" Prints a human-readable representation of the chain
HTML::TableExtract(3)
Perl module for extracting the content contained in tables within an HTML document, either as text or encoded element trees
Jifty::Web::Form::Clickable(3)
Some item that can be clicked on -- either a button or a link
Net::SSLGlue::Socket(3)
socket which can be either SSL or plain IP (IPv4/IPv6)
OpenXPKI::Server::Workflow::Condition::KeyGenerationMode(3)
Check if the profile allows key generation as specified by the "generate" parameter. Example: can_use_server_key: class: OpenXPKI::Server::Workflow::Condition::KeyGenerationMode param: generate: server _map_profile: $cert_profile Returns true if the key generation setting is either escrow, server or both. The setting is obtained for the given profile (by profile or from the default setting) from the node key.generate. If this node is missing, client is allowed and server is assumed ok if key.alg is not empty. If the profile parameter is not given in the configuration, the context value of cert_profile is used
PDF::API3::Compat::API2::Basic::TTF::Mort::Chain(3)
n .SS "$t->new" .SS "$t->new" Subsection "$t->new" n .SS "$t->read($fh)" .SS "$t->read($fh)" Subsection "$t->read($fh)" Reads the chain into memory n .SS "$t->out($fh)" .SS "$t->out($fh)" Subsection "$t->out($fh)" Writes the table to a file either from memory or by copying n .SS "$t->print($fh)" .SS "$t->print($fh)" Subsection "$t->print($fh)" Prints a human-readable representation of the chain
Tenjin::Template(3)
A Tenjin template object, either built from a file or from memory
Text::Context::EitherSide(3)
Get n words either side of search keywords
ZConf(3)
A configuration system allowing for either file or LDAP backed storage
ZConf::backends::file(3)
A configuration system allowing for either file or LDAP backed storage
orte-dvm(1), ompi_dvm(1)
Establish a Distributed Virtual Machine (DVM). Note: orte-dvm and ompi-dvm are synonyms for each other. Using either of the names will produce the same behavior
orte-submit(1), ompi-submit(1)
Execute serial and parallel jobs in Open MPI using a DVM. Note: ompi-submit and orte-submit are synonyms for each other. Using either of the names will produce the same behavior
redraw_vlist(nged)
Given the name(s) of database objects, regenerate the vlist associated with every shape in view that references the named object(s), either shapes or regions
home | help