The authentication options specify the suite of keys, select the key for each configured association and manage the configuration operations, as described below. The auth flag which controls these functions can be set or reset by the enable and disable configuration commands and also by remote configuration commands sent by a ntpdc program running in another machine. If this flag is set, persistent peer associations and remote configuration commands are effective only if cryptographically authenticated. If this flag is disabled, these operations are effective even if not cryptographic authenticated. It should be understood that operating in the latter mode invites a significant vulnerability where a rogue hacker can seriously disrupt client operations.
The auth flag affects all authentication procedures described below; however, it operates differently if cryptographic support is compiled in the distribution. If this support is available and the flag is enabled, then persistent associations are mobilized and remote configuration commands are effective only if successfully authenticated. If the support is unavailable and the flag is enabled, then it is not possible under any conditions to mobilize persistent associations or respond to remote configuration commands. The auth flag normally defaults to set if cryptographic support is available and to reset otherwise.
With the above vulnerabilities in mind, it is desirable to set the auth flag in all cases. One aspect which is often confusing is the name resolution process which maps server names in the configuration file to IP addresses. In order to protect against bogus name server messages, this process is authenticated using an internally generated key which is normally invisible to the user. However, if cryptographic support is unavailable and the auth flag is enabled, the name resolution process will fail. This can be avoided either by specifying IP addresses instead of host names, which is generally inadvisable, or by leaving the flag disabled and enabling it once the name resolution process is complete.
When ntpd is first started, it reads the key file and installs the keys in the key cache. However, the keys must be activated before they can be used with the trusted command. This allows, for instance, the installation of possibly several batches of keys and then activating or inactivating each batch remotely using ntpdc. This also provides a revocation capability that can be used if a key becomes compromised. The requestkey command selects the key used as the password for the ntpdc utility, while the controlkey command selects the key used as the password for the the ntpq utility.
The autokey scheme is specifically designed for multicast modes, where clients normally do not send messages to the server. In these modes, the server uses the scheme to generate a key list by repeated hashing of a secret value. The list is used in reverse order to generate a unique session key for each message sent. The client regenerates the session key and verifies the hash matches the previous session key. Each message contains the public values binding the session key to the secret value, but these values need to be verified only when the server generates a new key list or more than four server messages have been lost.
The scheme is appropriate for client/server and symmetric-peer modes as well. In these modes, the client generates a session key as in multicast modes. The server regenerates the session key and uses it to formulates a reply using its own public values. The client verifies the key identifier of the reply matches the request, verifies the public values and validates the message. In peer mode, each peer independently generates a key list and operates as in the multicast mode.
The autokey scheme requires no change to the NTP packet header format or message authentication code (MAC), which is appended to the header; however, if autokey is in use, an extensions field is inserted between the header and MAC. The extensions field contains a random public value which is updated at intervals specified by the revoke command, together with related cryptographic values used in the signing algorithm. The format of the extensions field is defined in Internet Draft draft-NTP- auth-coexist-00.txt. The MAC itself is constructed in the same way as NTPv3, but using the original NTP header and the extensions field padded to a 64-bit boundary. Each new public value is encrypted by the host private value. It is the intent of the design, not yet finalized, that the public value, encrypted public value, public key and certificate be embedded in the extensions field where the client can decrypt as needed. However, the relatively expensive encryption and decryption operations are necessary only when the public value is changed.
Note that both the original NTPv3 authentication scheme and the new NTPv4 autokey scheme operate separately for each configured association, so there may be several session key lists operating independently at the same time. Since all keys, including session keys, occupy the same key cache, provisions have been made to avoid collisions, where some random roll happens to collide with another already generated. Since something like four billion different session key identifiers are available, the chances are small that this might happen. If it happens during generation, the generator terminates the current session key list. By the time the next list is generated, the collided key will probably have been expired or revoked.
While permanent keys have lifetimes that expire only when manually revoked, random session keys have a lifetime specified at the time of generation. When generating a key list for an association, the lifetime of each key is set to expire one poll interval later than it is scheduled to be used. The maximum lifetime of any key in the list is specified by the autokey command. Lifetime enforcement is a backup to the normal procedure that revokes the last-used key at the time the next key on the key list is used.
The key file uses the same comment conventions as the configuration file. Key entries use a fixed format of the form
keyno type key
where keyno is a positive integer, type is a single character which defines the key format, and key is the key itself.
The key may be given in one of three different formats, controlled by the type character. The three key types, and corresponding formats, are listed following.


This example shows how to use the Dropbox.filesUpload()
[docs] method to upload a file.
To obtain an access token for quick testing, you can go to API Explorer click the "Get Token" button on the top right, copy the token it creates and then paste it here.


Problems Seminar 1 by Jeroen Eijkens
Turn on your camera.
Turn on your camera.
Please mute your microphone.
Turn on your camera.
Please mute your microphone.
Be on time.
Turn on your camera.
Please mute your microphone.
Be on time.
Be respectful and understanding. 👌
Problems Seminar 1 by Jeroen Eijkens
Riddle: On a table there are 127 chips, of which all have one white and one blue side. Of the 127 chips, 40 are lying blue side up. The assignment is to, while being blindfolded, divide these chips into two groups, with both groups having the same number of chips with the blue side facing up. You may only slide or flip the chips. How can you ensure this?
Group 1
$x$ blue chips
Group 2
$6-x$ blue chips
Group 1 flipped
$6-x$ blue chips
Group 2
$6-x$ blue chips
Problems Seminar 1 by Jeroen Eijkens


Worldwide CO
2
Emission
1992
Industry:
Total CO
2
Electric and Heat
Manufacturing
Transportation
Fuel Combustion
Fugitive
Info
Help
Continent:
Africa
Asia
Europe
North America
Oceania
South America
Data sources
CAIT Climate Data Explorer
NASA Global Climate Change


#head title="About" />
<#nav />
Help
1. InputData(sequence or file)
sequence
file
2. Result of the job
result
3. Job list and detials
list
detials
4. Download (txt | json | xls)
txt
json
xls
<#footer />


I’m a family man, entrepreneur, scrum agilist, certified scrum product owner, software engineer, and foodie, and have been building startups all my life. I have gone through a complete cycle of E-Commerce from training, building online and mobile e-store, building payment gateways and building a fulflllment and distribution system throughout my career.
For a full CV, visit my LinkedIn. Or see a curated list of my tech community involvement.
©2019 Hazrul Azhar - Split Template by One Page Love


