| (++) [Pretty] |
Concatenates two documents.
|
A | |
| addAttribute [Cil] |
Add an attribute.
|
| addAttributes [Cil] |
Add a list of attributes.
|
| addOffset [Cil] | addOffset o1 o2 adds o1 to the end of o2 .
|
| addOffsetLval [Cil] |
Add an offset at the end of an lvalue.
|
| additiveLevel [Cil] | |
| addrOfLevel [Cil] | |
| align [Pretty] |
Mark the current column as the current indentation level.
|
| alignOf_int [Cil] |
The minimum alignment (in bytes) for a type.
|
| allStmts [Cfg] |
Return all statements in a file - valid after computeFileCfg only
|
| append [Clist] |
Append two clists
|
| argsToList [Cil] |
Obtain the argument list ([] if None)
|
| arrowLevel [Cil] | |
| attributeHash [Cil] |
This table contains the mapping of predefined attributes to classes.
|
| auto_printer [Pretty] |
A function that when used at top-level in a module will direct
the pa_prtype module generate automatically the printing functions for a
type
|
B | |
| bitsOffset [Cil] |
Give a type of a base and an offset, returns the number of bits from the
base address and the width (also expressed in bits) for the subobject
denoted by the offset.
|
| bitsSizeOf [Cil] |
The size of a type, in bits.
|
| bitwiseLevel [Cil] | |
| blueEscStr [Errormsg] | |
| break [Pretty] |
A document that consists of either a space or a line break.
|
| bug [Cil] |
Like
Errormsg.bug except that Cil.currentLoc is also printed
|
| bug [Errormsg] |
Similar to
error except that its output has the form Bug: ...
|
| builtinFunctions [Cil] |
A list of the built-in functions for the current compiler (GCC or
MSVC, depending on
!msvcMode ).
|
| builtinLoc [Cil] |
This is used as the location of the prototypes of builtin functions.
|
| bytesSizeOfInt [Cil] |
The size in bytes of the given int kind.
|
C | |
| cExp [Formatcil] |
Constructs an expression based on the program and the list of arguments.
|
| cInstr [Formatcil] |
Constructs an instruction based on the program and the list of arguments.
|
| cLval [Formatcil] |
Constructs an lval based on the program and the list of arguments.
|
| cStmt [Formatcil] | |
| cStmts [Formatcil] |
Constructs a list of statements
|
| cType [Formatcil] |
Constructs a type based on the program and the list of arguments.
|
| cfgFun [Cfg] |
Compute a control flow graph for fd.
|
| charConstPtrType [Cil] |
char const *
|
| charConstToInt [Cil] |
Given the character c in a (CChr c), sign-extend it to 32 bits.
|
| charPtrType [Cil] |
char *
|
| charType [Cil] |
char
|
| char_is_unsigned [Cil] |
Whether "char" is unsigned.
|
| checkBeforeAppend [Clist] |
A useful check to assert before an append.
|
| children [Dominators] |
Return a list of statements dominated by the argument
|
| chr [Pretty] |
A document that prints a character.
|
| cilVersion [Cil] |
These are the CIL version numbers.
|
| cilVersionMajor [Cil] | |
| cilVersionMinor [Cil] | |
| cilVersionRevision [Cil] | |
| cilint_to_int [Cil] |
Convert a cilint int to an OCaml int, or raise an exception if that
can't be done.
|
| clearCFGinfo [Cfg] |
clear the sid, succs, and preds fields of each statment in a function
|
| clearFileCFG [Cfg] |
clear the sid, succs, and preds fields of each statement.
|
| colorFlag [Errormsg] |
Set to true if you want error and warning messages to be colored
|
| combinePredecessors [Dataflow.ForwardsTransfer] |
Take some old data for the start of a statement, and some new data for
the same point.
|
| combineStmtStartData [Dataflow.BackwardsTransfer] |
When the analysis reaches the start of a block, combine the old data
with the one we have just computed.
|
| combineSuccessors [Dataflow.BackwardsTransfer] |
Take the data from two successors and combine it
|
| commonIntKind [Cil] |
Return the common integer kind of the two integer arguments, as
defined in ISO C <IP_ADDRESS> ("Usual arithmetic conversions")
|
| compFullName [Cil] |
Get the full name of a comp
|
| compactStmts [Cil] |
Try to compress statements so as to get maximal basic blocks.
|
| comparativeLevel [Cil] | |
| compareLoc [Cil] |
Comparison function for locations.
|
| compute [Dataflow.BackwardsDataFlow] |
Fill in the T.stmtStartData, given a number of initial statements to
start from (the sinks for the backwards data flow).
|
| compute [Dataflow.ForwardsDataFlow] |
Fill in the T.stmtStartData, given a number of initial statements to
start from.
|
| computeCFGInfo [Cil] |
Compute the CFG information for all statements in a fundec and return a
list of the statements.
|
| computeDomTree [Dominators] |
returns the IDoms and a map from statement ids to
the set of statements that are dominated
|
| computeFileCFG [Cfg] |
Compute the CFG for an entire file, by calling cfgFun on each function.
|
| computeFirstPredecessor [Dataflow.ForwardsTransfer] |
Give the first value for a predecessors, compute the value to be set
for the block
|
| computeIDom [Dominators] |
Invoke on a code after filling in the CFG info and it computes the
immediate dominator information.
|
| concat [Pretty] | |
| constFold [Cil] |
Do constant folding on an expression.
|
| constFoldBinOp [Cil] |
Do constant folding on a binary operation.
|
| constFoldVisitor [Cil] |
A visitor that does constant folding.
|
| convertInts [Cil] | |
| copy [Dataflow.ForwardsTransfer] |
Make a deep copy of the data
|
| copyCompInfo [Cil] |
Makes a shallow copy of a
Cil.compinfo changing the name and the key.
|
| copyFunction [Cil] |
Create a deep copy of a function.
|
| copyVarinfo [Cil] |
Make a shallow copy of a
varinfo and assign a new identifier
|
| countCalls [Stats] |
Flag to indicate whether or not to count the number of calls of
to
Stats.repeattime or Stats.time for each label.
|
| countNewLines [Pretty] |
Keep a running count of the taken newlines.
|
| currentGlobal [Cil] |
A reference to the current global being visited
|
| currentLoc [Cil] |
A reference to the current location.
|
| cyanEscStr [Errormsg] | |
D | |
| dExp [Formatcil] |
Deconstructs an expression based on the program.
|
| dExp [Cil] |
Generate an
Cil.exp to be used in case of errors.
|
| dGlobal [Cil] |
Generate a
Cil.global to be used in case of errors.
|
| dInstr [Formatcil] |
Deconstructs an instruction based on the program.
|
| dInstr [Cil] |
Generate an
Cil.instr to be used in case of errors.
|
| dLval [Formatcil] |
Deconstructs an lval based on the program.
|
| dType [Formatcil] |
Deconstructs a type based on the program.
|
| d_attr [Cil] |
Pretty-print an attribute using
Cil.defaultCilPrinter
|
| d_attrlist [Cil] |
Pretty-print a list of attributes using
Cil.defaultCilPrinter
|
| d_attrparam [Cil] |
Pretty-print an argument of an attribute using
Cil.defaultCilPrinter
|
| d_binop [Cil] |
Pretty-print a binary operator
|
| d_block [Cil] |
Pretty-print a block using
Cil.defaultCilPrinter .
|
| d_const [Cil] |
Pretty-print a constant
|
| d_exp [Cil] |
Pretty-print an expression using
Cil.defaultCilPrinter
|
| d_fkind [Cil] |
Pretty-print a floating-point kind
|
| d_formatarg [Cil] |
Pretty-prints a format arg
|
| d_global [Cil] |
Pretty-print the internal representation of a global using
Cil.defaultCilPrinter .
|
| d_hloc [Errormsg] | |
| d_ikind [Cil] |
Pretty-print an integer of a given kind
|
| d_init [Cil] |
Pretty-print an initializer using
Cil.defaultCilPrinter .
|
| d_instr [Cil] |
Pretty-print an instruction using
Cil.defaultCilPrinter
|
| d_int32 [Pretty] |
Print an int32
|
| d_int64 [Pretty] | |
| d_label [Cil] |
Pretty-print a label using
Cil.defaultCilPrinter
|
| d_list [Pretty] |
sm: Yet another list printer.
|
| d_loc [Cil] |
Pretty-print a location
|
| d_loc [Errormsg] | |
| d_lval [Cil] |
Pretty-print an lvalue using
Cil.defaultCilPrinter
|
| d_map [Pretty.MakeMapPrinter] |
Format a map, analogous to d_list.
|
| d_offset [Cil] |
Pretty-print an offset using
Cil.defaultCilPrinter , given the pretty
printing for the base.
|
| d_plainexp [Cil] |
Pretty-print the internal representation of an expression
|
| d_plaininit [Cil] |
Pretty-print the internal representation of an integer
|
| d_plainlval [Cil] |
Pretty-print the internal representation of an lvalue
|
| d_plaintype [Cil] |
Pretty-print the internal representation of a type
|
| d_set [Pretty.MakeSetPrinter] |
Format a set, analogous to d_list.
|
| d_shortglobal [Cil] |
Pretty-print a short description of the global.
|
| d_stmt [Cil] |
Pretty-print a statement using
Cil.defaultCilPrinter .
|
| d_storage [Cil] |
Pretty-print storage-class information
|
| d_thisloc [Cil] |
Pretty-print the
Cil.currentLoc
|
| d_type [Cil] |
Pretty-print a type using
Cil.defaultCilPrinter
|
| d_typsig [Cil] |
Print a type signature
|
| d_unop [Cil] |
Pretty-print a unary operator
|
| dd_exp [Cil] |
Pretty-print an expression while printing descriptions rather than names
of temporaries.
|
| dd_lval [Cil] | |
| debug [Dataflow.BackwardsTransfer] |
Whether to turn on debugging
|
| debug [Dataflow.ForwardsTransfer] |
Whether to turn on debugging
|
| debugFlag [Errormsg] |
If set then print debugging info
|
| defaultCilPrinter [Cil] | |
| derefStarLevel [Cil] | |
| descriptiveCilPrinter [Cil] | |
| dn_attr [Cil] | |
| dn_attrlist [Cil] | |
| dn_attrparam [Cil] | |
| dn_exp [Cil] |
Versions of the above pretty printers, that don't print #line directives
|
| dn_global [Cil] | |
| dn_init [Cil] | |
| dn_instr [Cil] | |
| dn_lval [Cil] | |
| dn_stmt [Cil] | |
| dn_type [Cil] | |
| doGuard [Dataflow.ForwardsTransfer] |
Generate the successor to an If statement assuming the given expression
is nonzero.
|
| doInstr [Dataflow.BackwardsTransfer] |
The (backwards) transfer function for an instruction.
|
| doInstr [Dataflow.ForwardsTransfer] |
The (forwards) transfer function for an instruction.
|
| doStmt [Dataflow.BackwardsTransfer] |
The (backwards) transfer function for a branch.
|
| doStmt [Dataflow.ForwardsTransfer] |
The (forwards) transfer function for a statement.
|
| docAlphaTable [Alpha] |
Split the name in preparation for newAlphaName.
|
| docArray [Pretty] |
Formats an array.
|
| docCList [Clist] |
A document for printing a clist (similar to
docList )
|
| docList [Pretty] |
An alternative function for printing a list.
|
| docMap [Pretty.MakeMapPrinter] |
Format a map, analogous to docList.
|
| docOpt [Pretty] |
Prints an
'a option with None or Some
|
| docSet [Pretty.MakeSetPrinter] |
Format a set, analogous to docList.
|
| domTreeIter [Dominators] |
Iterate over a dominator tree
|
| dominates [Dominators] |
Check whether one statement dominates another.
|
| doubleType [Cil] |
double
|
| dprintf [Pretty] |
This function provides an alternative method for constructing
doc objects.
|
| dropAttribute [Cil] |
Remove all attributes with the given name.
|
| dropAttributes [Cil] |
Remove all attributes with names appearing in the string list.
|
| dummyFile [Cil] |
A dummy file
|
| dummyFunDec [Cil] |
A dummy function declaration handy when you need one as a placeholder.
|
| dummyInstr [Cil] |
A instr to serve as a placeholder
|
| dummyStmt [Cil] |
A statement consisting of just
dummyInstr
|
| dumpBlock [Cil] |
Dump a block to a file using a given indentation.
|
| dumpFile [Cil] |
Pretty-print an entire file.
|
| dumpGlobal [Cil] |
Pretty-print a global.
|
| dumpInit [Cil] |
Dump an initializer to a file using a given indentation.
|
| dumpStmt [Cil] |
Dump a statement to a file using a given indentation.
|
E | |
| empty [Clist] |
The empty clist
|
| emptyFunction [Cil] |
Make an empty function
|
| endsWith [Cil] |
return true if the first is a suffix of the second string
|
| envMachine [Cil] |
Machine model specified via CIL_MACHINE environment variable
|
| eprintf [Pretty] |
Like
Pretty.fprintf applied to stderr
|
| error [Cil] |
Like
Errormsg.error except that Cil.currentLoc is also printed
|
| error [Errormsg] |
Prints an error message of the form
Error: ... .
|
| errorLoc [Cil] |
Like
Cil.error except that it explicitly takes a location argument,
instead of using the Cil.currentLoc
|
| existsType [Cil] |
Scans a type by applying the function on all elements.
|
| expToAttrParam [Cil] |
Convert an expression into an attrparam, if possible.
|
F | |
| f_int32 [Pretty] | |
| f_int64 [Pretty] | |
| fastMode [Pretty] |
If set to
true then optional breaks are taken only when the document
has exceeded the given width.
|
| filterAttributes [Cil] |
Retains attributes with the given name
|
| filterStmt [Dataflow.BackwardsTransfer] |
Whether to put this predecessor block in the worklist.
|
| filterStmt [Dataflow.ForwardsTransfer] |
Whether to put this statement in the worklist.
|
| findNaturalLoops [Dominators] |
Compute the start of the natural loops.
|
| findOrCreateFunc [Cil] |
Find a function or function prototype with the given name in the file.
|
| find_stmts [Dataflow] |
Returns (all_stmts, sink_stmts), where all_stmts is a list of the
statements in a function, and sink_stmts is a list of the return statments
(including statements that fall through the end of a void function).
|
| finishParsing [Errormsg] | |
| fitsInInt [Cil] |
True if the integer fits within the kind's range
|
| flattenBeforePrint [Pretty] |
Whether to rebalance doc before printing it to avoid stack-overflows
|
| floatKindForSize [Cil] |
The float kind for a given size.
|
| flushOften [Pretty] |
If true the it flushes after every print
|
| foldGlobals [Cil] |
Fold over all globals, including the global initializer
|
| foldLeftCompound [Cil] |
Fold over the list of initializers in a Compound (not also the nested
ones).
|
| fold_left [Clist] |
A version of fold_left that works on clists
|
| forgcc [Cil] |
Return the string 's' if we're printing output for gcc, suppres
it if we're printing for CIL to parse back in.
|
| fprint [Pretty] |
Format the document to the given width and emit it to the given channel
|
| fprintf [Pretty] |
Like
Pretty.dprintf followed by Pretty.fprint
|
| fromList [Clist] |
Convert an ordinary list to a clist
|
| funcExitData [Dataflow.BackwardsTransfer] |
The data at function exit.
|
G | |
| gccBuiltins [Cil] | |
| getAlphaPrefix [Alpha] | |
| getCompField [Cil] |
Return a named fieldinfo in compinfo, or raise Not_found
|
| getGlobInit [Cil] |
Get the global initializer and create one if it does not already exist.
|
| getHPosition [Errormsg] |
high-level position
|
| getIdom [Dominators] |
This is like Inthash.find but gives an error if the information is
Not_found
|
| getInteger [Cil] |
If the given expression is an integer constant or a CastE'd
integer constant, return that constant's value.
|
| getLocation [Errormsg] | |
| getParenthLevel [Cil] |
Parentheses level.
|
| getPosition [Errormsg] | |
| get_globalLoc [Cil] |
Return the location of a global, or locUnknown
|
| get_instrLoc [Cil] |
Return the location of an instruction
|
| get_stmtLoc [Cil] |
Return the location of a statement, or locUnknown
|
| gprintf [Pretty] |
Like
Pretty.dprintf but more general.
|
| greenEscStr [Errormsg] | |
H | |
| hadErrors [Errormsg] |
This is set whenever one of the above error functions are called.
|
| hasAttribute [Cil] |
True if the named attribute appears in the attribute list.
|
I | |
| i64_to_int [Cil] |
Convert a 64-bit int to an OCaml int, or raise an exception if that
can't be done.
|
| increm [Cil] |
Increment an expression.
|
| indent [Pretty] |
Indents the document.
|
| indexLevel [Cil] | |
| initCIL [Cil] |
Call this function to perform some initialization.
|
| insert [Pretty] |
A function that is useful with the
printf -like interface
|
| insertImplicitCasts [Cil] |
Do insert implicit casts (default true)
|
| intKindForSize [Cil] |
The signed integer kind for a given size (unsigned if second argument
is true).
|
| intKindForValue [Cil] |
Return the smallest kind that will hold the integer's value.
|
| intPtrType [Cil] |
int *
|
| intRank [Cil] |
Return the integer conversion rank of an integer kind
|
| intType [Cil] |
int
|
| integer [Cil] |
Construct an integer of kind IInt.
|
| invalidStmt [Cil] |
An empty statement.
|
| isArithmeticType [Cil] |
True if the argument is an arithmetic type (i.e.
|
| isArrayType [Cil] |
True if the argument is an array type
|
| isCompleteType [Cil] |
Returns true if this is a complete type.
|
| isConstant [Cil] |
True if the expression is a compile-time constant
|
| isConstantOffset [Cil] |
True if the given offset contains only field nanmes or constant indices.
|
| isFunctionType [Cil] |
True if the argument is a function type
|
| isInteger [Cil] | |
| isIntegralType [Cil] |
True if the argument is an integral type (i.e.
|
| isPointerType [Cil] |
True if the argument is a pointer type
|
| isScalarType [Cil] |
True if the argument is a scalar type
|
| isSigned [Cil] |
Returns true if and only if the given integer type is signed.
|
| isVoidPtrType [Cil] |
is the given type "void *"?
|
| isVoidType [Cil] |
is the given type "void"?
|
| isZero [Cil] |
True if the given expression is a (possibly cast'ed) integer or character
constant with value zero
|
| iter [Clist] |
A version of iter that works on clists
|
| iterGlobals [Cil] |
Iterate over all globals, including the global initializer
|
K | |
| kindOfSizeOf [Cil] |
The integer kind of
Cil.typeOfSizeOf .
|
| kinteger [Cil] |
Construct an integer of a given kind.
|
| kinteger64 [Cil] |
Construct an integer of a given kind, using OCaml's int64 type.
|
| kintegerCilint [Cil] |
Construct an integer of a given kind, from a cilint.
|
L | |
| lastTime [Stats] | |
| leftflush [Pretty] |
Use after a
Pretty.line to prevent the indentation.
|
| lenOfArray [Cil] |
Call to compute the array length as present in the array type, to an
integer.
|
| length [Clist] |
Find the length of a clist
|
| line [Pretty] |
A document that consists of a mandatory newline.
|
| lineDirectiveStyle [Cil] |
How to print line directives
|
| lineLength [Cil] |
The length used when wrapping output lines.
|
| little_endian [Cil] |
Whether the machine is little endian.
|
| loadBinaryFile [Cil] |
Read a
Cil.file in binary form from the filesystem.
|
| locUnknown [Cil] |
Represents a location that cannot be determined
|
| locUnknown [Errormsg] |
An unknown location for use when you need one but you don't have one
|
| log [Errormsg] |
Print something to
logChannel
|
| logChannel [Errormsg] |
A channel for printing log messages
|
| logg [Errormsg] |
same as
Errormsg.log but do not wrap lines
|
| longType [Cil] |
long
|
| lookupTime [Stats] |
Return the cumulative time of all calls to
Stats.time and
Stats.repeattime with the given label.
|
| lowerConstants [Cil] |
Do lower constants (default true)
|
| lowerEnumVisitor [Cillower] |
Replace enumeration constants with integer constants
|
M | |
| makeFormalVar [Cil] |
Make a formal variable for a function.
|
| makeGlobalVar [Cil] |
Make a global variable.
|
| makeLocalVar [Cil] |
Make a local variable and add it to a function's slocals (only if insert =
true, which is the default).
|
| makeStaticGlobal [Cil] |
Whether to convert local static variables into global static variables
|
| makeTempVar [Cil] |
Make a temporary variable and add it to a function's slocals.
|
| makeVarinfo [Cil] |
Make a varinfo.
|
| makeZeroInit [Cil] |
Make a initializer for zero-ing a data type
|
| map [Clist] |
Map a function over a clist.
|
| mapGlobals [Cil] |
Map over all globals, including the global initializer and change things
in place
|
| mapNoCopy [Cil] |
Like map but try not to make a copy of the list
|
| mapNoCopyList [Cil] |
Like map but each call can return a list.
|
| mark [Pretty] |
Mark the beginning of a markup section.
|
| markup [Pretty] |
Prints a document as markup.
|
| missingFieldName [Cil] |
This is a constant used as the name of an unnamed bitfield.
|
| mkAddrOf [Cil] |
Make an AddrOf.
|
| mkAddrOrStartOf [Cil] |
Like mkAddrOf except if the type of lval is an array then it uses
StartOf.
|
| mkBlock [Cil] |
Construct a block with no attributes, given a list of statements
|
| mkCast [Cil] |
Like
Cil.mkCastT but uses typeOf to get oldt
|
| mkCastT [Cil] |
Construct a cast when having the old type of the expression.
|
| mkCilint [Cil] |
Construct a cilint from an integer kind and int64 value.
|
| mkCompInfo [Cil] |
Creates a a (potentially recursive) composite type.
|
| mkEmptyStmt [Cil] |
Returns an empty statement (of kind
Instr )
|
| mkFor [Cil] |
Make a for loop for(start; guard; next) { ...
|
| mkForIncr [Cil] |
Make a for loop for(i=start; i<past; i += incr) { ...
|
| mkMem [Cil] |
Make a Mem, while optimizing AddrOf.
|
| mkStmt [Cil] |
Construct a statement, given its kind.
|
| mkStmtOneInstr [Cil] |
Construct a statement consisting of just one instruction
|
| mkString [Cil] |
Make an expression that is a string constant (of pointer type)
|
| mkWhile [Cil] |
Make a while loop.
|
| mone [Cil] |
-1
|
| msvcBuiltins [Cil] | |
| msvcMode [Cil] |
Whether the pretty printer should print output for the MS VC compiler.
|
N | |
| name [Dataflow.BackwardsTransfer] |
For debugging purposes, the name of the analysis
|
| name [Dataflow.ForwardsTransfer] |
For debugging purposes, the name of the analysis
|
| newAlphaName [Alpha] |
Create a new name based on a given name.
|
| newHline [Errormsg] | |
| newVID [Cil] |
Generate a new variable ID.
|
| new_sid [Cil] | |
| newline [Errormsg] | |
| nil [Pretty] |
Constructs an empty document
|
| noMemoize [Formatcil] |
If set then will not memoize the parsed patterns
|
| null [Errormsg] |
Do not actually print (i.e.
|
| num [Pretty] |
A document that prints an integer in decimal form
|
| num64 [Pretty] |
A document that prints a 64-bit int in decimal form
|
O | |
| oldstyleExternInline [Cil] |
Set this to true to get old-style handling of gcc's extern inline C extension:
old-style: the extern inline definition is used until the actual definition is
seen (as long as optimization is enabled)
new-style: the extern inline definition is used only if there is no actual
definition (as long as optimization is enabled)
Note that CIL assumes that optimization is always enabled ;-)
|
| one [Cil] |
1
|
P | |
| parseInt [Cil] |
Convert a string representing a C integer literal to an expression.
|
| parse_error [Errormsg] | |
| partitionAttributes [Cil] |
Partition the attributes into classes:name attributes, function type,
and type attributes
|
| peepHole1 [Cil] |
Similar to
peepHole2 except that the optimization window consists of
one instruction, not two
|
| peepHole2 [Cil] |
A peephole optimizer that processes two adjacent instructions and possibly
replaces them both.
|
| plainCilPrinter [Cil] | |
| popContext [Errormsg] |
Removes the last registered context printing function
|
| prepareCFG [Cil] |
Prepare a function for CFG information computation by
Cil.computeCFGInfo .
|
| pretty [Dataflow.BackwardsTransfer] |
Pretty-print the state
|
| pretty [Dataflow.ForwardsTransfer] |
Pretty-print the state
|
| print [Stats] |
Print the current stats preceeded by a message
|
| printAttr [Cil] |
Print an attribute given a pretty printer
|
| printAttrs [Cil] |
Print a set of attributes given a pretty printer
|
| printBlock [Cil] |
Print a block given a pretty printer.
|
| printCfgChannel [Cfg] |
print control flow graph (in dot form) for fundec to channel
|
| printCfgFilename [Cfg] |
Print control flow graph (in dot form) for fundec to file
|
| printCilAsIs [Cil] |
Whether to print the CIL as they are, without trying to be smart and
print nicer code.
|
| printDepth [Pretty] |
Specifies the nesting depth of the
align /unalign pairs at which
everything is replaced with ellipsis
|
| printExp [Cil] |
Print an expression given a pretty printer
|
| printGlobal [Cil] |
Print a global given a pretty printer
|
| printIndent [Pretty] |
If false then does not indent
|
| printInit [Cil] |
Print an initializer given a pretty printer.
|
| printInstr [Cil] |
Print an instruction given a pretty printer
|
| printLval [Cil] |
Print an lvalue given a pretty printer
|
| printStmt [Cil] |
Print a statement given a pretty printer.
|
| printType [Cil] |
Print a type given a pretty printer
|
| print_CIL_Input [Cil] |
Whether we print something that will only be used as input to our own
parser.
|
| printerForMaincil [Cil] |
zra: This is the pretty printer that Maincil will use.
|
| printf [Pretty] |
Like
Pretty.fprintf applied to stdout
|
| ptrdiffType [Cil] |
An unsigned integer type that fits pointer difference.
|
| purpleEscStr [Errormsg] | |
| pushContext [Errormsg] |
Registers a context printing function
|
| pushGlobal [Cil] |
CIL keeps the types at the beginning of the file and the variables at the
end of the file.
|
R | |
| readingFromStdin [Errormsg] |
Records whether the stdin is open for reading the goal *
|
| real [Pretty] |
A document that prints a real number
|
| redEscStr [Errormsg] | |
| registerAlphaName [Alpha] |
Register a name with an alpha conversion table to ensure that when later
we call newAlphaName we do not end up generating this one
|
| removeOffset [Cil] |
Remove ONE offset from the end of an offset sequence.
|
| removeOffsetLval [Cil] |
Remove ONE offset from the end of an lvalue.
|
| repeattime [Stats] |
repeattime is like time but runs the function several times until the total
running time is greater or equal to the first argument.
|
| reset [Stats] |
Resets all the timings and specifies the method to use for future timings.
|
| resetEscStr [Errormsg] | |
| rev [Clist] |
Reverse a clist.
|
S | |
| s [Errormsg] |
Stop the execution by raising an Error.
|
| saveBinaryFile [Cil] |
Write a
Cil.file in binary form to the filesystem.
|
| saveBinaryFileChannel [Cil] |
Write a
Cil.file in binary form to the filesystem.
|
| separateStorageModifiers [Cil] |
Separate out the storage-modifier name attributes
|
| seq [Pretty] |
Formats a sequence.
|
| setCurrentFile [Errormsg] | |
| setCurrentLine [Errormsg] | |
| setFormals [Cil] |
Update the formals of a
fundec and make sure that the function type
has the same information.
|
| setFunctionType [Cil] |
Set the types of arguments and results as given by the function type
passed as the second argument.
|
| setFunctionTypeMakeFormals [Cil] |
Set the type of the function and make formal arguments for them
|
| setHFile [Errormsg] | |
| setHLine [Errormsg] | |
| setMaxId [Cil] |
Update the smaxid after you have populated with locals and formals
(unless you constructed those using
Cil.makeLocalVar or
Cil.makeTempVar .
|
| setTypeAttrs [Cil] | |
| setTypeSigAttrs [Cil] |
Replace the attributes of a signature (only at top level)
|
| showContext [Errormsg] |
Show the context stack to stderr
|
| signedVersionOf [Cil] |
Give the signed kind corresponding to any integer kind
|
| single [Clist] |
Create a clist containing one element
|
| sizeOf [Cil] |
The size of a type, in bytes.
|
| splitFunctionType [Cil] |
Given a function type split it into return type,
arguments, is_vararg and attributes.
|
| splitFunctionTypeVI [Cil] | |
| sprint [Pretty] |
Format the document to the given width and emit it as a string
|
| startParsing [Errormsg] | |
| startParsingFromString [Errormsg] | |
| start_id [Cfg] |
Next statement id that will be assigned.
|
| startsWith [Cil] |
sm: return true if the first is a prefix of the second string
|
| stmtStartData [Dataflow.BackwardsTransfer] |
For each block id, the data at the start.
|
| stmtStartData [Dataflow.ForwardsTransfer] |
For each statement id, the data at the start.
|
| stripCasts [Cil] |
Removes casts from this expression, but ignores casts within
other expression constructs.
|
| stripUnderscores [Cil] |
If string has leading and trailing __, strip them.
|
T | |
| test [Formatcil] |
Just a testing function
|
| text [Pretty] |
A document that prints the given string
|
| time [Stats] |
Time a function and associate the time with the given string.
|
| timethis [Stats] |
Time a function and set lastTime to the time it took
|
| toList [Clist] |
Convert a clist to an ordinary list
|
| truncateCilint [Cil] |
Represents an integer as for a given kind.
|
| truncateInteger64 [Cil] | |
| typeAddAttributes [Cil] |
Add some attributes to a type
|
| typeAttrs [Cil] |
Returns all the attributes contained in a type.
|
| typeOf [Cil] |
Compute the type of an expression
|
| typeOfLval [Cil] |
Compute the type of an lvalue
|
| typeOfSizeOf [Cil] |
An unsigned integer type that is the type of sizeof.
|
| typeOffset [Cil] |
Compute the type of an offset from a base type
|
| typeRemoveAttributes [Cil] |
Remove all attributes with the given names from a type.
|
| typeSig [Cil] |
Compute a type signature
|
| typeSigAttrs [Cil] |
Get the top-level attributes of a signature
|
| typeSigWithAttrs [Cil] |
Like
Cil.typeSig but customize the incorporation of attributes.
|
U | |
| uintPtrType [Cil] |
unsigned int *
|
| uintType [Cil] |
unsigned int
|
| ulongType [Cil] |
unsigned long
|
| unalign [Pretty] |
Reverts to the last saved indentation level.
|
| underscore_name [Cil] |
Whether the compiler generates assembly labels by prepending "_" to the
identifier.
|
| undoAlphaChanges [Alpha] |
Undo the changes to a table
|
| unimp [Cil] |
Like
Errormsg.unimp except that Cil.currentLoc is also printed
|
| unimp [Errormsg] |
Similar to
error except that its output has the form Unimplemented: ...
|
| uniqueVarNames [Cil] |
Assign unique names to local variables.
|
| unmark [Pretty] |
The end of a markup section
|
| unrollType [Cil] |
Unroll a type until it exposes a non
TNamed .
|
| unrollTypeDeep [Cil] |
Unroll all the TNamed in a type (even under type constructors such as
TPtr , TFun or TArray .
|
| unsignedVersionOf [Cil] |
Give the unsigned kind corresponding to any integer kind
|
| upointType [Cil] |
An unsigned integer type that fits pointers.
|
| useComputedGoto [Cil] |
Whether to use GCC's computed gotos.
|
| useLogicalOperators [Cil] |
Whether to use the logical operands LAnd and LOr.
|
V | |
| var [Cil] |
Makes an lvalue out of a given variable
|
| verboseFlag [Errormsg] | |
| visitCilAttributes [Cil] |
Visit a list of attributes
|
| visitCilBlock [Cil] |
Visit a block
|
| visitCilExpr [Cil] | |
| visitCilFile [Cil] |
Visit a file.
|
| visitCilFileSameGlobals [Cil] |
A visitor for the whole file that does not change the globals (but maybe
changes things inside the globals).
|
| visitCilFunction [Cil] |
Visit a function definition
|
| visitCilGlobal [Cil] |
Visit a global
|
| visitCilInit [Cil] |
Visit an initializer, pass also the variable to which this belongs and the
offset.
|
| visitCilInitOffset [Cil] |
Visit an initializer offset
|
| visitCilInstr [Cil] |
Visit an instruction
|
| visitCilLval [Cil] |
Visit an lvalue
|
| visitCilOffset [Cil] |
Visit an lvalue or recursive offset
|
| visitCilStmt [Cil] |
Visit a statement
|
| visitCilType [Cil] |
Visit a type
|
| visitCilVarDecl [Cil] |
Visit a variable declaration
|
| voidPtrType [Cil] |
void *
|
| voidType [Cil] |
void
|
W | |
| warn [Cil] |
Like
Errormsg.warn except that Cil.currentLoc is also printed
|
| warn [Errormsg] |
Like
Errormsg.error but does not raise the Errormsg.Error
exception.
|
| warnContext [Cil] |
Like
Errormsg.warn except that Cil.currentLoc and context
is also printed
|
| warnContextOpt [Cil] |
Like
Errormsg.warn except that Cil.currentLoc and context is also
printed.
|
| warnFlag [Errormsg] |
Set to true if you want to see all warnings.
|
| warnLoc [Cil] |
Like
Cil.warn except that it explicitly takes a location argument,
instead of using the Cil.currentLoc
|
| warnOpt [Cil] |
Like
Errormsg.warnOpt except that Cil.currentLoc is also printed.
|
| warnOpt [Errormsg] |
Like
Errormsg.warn but optional.
|
| warnTruncate [Cil] |
Emit warnings when truncating integer constants (default true)
|
| wcharKind [Cil] |
wchar_t (depends on architecture) and is set when you call
Cil.initCIL .
|
| wcharType [Cil] | |
| whiteEscStr [Errormsg] | |
| withContext [Errormsg] |
To ensure that the context is registered and removed properly, use the
function below
|
| withPrintDepth [Pretty] |
Invokes a thunk, with printDepth temporarily set to the specified value
|
Y | |
| yellowEscStr [Errormsg] | |
Z | |
| zero [Cil] |
0
|


skillsme
skillsme beta login page remade
skillsme beta login page remade
feugiat amet
Gym for all
I posses excellent communication, leadership, and problem solving strengths, resourceful and determined personnel, enthusiastic, committed to efficiency, focus with well-developed team spirit, with an active interest in develering value and pride in clients satisfaction . Proficient in HTML, css, bootstrap, jquery, javaScript.


| Project | Approved | Health | Budget | Spent |
|---|---|---|---|---|
|
|
|
{{ ::row.budget | currency }} | {{ ::row.spent | currency }} |
| Project | Approved | Health | Budget | Spent |
|---|---|---|---|---|
|
|
|
{{ ::row.budget | currency }} | {{ ::row.spent | currency }} |


HOME
TOYS
CATEGORIES
ALL PRODUCTS
LOGIN
HOME
TOYS
CATEGORIES
ALL PRODUCTS
LOGIN
TOY STORE
We Bring The Toy Store To You
TOYS
CATEGORIES
TOY NAME
TOY NAME
TOY NAME
TOY NAME
And MORE


The POW tool menu
- Blink Images/Graphs: Through
these two dialog boxes, you can blink (animate) multiple images in
a single graph or multiple graphs on the POW canvas.
- Region Files: Through
this dialog box, you can create and edit region files using the mouse.
- Contour Maps: Through
this dialog box, you can create and edit contour maps of the current
image.
- Profile: Select a slice
through an image and plot the pixel intensity along the slice.
- Ruler: Measure the distance
between two points in an image.
- Image Probe: Select a region
of an image and calculate flux and centroid data.
- X Range: Select range to
to restrict the analysis to only those photons that were detected within
certain time intervals.


Having done quite a bit of reading on Morning Glory (having a bulk organic seed distributor down the street helped peek my interest) I came to a few conclusions.
#1 Most extractions start with the idea that a polar/nonpolar wash is a good idea and seek to concentrate the alkaloids. I think these are unnecessarily complicated and outside of lab conditions are probably wasteful and often use chemicals to remove products that could be avoided by avoiding a layer of extraction mechanically.
#2 Most of the aklaloids present in morning glory seeds are strongly polar. Pure water (RO+DI) is an awfully potent polar solvent.
#3 Most traditional preperations and home recipies involve mildly acidic conditions in the polar (water) wash. It probably won't hurt anything AND the resultant wash is going to be acidic enough that it won't foster much in the way of bacterial growth if sitting in less than ideal conditions for a while.
#4 Ingestion and upsets seem to come either from fungicides or as a result of the oils and fibers from the seeds themselves. Most fibers should settle out to the bottom of a water wash. Most oils are either going to be heavier than water (settle to the bottom) or lighter (float to the top) and can be likewise avoided.
Well I thought about all off this and came to the conclusion that perhaps simple was better. I obtained around 3000 or so seeds from the place down the street from my house of 'Heavenly Blue' packaged for the 2005 planting season. I then slowly ground them to a fine flour using very slow pulses on a coffee grinder over approximately 3 hours.
A half cup of seeds was added to the grinder and then pulsed for 2-3 seconds with 30 second breaks in between. After 4-5 pulses the resulting flour/chaff mix was put through a fine sifter and the finer ground material sifted into a large glass bowl. The remaining material was returned to the grinder and pulsed again with the same breaks until all material could pass through the grinder. This process was continued until all seed matter was consumed and able to pass through the sifter.
A gallon of RO+DI water was obtained (ppm around 10) and a quart was added to the flour mixture. This was then placed in the fridge on the lowest temp setting (34-35 degrees) after an hour enough citric acid was added to bring pH to approximately 3 (just under a tablespoon). Over 1-2 days the solution was stirred up every few hours and then allowed to slowly settle. The water was then drawn off with a filtered syphon, being careful to not take up any of the oils floating on the surface or any of the fiber mass at the bottom of the bowl.  The resultant liquor has the same color as earl grey tea and if allowed to settle for a week or more quite a few tannins percipitate out of the solution.
The idea here was to maximize exposure of the actives to solvent. The fine flour maximizes surface area and should in theory aid in extraction. Most solvents have a definate 'limit' to how much solute can dissolve in them. By adding fresh solvent in batches we should at least reduce the amount of solute left behind.
Total amount of water/solute recovered was just under 3/4 of a gallon.
The resultant mixture had a slightly tangy sour taste no doubt due to the use of citric acid. It was very reminiscent of 'crystal lite' gone bad and blended very nicely with said beverage. Dose was variable between users but seemed to equate down to 3/4 of a cup to 1 1/2 cups per person.
Onset was around 30 minutes with the trip peaking at about 3 hours and fading at around hour 6-8 depending on the person. Some people with the higher dosage had visual 'tracers' well into the next day (12-14 hours later). No one reported any nausea or stomach upset but a few people did become dizzy.
The individual descriptions of trips look like a carbon copy of those already repeated on this site so I'm not going to go into excessive detail. Everyone involved found it a very positive experience and I think doing it as a group really helped. I would recommend this extraction as a group project.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Toggle navigation
Menu
Here We Go
Maps
Weather
Currency
Team
Contact
Here We Go!
Enter your destination..
Tell Me More
jjjjjjjjjjjjjjjjjjjj


--- layout: post title: The Move to Jekyll date: type: post published: false status: draft categories: - Fun IT Projects - How-to Guides tags: - github pages - jekyll - search meta: _edit_last: '1' _s2mail: 'yes' _publicize_twitter_user: "@alexdglover" _oembed_5c38271ebbb75e4d7957e4a10a8c98b8: "{{unknown}}" _wpas_mess: The Move to Jekyll _wpas_skip_16584087: '1' _thumbnail_id: '1115' author: login: AlexDGlover email<EMAIL_ADDRESS>display_name: AlexDGlover first_name: Alex last_name: Glover ---
WordPress has served me well over the years, but it's time for me to move on. My blog first started with Wordpress.com hosting, but I didn't like that I was hosting WP's ads, a custom domain was an up-charge, and they limit which themes and plugins I could use. So I migrated to a self-hosted WordPress instance, allowing me to serve Google ads, add membership functionality, and allow people to subscribe to my site by email.
I've had some issues with 1and1 hosting over the years (downtime, charges for PHP support, non-refundable contracts), and I've come to realize I don't need most of these plugins. I don't make enough money to justify the ads, and a lot of the site's visitors are friends and family. I only have a few members/subscribers, so I don't really need membership functionality either. On top of that, 1and1 isn't free - I'm literally paying for a hosting service I don't like, to host functionality I don't need.
With all of that in mind, blogging with Jekyll and hosting on GitHub seemed like a no-brainer. Hosting is free, it's faster and more secure than WP, and I get to enjoy hacking on a new tool set. But before I made the switch, I wanted to make sure Jekyll could do everything I wanted with a blogging platform.
TL;DR - I'm ditching WordPress hosted on 1and1, and I'm moving to Jekyll hosted on GitHub.
Out of the box, Jekyll is a great blogging platform and meets the majority of my use cases. That said, there a few features of my WordPress blog that Jekyll doesn't include, and I didn't want to lose as part of the transition.
The rest of this post will cover how I modified Jekyll and the Minimal Mistakes theme for my blog.
Fortunately, implementing the "featured image" was fairly easy with the Minimal Mistakes theme. The theme itself is supposed to offer it out-of-the-box, but either I'm doing something wrong or misunderstanding the theme documentation. In theory, you only need to set "teaser" property in the header section of your posts' front matter, like this:
--- title: "Hello world" date: 2016-11-17 16:16:01 -0600 categories: jekyll category1 category2 header: teaser: https://i0.wp.com/alexdglover.com/wp-content/uploads/2017/01/anim-3.gif --- And here's the body of your blog post.
For some reason, that didn't work for me using the stock home page. After doing some digging, I narrowed the so-called issue to a "grid" conditional in _includes/archive-single.html:
{% if include.type == "grid" and teaser %}

 {% endif %}
Well, I couldn't figure out where the include.type was supposed to be set, but who cares! The best thing about Jekyll is you have total control and it's easy to modify. I have no plans to use this "grid" functionality, so I just removed it from the conditional. Now the teaser is displayed on the home page (and in any page using the archive layout).
Jekyll supports Google Analytics, injecting your tracking ID into every page on your behalf. Google Analytics is a little overkill for a personal blog and I personally dislike the dashboard/interface, but there aren't that many site analytics platforms out there that are free and feature-rich. So I'm going down the path of least resistance on this one. I just need to take my existing GA tracking ID, and put in the _config.yml file:
# Analytics analytics: provider : "google" google: tracking_id : "ga-my-tracking-id-12973291"
I've seen plenty of other Jekyll users create a simple integration to social media sites using the built-in RSS feed from Jekyll and IFTTT, so I won't beat that dear horse. The most interesting implementation I've seen done was by Eduardo Boucas, so I'll direct you to his site for an example.
Fortunately, when I set up my self-hosted WordPress site I had the foresight to choose a sane and practical permalink structure. All of my permalinks are just the post title, but URL encoded (99% of the time this just means spaces are replaced by hyphens, and all words are downcased). I can maintain all of my permalinks and not lose any SEO "juice" by using that same permalink pattern in my new Jekyll blog:
# Outputting permalink: /:title/
Easy.
Search functionality was an interesting problem, but I knew right away how I wanted to solve it. In short, since Jekyll is a static site generator, there is no server-side code that can process search queries. It all needs to be handled in HTML and JavaScript.
This is a trivial limitation, considering how small my site is and how "cheap" it is to send a few extra kilobytes of HTML text to the end user. With that in mind, a search solution is fairly easy. In my initial implementation, I set up a separate search page (rather than try to do an _includes/search.html that I could embed in other pages or sidebars). The search page is populated with an HTML input field, followed by every single post in the blog wrapped in div tags with style="display: none;"
. At this point, the DOM of the page becomes our search "database," and we just need to write some JavaScript to find our query and update the div to style="display: none;"
. This gives us the power to search not only post titles, but also the actual content of the post bodies.
--- title: Search permalink: search.html ---  <input type="text" onkeyup="getSearchResults(this.value)">
 {% for post in site.posts %}

{{ post.title }}
 {% if post.header.teaser %}  {% endif %}
{{ post.date | date: "%B %e, %Y" }} - Categories {{ post.categories | join:',' }}

{{ post.content }}

 {% endfor %}

And here's the end result:
It even looks good on mobile-friendly display port sizes:
Well I'm sold! After testing my minor customizations, I'm ready to make the switch to GitHub pages using Jekyll and the Minimal Mistakes theme. I'll be sure to post again to describe any lessons learned from the actual migration, as well as any future customizations I make. If any of you have Jekyll tips and tricks to share, send 'em my way!


CBM-Command Help
CBM-Command Help Index
1 Introduction
1.1 What is CBM-Command?
1.2 History of CBM-Command
1.3 Key features of CBM-Command
1.4 New functions and fixes
1.4.1 New in Version 2.0
1.4.2 New in Version 2.1
2 General Information
2.1 Ports -- supported systems
2.2 How does it work
2.3 Updates, Support, and Contributions
2.3.1 Updates
2.3.2 Support
2.3.3 Contributions
2.4 License/Copyright
3 Operation
3.1 User interface
3.2 Drives
3.3 Keyboard Shortcuts:
4 Configuration and customizing
4.1 Customizing the interface and drives
4.1.1 Default drives
4.1.2 Colors
4.1.3 Keys
4.2 Versions
4.2.1 C64
4.2.2 C128
4.2.3 VIC-20
4.2.4 PLUS4
4.2.5 PET40
4.2.6 PET80
5 Credits
5.1 Idea and Code
5.2 Documentation
5.3 Testing
1 Introduction
1.1 What is CBM-Command?
CBM-Command is a tool for many Commodore machines that helps to manage files easily, by using an interface in the Norton Commander style. It uses 2 panels with short-cut keys that help to perform various tasks such as rename, copy, delete, make and move between directories (where available), and manage disk (D64/D71/D80/D81/D82) images.
1.2 History of CBM-Command
In April 2010, Payton Byrd realized that there was no good way to manage the many different storage devices that exist for the Commodore family of computers. So, he decided to do something about it. A new project called CBM-Command was started. Using the CC65 development environment and support from its mailing list members, he created a new file-manager in the style of old MS-DOS file managers.
1.3 Key features of CBM-Command
Two file-directory panels are displayed (only one is displayed at-a-time on the VIC-20)
Keyboard functions similar to the MS-DOS originals
Extended copying, moving, renaming, and deleting of files
Copying disks between drives
Creating disk images (D64, D71, D81)
Writing disk images to floppies
Built-in file viewer, to view text files (SEQ and PRG)
Typed-in commands can be sent to a drive's DOS.
Configurable hot-keys.
1.4 New functions and fixes
1.4.1 New in Version 2.0
Optimized a great deal of the code, practically the whole code-base. That has freed up a LOT of room for the new features.
Added REL-file copying.
Added D71 disk-image support.
Added configurable hot-keys.
Changed the rename functionality, to remember where you were in the directory.
Changed the disk-image routine, to move the pointer instead of rotating the data as necessary.
Changed the disk-command functionality, to use the blank line below the directory listing, instead of popping up a new window.
1.4.2 New in Version 2.1
It can detect the formats of Creative Micro Design's partitions and sd2iec's disk images.
It knows automatically when to create either single-sided (D64) or double-sided (D71) images.
CBM 8050 and CBM 8250 (SFD-1001) disk copier.
A better help file.
Fixed batch delete: it can remove many more files in one pass.
After a rename, it shows both the new and old names (you can verify that you changed what you wanted to change).
It is better at catching and reporting disk/file errors.
It is less likely to be jammed by missing drives.
It has improved support for RELative files.
It copies all of the data in IDE64 files.
The panels show the disks' format codes.
The image creater says which image format it plans to make. Now, it tells you before it asks for a file-name (to remind you about which suffix to use in the name).
Cleaner VIC-20 screens.
2 General Information
2.1 Ports -- supported systems
C64 -- This is the standard version, and includes support for only the standard 40-column display. Its file name is "cbmcommand.c64".
C128 -- This is the visually enhanced version, and supports only the 80-column display. The C128 version uses the 2 MHz. system-speed of the C128 computer, which allows for faster operations. The C128 version's file name is "cbmcommand.c128".
VIC-20 -- This is the basic version, and includes support for only the standard 22-column display. Its file name is "cbmcommand.vic20".
Plus4 -- This is nearly identical to the C64 version, except that it can't time its operations. And, it allows the use of the full 121-color palette of the Plus4 computer. Its file name is "cbmcommand.plus4".
Pet-40 -- This is similar to the C64 version; but, its display has only two colors. Its file-name is "cbmcommand.pet40".
Pet-80 -- This is similar to the C128 version; but, its display has only two colors. Its file-name is "cbmcommand.pet80".
2.2 How does it work
LOAD":*",8 or LOAD"LOADCBMCMD",8
RUN
where 8 is the drive where the program resides (do not use a ,1 suffix).
Those commands just load and run the first file, "LOADCBMCMD". It detects the current model, then loads the proper program for the recognized machine.
2.3 Updates, Support, and Contributions
2.3.1 Updates
Updates are available from the official project website: http://cbmcommand.codeplex.com/releases/.
2.3.2 Support
Feel free to send a question, or report a bug, to developers on the official project website, or to the official mailing list: http://groups.google.com/group/cbm-command/.
2.3.3 Contributions
If you have an idea that could improve CBM-command, let us know! Additional feature-requests are more than welcome. Join the project at: http://cbmcommand.codeplex.com/.
2.4 License/Copyright
Copyright © 2011, Payton Byrd
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"; AND, ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION), HOWEVER CAUSED, AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3 Operation
3.1 User interface
The program uses two panels (left and right), each with its own drive, that display the contents of a directory.
By using cursor-keys (left/right), you can jump between the panels; and, by using (up/down), you can move inside a directory.
By using the keys for the Page-Up and Page-Down functions (default keys are "+" and "-"), you can go one screen up or down in the current directory.
By using the keys for the "To Bottom" and "To Top" functions, you can go directly to the top-most or bottom-most file-name in the current directory.
The space-key selects/unselects items, in case you want to perform a task on multiple files in a batch; for example, copying 3 files from the left panel to the right panel, with just one step.
At the bottom is listed the actions that you can select by using the Function Keys. They perform the main tasks, DELETE, RENAME, COPY, etc.
Pressing the "Copy" function-key (F5) will copy the currently pointed file or all marked files. The current status of the copy process is displayed in the top status bar. Information about the used time and the average copy speed is provided. (The two panels must show different drives.)
Pressing the "Rename" function-key (F6) will open a text-input dialog for a new file-name for the currently pointed file.
Pressing the function-key assigned to the "Delete" function (F8) will delete the pointed file, or all marked files, after
an affirmative answer to the verification question that will appear. Press "Y" if you want to delete the files, and "N" or the
STOP-key if you don't.
Press the "Make Image" key (the default is "x") to make a new file that is an image of the disk in the current panel's drive. The file is written into the opposite panel's directory. Only three formats are supported, at this time: 1541 (D64), 1571 (D71), and 1581 (D81). The status bar will tell you which format will be written into the image file.
Disk-Image creation will begin after you type in a file-name. A progress bar is shown; and, additional info is provided in the top status bar.
Press the "Create Disk" key (the default is "X") to write the currently pointed image file's data onto the opposite
panel's disk. The file and the drive must have compatible formats (only the D64, D41, D71, and D81 formats, without error blocks or extra tracks, at this time). The disk will be formatted physically before the image is copied onto it.
Press the "Copy Disk" key (the default is "o") to copy the raw contents of a disk from one drive to the other drive. The two disks must have compatible formats. You can copy a single-sided disk onto a double-sided disk (then, the double becomes a single).
(You must choose different drives for the two panels before using any of the disk-transfer operations [make image, make disk, and copy disk].)
Press "F1" to see the Help file.
Press "SHIFT + Return" to view a pointed SEQ text-file (or, launch a program). Once inside the text viewer, use "Return" to advance to the next page. Press "STOP" to exit from the viewer.
If the file has a PRG file-type, then you will be asked if you want to open it as text.
Tapping "y" or the RETURN-key will say yes. But, if you say no (by tapping "n" or the STOP-key), then you will be asked if you want to leave the program. If you say yes, then CBM-Command will quit; BASIC commands will load and run the pointed program.
You can send any DOS text command to a drive by pressing the "DOS Command" key (the default is "@"). Type the command, and press "RETURN". (Or, press the "STOP"-key, at any time, if you change your mind, and don't want to send a command.) If the DOS gives an error message, CBM-Command will show it. Then, a directory will be read and shown.
(Currently, the DOS-Command function is the only way to change partitions.)
3.2 Drives
CBM-Command uses panels to display the contents of one or two drives at a time. The drive panels may be refreshed by choosing the appropriate "Re-read" command-key.
Directory panels are the primary focus of CBM-Command. There are two directory panels, one for the "left" drive and one for the "right" drive. You can navigate between the panels by using the left and right cursor keys.
To use a directory panel, you should select a drive by using the "D" (left panel) or "SHIFT-D" (right panel) hot-keys. You will see a list of device numbers, along with the reset-messages from the available drives. Use the cursor-keys and the "HOME" key to move up or down the list. Tap "RETURN" to choose the currently pointed drive; or, tap "STOP" to keep the old drive.
The top of each panel shows the disk's name and its format-code:
| Code | Formats |
| a | 1541/1571/2031/4040 |
| b | 2030 |
| c | 8050/8250/1001 |
| d | 1581 |
| h | CMD native partition |
| 4 | IDE64 |
| m | IDE64 CDROM |
| <blank> | VICE |
A group of file-names is shown below the disk-name. Each line shows a file's block-count, its name, and the initial letter of its file-type:
| Letter | File-type |
| d | DELeted, but closed |
| S | SEQuential |
| P | PRoGram |
| U | USeR-made format |
| R | RELative |
| C | CBM partition |
| D | DIRectory |
| L | soft-LiNK |
| O | any Other type |
Directory panels can be refreshed, which means that the directory is re-read from the drive, and all files are unselected. That is done by using the "E" (left panel) and "SHIFT-E" (right panel) hot-keys.
3.3 Keyboard Hot-keys:
These are the default command-keys for CBM-Command's tasks:
|
Function name |
Hot-key |
|
Re-read a Directory |
E (Left), SHIFT-E (Right) |
|
Select a Drive |
D (Left), SHIFT-D (Right) |
|
Help |
F1, H, Help-key |
|
Quit |
F2, Q |
|
Select a Drive for the Current Panel |
F3, U |
|
Re-read a Directory in the Current Panel |
F4, R |
|
Copy File(s) |
F5, C |
|
Rename a File |
F6, N |
|
Make a Directory |
F7, M |
|
Delete File(s) |
F8, L |
|
Give a Disk Command |
@ |
|
Tag/Untag a file |
SPACE-bar |
|
Tag All Files |
A |
|
Tag No Files |
S |
|
Navigate within a panel |
Up/Down Cursor |
|
Navigate between the panels |
Left/Right Cursor |
|
Page Up |
Plus (+) |
|
Page Down |
Minus (-) |
|
Top of the Directory |
Up-Arrow (^) |
|
Bottom of the Directory |
SHIFT Up-Arrow (Pi) |
|
Enter a Directory/Disk-Image |
SHIFT-Plus |
|
Exit a Directory/Disk-Image |
SHIFT-Minus |
|
Create an Image File from a Raw Disk |
x |
|
Create a Raw Disk from an Image File |
SHIFT-X |
|
Copy a Disk |
O |
|
Go to 64-mode (C128 Only) |
G |
4 Configuration and customizing
4.1 Customizing the interface and the drives
You can customize the interface of the program, by using the proper configuration program for the target system. For example, to customize the C128 version, load and run the file "CBMCMDCFG.C128"; while, for the Plus4, run the file "CBMCMDCFG.PLUS4".
4.1.1 Default drives
You can select the default drives for the Left and Right Panels. Pressing "L" or "R" will cycle the corresponding drive choice through all possible drive-numbers.
4.1.2 Colors
Colours for the Background, the Screen, the Menu, the Status, and File-names can be selected from an available-colour palette. First, type the number of the object that you wish to change. Then, using the cursor-keys and "Return", choose any color from a displayed palette. Press "STOP" if you change your mind, and don't want to adjust that object.
4.1.3 Keys
Most of the hot-keys for invoking operations can be customized freely.
Choose a command, whose keyboard hot-key you want to change, by using the cursor keys; and, press "Return".
Press the desired new key; and, confirm your choice by pressing on "Return". Or, press "STOP" to cancel.
Note that you cannot change the function keys in custom configurations.
4.2 Versions
4.2.1 C64
Two directory panels, 16 colors to choose, 40-column-wide display.
4.2.2 C128
Two directory panels, 16 colors to choose, 80-column-wide display.
4.2.3 VIC-20
Two one-visible-at-a-time directory panels, 8 colors to choose, 22-column-wide display.
4.2.4 PLUS4
Two directory panels, 121 colors to choose, 40-column-wide display.
4.2.5 PET40
Two directory panels, no choice of colors, 40-column-wide display, number-keys instead of function-keys.
4.2.6 PET80
Two directory panels, no choice of colors, 80-column-wide display, number-keys instead of function-keys.
5 Credits
5.1 Idea and Code
Idea: Payton Byrd
Code: Payton Byrd, Greg King
5.2 Documentation
Documentation: nbla000, Vladimir Jankovic, Greg King
5.3 Testing
Testing: Many people have tested CBM-Command; but, the following individuals really have gone out of their way to make CBM-Command the best it can be on their platform: nbla000 (VIC 20), Chicken (Plus 4), hurminator (C64).


Apache Flink 1.16.1 Release Announcement
January 30, 2023 - Martijn Visser (@martijnvisser82)The Apache Flink Community is pleased to announce the first bug fix release of the Flink 1.16 series.
This release includes 84 bug fixes, vulnerability fixes, and minor improvements for Flink 1.16. Below you will find a list of all bugfixes and improvements (excluding improvements to the build infrastructure and build stability). For a complete list of all changes see: JIRA.
We highly recommend all users upgrade to Flink 1.16.1.
Release Artifacts #
Maven Dependencies #
<dependency>
<groupId>org.apache.flink</groupId>
<artifactId>flink-java</artifactId>
<version>1.16.1</version>
</dependency>
<dependency>
<groupId>org.apache.flink</groupId>
<artifactId>flink-streaming-java</artifactId>
<version>1.16.1</version>
</dependency>
<dependency>
<groupId>org.apache.flink</groupId>
<artifactId>flink-clients</artifactId>
<version>1.16.1</version>
</dependency>
Binaries #
You can find the binaries on the updated Downloads page.
Docker Images #
- library/flink (official images)
- apache/flink (ASF repository)
PyPi #
Upgrade Notes #
FLINK-28988 - Incorrect result for filter after temporal join The filter will not be pushed down into both inputs of the event time temporal join. This may cause incompatible plan changes compared to Flink 1.16.0, e.g., when the left input is an upsert source (like upsert-kafka connector), the query plan will remove the ChangelogNormalize node in Flink 1.16.1, while it did appear in 1.16.0.
FLINK-29849 - Event time temporal join on an upsert source may produce incorrect execution plan This resolves the correctness issue when doing an event time temporal join with a versioned table backed by an upsert source. When the right input of the join is an upsert source, it no longer generates a ChangelogNormalize node for it. This is an incompatible plan change compared to 1.16.0
FLINK-30383 - UseLogicalIdentifier makes datadog consider metric as custom The Datadog reporter now adds a “flink.” prefix to metric identifiers if “useLogicalIdentifier” is enabled. This is required for these metrics to be recognized as Flink metrics, not custom ones.
Release Notes #
Bug
- [FLINK-16582] - NettyBufferPoolTest may have warns on NettyBuffer leak
- [FLINK-26037] - TaskManagerRunner may crash during shutdown sequence
- [FLINK-26890] - DynamoDB consumer error consuming partitions close to retention
- [FLINK-27341] - TaskManager running together with JobManager are bind to <IP_ADDRESS>
- [FLINK-27944] - IO metrics collision happens if a task has union inputs
- [FLINK-28102] - Flink AkkaRpcSystemLoader fails when temporary directory is a symlink
- [FLINK-28526] - Fail to lateral join with UDTF from Table with timstamp column
- [FLINK-28695] - Fail to send partition request to restarted taskmanager
- [FLINK-28742] - Table.to_pandas fails with lit("xxx")
- [FLINK-28786] - Cannot run PyFlink 1.16 on MacOS with M1 chip
- [FLINK-28863] - Snapshot result of RocksDB native savepoint should have empty shared-state
- [FLINK-28960] - Pulsar throws java.lang.NoClassDefFoundError: javax/xml/bind/annotation/XmlElement
- [FLINK-28988] - Incorrect result for filter after temporal join
- [FLINK-29231] - PyFlink UDAF produces different results in the same sliding window
- [FLINK-29234] - Dead lock in DefaultLeaderElectionService
- [FLINK-29298] - LocalBufferPool request buffer from NetworkBufferPool hanging
- [FLINK-29479] - Support whether using system PythonPath for PyFlink jobs
- [FLINK-29539] - dnsPolicy in FlinkPod is not overridable
- [FLINK-29615] - MetricStore does not remove metrics of nonexistent subtasks when adaptive scheduler lowers job parallelism
- [FLINK-29627] - Sink - Duplicate key exception during recover more than 1 committable.
- [FLINK-29677] - Prevent dropping the current catalog
- [FLINK-29728] - TablePlanner prevents Flink from starting is working directory is a symbolic link
- [FLINK-29749] - flink info command support dynamic properties
- [FLINK-29781] - ChangelogNormalize uses wrong keys after transformation by WatermarkAssignerChangelogNormalizeTransposeRule
- [FLINK-29803] - Table API Scala APIs lack proper source jars
- [FLINK-29817] - Published metadata for apache-flink in pypi are inconsistent and causes poetry to fail
- [FLINK-29827] - [Connector][AsyncSinkWriter] Checkpointed states block writer from sending records
- [FLINK-29839] - HiveServer2 endpoint doesn't support TGetInfoType value 'CLI_ODBC_KEYWORDS'
- [FLINK-29849] - Event time temporal join on an upsert source may produce incorrect execution plan
- [FLINK-29857] - Fix failure to connect to 'HiveServer2Endpoint' when using hive3 beeline
- [FLINK-29899] - Stacktrace printing in DefaultExecutionGraphCacheTest is confusing maven test log output
- [FLINK-29923] - Hybrid Shuffle may face deadlock when running a task need to execute big size data
- [FLINK-29927] - AkkaUtils#getAddress may cause memory leak
- [FLINK-30030] - Unexpected behavior for overwrite in Hive dialect
- [FLINK-30133] - HadoopModuleFactory creates error if the security module cannot be loaded
- [FLINK-30168] - PyFlink Deserialization Error with Object Array
- [FLINK-30189] - HsSubpartitionFileReader may load data that has been consumed from memory
- [FLINK-30239] - The flame graph doesn't work due to groupExecutionsByLocation has bug
- [FLINK-30304] - Possible Deadlock in Kinesis/Firehose/DynamoDB Connector
- [FLINK-30308] - ClassCastException: class java.io.ObjectStreamClass$Caches$1 cannot be cast to class java.util.Map is showing in the logging when the job shutdown
- [FLINK-30334] - SourceCoordinator error splitRequest check cause HybridSource loss of data and hang
- [FLINK-30359] - Encountered NoClassDefFoundError when using flink-sql-connector-elasticsearch6
- [FLINK-30366] - Python Group Agg failed in cleaning the idle state
- [FLINK-30525] - Cannot open jobmanager configuration web page
- [FLINK-30558] - The metric 'numRestarts' reported in SchedulerBase will be overridden by metric 'fullRestarts'
- [FLINK-30637] - In linux-aarch64 environment, using “is” judgment to match the window type of overwindow have returned incorrect matching results
Improvement
- [FLINK-27327] - Add description about changing max parallelism explicitly leads to state incompatibility
- [FLINK-29134] - fetch metrics may cause oom(ThreadPool task pile up)
- [FLINK-29155] - Improve default config of grpcServer in Process Mode
- [FLINK-29244] - Add metric lastMaterializationDuration to ChangelogMaterializationMetricGroup
- [FLINK-29458] - When two tables have the same field, do not specify the table name,Exception will be thrown：SqlValidatorException :Column 'currency' is ambiguous
- [FLINK-29639] - Add ResourceId in TransportException for debugging
- [FLINK-29693] - MiniClusterExtension should respect DEFAULT_PARALLELISM if set
- [FLINK-29834] - Clear static Jackson TypeFactory cache on CL release
- [FLINK-29966] - Replace and redesign the Python api documentation base
- [FLINK-30016] - Update Flink 1.16 release notes about updated oshi-core
- [FLINK-30116] - Don't Show Env Vars in Web UI
- [FLINK-30183] - We should add a proper error message in case the deprecated reflection-based instantiation of a reporter is triggered
- [FLINK-30357] - Wrong link in connector/jdbc doc.
- [FLINK-30436] - Integrate Opensearch connector docs into Flink docs v1.16
- [FLINK-30592] - The unsupported hive version is not deleted on the hive overview document
- [FLINK-30633] - Update AWS SDKv2 to v2.19.14
- [FLINK-30724] - Update doc of kafka per-partition watermark to FLIP-27 source
Technical Debt
- [FLINK-27731] - Remove Hugo Modules integration
- [FLINK-29157] - Clarify the contract between CompletedCheckpointStore and SharedStateRegistry
- [FLINK-29957] - Rework connector docs integration
- [FLINK-29958] - Add new connector_artifact shortcode
- [FLINK-29972] - Pin Flink docs to Elasticsearch Connector 3.0.0
- [FLINK-29973] - connector_artifact should append Flink minor version
- [FLINK-30291] - Integrate flink-connector-aws into Flink docs
- [FLINK-30382] - Flink 1.16 to integrate KDS/KDF docs from flink-connector-aws
- [FLINK-30383] - UseLogicalIdentifier makes datadog consider metric as custom


{% load static %}
Owned Refrigerators:
Friends' Refrigerators:
The currently displayed fridge.
The primary fridge is loaded on log in.
No Refrigerators. Please Add One.


Democrats question FAA decisions on two Boeing safety issues
Two Democratic U.S. House lawmakers said on Thursday the Federal Aviation Administration overruled agency technical specialists on two Boeing Co safety issues involving the 737 MAX rudder cable and lightning protection for the 787 Dreamliner that it said could be "potentially catastrophic."
WASHINGTON: Two Democratic U.S. House lawmakers said on Thursday the Federal Aviation Administration overruled agency technical specialists on two Boeing Co safety issues involving the 737 MAX rudder cable and lightning protection for the 787 Dreamliner that it said could be "potentially catastrophic."
Representative Peter DeFazio, who chairs the House Transportation and Infrastructure Committee, and Rick Larsen, who chairs the aviation subcommittee, said in a letter that FAA management ultimately overruled after Boeing objected and "raise questions about how the agency weighs the validity of safety issues raised by its own experts."
(Reporting by David Shepardson; Editing by Chris Reese)


pyscan.
max_halfplane
(net, mpts, bpts, disc_f)¶Scans the set of halfplanes defined by the points in the net and maximizes the function disc_f with respect to the fraction of points contained in mpts and bpts. Function takes \(O(ns\log n)\) where n is the net size and s is the size of the mpts and bts.
| Parameters: |
|
|---|---|
| Return type: | Tuple of the found halfplane and the maximum disc_f value |
pyscan.
max_halfplane_fast
(r, mpts, bpts, disc_f)¶HERE BE DRAGONS!!! This method is still experimental and somewhat broken. This method uses a different method to scan the set of potential halfplanes with respect to the fraction of points contained in mpts and bpts. This code could potentially be much faster than the standard max_halfplane method.
| Parameters: |
|
|---|---|
| Return type: | Tuple of the found halfplane and the maximum disc_f value |
pyscan.
max_halfspace
(net, mpts, bpts, disc_f)¶Scans the set of halfspaces defined by the points in the net and maximizes the function disc_f with respect to the fraction of points contained in mpts and bpts. Function takes \(O(n^2s\log n)\) where n is the net size and s is the size of the mpts and bts.
| Parameters: |
|
|---|---|
| Return type: | Tuple of the found halfspace and the maximum disc_f value |
pyscan.
max_disk
(net, mpts, bpts, disc_f)¶Scans the set of disks defined by the points in the net and maximizes the function disc_f with respect to the fraction of points contained in mpts and bpts. Function takes \(O(n^2s\log n)\) where n is the net size and s is the size of the mpts and bts.
| Parameters: |
|
|---|---|
| Return type: | Tuple of the found disk and the maximum disc_f value |
pyscan.
max_disk_scale
(net, mpts, bpts, min_res, disc_f)¶Scans the set of disks defined by the points in the net, between the min_res and 2 * min_res and maximizes the function disc_f with respect to the fraction of points contained in mpts and bpts. Internally we use the disk radius restriction to ignore far away points and prune out many potential disks. This can significantly decrease the amount of time the method takes to find the best region. In worst case this method will still take \(O(n^2s\log n)\) where n is the net size and s is the size of the mpts and bts, but usually runtime will be much less.
| Parameters: |
|
|---|---|
| Return type: | Tuple of the found disk and the maximum disc_f value |
pyscan.
max_subgrid
(grid, disc_f)¶Finds the maximum subgrid exactly by enumerating all the subgrids and computing disc_f on each subgrid. Takes \(O(n^4)\) where the grid is \(n \times n\).
| Parameters: |
|
|---|---|
| Return type: | The maximum subgrid found. |
pyscan.
max_subgrid_linear
(grid, x, y)¶Finds the maximum subgrid with respect to the linear function \(f(m, b) = xm + yb\) exactly by using the Kadane algorithm. Takes \(O(n^3)\) where the grid is \(n \times n\).
| Parameters: |
|
|---|---|
| Return type: | The maximum subgrid found. |
pyscan.
max_subgrid_linear_theory
(grid, r, x, y)¶Finds an approximate maximum subgrid with respect to the linear function \(f(m, b) = xm + yb\) using the algorithm from [MP18a]. Takes \(O(n^2 + r^2 \log r)\) where the grid is \(n \times n\). :param grid: A Grid object :param r: Determines how frequently to approximate the subgrids. See [MP18a] for details. :param x: Double defines linear function. :param y: Double defines linear function. :rtype: The maximum subgrid found.
pyscan.
max_subgrid_convex
(grid, eps, disc_f)¶Approximately finds the maximum subgrid of the grid with error eps by successively computing the maximum subgrid with respect to various linear function using the Kadane algorithm. Takes \(O(\frac{1}{\sqrt{\varepsilon}} n^3)\) where the grid is \(n \times n\).
| Parameters: |
|
|---|---|
| Return type: | The maximum subgrid found. |
pyscan.
max_subgrid_convex_theory
(grid, eps, disc_f)¶Approximately finds the maximum subgrid of the grid with error eps by successively computing the maximum subgrid with respect to various linear function using the algorithm from [MP18a]. Takes \(O(\frac{1}{\sqrt{\varepsilon}} n^2 \log n)\) where the grid is \(n \times n\). This method is depreciated and will be replaced shortly.
| Parameters: |
|
|---|---|
| Return type: | The maximum subgrid found. |
pyscan.
max_rectangle
(mpts, bpts, eps, x, y)¶pyscan.
max_rectangle_heap
(mpts, bpts, x, y)¶Implements the algorithm from [APV06][DGM95] to scan the data set in \(s^2 \log s\) time. We use a Treap based rotation scheme to keep the tree balanced.
| Parameters: |
|
|---|---|
| Return type: | The maximum rectangle found. |
pyscan.
ham_tree_sample
(pts, size)¶Takes the list of pts and computes a ham tree sample [MP18b]. This method can shrink the size of the sample significantly while preserving the error with respect to halfplanes. This serves as a useful preprocessing step for speeding up halfplane scanning. In theory sample sizes go from \(O(\frac{1}{\varepsilon^2}\) to \(O(\frac{1}{\varepsilon^{1.53..}}\log^{.766}\frac{1}{\varepsilon})\) where \(\varepsilon\) is the absolute fraction of misplaced points in a halfplane.
| Parameters: | pts – List of WPoints |
|---|---|
| Return type: | List of WPoints |
pyscan.
max_halfplane_labeled
(net, lmpts, lbpts, disc_f)¶Scans the set of halfplanes defined by the points in the net and maximizes the function disc_f with respect to the labeled sets of points lmpts and lbpts. If two points with the same label are in the same region then the two points only contribute one of their weights to the region. This algorithm runs in time \(O(ns \log n)\) where n is the net size and s is the size of the lmpts and lbpts.
| Parameters: |
|
|---|---|
| Return type: | Tuple of the found halfplane and the maximum disc_f value |
pyscan.
max_halfspace_labeled
(net, lmpts, lbpts, disc_f)¶Scans the set of halfspaces defined by the points in the net and maximizes the function disc_f with respect to the labeled sets of points lmpts and lbpts. If two points with the same label are in the same region then the two points only contribute one of their weights to the region. This algorithm runs in time \(O(n^2s \log n)\) where n is the net size and s is the size of the lmpts and lbpts.
| Parameters: |
|
|---|---|
| Return type: | Tuple of the found halfspace and the maximum disc_f value |
pyscan.
max_disk_labeled
(net, lmpts, lbpts, disc_f)¶Scans the set of disks defined by the points in the net and maximizes the function disc_f with respect to the fraction of points contained in lmpts and lbpts. Points with identical labels are not double counted if they are contained in the same region. In worst case this method will still take \(O(n^2s\log n)\) where n is the net size and s is the size of the lmpts and lbts.
| Parameters: |
|
|---|---|
| Return type: | Tuple of the found disk and the maximum disc_f value |
pyscan.
max_disk_scale_labeled
(net, lmpts, lbpts, compress, min_res, disc_f)¶Scans the set of disks defined by the points in the net and maximizes the function disc_f with respect to the fraction of points contained in lmpts and lbpts. Only considers disks with radii between min_res and 2 * min_res. This method internally maps the disk scanning problem to halfplane scanning. Using this mapping we can compress sets of points with the same labels. This compression step can significantly improve the runtime and doesn’t incurr any extra error. In worst case this method will still take \(O(n^2s\log n)\) where n is the net size and s is the size of the lmpts and lbts, but in practice this method should be much faster than this.
| Parameters: |
|
|---|---|
| Return type: | Tuple of the found disk and the maximum disc_f value |
pyscan.
max_disk_scale_labeled_alt
(net, lmpts, lbpts, min_res, disc_f)¶Scans the set of disks defined by the points in the net and maximizes the function disc_f with respect to the fraction of points contained in lmpts and lbpts. Only considers disks with radii between min_res and 2 * min_res. This method internally directly scans disks and lacks the compression step found in the previous algorihtm, so it is slighlty slower in practice then the previous method with compression turned off. In worst case this method will still take \(O(n^2s\log n)\) where n is the net size and s is the size of the lmpts and lbts, but in practice this method should be much faster than this.
| Parameters: |
|
|---|---|
| Return type: | Tuple of the found disk and the maximum disc_f value py::def(“max_rect_labeled”, &pyscan::max_rect_labeled); py::def(“max_rect_labeled_scale”, pyscan::max_rect_labeled_scale); |
pyscan.
max_rect_labeled
(r, max_width, lmpts, lbpts, disc_f)¶Scans an approximate set of rectangles smaller than max_width in lmpts and lbpts by using a grid where each row and column of the grid can have at most \(1/r\) fraction of the total weight.
| Parameters: |
|
|---|---|
| Return type: | Tuple of the found rectangle and the maximum disc_f value |
pyscan.
max_rect_labeled_scale
(r, max_width, alpha, lmpts, lbpts, disc_f)¶Creates a regular sparse grid of size \(1/alpha \times 1/alpha\) and then considers subgrids of max_width size containing a large enough fraction of points to be worth scanning. On these small subgrids this method constructs a new grid such that each row and column of this grid can have at most \(1/r\) fraction of the total weight and then scans ever subgrid of this new grid. This method is usually faster than the previous method, but introduces some spatial error \(\alpha\).
| Parameters: |
|
|---|---|
| Return type: | Tuple of the found rectangle and the maximum disc_f value |
These methods use different scan statistics than the purely combinatorial versions.
pyscan.
gaussian_kernel
(bandwidth)¶Constructs a gaussian kernel to be used with the smooth scanning function of form \(1/\sqrt{2 \pi} \exp(-u^2/(2 b^2))\) where b is bandwidth.
| Parameters: | bandwidth – double (kernel bandwidth) |
|---|
pyscan.
Bernouli_K
(kernel)¶Constructs a discrepancy object that can be used to scan in the smooth scanning functions. The kernel parameter defines how distance is measured and how the bandwidth is determined.
| Parameters: | kernel – The kernel used to determine distance. |
|---|
pyscan.
max_annuli
(net, mpts, bpts, radii, disc_f)¶Scans the set of annuli with radii defined by radii and the points in the net. For each annuli we maximizes the function disc_f with respect to the mpts and bpts.
| Parameters: |
|
|---|---|
| Return type: | Tuple of a disk of radius equal to radii[-1] centered at the annuli and the maximum disc_f value |
pyscan.
max_annuli_scale
(net, mpts, bpts, radii, disc_f)¶Scans the set of annuli with radii defined by radii and the points in the net. For each annuli we maximizes the function disc_f with respect to the mpts and bpts. This version ignores far away points, so in theory can be much faster than the previous version.
| Parameters: |
|
|---|---|
| Return type: | Tuple of a disk of radius equal to radii[-1] centered at the annuli and the maximum disc_f value |
pyscan.
max_annuli_scale_multi
(net, mpts, bpts, res_scales, max_radii, disc_f)¶Scans the set of annuli with radii less than max_radii. The algorithm uses the res_scales to define levels in the annuli for approximating the kernel values. For each annuli we maximizes the function disc_f with respect to the mpts and bpts. This version ignores far away points and uses a more efficient method for scanning all the annuli. In theory the runtime of this method should be as good or even better than the previous algorithm, but in practice is probably slightly slower.
| Parameters: |
|
|---|---|
| Return type: | Tuple of a disk of radius equal to radii[-1] centered at the annuli and the maximum disc_f value |


ngCsv
example
Filename
Field separator
Export to CSV
Export to CSV with header
Export with ng-click
With BOM
Add row


About
I'm a technically minded individual who enjoys finding solutions through software.
Skills: (software) Ruby, HTML5, CSS3, JavaScript/jQuery, AJAX, AWS (Elastic Beanstalk, RDS, EC2, S3) Git, SQL, Oauth, APIs, Sketchup, Shopify, Spree
(network) Cisco, VoIP and Data, Call Manager, VMware, Opengear
Previously: (Until Feb/2018)
I worked for a big (the biggest) e-commerce company where I was responsible for multiple technical roles in daily operations. I also helped to develop more efficient automated processes for associates working in the warehouse. I was previously in Network Engineering using Cisco switches and routers. I also set up a VoIP networks and configured IP phones and gateways with Call Manager.
In my spare time I've been working on my own projects. Recently I completed CAD concept models and 3D printing prototypes. I submitted a provisional patent application and will next be creating a crowdfunding video. (updated 11/24/18)
more...
I love to have fun! I'm also extremely competitive and that competition to produce the best results is what drives me. Fortunately, it's usually internalized so I come off very laid back, and I am for the most part. It's not about winning but the satisfaction that comes with my ability to help others reach their goals too.


Videos
General Videos
High School Tournaments
Middle School Tournaments
Tongal Videos
Other
Pictures
Logos
Teams may use these logos for t-shirts, publicity, and other materials as long as:
-
The Logos may not be modified in any way other than rendering in a monochromatic way; the images may not be trimmed, cropped, changed in aspect ratio, or modified in any other fashion.
-
The only exception to (1) is that the logos of the sponsoring organization (DARPA, MIT, CASIS, Top Coder, MAP, Aurora, SSL, and MIT) may be separated and placed elsewhere in the design. However these logos must appear in the design and cannot be re-ordered, re-shaped, trimmed, cropped, or modified in any way other than for monochromatic rendering.
-
The Logos may not be used in any way that can be interpreted as the Zero Robotics program supporting any type of organization, company, or event other than the Zero Robotics competition the team is participating.
-
The Logos may not be used in any way that can be interpreted as the Zero Robotics program giving preference to any team, alliance, school, or organization participating in the program.
Zero Robotics Program Logos
CosmoSPHERES Tournament Logo
Past High School Tournament Logos
2012
RetroSPHERES Tournament Logo
High School
Middle School
Flyers
Other


To past me, from future me – some words of advice.
1. Write clear emails.
A well-written email will establish goodwill for yourself, bring others in to your perspective, and save both time and energy in the long run.
Before you write an email, know the context of the situation. Ask yourself this: who holds power in this situation, and what are the expectations from all parties coming into the conversation? Then, figure out what information you need to include and which expectations you need to set in order to meet your own goals.
People have short attention spans, and work emails are not a great medium to include subtle implications. If you want something to happen, then be very direct or else it will be misunderstood.
On a similar note, keep it simple. No one wants to read paragraphs that are more than four lines long, unless they’re already expecting to dive deep into the details on a shared project. If you find yourself writing a longer email than you were expecting, a quick 5-10 minute phone call goes a long way.
Speaking of phone calls: know when to call it quits with email. It’s useful to have a written record of communication, but if you’re constrained by a deadline, it is worth calling or even visiting someone in person to make sure something gets done.
2. Listen attentively, speak confidently, and act decisively.
When presented with a question, always make sure to listen and ask questions until you fully understand the situation. Again, keep the context in mind: know who you’re talking to and what’s important to them.
I’m often filled with a paralyzing need to find The Perfect Answer™, but I’ve began to accept that nothing I’m working on will be absolutely perfect – while there are right and wrong answers when you’re doing homework or taking a test for school, the lines are often blurred when working for a company. It’s absolutely okay to be uncertain about the conclusions you’ve come to, but it’s important to confidently communicate where that uncertainty comes from and establish the best path forward when tackling a problem. Don’t be afraid to say you don’t know an answer and ask to follow-up on it later.
If you need to act, then do it decisively.1 Trust that you’ve made the best decision with the information you have. If you’re proven wrong, no worries – just adapt to the new knowledge you’ve been given and move on. It’ll inspire confidence and trust from those around you.
3. Set aside time to learn and experiment.
I am a strong believer that low-stakes, unstructured “play” time is the best way to grow your curiosity and learn.
At a full-time job, it can be hard to find time for yourself, especially when you’re running from meeting to meeting on a tight schedule and struggling to get your work done. Be deliberate about setting boundaries so that you’re able to work in a way that suits you best; ultimately, a better environment for youself leads to happier and more productive work.
I find it important to make a space for myself with no expectations to produce anything of value, so I can experiment (and fail!) with new ideas. In this way, I’m able to take a break from higher-stress work, learn, and recharge at the same time by following my curiosity wherever it takes me.
4. Make decisions for the long-term.
It’s easy to get caught up in the day-to-day tasks and drama of a workplace environment, but make sure to put the decisions you make for the short term in perspective of the long run.
Before you send an angry email, think about whether you’ll regret sending it a month later.
Before you make decisions about taking (or not taking) on an extra project, think about whether it’s consistent with your goals.

5. Find joy outside of work.
Sure – work can be fulfilling, but it can also suck. At its best, you are making a real difference in the lives of other people, and at its worst, you are a cog of a capitalist machine that values you only for your ability to create profits which will then be distributed in a system that entrenches power for those who already hold it.
Make sure to take care of yourself by finding activities that you enjoy and participating in those activities.
-
Take this post, for example. Am I in any position to share my advice with anyone? Arguable. Will I still write this post? Well, see for yourself. ⤴


lrepeat - Build a list by repeating elements
lrepeat number element1 ?element2 element3 ...?
The lrepeat command creates a list of size number * number of
elements by repeating number times the sequence of elements
element1 element2 .... number must be a positive integer,
elementn can be any Tcl value. Note that lrepeat 1 arg ...
is identical to list arg ..., though the arg is required
with lrepeat.
lrepeat 3 a
→ a a a
lrepeat 3 [lrepeat 3 0]
→ {0 0 0} {0 0 0} {0 0 0}
lrepeat 3 a b c
→ a b c a b c a b c
lrepeat 3 [lrepeat 2 a] b c
→ {a a} b c {a a} b c {a a} b c
list, lappend, linsert, llength, lset
element, index, list
Copyright © 1995-1997 Roger E. Critchlow Jr.
Copyright © 2003 by Simon Geard. All rights reserved.


Custom Workflow and Login Example
Hello!
This demonstration highlights the flexibility of the Okta cloud platform and SDK.
This example user Okta Spring Boot Starter to add the Authorization Code Flow to your application.
When you click the login button below, you will prompted to login with an account on this org or with social or federated partner.
This example supports registration for new users into this Okta org. Click register below to follow an enrollment workflow.
Complete Account
We just need a little more information to get your account setup.
Welcome back, Joe Coder!
You have successfully authenticated against your Okta org, and have been redirected back to this application.
Visit the My Profile page in this application to view the information retrieved with your OAuth Access Token.


Big courtroom thrillers have always captivated America. O.J. Simpson, Tom Capano, The Menendez Brothers. All these names are synonymous to Americans and courtrooms. And, of course, courtroom dramas are not a new topic to Hollywood. Whether it be John Grisham's thrilling novels or television's famous dramas, the courtroom has always provided big bucks. So when I rented A Civil Action, I was expecting the film to be like The Rainmaker, a brilliant law film that kept viewers on the edge of their seat. However, what I saw in A Civil Action was far different from what I expected, a major surprise, but fortunately, a pleasant one.
John Travolta always seems to come up big when you least expect it. No one expected him to light up the screen in Grease, nor in Saturday Night Fever. But, whenever he gets knocked down, he always seems to come back fighting. A Civil Action is not John's best performance, but a strong one that could rival any performance in 1998. Travolta proves that a normal and believable performance can vault a film into Oscar nominations. His performance is not flashy, nor memorable, just solid. If he delivered the only solid performance, this film would still be average. Luckily, he has a strong supporting cast.
William H. Macy is probably one of the most underrated actors in Hollywood. He continues to deliver great performances one after the other, but he is still regarded as a secondary actor. In A Civil Action, he delivers yet another great performance as Travolta's paranoid and greedy accountant. He is not a lovable character, but a character who stands out in your mind whenever you think of the film. He is not one of the big time lawyers, just a measly accountant. But, he delivers one of the best supporting roles of 1998, but there is actually someone better in A Civil Action.
Robert Duvall is also an underrated actor. He gets many leading roles, but is never heard when you hear of big box office draws like Tom Hanks, Brad Pitt and Jim Carrey. Duvall has a supporting role in this as a lawyer of the co-defendant. Duvall is magical in this role. He is the wise teacher, who not only battles it out in the courtroom, but also manages to teach every major player a lesson, in his own twisted way.
In many non-comedic films, directors are always trying to find a way to implement a touch of comedy, to keep the audience on their toes. Unfortunately, they usually just key in on one character whose main objective is to be funny (Jar-Jar Binks, anyone?). However, this usually backfires because the character is never fully developed. This is not the case in A Civil Action. They have comedy coming from all sides. Whether it be Duvall's inane questions or Macy's sharp anger, the laughs come in a steady pace. Granted, it's not roll in the aisle funny, but it provides a nice addition to the film.
The plot is terrific- somewhat. The setup is nice with the film actually starting with a victory in the courtroom. Then the case that will make or break Jan (Travolta)'s career rears its ugly head. They find out the goldmine involved with the case and wind up taking it. However, budgets soon flounder and Jan finds himself in deep debt. I will not spoil the rest, although I must speak of the one downside to the film. The courtroom debates are great, but the actual problem they are fighting for is never fully explored. It left me somewhat confused, although the rest of the film is terrific.
All in all, John Travolta is back yet again in this great film. His supporting cast, consisting of Macy and Duvall, turn in tremendous performances, which ease the load on Travolta. The film is smart, witty and thought provoking. Not only does it gauge in-court battles, but also the various tolls it can take on the major players. A Civil Action provides everything a drama lover craves.
Rating: 3 ½ Stars Out of 4 Stars.
The Movie Page- http://jump.to/moviepage Reviews, Previews, News and So Much More!
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Emotional Intelligence
What is emotional intelligence?
Emotional intelligence is the measure of a person’s ability to identify and manage their own emotions. It is an awareness of one’s own feelings and how they can affect or be affected by their emotions. It also extends to awareness of the emotions of others around them and how their emotions are affected by events. Emotional intelligence is linked to several valuable skills in personal and professional life including effective communication, conflict defusal and leadership ability.
How is it different to IQ?
High EQ is more to do with knowledge of oneself and the ability to observe and learn more about the self and others emotionally. EQ is related to skills and abilities that consider real world context, accounting for the individuality of the people, environment and situations.
IQ is a measure of someone’s intelligence when it comes to academic knowledge and skills. IQ is measured by a series of standardized tests and doesn’t necessarily take real world applications and contexts into account, focusing more on theoretical situations.
Why is it important?
Having a high EQ has a much stronger correlation to workplace and personal success than IQ does. This is because high EQ is linked to good management, work ethic, teamwork and leadership skills. People with a higher EQ are more adept at managing their emotions and acting to secure better emotional outcomes for themselves and others. People with a high IQ may not have the necessary emotional skills to apply their academic knowledge in meaningful contexts, skills which are crucial to advancing and succeeding in a work environment and many aspects of one’s personal life.


We've recently encountered an interesting problem:
One of our applications had a service using .net remoting with
impersonation turned on.
Inside this service we had some code using
WindowsIdentity.GetCurrent()
to find the user in AD and check some of its properties.
Our issue was thus:
- User
X
logs in and uses the service. All is well. - User
X
has itsLogonName
andSAMAccountName
changed toY
- User
Y
logs on and uses the service. - When the service is calling
WindowsIdentity.GetCurrent()
, the username returned isX
, even though the name has changed. - After restarting the server (not only the service, the entire OS), All is well (until the next time a user chnages the LogonName).
We eventually discovered that WindowsIdentity uses LsaLookupSids, which caches the SID/username mappings instead of asking the DC again. To prevent that, there is a registry value that can be changed to stop caching, according to kb946358:
System\CurrentControlSet\Control\Lsa:LsaLookupCacheMaxSize=0
I made it into a little script, that we used as a mid-term solution to clear the server's cache without disrupting service:
param([string[]]$servers)
$servers | %{
$base = [microsoft.win32.registrykey]::OpenRemoteBaseKey('LocalMachine',$_)
$sub = $base.OpenSubKey('System\CurrentControlSet\Control\Lsa',$true)
$sub.SetValue('LsaLookupCacheMaxSize',0)
Start-Sleep -Seconds 5
$sub.DeleteValue('LsaLookupCacheMaxSize')
$sub.Close()
$base.Close()
}
Enjoy!


Engines That Move Markets
Technology Investing from Railroads to the Internet and Beyond
Alasdair Nairn
Second Edition


INDRA
Client
Corpus
Lang
Mind
Reports
Mail
State
Docs
Help
Offer to install the Indra AI, and become an IndraAI Mind Cadet
SNACKS!


| 043:021 Khan | : |
Or have We given them any Book before this (the Qur'an), to which they are holding fast? |
| 043:021 Maulana | : |
Or have We given them a Book before it so that they hold fast to it? |
| 043:021 Pickthal | : |
Or have We given them any scripture before (this Qur'an) so that they are holding fast thereto? |
| 043:021 Rashad | : |
Have we given them a book before this, and they are upholding it? |
| 043:021 Sarwar | : |
Had We, before sending the Quran, given them a book to which they now refer as an authority?. |
| 043:021 Shakir | : |
Or have We given them a book before it so that they hold fast to it? |
| 043:021 Sherali | : |
Have WE given them a Scripture before this, so that they are holding fast to it? |
| 043:021 Yusufali | : |
What! have We given them a Book before this, to which they are holding fast? |
Concepts/Themes Covered: أركان الإسلام > التوحيد > الشرك والمشركون > الشُبَه التي يحتج بها المشركون Pillars of Islam> Islamic> Polytheism and the Polytheists> The Pretexts Offered by the Polytheists as a Proof أركان الإسلام > التوحيد > الكافرون > التهكم بالكفار Pillars of Islam> Islamic> The Disbelievers> The Mockery against the Disbelievers الإيمان > الملائكة > الإيمان بهم Faith> The Angels> To Believe in them
This tool uses eight English parallel translations for the Holy Quran imported from Mr. Clay Smith. You can also visit Qurany Concepts for browsing the Quran themes or topics. If you want to search the Holy Quran for keywords, please visit Qurany Keywords.