|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object org.cobogw.gwt.user.client.CSS
public class CSS
Defines a set of CSS attributes, values and colors as a typesafe enumeration.
All static identifiers will be in-lined by the GWT compiler and unused identifiers will be ignored. Which means no overhead is created by using this class.
This class takes care of browser incompatibilities where possible, like
CSS.A.FLOAT
or otherwise provides information regarding other
solutions.
The support for browser incompatibilities is probably not complete, if you find any issue please report.
This class is based on the W3C document 'Cascading Style Sheets Level 2 Revision 1 (CSS 2.1) Specification, W3C Candidate Recommendation 19 July 2007'. Copyright © 1994-2007 W3C (Massachusetts Institute of Technology, European Research Consortium for Informatics and Mathematics, Keio University), All Rights Reserved.
| Nested Class Summary | |
|---|---|
static class |
CSS.A
This class contains all CSS Attributes. |
static class |
CSS.V
This class contains all named (i.e. |
| Constructor Summary | |
|---|---|
CSS()
|
| Method Summary | |
|---|---|
static void |
setInlineBlock(com.google.gwt.dom.client.Element element)
Method to handle the browser specific implementation requirements for the property value 'inline-block' of the property 'display'. |
static void |
setOpacity(com.google.gwt.dom.client.Element element,
float opacity)
Set the Opacity on an element taking care of browser specific implementations. |
static void |
setProperty(com.google.gwt.dom.client.Element element,
java.lang.String name,
java.lang.String value)
Convenience method to set a style property on an element. |
static void |
setProperty(com.google.gwt.user.client.ui.Widget widget,
java.lang.String name,
java.lang.String value)
Convenience method to set a style property on a widget. |
static void |
setPropertyPx(com.google.gwt.dom.client.Element element,
java.lang.String name,
int value)
Convenience method to set a style pixel property on an element. |
static void |
setPropertyPx(com.google.gwt.user.client.ui.Widget widget,
java.lang.String name,
int value)
Convenience method to set a style pixel property on an element. |
static void |
setSelectable(com.google.gwt.dom.client.Element element,
boolean selectable)
Make an element unselectable by the user and takes care of the browser specific implementations. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public CSS()
| Method Detail |
|---|
public static void setProperty(com.google.gwt.dom.client.Element element, java.lang.String name, java.lang.String value)
The GWT compiler will optimize this method away, meaning there are no additional costs of an extra method call when using method.
element
- Element to set the property onname
- Name of the propertyvalue
- Value of the propertypublic static void setProperty(com.google.gwt.user.client.ui.Widget widget, java.lang.String name, java.lang.String value)
The GWT compiler will optimize this method away, meaning there are no additional costs of an extra method call when using method.
widget
- Widget to set the property onname
- Name of the propertyvalue
- Value of the propertypublic static void setPropertyPx(com.google.gwt.dom.client.Element element, java.lang.String name, int value)
The GWT compiler will optimize this method away, meaning there are no additional costs of an extra method call when using method.
element
- Element to set the property onname
- Name of the propertyvalue
- Value of the property in pixelspublic static void setPropertyPx(com.google.gwt.user.client.ui.Widget widget, java.lang.String name, int value)
The GWT compiler will optimize this method away, meaning there are no additional costs of an extra method call when using method.
widget
- Widget to set the property onname
- Name of the propertyvalue
- Value of the property in pixelspublic static void setInlineBlock(com.google.gwt.dom.client.Element element)
element
- Element to set the display property inline-block onhttp://www.brunildo.org/test/InlineBlockLayout.html
,
http://www.tanfa.co.uk/archives/show.asp?var=300
,
http://www.brunildo.org/test/inline-block.html
public static void setOpacity(com.google.gwt.dom.client.Element element, float opacity)
element
- Element to set opacityopacity
- value between 0 and 1public static void setSelectable(com.google.gwt.dom.client.Element element, boolean selectable)
This method will not protect you from people who want to copy content and the technique should preferable only be used on specific elements like a button.
element
- Element to make unselectableselectable
- If true
elements becomes unselectable,
if false
it becomes selectable.
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


This is a simple demo to show how you can quickly use sounds and synths to play patterns. This HTML file loads Tone.js from CDN and the browser version of Scribbletune as SCRIPT tags. It also loads a file called script.js for using these 2 libraries for generating patterns and playing them. Take a look at script.js to see the minimal code written for this demo.
Click here to view an example of using sessions and channels with multiple clips


Filters
Max Support
1
5
10
Setup
Select DOW
Monday
Tuesday
Wednesday
Thursday
Friday
Saturday
Sunday
Select HOD
0 - 5
6 - 11
12 - 17
18 - 23
Apply Filters
Selection Mode
Start
End
Path
Apply Selection


WITNESS LIST Nominations Committee February 24, 1999-1:00P Commissioner, TX Health Human Serv For: Gilbert, Don Allen (self), Austin Justice, Supreme Court of Texas For: Gonzales, Alberto R. (self), Austin Lease Board-Tx Parks and Wildlife For: Gammon, William III (self), Austin Texas Parks and Wildlife Commission For: Henry, Alvin L. (self), Houston Idsal, Katharine Armstr (self (Katharine Armstrong Idsal)), Dallas Watson, Mark E., Jr. (self), San Antonio TX Workforce Commission For: Lehman, Ron (self), Round Rock O'Mahoney, Terrence P. (self), Dallas Univ of TX System Board of Regents For: Hunt, Woody L. (self), El Paso Miller, Charles (self), Houston Romero, Raul R. (self), Houston Against: Enuha, Felicia (Anti-Racist Organizing Committee), Austin


public final class RegisterTable extends java.lang.Object implements Cloneable
PluginManager
is Firer
.
Alg
is the most abstract interface for all algorithms.
Every algorithm has a unique name. Every algorithm is registered in system register table and identified by its name.
Such system register table is modeled as this RegisterTable
class.
Actually, plug-in manager discovers automatically all algorithms via their names at the booting time and requires PluginStorage
to add such algorithms into register tables represented by RegisterTable
classes.
After Hudup framework started, it is easy to retrieve any any algorithms by looking up algorithms in register tables from PluginStorage
.
Please pay attention that system register tables are stored in a so-called plug-in storage
which is represented by PluginStorage
class.
RegisterTable
provides two important methods as follows:
register(Alg)
registers a given algorithm. This method is called by PluginManager.discover(String)
at starting time of Hudup.
A algorithm which is registered in RegisterTable
will be added in the internal map algMap
.
query(String)
retrieves an algorithm by its name with attention that such algorithm is named by returned value of its Alg.getName()
method.
Method query(String)
is often called by evaluator and recommendation service to retrieve specified algorithms.
A algorithm which is unregistered in RegisterTable
will be removed from the internal map algMap
.
Alg
interface. Alg
has five typical inherited interfaces as follows:
Recommender
.CTSManager
.DatasetParser
.ExternalQuery
.Metric
.| Modifier and Type | Class and Description |
|---|---|
static class |
RegisterTable.AlgFilter
This abstract class is used for filtering (selecting) an specified algorithm based on custom criteria.
|
| Modifier and Type | Field and Description |
|---|---|
protected static org.apache.log4j.Logger |
logger
Logger of this class.
|
| Constructor and Description |
|---|
RegisterTable()
Default constructor.
|
RegisterTable(java.util.Collection<Alg> algs)
COnstructor with specified collection of algorithms.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
canRegister(Alg alg)
Checking if it is able to register the specified algorithm.
|
void |
clear()
Clearing register table, which means that all algorithms are unregistered from this table.
|
java.lang.Object |
clone()
Any class that implements this interface must define this method to clone itself.
|
boolean |
contains(java.lang.String algName)
Testing whether or not this table registers an algorithm having specified name.
|
void |
copy(RegisterTable from)
Registering all algorithms of the specified table into this table.
|
void |
copyNewOnes(RegisterTable from)
Registering all algorithms of the specified table into this table.
|
java.util.List<Alg> |
getAlgList()
Getting list of registered algorithms.
|
java.util.List<Alg> |
getAlgList(java.util.List<java.lang.String> nameList)
Getting list of registered algorithms whose names in the specified list.
|
java.util.List<Alg> |
getAlgList(RegisterTable.AlgFilter filter)
Getting list of registered algorithms based on the specified algorithm filter.
|
java.util.List<java.lang.String> |
getAlgNames()
Return an array of names of registered algorithms.
|
Alg |
query(java.lang.String algName)
Return algorithm via name.
|
boolean |
register(Alg alg)
Registering an specified algorithm.
|
int |
size()
Getting size of this register table.
|
Alg |
unregister(java.lang.String algName)
Unregistering the algorithm (if it was registered in this table) via the specified name.
|
public RegisterTable()
public RegisterTable(java.util.Collection<Alg> algs)
algs
- specified collection of algorithms. These algorithms are registered.public boolean register(Alg alg)
alg
- specified algorithm.true
if registration is successful.public boolean canRegister(Alg alg)
alg
- specified algorithm.true
if the specified algorithm can be registered in this table.public Alg query(java.lang.String algName)
algName
- specified name.public Alg unregister(java.lang.String algName)
algName
- specified algorithm name.public java.util.List<java.lang.String> getAlgNames()
public java.util.List<Alg> getAlgList()
public java.util.List<Alg> getAlgList(RegisterTable.AlgFilter filter)
filter
- specified algorithm filter represented by RegisterTable.AlgFilter
.public java.util.List<Alg> getAlgList(java.util.List<java.lang.String> nameList)
nameList
- specified list of algorithm names.public boolean contains(java.lang.String algName)
algName
- specified algorithm name.public int size()
public void clear()
public java.lang.Object clone()
Cloneable
clone
in class java.lang.Object
public void copy(RegisterTable from)
from
- specified table.public void copyNewOnes(RegisterTable from)
from
- specified table.


Username: {{username}}
This app demonstrates how to authenticate and access protected FHIR resources.


Print Version
|
|
Overview - Quarter - Listing - 129533 ONTARIO LTD.
| Vendor Name: |
129533 ONTARIO LTD. |
| Reference Number: |
7047101 |
| Contract Date: |
2007-04-02 |
| Description of Work: |
Other professional services not otherwise specified |
| Contract Period: |
04/02/2007 to 03/31/2008 |
| Contract Value: |
$14,840.00 |
|


Shows you can dynamically set a mask on different cells. In this example pieces columns allows decimals. The other cells allow just integer values (no decimal).


TI-92 Link Protocol Guide - Variable formats
A TI-92 variable has two parts: a header and a data section. While the header may be different, the format of the data section never changes whether the variable is in a file, in a transfer packet, or in the calculator's memory. This section describes the format of the data section for most types of variables. The format for the header is described in the packet format and the file format section.
Often certain variable types such as functions or lists are included in other larger variables. When such nesting occurs, it will be noted by referencing the type of subvariable rather than expanding its components. For example, a list contained in a GDB will be referenced as a list, not as the individual fields that make up a list.
Important note: All 2- and 4-byte values in this section are big-endian (MSB first) unless specified otherwise.
There are several types of variables that the TI-92 uses.
Expressions are basic algebraic expressions like the ones entered on the home screen.
Lists are sequences of real or complex numbers used in statistical calculations.
Matrices are two-dimensional matrices with real or complex components.
Data variables are spreadsheets containing values in some cells.
Text variables are files of readable text.
Strings are sequences of text characters.
Graphics Databases (GDB's) are stored sets of graphing functions.
Figures are objects created in the geometry application.
Pictures are stored bitmaps of the graph screen.
Programs are sequences of commands.
Functions are sequences of commands that evaluate based on the values of one or more variables.
Macros are stored command sequences for the geometry application.
TI-92 expressions are tokenized and in Reverse Polish Notation (RPN). In RPN, each operand and each operator is a "symbol," which can be pushed onto a first-in-first-out (FIFO) "stack." A stack is a data structure that works like a stack of trays: new trays can be pushed onto the stack at any time, and trays on the stack can be popped off at any time, but they always come off in the reverse order than that in which they were pushed.
Operations are read from left to right. Whenever an operand is encountered, it is pushed onto the stack. Whenever an operator is encountered, it pops one or more operands off of the stack, uses them to compute the result, then pushes the result back onto the stack. The final value is the only operand left in the stack after all operations are complete. With this method, storing parenthesis is unnecessary because there are never any ambiguities as to the order of evaluation.
Click here for a list of tokens.
| Offset | Length | Description |
|---|---|---|
| 0 | 2 bytes | Number of bytes in this expression minus two for this field. |
| 2 | n bytes | Expression operands and operators, tokenized and in RPN. |
Example - expression (a+b)*c:
00 05 0B 0C 8B 0D 8F
a b + c *
A list is represented as an expression beginning with token E5h and ending with token D9h. The format of a list can be simplified as follows:
| Offset | Length | Description |
|---|---|---|
| 0 | 2 bytes | Number of bytes in this list minus two for this field |
| 2 | 1 byte | This byte always contains E5h. |
| 3 | n bytes | Element values, one by one, last to first. Each element value is a NUMBER (a group of tokens, in Reverse Polish Notation, representing a single value). |
| 3+n | 1 byte | This byte always contains D9h. |
A matrix is represented as a list of row lists. The format can be simplified as follows:
| Offset | Length | Description |
|---|---|---|
| 0 | 2 bytes | Number of bytes in this list minus two for this field |
| 1 | 1 byte | This byte always contains E5h. |
| 3 | n bytes | Rows, one by one, last to first. Each row is a List without the first two bytes. |
| 3+n | 1 byte | This byte always contains D9h. |
Data variables consist of a number of lists, functions and strings. They have the following format:
| Offset | Length | Description |
|---|---|---|
| 0 | 2 bytes | Number of bytes in this data variable minus two for this field |
| 2 | 1 byte | The number of rows in the longest column |
| 3 | 1 byte | The number of columns |
| 4 | n bytes | Column definitions, one by one, first to last. See format below. |
| 4+n | 1 byte | The number of column calculations |
| 5+n | m bytes | Column calculation definitions, one by one, first to last. See format below. |
| 5+n+m | 1 byte | The number of column titles |
| 6+n+m | x bytes | Column calculation definitions, one by one, first to last. See format below. |
| 6+n+m+x | 1 byte | This byte always contains DDh. |
Each column definition follows this format:
| Offset | Length | Description |
|---|---|---|
| 0 | 1 byte | The column number (1-based) |
| 1 | y bytes | A List representing the column |
Each column calculation definition follows this format:
| Offset | Length | Description |
|---|---|---|
| 0 | 1 byte | The column number (1-based) |
| 1 | y bytes | An Expression representing the calculation function |
Each column title definition follows this format:
| Offset | Length | Description |
|---|---|---|
| 0 | 1 byte | The column number (1-based) |
| 1 | y bytes | A String representing the column title |
Text variables have the following format:
| Offset | Length | Description |
|---|---|---|
| 0 | 2 bytes | Number of bytes in this text variable minus two for this field |
| 2 | 2 bytes | Offset, in characters, to the cursor position. |
| 4 | n bytes | Text lines (see format below) |
| 4+n | 1 byte | This byte always has a value of E0h. |
Each line of text has this format:
| Offset | Length | Description |
|---|---|---|
| 0 | 1 byte | Line type: 0Ch=page break, 20h=normal, 43h=Command, 50h=PrintObj |
| 1 | m bytes | Characters, first to last. The string is not zero-terminated. |
| 1+m | 1 byte | Line delimiter: 0Dh=line break, 00h=end of file |
Strings are represented as follows:
| Offset | Length | Description |
|---|---|---|
| 0 | 2 bytes | Number of bytes in this string minus two for this field |
| 2 | 1 byte | This byte always has a value of 0. |
| 3 | n bytes | Characters, first to last. The string is zero-terminated. |
| 3+n | 1 byte | This byte always has a value of 2Dh. |
GDB's for each graphing mode are different, but they all consist of a window setup portion and a function library portion.
All GDB have the following overall format:
| Offset | Length | Description |
|---|---|---|
| 0 | 2 bytes | Number of bytes in this GDB minus two for this field. |
| 2 | 1 byte | Number of graphs (1 or 2) |
| 3 | 1 byte | Angle mode: 01h=Radians, 02h=Degrees |
| 4 | 1 byte | Complex number mode: 01=Real, 02=Rectangular, 03=Polar |
| 5 | 1 byte | Graph mode: 01h=Function, 02h=Polar, 03h=Parametric, 04h=Sequence, 05h=3D |
| 6 | 1 byte | Active graph number (0 or 1) - Not present when #graphs=1 |
| 7 | 1 byte | Graph 2 mode (same possible values as offset 3) - Not present when #graphs=1 |
| 8 | 1 byte | Split Screen mode: 01h=Full, 02h=Top/Bottom, 03h=Left/Right - Not present when #graphs=1 |
| 9 | 1 byte | Split Screen ratio: 01h=1:1, 02h=1:2, 03h=2:1 - Not present when #graphs=1 |
| 6 or 10 (Ah) | n bytes | One or two graphs back to back (see various graph formats below). |
| 6+n or 10 (Ah)+n | 1 byte | This byte always contains DEh. |
A function-mode graph has this format:
| Offset | Length | Description |
|---|---|---|
| 0 | 10 bytes | A REAL: xmin (see REAL format, below) |
| 10 (Ah) | 10 bytes | A REAL: xmax |
| 20 (14h) | 10 bytes | A REAL: xscl |
| 30 (1Eh) | 10 bytes | A REAL: ymin |
| 40 (28h) | 10 bytes | A REAL: ymax |
| 50 (32h) | 10 bytes | A REAL: yscl |
| 60 (3Ch) | 10 bytes | A REAL: x |
| 70 (46h) | 10 bytes | A REAL: y |
| 80 (50h) | 10 bytes | A REAL: xres |
| 90 (5Ah) | 2 bytes | Graphing format flags (see graph format flags, below) |
| 92 (5Ch) | 2 bytes | Reserved; these bytes always have a value of 0h |
| 94 (5Eh) | 1 byte | The number of functions in this graph |
| 95 (5Fh) | n bytes | Function definitions, one after another (see function definition format, below). |
| 95 (5Fh)+n | 1 byte | This byte always has a value of 0. |
| 96 (60h)+n | 1 byte | Table setup flags (see table setup flags, below). |
| 97 (61h)+n | 10 bytes | A REAL: tblStart |
| 107 (6Bh)+n | 10 bytes | A REAL: tbl |
| 117 (75h)+n | x bytes | A List: tblInput |
A polar-mode graph has the following format:
| Offset | Length | Description |
|---|---|---|
| 0 | 10 bytes | A REAL: xmin (see REAL format, below) |
| 10 (Ah) | 10 bytes | A REAL: xmax |
| 20 (14h) | 10 bytes | A REAL: xscl |
| 30 (1Eh) | 10 bytes | A REAL: ymin |
| 40 (28h) | 10 bytes | A REAL: ymax |
| 50 (32h) | 10 bytes | A REAL: yscl |
| 60 (3Ch) | 10 bytes | A REAL: x |
| 70 (46h) | 10 bytes | A REAL: y |
| 80 (50h) | 10 bytes | A REAL: min |
| 90 (5Ah) | 10 bytes | A REAL: max |
| 100 (64h) | 10 bytes | A REAL: step |
| 110 (6Eh) | 2 bytes | Graphing format flags (see graph format flags, below) |
| 112 (70h) | 2 bytes | Reserved; these bytes always have a value of 0h |
| 114 (72h) | 1 byte | The number of functions in this graph |
| 115 (73h) | n bytes | Function definitions, one after another (see function definition format, below). |
| 115 (73h)+n | 1 byte | This byte always has a value of 0. |
| 116 (74h)+n | 1 byte | Table setup flags (see table setup flags, below). |
| 117 (75h)+n | 10 bytes | A REAL: tblStart |
| 127 (7Fh)+n | 10 bytes | A REAL: tbl |
| 137 (89h)+n | x bytes | A List: tblInput |
A parametric-mode graph has the following format:
| Offset | Length | Description |
|---|---|---|
| 0 | 10 bytes | A REAL: xmin (see REAL format, below) |
| 10 (Ah) | 10 bytes | A REAL: xmax |
| 20 (14h) | 10 bytes | A REAL: xscl |
| 30 (1Eh) | 10 bytes | A REAL: ymin |
| 40 (28h) | 10 bytes | A REAL: ymax |
| 50 (32h) | 10 bytes | A REAL: yscl |
| 60 (3Ch) | 10 bytes | A REAL: x |
| 70 (46h) | 10 bytes | A REAL: y |
| 80 (50h) | 10 bytes | A REAL: tmin |
| 90 (5Ah) | 10 bytes | A REAL: tmax |
| 100 (64h) | 10 bytes | A REAL: tstep |
| 110 (6Eh) | 2 bytes | Graphing format flags (see graph format flags, below) |
| 112 (70h) | 2 bytes | Reserved; these bytes always have a value of 0h |
| 114 (72h) | 1 byte | The number of functions in this graph |
| 115 (73h) | n bytes | Function definitions, one after another (see parametric function definition format, below). |
| 115 (73h)+n | 1 byte | This byte always has a value of 0. |
| 116 (74h)+n | 1 byte | Table setup flags (see table setup flags, below). |
| 117 (75h)+n | 10 bytes | A REAL: tblStart |
| 127 (7Fh)+n | 10 bytes | A REAL: tbl |
| 137 (89h)+n | x bytes | A List: tblInput |
A sequence-mode graph has the following format:
| Offset | Length | Description |
|---|---|---|
| 0 | 10 bytes | A REAL: xmin (see REAL format, below) |
| 10 (Ah) | 10 bytes | A REAL: xmax |
| 20 (14h) | 10 bytes | A REAL: xscl |
| 30 (1Eh) | 10 bytes | A REAL: ymin |
| 40 (28h) | 10 bytes | A REAL: ymax |
| 50 (32h) | 10 bytes | A REAL: yscl |
| 60 (3Ch) | 10 bytes | A REAL: x |
| 70 (46h) | 10 bytes | A REAL: y |
| 80 (50h) | 10 bytes | A REAL: nmin |
| 90 (5Ah) | 10 bytes | A REAL: nmax |
| 100 (64h) | 10 bytes | A REAL: plotstrt |
| 110 (6Eh) | 10 bytes | A REAL: plotstep |
| 120 (78h) | 2 bytes | Graphing format flags (see graph format flags, below) |
| 122 (7Ah) | 1 byte | X Axis: FFh = n, 00h = u, otherwise i = ui(n). |
| 123 (7Ah) | 1 byte | Y Axis: FFh = n, 00h = u, otherwise i = ui(n). |
| 124 (7Ch) | 1 byte | The number of functions in this graph |
| 125 (7Dh) | n bytes | Function definitions, one after another (see function definition format, below). |
| 125 (7Dh)+n | 1 byte | The number of initial values in this graph |
| 126 (7Eh)+n | m bytes | Initial value definitions, one after another (see initial value definition fromat, below). |
| 126 (7Eh)+n+m | 1 byte | Table setup flags (see table setup flags, below). |
| 127 (7Fh)+n+m | 10 bytes | A REAL: tblStart |
| 137 (89h)+n+m | 10 bytes | A REAL: tbl |
| 147 (93h)+n+m | x bytes | A List: tblInput |
A 3D-mode graph has this format:
| Offset | Length | Description |
|---|---|---|
| 0 | 10 bytes | A REAL: xmin (see REAL format, below) |
| 10 (Ah) | 10 bytes | A REAL: xmax |
| 20 (14h) | 10 bytes | A REAL: xgrid |
| 30 (1Eh) | 10 bytes | A REAL: ymin |
| 40 (28h) | 10 bytes | A REAL: ymax |
| 50 (32h) | 10 bytes | A REAL: ygrid |
| 60 (3Ch) | 10 bytes | A REAL: x |
| 70 (46h) | 10 bytes | A REAL: y |
| 80 (50h) | 10 bytes | A REAL: zmin |
| 90 (5Ah) | 10 bytes | A REAL: zmax |
| 100 (64h) | 10 bytes | A REAL: zscl |
| 110 (6Eh) | 10 bytes | A REAL: eye° |
| 120 (78h) | 10 bytes | A REAL: eye° |
| 130 (82h) | 10 bytes | A REAL: An unnamed value dependent on eye° and the screen width |
| 140 (8Ch) | 10 bytes | A REAL: An unnamed value dependent on eye°, eye° and the screen height |
| 150 (96h) | 2 bytes | Graphing format flags (see graph format flags, below) |
| 152 (98h) | 2 bytes | Reserved; these bytes always contain 0. |
| 154 (9Ah) | 1 byte | The number of functions in this graph |
| 155 (9Bh) | n bytes | Function definitions, one after another (see function definition format, below). |
| 155 (9Bh)+n | 1 byte | This byte is always 0. |
The graph format flags word has the following format:
| Bit (Mask) | Mode if set (1) | Mode if clear (0) |
|---|---|---|
| 0 (0001h) | Coordinates: POLAR | Coordinates: RECT |
| 1 (0002h) | Leading Cursor: ON | Leading Cursor: OFF |
| 2 (0004h) | Labels: ON | Labels: OFF |
| 3 (0008h) | Axes: BOX | Axes: AXES |
| 4 (0010h) | Axes: OFF | Axes: ON |
| 5 (0020h) | Grid: ON | Grid: OFF |
| 6 (0040h) | Graph Order: SIMUL | Graph Order: SEQ |
| 7 (0080h) | Coordinates: OFF | Coordinates: ON |
| 8 (0100h) | Style: WIRE FRAME | Style: HIDDEN SURFACE |
| 13 (2000h) | Build Web: AUTO | Build Web: TRACE |
| 14 (4000h) | Axes: WEB | Axes: TIME or CUSTOM |
| 15 (8000h) | Axes: TIME | Axes: WEB or CUSTOM |
The table setup flags byte has the following format:
| Bit (Mask) | Mode if set (1) | Mode if clear (0) |
|---|---|---|
| 6 (0040h) | Independent: ASK | Independent: AUTO |
| 7 (0080h) | Graph <-> Table: ON | Graph <-> Table: OFF |
| Offset | Length | Description |
|---|---|---|
| 0 | 1 byte | Function ID (the number of the function). |
| 1 | n bytes | A Function yi(x), ri(), ui(n), or zi(x,y) |
Parametric-mode function definitions have the following format:
| Offset | Length | Description |
|---|---|---|
| 0 | 1 byte | Function ID (the number of the function) with bit 7 clear. |
| 1 | n bytes | A Function xti(t) |
| 1+n | 1 byte | Function ID (the number of the function) with bit 7 set. |
| 2+n | m bytes | A Function yti(t) |
REAL values referred to in the above GDB format definitions are represented by a sign bit, a 15-bit binary number containing the base-10 exponent, and a binary-coded-decimal (4 bits per decimal digit) 16-digit mantissa:
| Offset | Length | Description |
|---|---|---|
| 0 | 1 byte | Sign bit (bit 7) and upper 7 bits of exponent (bits 0-6) |
| 1 | 1 byte | Lower 8 bitts of exponent |
| 2 | 8 bytes | BCD mantissa |
There is no information available about this data type at this time.
Pictures are 128x63-pixel bitmaps. They have the following format:
| Offset | Length | Description |
|---|---|---|
| 0 | 2 bytes | Number of bytes in this picture minus two for this field |
| 2 | 2 bytes | Height, in pixels, of the picture. |
| 4 | 2 bytes | Width, in pixels, of the picture. |
| 6 | n bytes | Monochrome (1 bpp) bitmap. (n = height * ceiling[width/8] ) |
| 6+n | 1 byte | This byte always has a value of DFh. |
The following figure demonstrates byte ordering of the pixels if the bitmap for a 128x63 picture is in a 1008-element array data[]:
Programs are represented as a series of tokens in Reverse Polish Notation enclosed in the Prgm and EndPrgm tokens. They can be either tokenized or untokenized.
Untokenized programs have this format:
| Offset | Length | Description |
|---|---|---|
| 0 | 2 bytes | Number of bytes in this program minus two for this field |
| 2 | n bytes | Zero-terminated ASCII text starting with the "(" character in the program name. Line breaks are represented as 0Dh bytes. The colon (":") characters after the line breaks are not stored. |
| 2+n | 2 bytes | Offset, in characters, of the cursor from the beginning of the program |
| 4+n | 3 bytes | These three bytes always contain {19h, E4h, E5h} (Endprgm and '}' tokens). |
| 7+n | 4 bytes | These four bytes always contain {00h, 00h, 08h, DCh}. |
Tokenized programs have this format:
| Offset | Length | Description |
|---|---|---|
| 0 | 2 bytes | Number of bytes in this program minus two for this field |
| 2 | n bytes | Program tokens to be pushed onto the stack, then executed once complete. |
| 2+n | 4 bytes | These four bytes always contain {00h, 00h, 40h, DCh}. |
The program tokens are generally in reverse order of execution, following the Reverse Polish Notation method that the TI-92 uses. The first tokens in execution order specify the arguments for the program. The next token is always E5h, followed by the "Prgm" token (E4h+19h), then the program statements. Following the program statements is the "EndPrgm" token (E4h+12h), then the E9h token. Each statement is separated by a 00h byte, and line breaks are represented as E8h tokens. Statements on the same line are separated by E7h tokens.
Click here for a table of token definitions.
The format for functions is similar to the format for programs. Functions can be but are not required to be enclosed in Func and Endfunc tokens. Functions, like programs, can be tokenized or untokenized.
Untokenized functions have this format:
| Offset | Length | Description |
|---|---|---|
| 0 | 2 bytes | Number of bytes in this function minus two for this field |
| 2 | n bytes | Zero-terminated ASCII text starting with the "(" character in the function name. Line breaks are represented as 0Dh bytes. The colon (":") characters after the line breaks are not stored. |
| 2+n | 2 bytes | Offset, in characters, of the cursor from the beginning of the function |
| 4+n | 3 bytes | These three bytes always contain {17h, E4h, E5h} (Endfunc and '}' tokens). |
| 7+n | 2 bytes | These two bytes always have a value of 0. |
| 9+n | 1 byte | Flags (see format below). |
| 10 (Ah)+n | 1 byte | This byte always contains DCh. |
Tokenized functions have this format:
| Offset | Length | Description |
|---|---|---|
| 0 | 2 bytes | Number of bytes in this program minus two for this field |
| 2 | n bytes | Program tokens |
| 7+n | 2 bytes | These two bytes always have a value of 0. |
| 9+n | 1 byte | Flags (see format below). |
| 10 (Ah)+n | 1 byte | This byte always contains DCh. |
The flags byte has the following format:
| Bit (Mask) | Mode if set (1) | Mode if clear (0) |
|---|---|---|
| 0 (01h) | Graph style: 000=line, 001=dot, 010=thick line, 011=animate, 100=path, 101=shade above, 110=shade below, 111=square | |
| 1 (02h) | ||
| 2 (04h) | ||
| 3 (08h) | Untokenized | Tokenized |
| 4 (10h) | Unknown | |
| 5 (20h) | Unknown | |
| 6 (40h) | Graph 1 plot on | Graph 1 plot off |
| 7 (80h) | Graph 2 plot on | Graph 2 plot off |
There is no information available about this data type at this time.


Unit 1, Week 3 Cultural Blogpost
Thinking Styles
Sunday January 11, 2015
In today's blogpost I am going to investigate my thinking style in the Gregorc Thinking Style paradigm, how it fits into DBC and what I can do to broaden my approach to challenges. My thinking style is Abstract Sequential. People in this learning style like to be heard and analyze situations carefully before pursuing an action. The Abstract Sequential (AS) style does best with access to learning resources and are able to learn alone. AS thinkers struggle to work with those with different view points and in situations with specific rules and regulations and time constraints.
When I read these descriptions of my thinking style it sounds like bad news for how I fit into DBC. DBC does have a lot of specified rules and ways to learn and there is a significant time constraint on how we learn. I would also say so far I have spent more time learning on my own, successfully using online resources and our text, and I have struggled most with learning from other members of our cohorts.
This is only one way of looking at my interaction with DBC. The specific rules for DBC are a necessary function of remote learning on our own. We do not have the opportunity to work closely with instructors or each other yet. We need very specific guidelines and tasks to make sure everyone will be ready when we are actually learning in person at our cohort locations. The short timeframe we have to learn what we need is also a necessary function of DBC. We are entering an intensive course designed ot make us successful junior developers. After we complete our program I believe we are free to take time as we need to become better developers.
As I said above, my greatest challenge with DBC has been working with pairs. I have certainly enjoyed the people i have been able to work with, however I do feel like sometimes there was not much accomplished on my end. I think that part of my challenges with learning with pairing has been a lack of clarity of objectives of my sessions. I think it would be beneficial for me to be cognizant of my challenges as an AS thinker and make sure I have clear objectives with my pair as to what we want to learn together. This will help me learn as much as possible from these sessions.
I think it would also help me grow an appreciation for the skill of working on a team if I could find more examples in the real world of how software teams develop new ideas. This could help me expand my appreciation for working in pairs and also give me a lot more to look for in terms of learning objectives. The opportunity to pair program is worth more than just learning the task or syntax at hand, but also the ability to learn how to work as a team in general. I do feel confident in my ability to communicate so I think this is an objective I can accomplish!


--- title: sphericalRegion sidebar: function_reference_sidebar permalink: sphericalRegion.sphericalRegion.html folder: function_reference toc: false ---
The class sphericalRegion describes a region on the sphere that is bounded by small circles. For a list of normal vectors \(N_i\) and coefficients \(\alpha_i\) the region is defined as all vectors \(v\) on the sphere that satify for all \(i\) the condition
\[v \cdot N_i \le \alpha_i\]
| N | vector3d |
| alpha | double (default is 0 which corresponds to a great circle) |
| N | the normal vector3d of the bounding circles |
| alpha | the cosine of the bounding circle |
| antipodal |


Using the
Zip and Upload
feature, you can compress one or more files and/or directories in to a
single zip file and then upload the zip file to your FTP site, all in
one easy step. To do this -
FTP -> Zip and
Upload...
from the menu bar
Zip
and Upload...
from the context menu
Ctrl + Shift + F9
(Command
+ Shift + F9
on Mac OS X) key on your key board
Zip
and Upload
will be displayed.
Zip File Name
Specify a name for the target zip file
Create zip file in a temporary directory and delete it
after uploading
Select this option if you do not want to keep the zip file
on your local system. JFTP creates the zip file in a temporary
directory, uploads it and then deletes the zip file from the temporary
location.
Create zip file in a temporary directory and delete it
after uploading
option is selected by default.
Create zip file in the current working directory
Select this option to create the zip file in the current
local working directory. The zip file will stay in the working
directory even after the file is transferred.
Create zip file in the directory specified below:
Use this option if you would like to create the zip file in
a different location. Selecting this option would bring up a file
dialog using which you can locate the directory in which you would
like to save the zip file.
Browse...
Clicking on this button would open a file dialog using which you can
locate the directory in which you would like to save the zip file.
Upload
Click this button to create the zip file and to upload it to
the FTP site.
Cancel
Click this button to close the
Zip and Upload
dialog.
Help
Clicking this button displays this help topic.


Overview
Package
Class
Use
Tree
Deprecated
Index
Help
PREV LETTER
NEXT LETTER
FRAMES
NO FRAMES
All Classes
A
B
C
D
E
F
G
H
I
L
M
N
O
P
Q
R
S
T
U
V
W
S
Select
- Interface in
operator
Select Operation.
select(Population)
- Method in interface operator.
Select
select(Population)
- Method in class operator.
TournamentEqualization
select(Population)
- Method in class operator.
TournamentSelection
SemanticFitness
- Class in
fitness
Abstract class representing Semantic problems, including Order and Majority.
SemanticFitness()
- Constructor for class fitness.
SemanticFitness
SemanticMajority
- Class in
fitness
Class representing Semantic Majority problems.
SemanticMajority(int, String)
- Constructor for class fitness.
SemanticMajority
SemanticOrder
- Class in
fitness
Class representing Semantic Order problems.
SemanticOrder(int, String)
- Constructor for class fitness.
SemanticOrder
setDataValue(Boolean)
- Method in class phenotype.
BooleanPhenotype
setDataValue(Integer)
- Method in class phenotype.
IntListPhenotype
setDataValue(Double)
- Method in class phenotype.
SRPhenotype
setError(Double)
- Method in class phenotype.
SRPhenotype
setFitness(Double)
- Method in class gp.
Individual
setInputs(int)
- Method in class fitness.
BooleanFitness
setPhenotype(Phenotype)
- Method in class gp.
Individual
setSeed(long)
- Method in class gp.
MersenneTwister
Initalize the pseudo random number generator.
setSeed(int[])
- Method in class gp.
MersenneTwister
Sets the seed of the MersenneTwister using an array of integers.
setSeed(long)
- Method in class gp.
MersenneTwisterFast
Initalize the pseudo random number generator.
setSeed(int[])
- Method in class gp.
MersenneTwisterFast
Sets the seed of the MersenneTwister using an array of integers.
Sin
- Class in
math
Sin(Operator)
- Constructor for class math.
Sin
SinglePointCrossover
- Class in
operator
SinglePointCrossover(MersenneTwisterFast, int, int)
- Constructor for class operator.
SinglePointCrossover
size()
- Method in class phenotype.
BooleanPhenotype
size()
- Method in class phenotype.
IntListPhenotype
size()
- Method in class phenotype.
SRPhenotype
Sqrt
- Class in
math
Sqrt(Operator)
- Constructor for class math.
Sqrt
Square
- Class in
math
Square(Operator)
- Constructor for class math.
Square
SRDataFitness
- Class in
fitness
SRDataFitness(String)
- Constructor for class fitness.
SRDataFitness
Return an SRFitness object, built from a file of input,output datapoints.
SRFitness
- Class in
fitness
This is outlines the common operators of all fitness functions used in the symbolic regression (SR) problem type.
SRFitness()
- Constructor for class fitness.
SRFitness
SRFunctionFitness
- Class in
fitness
SRFunctionFitness(MersenneTwisterFast, String, List<String>, List<String>)
- Constructor for class fitness.
SRFunctionFitness
Create a SRFitness object from a target function specification.
SRPhenotype
- Class in
phenotype
Phenotype for Symbolic Regression problem
SRPhenotype()
- Constructor for class phenotype.
SRPhenotype
stateEquals(Object)
- Method in class gp.
MersenneTwister
stateEquals(Object)
- Method in class gp.
MersenneTwisterFast
step()
- Method in class algorithm.
AlgorithmBase
This is the heart of the algorithm.
SubtreeMutate
- Class in
operator
SubtreeMutate(MersenneTwisterFast, int)
- Constructor for class operator.
SubtreeMutate
Overview
Package
Class
Use
Tree
Deprecated
Index
Help
PREV LETTER
NEXT LETTER
FRAMES
NO FRAMES
All Classes
A
B
C
D
E
F
G
H
I
L
M
N
O
P
Q
R
S
T
U
V
W


{% extends "base.html" %} {% block title %}JeffPD{% endblock %} {% block page_content %}
Hey {{ current_user.first_name }}. Welcome to your first tech PD at IAL with Jeff Maxim for the 2015-2016 school year.
I'm here to help make your experience with technology at IAL better.
I've worked as a classroom teacher for 9 years, and I've been a classroom teacher at IAL for 3 years. That means I fully understand the successes and failures that we've had with technology at IAL in the past. I've complained about the printers being jammed, about the wifi being down. I've gotten mad when none of the student laptops are charged or working, and I've been frustrated when the students misbehave while using technology in the classroom. If you're a returning teacher, {{ current_user.first_name }}, I'm sure you can list many other frustrations that you've had with technology at IAL.
My hope is that we can solve as many of those problems as possible this year. I know there's many challenges, but I'm here to help.
My role is to coach you on how to use technology effectively in your teaching. This year, I will be helping you find fun, easy, effective, stress-free ways to use tech in your classroom with your students.
I'm also here to help you if you have ANY tech problems at school. Can't connect to email? Projector broken? Please email me, grab me while I'm walking down the hall, or let me know some other way. Remember, {{ current_user.first_name }}, I'm here to help make your experience with technology at IAL better!
Here's my FaceBook, Twitter, LinkedIn, Instagram, GitHub, Personal Blog, and my former class website. Feel free to follow me on any of them, and feel free to use any of them to contact me!
An IAL Gmail account makes communicating with coworkers, students, and parents easier, so let's get started by having you login to that account. Here's how to do that:
Your task here is to send an email to me from your IAL gmail account. It can have any subject and any body content. My email address is<EMAIL_ADDRESS>The first person from this group who successfully completes this task will win a small prize!
Here's some of the ways I'll help you this year:
You're done learning everything you need to learn in my PD session for today. I hope you had fun. Please fill out the quiz/feedback form below. When you're done, you can also checkout the bonus challenges that are below the form!
If you logged into your email, sent me an email, and completed the short quiz, you've done all the required work for my PD session. But, come on, {{ current_user.first_name }}, you're better than that, amirite? You want to learn how to use tech in some crazy, awesome ways! If you've got the time and motivation, continue on to the following, unrequired, bonus challenges!
Follow the tutorial that I've written up at this link. It'll show you all about what a google form is, how they're helpful in the classroom, and how to make a great google form to use in the classroom!
Class websites are pretty great. Here's the one I used with my students last year. They allow you to easily get materials to students, communicate news to parents, and keep administrators updated about what's going on in your classroom.
If you want to get started making your own, follow this tutorial that I've made for you!


filmcritic.com presents a review from staff member Athan Bezaitis. You can find the review with full credits at http://www.filmcritic.com/misc/emporium.nsf/60e74e041ca9cd6b8625626f0062219f/bf06d466fd88595b8825685900752b2a?OpenDocument
UNIVERSAL SOLDIER: THE RETURN
Jean-Claude's best days are behind him. Way behind him. The former martial arts champion is now graying at the temples, and he still hasn't improved on his English accent. Of course, his acting skills -- in the traditional sense of dialogue and mannerisms -- have never given us sufficient reason to watch his movies, but when his physical capabilities start to deteriorate, you know he's in trouble.
So what do you do when your star loses his signature appeal? UNIVERSAL SOLDIER: THE RETURN attempts to turn him into a sort of James Bond, allowing him to rely on high tech stunts and clever intuition rather than pure power. The problem is that nobody wants Van Damme when we've already got Arnold, Pierce Brosnan, and even Sly Stallone as kings of the one-liner action flicks. So the formula is set: a limited budget, a fallible star, and Goldberg, the WCW wrestler, as your ominous villain. The result is a predictably lackluster flick.
RETURN is the story of SETH, the uncontrollable mainframe computer, who has ordered the practically invincible UNISOL soldiers on a wild killing spree. Can Jean-Claude stop them? You'll have to rent it to find out for yourself, but I'll tell you that Jean-Claude only does his famous reverse aerial roundhouse kick to the face once.
If you're looking for a few cool fight scenes or some cheeseball special effects for a mind numbing evening then check it out. Otherwise, you'd be better off with some of JC's other combat movies like KICKBOXER or BLOOD SPORT.
2 stars
-- Christopher Null -<EMAIL_ADDRESS>- http://www.filmcritic.com
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


????? ????
on 2012-04-23 14:51:17
If I might —perhaps you should consider adding a few images. I don’t mean to disrespect what you’ve said ; its very enlightening, indeed. However, I think would respond to it more positively if they could be something tangible to your ideas
Pitouli
on 2011-06-14 14:52:26
A bigger list for replacement :
entities['38'] = '&';
entities['60'] = '<';
entities['62'] = '>';
entities['94'] = 'ˆ';
entities['126'] = '˜';
entities['130'] = '‚'; // Single Low-9 Quotation Mark
entities['131'] = 'ƒ'; // Latin Small Letter F With Hook
entities['132'] = '„'; // Double Low-9 Quotation Mark
entities['133'] = '…'; // Horizontal Ellipsis
entities['134'] = '†'; // Dagger
entities['135'] = '‡'; // Double Dagger
entities['136'] = 'ˆ'; // Modifier Letter Circumflex Accent
entities['137'] = '‰'; // Per Mille Sign
entities['138'] = 'Š'; // Latin Capital Letter S With Caron
entities['139'] = '‹'; // Single Left-Pointing Angle Quotation Mark
entities['140'] = 'Œ'; // Latin Capital Ligature OE
entities['145'] = '‘'; // Left Single Quotation Mark
entities['146'] = '’'; // Right Single Quotation Mark
entities['147'] = '“'; // Left Double Quotation Mark
entities['148'] = '”'; // Right Double Quotation Mark
entities['149'] = '•'; // Bullet
entities['150'] = '–'; // En Dash
entities['151'] = '—'; // Em Dash
entities['152'] = '˜'; // Small Tilde
entities['153'] = '™'; // Trade Mark Sign
entities['154'] = 'š'; // Latin Small Letter S With Caron
entities['155'] = '›'; // Single Right-Pointing Angle Quotation Mark
entities['156'] = 'œ'; // Latin Small Ligature OE
entities['159'] = 'Ÿ'; // Latin Capital Letter Y With Diaeresis
entities['160'] = ' '; // Non-breaking space
entities['161'] = '¡'; // Inverted exclamation mark
entities['162'] = '¢'; // Cent sign
entities['163'] = '£'; // Pound sign
entities['164'] = '¤'; // Currency sign
entities['165'] = '¥'; // Yen sign
entities['166'] = '¦'; // Broken vertical bar
entities['167'] = '§'; // Section sign
entities['168'] = '¨'; // Diaeresis
entities['169'] = '©'; // Copyright sign
entities['170'] = 'ª'; // Feminine ordinal indicator
entities['171'] = '«'; // Left-pointing double angle quotation mark
entities['172'] = '¬'; // Not sign
entities['173'] = ''; // Soft hyphen
entities['174'] = '®'; // Registered sign
entities['175'] = '¯'; // Macron
entities['176'] = '°'; // Degree sign
entities['177'] = '±'; // Plus-minus sign
entities['178'] = '²'; // Superscript two
entities['179'] = '³'; // Superscript three
entities['180'] = '´'; // Acute accent
entities['181'] = 'µ'; // Micro sign
entities['182'] = '¶'; // Pilcrow sign
entities['183'] = '·'; // Middle dot
entities['184'] = '¸'; // Cedilla
entities['185'] = '¹'; // Superscript one
entities['186'] = 'º'; // Masculine ordinal indicator
entities['187'] = '»'; // Right-pointing double angle quotation mark
entities['188'] = '¼'; // Vulgar fraction one-quarter
entities['189'] = '½'; // Vulgar fraction one-half
entities['190'] = '¾'; // Vulgar fraction three-quarters
entities['191'] = '¿'; // Inverted question mark
entities['192'] = 'À'; // A with grave
entities['193'] = 'Á'; // A with acute
entities['194'] = 'Â'; // A with circumflex
entities['195'] = 'Ã'; // A with tilde
entities['196'] = 'Ä'; // A with diaeresis
entities['197'] = 'Å'; // A with ring above
entities['198'] = 'Æ'; // AE
entities['199'] = 'Ç'; // C with cedilla
entities['200'] = 'È'; // E with grave
entities['201'] = 'É'; // E with acute
entities['202'] = 'Ê'; // E with circumflex
entities['203'] = 'Ë'; // E with diaeresis
entities['204'] = 'Ì'; // I with grave
entities['205'] = 'Í'; // I with acute
entities['206'] = 'Î'; // I with circumflex
entities['207'] = 'Ï'; // I with diaeresis
entities['208'] = 'Ð'; // Eth
entities['209'] = 'Ñ'; // N with tilde
entities['210'] = 'Ò'; // O with grave
entities['211'] = 'Ó'; // O with acute
entities['212'] = 'Ô'; // O with circumflex
entities['213'] = 'Õ'; // O with tilde
entities['214'] = 'Ö'; // O with diaeresis
entities['215'] = '×'; // Multiplication sign
entities['216'] = 'Ø'; // O with stroke
entities['217'] = 'Ù'; // U with grave
entities['218'] = 'Ú'; // U with acute
entities['219'] = 'Û'; // U with circumflex
entities['220'] = 'Ü'; // U with diaeresis
entities['221'] = 'Ý'; // Y with acute
entities['222'] = 'Þ'; // Thorn
entities['223'] = 'ß'; // Sharp s. Also known as ess-zed
entities['224'] = 'à'; // a with grave
entities['225'] = 'á'; // a with acute
entities['226'] = 'â'; // a with circumflex
entities['227'] = 'ã'; // a with tilde
entities['228'] = 'ä'; // a with diaeresis
entities['229'] = 'å'; // a with ring above
entities['230'] = 'æ'; // ae. Also known as ligature ae
entities['231'] = 'ç'; // c with cedilla
entities['232'] = 'è'; // e with grave
entities['233'] = 'é'; // e with acute
entities['234'] = 'ê'; // e with circumflex
entities['235'] = 'ë'; // e with diaeresis
entities['236'] = 'ì'; // i with grave
entities['237'] = 'í'; // i with acute
entities['238'] = 'î'; // i with circumflex
entities['239'] = 'ï'; // i with diaeresis
entities['240'] = 'ð'; // eth
entities['241'] = 'ñ'; // n with tilde
entities['242'] = 'ò'; // o with grave
entities['243'] = 'ó'; // o with acute
entities['244'] = 'ô'; // o with circumflex
entities['245'] = 'õ'; // o with tilde
entities['246'] = 'ö'; // o with diaeresis
entities['247'] = '÷'; // Division sign
entities['248'] = 'ø'; // o with stroke. Also known as o with slash
entities['249'] = 'ù'; // u with grave
entities['250'] = 'ú'; // u with acute
entities['251'] = 'û'; // u with circumflex
entities['252'] = 'ü'; // u with diaeresis
entities['253'] = 'ý'; // y with acute
entities['254'] = 'þ'; // thorn
entities['255'] = 'ÿ'; // y with diaeresis
entities['264'] = 'Ĉ'; // Latin capital letter C with circumflex
entities['265'] = 'ĉ'; // Latin small letter c with circumflex
entities['338'] = 'Œ'; // Latin capital ligature OE
entities['339'] = 'œ'; // Latin small ligature oe
entities['352'] = 'Š'; // Latin capital letter S with caron
entities['353'] = 'š'; // Latin small letter s with caron
entities['372'] = 'Ŵ'; // Latin capital letter W with circumflex
entities['373'] = 'ŵ'; // Latin small letter w with circumflex
entities['374'] = 'Ŷ'; // Latin capital letter Y with circumflex
entities['375'] = 'ŷ'; // Latin small letter y with circumflex
entities['376'] = 'Ÿ'; // Latin capital letter Y with diaeresis
entities['402'] = 'ƒ'; // Latin small f with hook, function, florin
entities['710'] = 'ˆ'; // Modifier letter circumflex accent
entities['732'] = '˜'; // Small tilde
entities['913'] = 'Α'; // Alpha
entities['914'] = 'Β'; // Beta
entities['915'] = 'Γ'; // Gamma
entities['916'] = 'Δ'; // Delta
entities['917'] = 'Ε'; // Epsilon
entities['918'] = 'Ζ'; // Zeta
entities['919'] = 'Η'; // Eta
entities['920'] = 'Θ'; // Theta
entities['921'] = 'Ι'; // Iota
entities['922'] = 'Κ'; // Kappa
entities['923'] = 'Λ'; // Lambda
entities['924'] = 'Μ'; // Mu
entities['925'] = 'Ν'; // Nu
entities['926'] = 'Ξ'; // Xi
entities['927'] = 'Ο'; // Omicron
entities['928'] = 'Π'; // Pi
entities['929'] = 'Ρ'; // Rho
entities['931'] = 'Σ'; // Sigma
entities['932'] = 'Τ'; // Tau
entities['933'] = 'Υ'; // Upsilon
entities['934'] = 'Φ'; // Phi
entities['935'] = 'Χ'; // Chi
entities['936'] = 'Ψ'; // Psi
entities['937'] = 'Ω'; // Omega
entities['945'] = 'α'; // alpha
entities['946'] = 'β'; // beta
entities['947'] = 'γ'; // gamma
entities['948'] = 'δ'; // delta
entities['949'] = 'ε'; // epsilon
entities['950'] = 'ζ'; // zeta
entities['951'] = 'η'; // eta
entities['952'] = 'θ'; // theta
entities['953'] = 'ι'; // iota
entities['954'] = 'κ'; // kappa
entities['955'] = 'λ'; // lambda
entities['956'] = 'μ'; // mu
entities['957'] = 'ν'; // nu
entities['958'] = 'ξ'; // xi
entities['959'] = 'ο'; // omicron
entities['960'] = 'π'; // pi
entities['961'] = 'ρ'; // rho
entities['962'] = 'ς'; // sigmaf
entities['963'] = 'σ'; // sigma
entities['964'] = 'τ'; // tau
entities['965'] = 'υ'; // upsilon
entities['966'] = 'φ'; // phi
entities['967'] = 'χ'; // chi
entities['968'] = 'ψ'; // psi
entities['969'] = 'ω'; // omega
entities['977'] = 'ϑ'; // Theta symbol
entities['978'] = 'ϒ'; // Greek upsilon with hook symbol
entities['982'] = 'ϖ'; // Pi symbol
entities['8194'] = ' '; // En space
entities['8195'] = ' '; // Em space
entities['8201'] = ' '; // Thin space
entities['8204'] = ''; // Zero width non-joiner
entities['8205'] = ''; // Zero width joiner
entities['8206'] = ''; // Left-to-right mark
entities['8207'] = ''; // Right-to-left mark
entities['8211'] = '–'; // En dash
entities['8212'] = '—'; // Em dash
entities['8216'] = '‘'; // Left single quotation mark
entities['8217'] = '’'; // Right single quotation mark
entities['8218'] = '‚'; // Single low-9 quotation mark
entities['8220'] = '“'; // Left double quotation mark
entities['8221'] = '”'; // Right double quotation mark
entities['8222'] = '„'; // Double low-9 quotation mark
entities['8224'] = '†'; // Dagger
entities['8225'] = '‡'; // Double dagger
entities['8226'] = '•'; // Bullet
entities['8230'] = '…'; // Horizontal ellipsis
entities['8240'] = '‰'; // Per mille sign
entities['8242'] = '′'; // Prime
entities['8243'] = '″'; // Double Prime
entities['8249'] = '‹'; // Single left-pointing angle quotation
entities['8250'] = '›'; // Single right-pointing angle quotation
entities['8254'] = '‾'; // Overline
entities['8260'] = '⁄'; // Fraction Slash
entities['8364'] = '€'; // Euro sign
entities['8472'] = '℘'; // Script capital
entities['8465'] = 'ℑ'; // Blackletter capital I
entities['8476'] = 'ℜ'; // Blackletter capital R
entities['8482'] = '™'; // Trade mark sign
entities['8501'] = 'ℵ'; // Alef symbol
entities['8592'] = '←'; // Leftward arrow
entities['8593'] = '↑'; // Upward arrow
entities['8594'] = '→'; // Rightward arrow
entities['8595'] = '↓'; // Downward arrow
entities['8596'] = '↔'; // Left right arrow
entities['8629'] = '↵'; // Downward arrow with corner leftward. Also known as carriage return
entities['8656'] = '⇐'; // Leftward double arrow. ISO 10646 does not say that lArr is the same as the 'is implied by' arrow but also does not have any other character for that function. So ? lArr can be used for 'is implied by' as ISOtech suggests
entities['8657'] = '⇑'; // Upward double arrow
entities['8658'] = '⇒'; // Rightward double arrow. ISO 10646 does not say this is the 'implies' character but does not have another character with this function so ? rArr can be used for 'implies' as ISOtech suggests
entities['8659'] = '⇓'; // Downward double arrow
entities['8660'] = '⇔'; // Left-right double arrow
// Mathematical Operators
entities['8704'] = '∀'; // For all
entities['8706'] = '∂'; // Partial differential
entities['8707'] = '∃'; // There exists
entities['8709'] = '∅'; // Empty set. Also known as null set and diameter
entities['8711'] = '∇'; // Nabla. Also known as backward difference
entities['8712'] = '∈'; // Element of
entities['8713'] = '∉'; // Not an element of
entities['8715'] = '∋'; // Contains as member
entities['8719'] = '∏'; // N-ary product. Also known as product sign. Prod is not the same character as U+03A0 'greek capital letter pi' though the same glyph might be used for both
entities['8721'] = '∑'; // N-ary summation. Sum is not the same character as U+03A3 'greek capital letter sigma' though the same glyph might be used for both
entities['8722'] = '−'; // Minus sign
entities['8727'] = '∗'; // Asterisk operator
entities['8729'] = '∙'; // Bullet operator
entities['8730'] = '√'; // Square root. Also known as radical sign
entities['8733'] = '∝'; // Proportional to
entities['8734'] = '∞'; // Infinity
entities['8736'] = '∠'; // Angle
entities['8743'] = '∧'; // Logical and. Also known as wedge
entities['8744'] = '∨'; // Logical or. Also known as vee
entities['8745'] = '∩'; // Intersection. Also known as cap
entities['8746'] = '∪'; // Union. Also known as cup
entities['8747'] = '∫'; // Integral
entities['8756'] = '∴'; // Therefore
entities['8764'] = '∼'; // tilde operator. Also known as varies with and similar to. The tilde operator is not the same character as the tilde, U+007E, although the same glyph might be used to represent both
entities['8773'] = '≅'; // Approximately equal to
entities['8776'] = '≈'; // Almost equal to. Also known as asymptotic to
entities['8800'] = '≠'; // Not equal to
entities['8801'] = '≡'; // Identical to
entities['8804'] = '≤'; // Less-than or equal to
entities['8805'] = '≥'; // Greater-than or equal to
entities['8834'] = '⊂'; // Subset of
entities['8835'] = '⊃'; // Superset of. Note that nsup, 'not a superset of, U+2283' is not covered by the Symbol font encoding and is not included.
entities['8836'] = '⊄'; // Not a subset of
entities['8838'] = '⊆'; // Subset of or equal to
entities['8839'] = '⊇'; // Superset of or equal to
entities['8853'] = '⊕'; // Circled plus. Also known as direct sum
entities['8855'] = '⊗'; // Circled times. Also known as vector product
entities['8869'] = '⊥'; // Up tack. Also known as orthogonal to and perpendicular
entities['8901'] = '⋅'; // Dot operator. The dot operator is not the same character as U+00B7 middle dot
// Miscellaneous Technical
entities['8968'] = '⌈'; // Left ceiling. Also known as an APL upstile
entities['8969'] = '⌉'; // Right ceiling
entities['8970'] = '⌊'; // left floor. Also known as APL downstile
entities['8971'] = '⌋'; // Right floor
entities['9001'] = '⟨'; // Left-pointing angle bracket. Also known as bra. Lang is not the same character as U+003C 'less than'or U+2039 'single left-pointing angle quotation mark'
entities['9002'] = '⟩'; // Right-pointing angle bracket. Also known as ket. Rang is not the same character as U+003E 'greater than' or U+203A 'single right-pointing angle quotation mark'
// Geometric Shapes
entities['9642'] = '▪'; // Black small square
entities['9643'] = '▫'; // White small square
entities['9674'] = '◊'; // Lozenge
// Miscellaneous Symbols
entities['9702'] = '◦'; // White bullet
entities['9824'] = '♠'; // Black (filled) spade suit
entities['9827'] = '♣'; // Black (filled) club suit. Also known as shamrock
entities['9829'] = '♥'; // Black (filled) heart suit. Also known as shamrock
entities['9830'] = '♦'; // Black (filled) diamond suit
Kevin van Zonneveld
on 2009-12-14 15:34:38
@ Nick Kolosov: Thanks for reporting.
@ Fox: Thanks for fixing : )
Will be online shortly folks.
Fox
on 2009-12-02 10:23:07
Sure it's not a good solution, but to answer to Nick Kolosov, and as I had the same problem with using :
- htmlspecialchars => encode
- html_entity_decode => decode
And my aim was to not add parameters in functions (keep functions like php). I decided to add a small code in decode functions in order to fix the problem.
in html_entity_decode function before :
for (symbol in hash_map) {
add the following lines :
// BOF : fix & problem
delete(hash_map['&']);
hash_map['&'] = '&';
// EOF : fix & problem
Nick Kolosov
on 2009-11-17 11:23:32
Ups, blog eated html tags. Error example:
html_entity_decode(' ') = ' ' instead of ' '
Nick Kolosov
on 2009-11-17 11:09:51
Entities order must depend on the direction of translation.
With conversion  =>
entities['38'] must be the first one.
With conversion  =>
entities['38'] must be the last one.
Current version with html_entity_decode converts   to space instead of . Its' wrong.
May be html_entity_decode must be corrected, js is not my s trong side, don't know how to reverse hash order
Brett Zamir
on 2009-10-20 20:06:18
@Roger: Yes, things can be that easy, if that's what you are trying to do. However, your function creating numeric character references has no relation to substituting for get_html_translation_table() for those who need it (nor for htmlentities() or htmlspecialchars() which depend on it).
Roger
on 2009-10-20 16:51:08
Things can be so easy:
function toHTMLEntity(str) {
var s = str.split("");
var ret = "";
for (i = 0; i < s.length; i++) {
var c = s[i].charCodeAt(0);
if(c > 127) ret += ("&#" + c + ";");
else ret += s[i];
}
return ret;
}
Kevin van Zonneveld
on 2009-07-08 16:34:24
Great stuff!
Brett Zamir
on 2009-07-05 03:25:18
It was fixed recently in subversion (SVN). It just needed some time to be made available.
Yes, it's true that ECMAScript doesn't guarantee the order of execution within objects, but I understand that all major browsers maintain the order (and PHP.JS in general depends on this, being as we rely on objects for associative array-like behavior).
Good point about "histogram". Maybe someone copied it from count_chars() which looks like that one used the word correctly. Anyways, I fixed it for the other functions (entity ones) where it was indeed not correct.
Ratheous
on 2009-07-04 23:35:45
Because the ampersand is used in all entities, and htmlspecialchars etc. washes the string through the split and join repeatedly, entities['38'] should be the first item in the array and the first character replaced. Thus any ampersand already in the string will be correctly replaced but those introduced by the replacement of other characters will remain intact.
Someone may have commented on this previously; it's hard to tell because the comments are a bit hard to follow, but regardless, it hasn't been fixed.
Moving it up to line 40 solves the problem in my code, but if I remember correctly the use of for...in doesn't guarantee iterators in a particular order so it might be better to take it out of the entities table and replace it separately (though in my experience they come out in the order they were assigned).
P.S. Just as an observation, you use 'histogram' as a variable name in a number of functions for what is actually a hash table...
his?to?gram?/?h?st??græm/
–noun Statistics.
a graph of a frequency distribution in which rectangles with bases on the horizontal axis are given widths equal to the class intervals and heights equal to the corresponding frequencies.
Brett Zamir
on 2009-04-30 09:27:22
Thanks... Done in SVN. I also simplified the if/else following
KELAN
on 2009-04-30 07:55:27
useQuoteStyle = !isNaN(quote_style) ? constMappingQuoteStyle[quote_style] : quote_style ? quote_style.toUpperCase() : 'ENT_COMPAT';
KELAN
on 2009-04-30 07:53:00
useTable = (table ? table.toUpperCase() : 'HTML_SPECIALCHARS');
useQuoteStyle = (quote_style ? quote_style.toUpperCase() : 'ENT_COMPAT');
// Translate arguments
constMappingTable[0] = 'HTML_SPECIALCHARS';
constMappingTable[1] = 'HTML_ENTITIES';
constMappingQuoteStyle[0] = 'ENT_NOQUOTES';
constMappingQuoteStyle[2] = 'ENT_COMPAT';
constMappingQuoteStyle[3] = 'ENT_QUOTES';
// Map numbers to strings for compatibilty with PHP constants
if (!isNaN(useTable)) {
useTable = constMappingTable[useTable];
}
if (!isNaN(useQuoteStyle)) {
useQuoteStyle = constMappingQuoteStyle[useQuoteStyle];
}
==> get_html_translation_table(0,2);
constMappingTable[0] = 'HTML_SPECIALCHARS';
constMappingTable[1] = 'HTML_ENTITIES';
constMappingQuoteStyle[0] = 'ENT_NOQUOTES';
constMappingQuoteStyle[2] = 'ENT_COMPAT';
constMappingQuoteStyle[3] = 'ENT_QUOTES';
useTable = !isNaN(table) ? constMappingTable[table] : table ? table.toUpperCase() : 'HTML_SPECIALCHARS';
useQuoteStyle = !isNaN(quote_style) ? constMappingQuoteStyle[table] : quote_style ? quote_style.toUpperCase() : 'ENT_COMPAT';
Kevin van Zonneveld
on 2009-03-02 14:37:50
@ madipta: Thank you: fixed.
madipta
on 2009-02-26 02:56:45
i think you need to move entities['38'] on top
entities['38'] = '&';
if (useQuoteStyle != 'ENT_NOQUOTES') {
entities['34'] = '"';
}
if (useQuoteStyle == 'ENT_QUOTES') {
entities['39'] = ''';
}
Kevin van Zonneveld
on 2009-02-25 16:36:30
@ Marco: Excellent suggestion, thanks!
Marco
on 2009-02-23 16:22:52
I suggest that you add a ; after the following code so that the script can be packed to one line (for example with: http://dean.edwards.name/packer/)
symbol = String.fromCharCode(decimal)
Kevin van Zonneveld
on 2009-02-21 12:50:51
@ Alex: Ok I've changed it in SVN, can you tell me why is that?
Alex
on 2009-02-20 13:09:05
need replace:
entities['39'] = ''';
to
entities['39'] = ''';
Kevin van Zonneveld
on 2008-12-01 09:34:04
@ GreLI: It was easier developing (read: copy & pasting ;) that way. We might want to switch back to reduce it's size though, that's a good point, thanks.
GreLI
on 2008-11-30 16:39:50
Instead of this:
entities['38'] = '&amp;';
entities['60'] = '&lt;';
entities['62'] = '&gt;';
You can write
entities = {
'38': '&amp;',
'60': '&lt;',
'62': '&gt;'
}
to reduce size and increase readability.
Kevin van Zonneveld
on 2008-11-03 10:23:51
@ noname: I've committed your fix noname, thanks!
noname
on 2008-10-25 17:32:15
You need to change position for some lines.
From:
entities['60'] = '<';
entities['62'] = '>';
entities['38'] = '&';
To:
entities['38'] = '&';
entities['60'] = '<';
entities['62'] = '>';
Because it will be encode wrong. Example:
 => &lt;a&gt;


{% extends 'base.html' %} {% load staticfiles %} {% block title %}
Review, comment and explore this idea to find a new subject of interest for you
{{idea.description}}
| Date Comment | Author | Comment |
|---|---|---|
| {{ comment.created }} | {{ comment.author }} | {{ comment.comment }} |


|
|
CIFXClock Class ReferenceInheritance diagram for CIFXClock:
List of all members.
Constructor & Destructor Documentation
| CIFXClock::CIFXClock |
( |
|
) |
[private] |
|
| CIFXClock::~CIFXClock |
( |
|
) |
[private] |
|
Member Function Documentation
| U32 CIFXClock::AddRef |
( |
void |
|
) |
[virtual] |
|
|
|
This method increments the reference count for an interface on a component.
- Note:
- It should be called for every new copy of a pointer to an interface on a given component.
- Returns:
- It returns a U32 that contains a value from 1 to 2^32 - 1 that defines the new reference count. The return value should only be used for debugging purposes.
Implements IFXUnknown. |
| virtual void IFXAPI CIFXClock::AdvanceTo |
( |
IFXTime |
newtime |
) |
[virtual] |
|
|
|
This method advances the simulation time to the specified new time.
The new time must between the current simulation time and the end of the frame, inclusive. The clock cannot run backwards.
- Parameters:
-
| newtime | The simulation time the clock is to advance to. |
Implements IFXClock. |
| void CIFXClock::AdvanceToEnd |
( |
|
) |
[virtual] |
|
|
|
This method advances the simulation time to the end of the frame.
Implements IFXClock. |
| U32 CIFXClock::GetCurrentFrame |
( |
|
) |
[virtual] |
|
|
|
This method returns the current frame number.
- Returns:
- The current frame number.
Implements IFXClock. |
| U32 CIFXClock::GetFrameEnd |
( |
|
) |
[virtual] |
|
|
|
This method returns the end of the current frame, in simulation time.
- Returns:
- The end of the current frame.
Implements IFXClock. |
| U32 CIFXClock::GetFrameStart |
( |
|
) |
[virtual] |
|
|
|
This method returns the start of the current frame, in simulation time.
- Returns:
- The start of the current frame.
Implements IFXClock. |
| U32 CIFXClock::GetSimulationTime |
( |
|
) |
[virtual] |
|
|
|
This method returns the lower 32 bits of the current simulation time.
- Returns:
- The current simulation time.
Implements IFXClock. |
| IFXRESULT CIFXClock::GetSimulationTime64 |
( |
IFXTime * |
pHigh, |
|
|
IFXTime * |
pLow |
|
) |
[virtual] |
|
|
|
This method returns the upper 32 bits of the current simulation time.
- Parameters:
-
| pHigh | Returns the upper 32 bits of the simulation time. If NULL, this parameter is ignored. |
| pLow | Returns the lower 32 bits of the simulation time. If NULL, this parameter is ignored. |
- Returns:
- Returns an IFXRESULT code.
- IFX_OK upon success.
- IFX_E_NOT_INITIALIZED if the clock has not been initialized.
Implements IFXClock. |
| U32 CIFXClock::GetSimulationTimeDelta |
( |
|
) |
[virtual] |
|
|
|
This method returns the difference between the current simulation time and the start of the current frame.
- Returns:
- The current simulation time delta.
Implements IFXClock. |
| U32 CIFXClock::GetSystemTime |
( |
|
) |
[virtual] |
|
|
|
This method returns the lower 32 bits of the system time, as of the last Update.
- Returns:
- The current system time.
Implements IFXClock. |
| IFXRESULT CIFXClock::GetSystemTime64 |
( |
IFXTime * |
pHigh, |
|
|
IFXTime * |
pLow |
|
) |
[virtual] |
|
|
|
This method returns the upper 32 bits of the system time.
- Parameters:
-
| pHigh | Returns the upper 32 bits of the system time. If NULL, this parameter is ignored. |
| pLow | Returns the lower 32 bits of the system time. If NULL, this parameter is ignored. |
- Returns:
- Returns an IFXRESULT code.
- IFX_OK upon success.
- IFX_E_NOT_INITIALIZED if the clock has not been initialized.
Implements IFXClock. |
| void CIFXClock::IncrementFrame |
( |
|
) |
[virtual] |
|
|
|
This method begins a new frame.
It increments the frame count and computes new starting and ending frame times. The frame times are always in simulation time.
Implements IFXClock. |
| IFXRESULT CIFXClock::Initialize |
( |
IFXCoreServices * |
pCoreServices |
) |
[virtual] |
|
|
|
This method initializes the clock.
- Parameters:
-
| pCoreServices | A pointer to an implementation of the IFXCoreServices interface. |
- Returns:
- Returns an IFXRESULT code.
- IFX_E_INVALID_POINTER is returned if pCoreServices is invalid.
Implements IFXClock. |
| BOOL CIFXClock::IsRunning |
( |
|
) |
[virtual] |
|
|
|
This method indicates whether the clock is running or stopped.
- Returns:
- TRUE if the clock is running, FALSE if it is stopped.
Implements IFXClock. |
| virtual void IFXAPI CIFXClock::JumpForward |
( |
IFXTime |
offset |
) |
[virtual] |
|
|
|
This method advances the system time to the specified new time.
This causes the clock to think that real time has passed.
- Parameters:
-
| newtime | The system time the clock is to advance to. |
Implements IFXClock. |
| void CIFXClock::NotifyPause |
( |
|
) |
[virtual] |
|
|
|
This method pauses the clock.
The clock will automatically restart upon the next call to Update().
- Returns:
- Returns an IFXRESULT code.
- IFX_OK upon success.
- IFX_E_NOT_INITIALIZED if the clock has not been initialized.
Implements IFXClock. |
| IFXRESULT CIFXClock::QueryInterface |
( |
IFXREFIID |
riid, |
|
|
void ** |
ppv |
|
) |
[virtual] |
|
|
|
This method provides access to the various interfaces supported by a component.
Upon success, it increments the component's reference count and hands back a pointer to the specified interface.
- Note:
- A number of rules must be adhered to by all implementations of IFXAPI QueryInterface . For a list of such rules, refer to the IFXCOM usage guidelines.
- Returns:
- Upon success, IFX_OK is returned. Otherwise, either IFX_E_INVALID_POINTER or IFX_E_UNSUPPORTED are returned.
Implements IFXUnknown. |
| U32 CIFXClock::Release |
( |
void |
|
) |
[virtual] |
|
|
|
This method decrements the reference count for the calling interface on a component.
- Note:
- If the reference count on a component falls to zero, the component is destroyed.
- Returns:
- It returns a U32 that contains a value from 1 to 2^32 - 1 that defines the new reference count. The return value should only be used for debugging purposes.
Implements IFXUnknown. |
| IFXRESULT CIFXClock::Reset |
( |
|
) |
[virtual] |
|
|
|
This method resets the clock.
- Returns:
- Returns an IFXRESULT code.
- IFX_OK upon success.
- IFX_E_ALREADY_INITIALIZED if the clock has already been initialized.
- IFX_E_INVALID_POINTER if the pCoreServices pointer is NULL.
Implements IFXClock. |
| void CIFXClock::SetAuto |
( |
BOOL |
newstate |
) |
[virtual] |
|
|
|
This method sets the auto-reset flag on the clock.
If auto-reset is true, the clock automatically inverts it's running state upon the next call to IncrementFrame. That is, if it is stopped, it automatically starts, and if it is running, it automatically stops. The auto-reset flag is cleared after it has been triggered, so the clock will not oscillate between running and stopped.
- Parameters:
-
| newstate | TRUE to set the auto-reset feature, FALSE to clear it. |
Implements IFXClock. |
| void CIFXClock::SetRunning |
( |
BOOL |
newstate |
) |
[virtual] |
|
|
|
This method starts or stops the simulation clock.
Note that system time and frame count continue to advance while the clock is stopped, but the simulation time does not advance.
- Parameters:
-
| newstate | TRUE to start the clock, FALSE to stop it. |
Implements IFXClock. |
| void CIFXClock::Update |
( |
|
) |
[virtual] |
|
|
|
This method updates the system time.
Implements IFXClock. |
Friends And Related Function Documentation
| IFXRESULT IFXAPI_CALLTYPE CIFXClock_Factory |
( |
IFXREFIID |
riid, |
|
|
void ** |
ppv |
|
) |
[friend] |
|
Member Data Documentation
© 1999 - 2006 Intel Corporation. All rights reserved.
* Other names and brands may be claimed as the property of others.
|
|


DataMapper
DataMapper is an Object Relational Mapper written in PHP for CodeIgniter. It is designed to map your Database tables into easy to work with objects, fully aware of the relationships between each other.
Features
- Everything is an object!
- Easy to setup, easy to use.
- Custom Validation on object properties.
- Lazy Loading (related objects are only loaded upon access).
- Relations and their integrity are automatically managed for you.
- One to One, One to Many, and Many to Many relations fully supported.
- Select data in the style of Active Record (with or without Method Chaining).


--- layout: post title: Start the New Year with an inspiring book ... date: 2015-01-03 16:22:10.000000000 +01:00 type: post published: true status: publish categories: - Books tags: - autobiography - books - goals - inspiration - luck - reading - scott adams - success - systems meta: _edit_last: '1' snap_MYURL: '' snapEdIT: '1' snapLI: 's:227:"a:1:{i:0;a:8:{s:10:"AttachPost";s:1:"1";s:10:"SNAPformat";s:25:"Blogged: %TITLE% - %SURL%";s:11:"SNAPformatT";s:1:" ";s:9:"isAutoImg";s:1:"A";s:8:"imgToUse";s:0:"";s:9:"isAutoURL";s:1:"A";s:8:"urlToUse";s:0:"";s:4:"doLI";i:0;}}";' snapTW: 's:288:"a:1:{i:0;a:9:{s:4:"doTW";s:1:"1";s:10:"SNAPformat";s:32:"Blogged: %TITLE% - %SURL% %CATS%";s:8:"attchImg";s:1:"0";s:9:"isAutoImg";s:1:"A";s:8:"imgToUse";s:0:"";s:11:"isPrePosted";s:1:"1";s:8:"isPosted";s:1:"1";s:4:"pgID";s:18:"551398150745776128";s:5:"pDate";s:19:"2015-01-03 15:22:18";}}";' _thumbnail_id: '2634' featured_posts_widget_flag: 'false' snap_isAutoPosted: '1' _nxs_snap_sh_DL0_1420298539: a:11:{s:7:"dlUName";s:10:"bbelderbos";s:5:"nName";s:4:"Debb";s:6:"dlPass";s:21:"n5g9af4x5n4i4l5b4f444";s:8:"catSelEd";s:0:"";s:11:"dlMsgFormat";s:6:"%TEXT%";s:12:"dlMsgTFormat";s:7:"%TITLE%";s:4:"doDL";i:1;s:6:"catSel";s:1:"0";s:8:"isPosted";s:0:"";s:2:"ii";i:0;s:9:"timeToRun";i:1420298539;} _nxs_snap_sh_FB0_1420298533: 'a:23:{s:4:"doFB";i:1;s:5:"nName";s:4:"FBbb";s:7:"fbAppID";s:15:"154002097960796";s:8:"fbAppSec";s:32:"2eadd32d7e5682c3efabd1436db76795";s:8:"catSelEd";s:0:"";s:10:"fbPostType";s:1:"A";s:7:"fbAttch";s:1:"1";s:12:"fbAttchAsVid";i:0;s:6:"imgUpl";s:1:"1";s:11:"fbMsgFormat";s:25:"Blogged: %TITLE% - %SURL%";s:10:"fbMsgAFrmt";s:0:"";s:5:"fbURL";s:37:"https://www.facebook.com/bobbelderbos";s:6:"fbPgID";s:12:"bobbelderbos";s:6:"catSel";s:1:"0";s:14:"fbAppAuthToken";s:112:"AAACMEGhX91wBAICJn6YySGUZBMEc6bHMVTSCnrRTwpMBaxQZBPmuPZBrxZCLwV5hgTIj7iBAuODQuZC7IohurUJ3FGPk2MuVLSnuTzj56sAZDZD";s:18:"fbAppPageAuthToken";s:117:"AAACMEGhX91wBAK1osOX6OnH9UDLln8tShukA5BMgy7SWuWJdn3XFzwOZBZCCDwLebZBGj03x7f4h8PoxgXNGm3npp2W5asdUyW71d7F8hYrUZAHS4D9H";s:13:"fbAppAuthUser";s:9:"628517118";s:8:"isPosted";s:0:"";s:8:"imgToUse";b:0;s:8:"urlToUse";b:0;s:8:"postType";s:1:"A";s:2:"ii";i:0;s:9:"timeToRun";i:1420298533;}' _nxs_snap_sh_TW0_1420298535: 'a:16:{s:4:"doTW";i:1;s:5:"nName";s:4:"Twbb";s:5:"twURL";s:30:"https://twitter.com/bbelderbos";s:9:"twConsKey";s:22:"yTTWJQa7h0W3ciff6ZQyzg";s:9:"twConsSec";s:40:"MFJXzS2jzvsuZrZPdI0vtueOKBOzur1yZb76N7iE";s:10:"twAccToken";s:50:"177360544-kfNWE0vEciJe3C6F4ZC2kU0nKHXGl8tLr1mMj9cO";s:8:"catSelEd";s:0:"";s:13:"twAccTokenSec";s:40:"Yrr0EWAO0fOJj9ZDU0es4UoQ0371X6D6OTCuvxdw";s:11:"twMsgFormat";s:32:"Blogged: %TITLE% - %SURL% %CATS%";s:8:"attchImg";i:0;s:4:"twOK";i:1;s:6:"catSel";s:1:"0";s:8:"isPosted";s:0:"";s:8:"imgToUse";b:0;s:2:"ii";i:0;s:9:"timeToRun";i:1420298535;}' snapFB: 's:367:"a:1:{i:0;a:12:{s:4:"doFB";s:1:"1";s:8:"postType";s:1:"A";s:10:"AttachPost";s:1:"1";s:10:"SNAPformat";s:25:"Blogged: %TITLE% - %SURL%";s:9:"isAutoImg";s:1:"A";s:8:"imgToUse";s:0:"";s:9:"isAutoURL";s:1:"A";s:8:"urlToUse";s:0:"";s:11:"isPrePosted";s:1:"1";s:8:"isPosted";s:1:"1";s:4:"pgID";s:31:"160267890674014_892040617496734";s:5:"pDate";s:19:"2015-01-03 15:22:20";}}";' dsq_thread_id: '3386465289' snapDL: s:239:"a:1:{i:0;a:7:{s:4:"doDL";s:1:"1";s:11:"SNAPformatT";s:7:"%TITLE%";s:10:"SNAPformat";s:6:"%TEXT%";s:11:"isPrePosted";s:1:"1";s:8:"isPosted";s:1:"1";s:4:"pgID";s:32:"3e6974f2c23595a2d37c95d6d86fe75c";s:5:"pDate";s:19:"2015-01-03 15:22:22";}}"; author: login: bbWebdesign email<EMAIL_ADDRESS>display_name: Bob first_name: Bob last_name: Belderbos ---
How to Fail at Almost Everything and Still Win Big is Scott Adams' (creator of Dilbert) funny memoir about his many failures and what they taught him about success.
I enjoyed this entertaining page-tuner. There are many useful lessons in this book, just a couple:
- Have a system instead of goals. A goal is something specific you achieve or not, systems however refer to things you do on a regular basis that increase your odds of happiness. Systems for me are: diet + exercise, reading, writing, parenting, and coding.
- To find out where your talent lies, remember what you were doing obsessively by the age of ten. In my case it was painting and building stuff with Lego. This explains my interest in designing websites and building software.
- Don't fear failure, embrace it. As you read through Scott's many failures you discover how much he learned and how it all contributed to later successes.
- Try a lot of different things (sampling), bail out if you don't see results. The more you try, the greater the odds you stumble upon a successful idea. Scott reveals his Success Formula: Every Skill You Acquire Doubles Your Odds of Success. The more concepts you understand, the easier you learn new stuff.
- Achievers see success as a skill that can be learned. That means they figure out what they need and they go and get it.
- Learn essential skills like writing, psychology (cognitive biases), conversation, persuasion and technology.
- Don’t assume you know how much potential you have. Sometimes the only way to know what you can do is to test yourself.
- The biggest component of luck is timing. Samuel Goldwyn said "The harder I work, the luckier I get."
- Proper eating and exercise form the corner stone for further success.
- Books change us automatically, just as any experience does.