A simple library to interact with DIDs that conform to the DID-provider interface.
npm install dids
import { DID } from 'dids'
import Ed25519Provider from 'key-did-provider-ed25519'
import KeyResolver from 'key-did-resolver'
const seed = // 32 bytes of entropy, Uint8Array
const provider = new Ed25519Provider(seed)
const did = new DID({ provider, resolver: KeyResolver.getResolver() })
// Authenticate with the provider
await did.authenticate()
// Read the DID string - this will throw an error if the DID instance is not authenticated
const aliceDID = did.id
// Create a JWS - this will throw an error if the DID instance is not authenticated
const jws = await did.createJWS({ hello: 'world' })
The DagJWS functionality of the DID library can be used in conjunction with IPFS.
const payload = { some: 'data' }
// sign the payload as dag-jose
const { jws, linkedBlock } = await did.createDagJWS(payload)
// put the JWS into the ipfs dag
const jwsCid = await ipfs.dag.put(jws, { format: 'dag-jose', hashAlg: 'sha2-256' })
// put the payload into the ipfs dag
const block = await ipfs.block.put(linkedBlock, { cid: jws.link })
// get the value of the payload using the payload cid
console.log((await ipfs.dag.get(jws.link)).value)
// output:
// > { some: 'data' }
// alternatively get it using the ipld path from the JWS cid
console.log((await ipfs.dag.get(jwsCid, { path: '/link' })).value)
// output:
// > { some: 'data' }
// get the jws from the dag
console.log((await ipfs.dag.get(jwsCid)).value)
// output:
// > {
// > payload: 'AXESINDmZIeFXbbpBQWH1bXt7F2Ysg03pRcvzsvSc7vMNurc',
// > signatures: [
// > {
// > protected: 'eyJraWQiOiJkaWQ6Mzp1bmRlZmluZWQ_dmVyc2lvbj0wI3NpZ25pbmciLCJhbGciOiJFUzI1NksifQ',
// > signature: 'pNz3i10YMlv-BiVfqBbHvHQp5NH3x4TAHQ5oqSmNBUx1DH_MONa_VBZSP2o9r9epDdbRRBLQjrIeigdDWoXrBQ'
// > }
// > ],
// > link: CID(bafyreigq4zsipbk5w3uqkbmh2w2633c5tcza2n5fc4x45s6soo54ynxk3q)
// > }
As can be observed above the createDagJWS
method takes the payload, encodes it using dag-cbor
and computes it's CID. It then uses this CID as the payload of the JWS that is then signed. The JWS that was just created can be put into ipfs using the dag-jose
codec. Returned is also the encoded block of the payload. This can be put into ipfs using ipfs.block.put
. Alternatively ipfs.dag.put(payload)
would have the same effect.
The DagJWE functionality allows us to encrypt IPLD data to one or multiple DIDs. The resulting JWE object can then be put into ipfs using the dag-jose codec. A user that is authenticated can at a later point decrypt this object.
const cleartext = { some: 'data', coolLink: new CID('bafyqacnbmrqxgzdgdeaui') }
// encrypt the cleartext object
const jwe = await did.createDagJWE(cleartext, ['did:3:bafy89h4f9...', 'did:key:za234...'])
// put the JWE into the ipfs dag
const jweCid = await ipfs.dag.put(jwe, { format: 'dag-jose', hashAlg: 'sha2-256' })
// get the jwe from the dag and decrypt it
const dagJWE = await ipfs.dag.get(jweCid)
console.log(await did.decryptDagJWE(dagJWE))
// output:
// > { some: 'data' }
import { DID } from 'dids'
import KeyResolver from '@ceramicnetwork/key-did-resolver'
// See https://github.com/decentralized-identity/did-resolver
const did = new DID({ resolver: KeyResolver.getResolver() })
// Resolve a DID document
await did.resolve('did:test:...')
MIT
Generated using TypeDoc


Basic implementation.
$('#block_0').find('ul.tabs').tabulous();
Apply custom class names to active tab and active content block.
$('#block_1').find('ul.tabs').tabulous({ tabCSS: 't-active', contentCSS: 'c-active' });
Use a mouseover event instead of click event.
$('#block_2').find('ul.tabs').tabulous({ event: 'mouseover' });
Use with a callback function. The tab element, and content block element, are passed as arguments in the callback. You can return false to prevent the tab behavior from executing. Clicking the third tab below will redirect to the Google homepage.
$('#block_3').find('ul.tabs').tabulous({ callback: function($tab, $content){ if($content.is('#tab_3_c')){ window.location = $content.text(); return false; } } });
Now for some advanced functionality. Load content via ajax by using the callback function. Also, by utilizing localStorage, we can save the last tab that was viewed by the user, and reload it when he/she returns to the page. We can also turn off the JavaScript check in this scenario since the content is loaded via ajax.
var lastTabIdx = 1; // get the last tab that was viewed if(localStorage) lastTabIdx = Number(localStorage.tab) || 1; // fn which loads the content function loadFile($content){ var id = $content.attr('id'), file = ''; // determine which file to load switch(id){ case 'tab_4_a': file = '01'; break; case 'tab_4_b': file = '02'; break; case 'tab_4_c': file = '03'; break; } // ajax load content $content.load('ajax/' + file + '.html'); } // load the ajax content from previous session loadFile( $('#block_4').find('div.content:nth-child(' + (lastTabIdx + 1) + ')') ); // init tabulous $('#block_4').find('ul.tabs').tabulous({ index: lastTabIdx, checkJS: false, callback: function($tab, $content){ // save the index of the last tab that was viewed if(localStorage) localStorage.tab = $tab.parent().index() + 1; // only load if content hasn't been loaded yet if(!$content.html()) loadFile($content); } });
Because events are bound using event delegation, new tabs can be easily added dynamically without having to do any extra set up. Simply add a new tab using the button below and click it to view it's contents.
Be sure to check this page after disabling JavaScript. You will find all the content blocks visible (except the set dependent on ajax).


The spellbook is a module which defines the spells used in hex_client. These are good models for spells you might want to write. This module also contains some useful helper functions you might want to use in writing your own programs as well.
An error to represent a situation where we have an invalid spell
Returns a color partway between colorOne and colorTwo. t=0.0 is fully colorOne, and t=1.0 is fully colorTwo
Returns a list of all the light numbers in a ring of the hex. The center light is ring 0 and the outer edge is ring 3
Creates a flickering flame at the center of the Hex


|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object coalda.base.Constants
public class Constants
| Nested Class Summary | |
|---|---|
static class |
Constants.itemKind
Kinds of visualItems shown in the visualization. |
| Field Summary | |
|---|---|
static java.lang.String |
bmuFile
File used for the import of calculations, contains the BMU for every feature vector. |
static java.lang.String |
calctable
Tablenames in the database for calculation table. |
static java.lang.String |
codebookFile
File used for the import of calculations, contains the weights of the nodes in the input space dimensions. |
static java.lang.String |
configFile
Config file to use. |
static java.lang.String |
coordsFile
File used for the import of calculations, contains map coordinates in output space. |
static boolean |
db
Use the db or read information from files. |
static java.lang.String |
dbCreateScript
File path to the script used for the creation of the db. |
protected static java.lang.String |
dbDriver
Class name of driver for database. |
static java.lang.String |
dbLocation
Location of the database. |
protected static java.lang.String |
dbPassword
Password for the user of the database. |
protected static java.lang.String |
dbUser
User of the database. |
static java.lang.String |
edgeKey
Field of visualItem of kind edge, used for saving the ID of the edge. |
static java.lang.String |
edgeKind
String for kind of visualItem = edge. |
static java.lang.String |
edgeSource
Field of visualItem, used for the ID of the source/start node of the edge. |
static java.lang.String |
edgeTarget
Field of visualItem of kind edge, used for saving the target/end node of the edge. |
static java.lang.String |
edgeUmatValue
Field of visualItem of kind edge, used for saving the U-matrix value of the edge. |
static java.lang.String |
entitytable
Tablenames in the database for entity table. |
static java.lang.String |
featureDefinitionsFile
File where the names of the features are defined, used for displaying them to the user in the side pane and calculating the number of features. |
static java.lang.String |
featureFile
File used for the import of feature vectors, contains the feature vectors. |
static java.lang.String |
featureID
Field of visualItem of kind feature vector, used for saving the ID of the feature vector. |
static java.lang.String |
featureLabel
Field of visualItem of kind feature vector, used for saving the label of the feature vector. |
static java.lang.String |
features
Field of visualItem of kind feature vector, used for saving the array of features of the feature vector. |
static java.lang.String |
featuretable
Tablenames in the database for feature vector table. |
static java.lang.String |
fvidsFile
File used for the import of calculations, contains the IDs of the feature vectors used for calculation. |
static java.lang.String |
fvKind
String for kind of visualItem = fv. |
static java.lang.String |
kind
Field of visualItem, used for determining the kind of a visualItem, can be of enumKind. |
static java.lang.String |
linkFile
File used for the import of a corpus, containing the links of the corpus. |
static java.lang.String |
linktable
Tablenames in the database for link table. |
static java.lang.String |
markableFile
File used for the import of a corpus, containing the markables of the corpus. |
static java.lang.String |
markabletable
Tablenames in the database for markable table. |
static java.lang.String |
matlabServer
Computer where the matlab SOM server is running. |
static java.lang.String |
neighboursFile
File used for the import of calculations, contains the neighbourhood relations between nodes in output space. |
static java.lang.String |
nodeCoDisLabel
Field of visualItem of kind node, used for saving a label of the node consisting of to numbers "a/b" with "a" being the number of coreferent feature vectors associated with that node and "b" the number of disreferent feature vectors. |
static java.lang.String |
nodeCorefNumber
Field of visualItem of kind node, used for saving the number of coreferent feature vectors associated with that node |
static java.lang.String |
nodeDisrefNumber
Field of visualItem of kind node, used for saving the number of disreferent feature vectors associated with that node |
static java.lang.String |
nodeFVectors
Field of visualItem of kind node, used for saving the IDs of all feature vectors associated with this node. |
static java.lang.String |
nodeFVNumber
Field of visualItem of kind node, used for saving the number of feature vectors associated with this node. |
static java.lang.String |
nodeKey
Field of visualItem of kind node, used for saving the ID of the node. |
static java.lang.String |
nodeKind
String for kind of visualItem = node. |
static java.lang.String |
nodeProportion
Field of visualItem of kind node, used for saving the percentage of coreferent feature vectors associated with this node. |
static java.lang.String |
nodeProportionDis
Field of visualItem of kind node, used for saving the percentage of disreferent feature vectors associated with this node. |
static java.lang.String |
nodeUmatValue
Field of visualItem of kind node, used for saving the U-matrix value. |
static java.lang.String |
nodeWeight
Field of visualItem of kind node, actually there are as many fields for the weights as there are features in the input space, each one has as its name nodeWeight + i, i being the ID of the feature. |
static java.lang.String |
nodeXValue
Field of visualItem of kind node, used for saving the x value of the node in output space. |
static java.lang.String |
nodeYValue
Field of visualItem of kind node, used for saving the y value of the node in output space. |
static java.lang.String[] |
possibleLabels
Names for the possible labels as shown to the user. |
static int[] |
possibleLabelValues
Possible labels as assigned in the data. |
static java.lang.String[] |
possibleNodeColorings
Possible fields that can be used for coloring the nodes. |
static java.lang.String[] |
possibleNodeLabels
Possible fields that can be used for the nodelabel of the nodes. |
static java.lang.String |
textFile
File used for the import of a corpus, containing the sentences of the corpus. |
static java.lang.String |
texttable
Tablenames in the database for sentences table. |
static java.lang.String |
umatFile
File used for the import of calculations, contains the U-matrix values for nodes and edges. |
static java.lang.String |
wordFile
File used for the import of a corpus, containing the words of the corpus. |
static java.lang.String |
wordtable
Tablenames in the database for word table. |
| Constructor Summary | |
|---|---|
Constants()
|
| Method Summary | |
|---|---|
static void |
getSettings()
Method getSettings. |
static java.io.BufferedReader |
openFile(java.lang.String location)
Method openFile. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
public static java.lang.String configFile
public static boolean db
public static java.lang.String[] possibleLabels
public static int[] possibleLabelValues
public static java.lang.String kind
public static java.lang.String nodeKind
public static java.lang.String edgeKind
public static java.lang.String fvKind
public static java.lang.String nodeKey
public static java.lang.String nodeXValue
public static java.lang.String nodeYValue
public static java.lang.String nodeUmatValue
public static java.lang.String nodeFVectors
public static java.lang.String nodeFVNumber
public static java.lang.String nodeWeight
public static java.lang.String nodeProportion
public static java.lang.String nodeProportionDis
public static java.lang.String nodeCoDisLabel
public static java.lang.String nodeCorefNumber
public static java.lang.String nodeDisrefNumber
public static java.lang.String edgeKey
public static java.lang.String edgeSource
public static java.lang.String edgeTarget
public static java.lang.String edgeUmatValue
public static java.lang.String featureID
public static java.lang.String featureLabel
public static java.lang.String features
public static java.lang.String[] possibleNodeColorings
public static java.lang.String[] possibleNodeLabels
public static java.lang.String featureDefinitionsFile
public static java.lang.String calctable
public static java.lang.String wordtable
public static java.lang.String markabletable
public static java.lang.String entitytable
public static java.lang.String linktable
public static java.lang.String texttable
public static java.lang.String featuretable
public static java.lang.String dbCreateScript
protected static java.lang.String dbDriver
public static java.lang.String dbLocation
protected static java.lang.String dbUser
protected static java.lang.String dbPassword
public static java.lang.String textFile
public static java.lang.String wordFile
public static java.lang.String markableFile
public static java.lang.String linkFile
public static java.lang.String featureFile
public static java.lang.String coordsFile
public static java.lang.String neighboursFile
public static java.lang.String umatFile
public static java.lang.String bmuFile
public static java.lang.String codebookFile
public static java.lang.String fvidsFile
public static java.lang.String matlabServer
| Constructor Detail |
|---|
public Constants()
| Method Detail |
|---|
public static java.io.BufferedReader openFile(java.lang.String location) throws java.io.IOException
location
- Path to the file.
java.io.IOException
- if file is not found or cannot be opened.public static void getSettings()
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


I created this boilerplate because I really liked Josh David Miller's ngbp boilerplate but I wanted to use different build tools.
This page is just here to show the power of ui.router.


Robert A. Wardle
Biographie
- Born 1890 Clifton, England
- Died January 2, 1974 Winnipeg
- BSc. Zoology, Royal College of Science, University of London 1912
- MSc. Royal College of Science 1914
- Manchester Special Lecturer in Zoology 1918-1928
- British Cotton Growers Association Research Investigator Sudan 1923-24
- University of Manitoba Head Department of Zoology 1928-1958
- United College (now University of Winnipeg) Zoology Department 1958-1962
- Research on entomology and parasitology, particularly tapeworms. Several books including the 780 page "The Zoology of Tapeworms" co-authored with J. A. McLeod 1952. This book was updated by "Advances in the Zoology of tapeworms, 1950-1970" co-authored with J. A. McLeod and S. Radinovsky which was published shortly after his death.
SCZ
- R. A. Wardle Award established 1974
Honneurs
- Fellow Royal Society of Canada 1936
Références
- McLeod, J.A. and H. E. Welch 1974 Professor R. A. Wardle, M. Sc. CSZ Bull. 5(3): 2-3.


- (int)count;
Result: if count of the receiver < count of other, returns NSOrderedDescending. If count of the receiver > count of other, returns NSOrderedAscending. If count of the receiver == count of other, returns result of -textCompare:other.- (NSComparisonResult)countCompare:(RPCountedToken*)other;
+ (RPCountedToken*)ellipsisToken;
The text of the special "ellipsis" RPCountedToken is a one-character string, the unicode eliipsis (0x2026). The count is 0. This special RPCountedToken is used by RPTokenControl as the last token when there are too many to fit in the given frame.
Result: an autoreleased instance of the special "ellipsis" RPCountedoken- (void)incCount;
- (id)initWithText:(NSString*)text count:(int)count;
Result: an instance of RPCountedToken
Name Description text new value for the text property of the receiver count new value for the count property of the receiver
- (BOOL)isEllipsisToken;
With the current design, -[myCountedToken isEllipsisToken] is equivalent to -[myCountedToken count] == 0 && myCountedToken != nil. This method is a convenience and attempt to avert future bugs.
Result: If the receiver is an ellipsis token, returns YES. Otherwise, returns NO.- (NSString*)text;
Result: NSOrderedAscending, NSOrderedSame or NSOrderedDescending, determined by sending -localizedCaseInsensitiveCompare:other to the receiver.- (NSComparisonResult)textCompare:(RPCountedToken*)other;
Result: The text value of the receiver with the count value appended in square brackets. Example: "MyText [5]"- (NSString*)textWithCountAppended;
(Last Updated 2/8/2008)


Copyright (c) 2000 Robert A. Kraus
This game is played on an empty 8x8 square board:
Each player starts with 13 stones (Atoms) off board. There are also 4 neutral stones (Neutrons).
|
| An example White's turn. He slides the Neutron at g3 to cell [1] capturing g1. Then Black slides e4 to cell [2]. White replies by moving c6 to cell [3] capturing e7. Now Black moves h2 to f2 capturing all the other Atoms are draws the game! |
There is a ZRF to play Reactor with Zillions. In the original game, the game setup is produced by a random generator.


British F1 Sidecars FINAL — Round 10 — 2019 — Brands Hatch
by RaccoonGTBritish F1 Sidecars FINAL — Round 10 — 2019 — Brands Hatch
Molson Group British Sidecar Championship 3 Wheels, 2 People, 1 Aim ... TO WIN! High Octane, High Adrenaline, Highly Spectacular Firmly established in the Bri…www.youtube.com


Type Userdata Library None Keywords userdata Sample code See also
The type userdata is provided to allow arbitrary C data to be stored in Lua variables. This type corresponds to a block of raw memory and has no pre-defined operations in Lua, except assignment and identity test.
______
This page is based on the Lua 5.1 Reference which is subject to the following license notice:
Copyright © 1994–2012 Lua.org, PUC-Rio. Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Additional changes and modifications are subject to the copyright at the bottom of this page.


|
Oboe
1.5
A library for creating real-time audio apps on Android
|
#include <AudioStreamCallback.h>
Public Member Functions | |
| virtual bool | onError (AudioStream *, Result) |
| virtual void | onErrorBeforeClose (AudioStream *, Result) |
| virtual void | onErrorAfterClose (AudioStream *, Result) |
AudioStreamErrorCallback defines a callback interface for being alerted when a stream has an error or is disconnected using onError*
methods.
It is used with AudioStreamBuilder::setErrorCallback().
|
inlinevirtual |
This will be called before other onError
methods when an error occurs on a stream, such as when the stream is disconnected.
It can be used to override and customize the normal error processing. Use of this method is considered an advanced technique. It might, for example, be used if an app want to use a high level lock when closing and reopening a stream. Or it might be used when an app want to signal a management thread that handles all of the stream state.
If this method returns false it indicates that the stream has *not been stopped and closed by the application. In this case it will be stopped by Oboe in the following way: onErrorBeforeClose() will be called, then the stream will be closed and onErrorAfterClose() will be closed.
If this method returns true it indicates that the stream has been stopped and closed by the application and Oboe will not do this. In that case, the app MUST stop() and close() the stream.
This method will be called on a thread created by Oboe.
| audioStream | pointer to the associated stream |
| error |
|
inlinevirtual |
This will be called when an error occurs on a stream, such as when the stream is disconnected, and if onError() returns false (indicating that the error has not already been handled).
The underlying AAudio or OpenSL ES stream will already be stopped AND closed by Oboe. So the underlying stream cannot be referenced. But you can still query most parameters.
This callback could be used to reopen a new stream on another device.
| audioStream | pointer to the associated stream |
| error |
Reimplemented in oboe::StabilizedCallback.
|
inlinevirtual |
This will be called when an error occurs on a stream, such as when the stream is disconnected, and if onError() returns false (indicating that the error has not already been handled).
Note that this will be called on a thread created by Oboe.
The underlying stream will already be stopped by Oboe but not yet closed. So the stream can be queried.
Do not close or delete the stream in this method because it will be closed after this method returns.
| audioStream | pointer to the associated stream |
| error |
Reimplemented in oboe::StabilizedCallback.


Stream is not here
You want
/stream
(note the lack of a trailing slash)
This page intentionally does not redirect as some clients handle that
partially
and end up much harder to debug. A hard failure is clearer than a partially working state.


This "dashboard" represents the level of conformance that each implementation currently achieves. Includes all tests in the test suite.
The table below shows which tests the implement ion passes or fails.
This data does not represent real-time results from automated testing; as such the results may not be up-to-date. Although we strive to keep this data up to date, these results may be obsoleted at any time. The following list represents the user agents that have been tested for conformance in this report. They have been included because they claim to support the specification.
The following people contributed to the creation and/or maintained of this test suite:


|
Revenge of the Bimbo: Legally
Blonde and My Cousin Vinny
by Katie Reese
In one of the Picturing Justice articles,
author David Papke, a law professor, submits a conversation with
his teenage daughter about the first Legally Blonde film.
Essentially, the conversation argues whether or not the film
actually has anything to do with law. It appears that the daughter
wins and Legally Blonde is really just a cute chick flick,
but I think that it is impossible that the meaning of the movie
stops there. Certainly the film gives a poor showing of legal
realities but there is substance there. Whenever a text engages
conceptions and depictions of society ideological assumptions
emerge from the discussion either advertently or inadvertently.
More commonly, ideology appears in the text inadvertently but
its presence is inevitable in popular culture since ideology
encompasses dominant world-views. An analysis of popular culture
then becomes incredibly revealing of a culture, and specifically,
of our North American culture in how we see the world and ourselves.
My Cousin Vinny is another lawyer comedy that, while seemingly
merely funny and easy to watch, is also indicative of popular
ideology. Like Legally Blonde, My Cousin Vinny's
humour centers around a "fish out of water" story where
characters from one well known social locale are displaced into
a foreign, and equally known locale. Both films use cultural
stereotypes blatantly to expose some of our ideological assumptions
about these cultures and stock characters and to present their
own messages. What these films have to say about women and law
is telling of social ideologies and dominant views.
My Cousin Vinny
presents us with cultural stereotypes of North and South that
are inevitably exposed as erroneous ideological assumptions.
When Stan and his friend drive into Alabama, the scene is set
in an entirely rural community where manure is for sale on the
side of the road and where farmers chew on wheat out of the sides
of their mouths. The two soon-to-be accuseds for murder reveal
in their nervousness the stereotypes about Southern justice and
inbreeding that the North has of the South. The very formalistic
rules of court and the extensive training of Judge Haller at
Yale University contrast these Northern expectations of Southern
justice and undermine the audience's same expectations of the
South. Similarly, the well briefed eye-witness testimonies in
the preliminary inquiry reveal a polished and well researched
prosecutorial team.
Similarly, the film reveals stereotypes about Italian-American
Northerners through Mona Lisa Vito and Vinny. When they pull
up in their enormous car and step outside in gaudy apparel, the
audience is at once expectant of the cultural clash that will
ensue and knows, even before they begin speaking, that these
are characters with little education, Brooklyn accents, terrible
swearing, domestic disputes, and limited knowledge of the country.
Lisa and Vinny seem to be stock characters, characters who have
a wide understanding of American-Chinese food but have never
heard of grits or mud ruining the alignment of car wheels. In
the end, both are shown to be incredibly intelligent, intuitive
people and the stereotype is turned on its head.
This is particularly true of Lisa who inevitably steals the show.
Her image of the Italian-American bimbo and then subsequent brilliance
exposes assumptions about "the bimbo" and presents
us with a new ideological view of the female Italian-American,
that of the brilliant and empowered woman beneath the ditsy façade.
Lisa is an out of work hair dresser who wears stilettos, sequins,
has huge hair, and worries about the domesticity of her future
married life and ticking clock. This is an image of a cultural
woman that is common to us and we know what to expect from the
stereotype: cattiness, and superficiality combined with limited
literary ability. However, Lisa is not what we expect. When Vinny
cannot get through the first few pages of the book on rules of
procedure over a number of days, Lisa sits down with the book
and nears the middle almost immediately. Similarly, she plays
pool better than the sharks in the tavern, really does know more
about cars and torque than anyone else in the world, and calls
the shots in the courtroom as well as the bedroom.
We initially see Lisa as an extension of Vinny's otherness in
the South and do not expect much narrative force from this type
of character. However, Mona Lisa Vito steps outside the stereotype
and reveals a new ideology of the cultural Woman, one who commands
attention and respect. Her brilliance is revealed to us slowly,
and culminates in a dazzling display in the courtroom where the
audience understands that she single handedly solves the entire
case by taking pictures of the tire tracks and then identifying
the perpetrators' car to be one different from the accuseds'.
She out performs, out speaks, and dismisses the testimonies and
authority of the entire male prosecutorial team (McDonald Carolan,
at 157).
Legally Blonde
attempts the same kinds of inversion with ideological assumptions
about place and stock characters, but is not as successful at
displacing old ideologies with new ideologies about place and
women as is My Cousin Vinny. Elle's arrival at Harvard,
the quintessential legal institution, is illustrative of popular
culture's assumptions about law school, and, in particular, Harvard.
In a small group discussion on the first day, we meet three very
typical law students: the absolute geek with numerous doctorates
who has been de-worming orphans in eastern Europe for the past
few months, the scary lesbian with a phD in women's studies and
a focus on the history of combat, and the arrogant but inept
genius who enjoys telling people his IQ and assumes that famous
philosophers take their ideas from his fourth grade papers. Elle
contrasts these bleak stock characters with her own stock character
and brilliantly coloured clothing against the grey that surrounds
her. She introduces herself and her dog by their astrological
signs and is universally rejected by this group because she is
not the typical law student.  With her, the stereotypes
of law students are complete: no one who is dynamic, interesting,
or welcoming can be found at law school, nor can you get in unless
you have an obscene amount of unpractical education.
The film is similarly damning and revealing of popular notions
of law professors and admissions committees. Professor Stromwell
begins her class with an exercise in intimidation and then what
ensues is a hyperbolic portrayal of the Socratic method. The
effect is that law school is a horribly competitive, stressful
environment. In Elle's first criminal law class, Professor Callahan
acknowledges the ruthlessness of law school by announcing four
summer spots in his firm with the declaration, "let the
blood bath begin." Similarly, the admissions committee lacks
any sense of humour or knowledge of life outside of academia,
illustrated by their interpretation of Elle's fundraising campaign
of a line of faux-fur panties as being "a friend of the
animals" and of her frivolous undergraduate degree as "diversity."
From these stereotypes, and from Elle's conquering of the legal
world with her perkiness, we see a dominant ideology that law
is a ruthless, competitive and hostile environment. Even though
Professor Stromwell comes to the salon and encourages Elle to
stay in school, Vivian Kensington becomes her best friend, and
her absolutely horrible classmates vote her as their favourite
for the position of convocation speaker, this transformation
in welcome to the bimbo only occurs because of Elle's genuineness
and persistence and not from a hope that the legal profession
can have compassion. The change in attitudes at the legal institution
does not have the powerful inverting effect that appears in My
Cousin Vinny where the South's legal system shows its own
merit. Harvard's redemption is reluctant and only through Elle's
overwhelming goodness and influence. The inherent potential evilness
of the system remains.
Despite affirming a malicious undercurrent to the entire legal
profession, there is a contrary and very real ideology legitimizing
law throughout the film. The mere fact that Elle must prove herself
in the legal forum gives legitimacy to the profession as a place
of prestige and authority. The film gives credence to law school
as a place for smart people when Elle can no longer identify
with her Californian friends whose news about bangs and lip liner
interrupts Elle's story of emotional crisis and rejection.  Their
gross frivolity makes even Harvard desirable. This idea that
law school is a place of prestige and respectability is an underlying
ideological assumption confirmed through decades and centuries
and remains unchallenged by this film.
The entire purpose of the film attempts to underscore assumptions
about the blonde bimbo. From a woman who cannot continue to walk
home because of a threat to her shoes, we get a woman who wins
a murder trial in her first year as a law student and then receives
a prestigious offer in a large Boston firm. The attempted message
of the film is that the bimbo is really brilliant. This is the
same ideological message that My Cousin Vinny presents
about Lisa but it lacks the same poignancy because the outcome
is so transparent from the opening scenes of the film. Similarly,
there is a question if this is even really the ideological message
or is it merely that a girl has to do anything to get a great
guy? The actual evidence that Elle is smart is fleeting. She
makes some observant comments in class and has clearly read but
then her behaviour on Callahan's legal team is embarrassing (for
example: "I just don't think that Brooke could have done
this. She exercises a lot. Exercise creates endorphins and endorphins
make you happy. Happy people just don't kill their husbands").
The film does this to extend the bimbo joke, and Reese Witherspoon
is incredibly charming, but by extending this bimbo-ness, the
film actually undermines if Elle really is smart.
Everything in this film centers on the creation of utopian romance
and not on inverting conceptions about the bimbo. Elle's help
to Paulette, the white trash manicurist, is in helping her to
connect with the UPS guy. Similarly, she does a great service
to the de-worming law student by making him look desirable in
the face of rejection. Elle's entire purpose in going to law
school stems not from ambition to do something greater with her
life, nor from a passion for justice, but is rather a function
of marital conquest. When she rejects Warner and then subsequently
gives a relatively intelligent speech at their graduation, we
wonder if Elle has transcended this marital quest. The musical
score with the lyrics of "Perfect Day" is the same
as in the initial scene of her getting ready for her date with
Warner when she expects him to propose. We think that now her
perception of the perfect day has changed to career success and
recognition of hard work and of coming to terms with self but
then a subtitle under her new boyfriend, Emmitt, reverses this
inclination. The subtitle indicates that this is really the perfect
day because he will propose that night. Now she will marry the
perfect guy. Law school was worth it.
As a blonde who uses an ibook and who saw Legally Blonde
on the day of receiving an acceptance to law school, I really
like Elle Woods. However, the ideological message fails to present
women as autonomous, competent individuals deserving of respect.
My Cousin Vinny does a much better job of this through
using Bohdan Dziemidok's Contrast Theory to create a gap between
our expectations of Lisa and what actually ensues. Both films,
however, use obvious stereotypes and force reflections on cultural
assumptions that we make. A good trend for feminism is that Hollywood
film has changed to make the ideological assumption that bimbos
are more than they have traditionally been seen to be. Let's
just hope that there are more Mona Lisa Vitos than there are
Elle Woods. Works
Cited:
Mary Ann McDonald Carolan,
"Italian American Women as Comic Foils: Exploding the Stereotype
in My Cousin Vinny, Moonstruck, and Married to the Mob"
(2002) 13 Literature Interpretation Theory 155.
Bohdan Dziemidok, The Comical: A Philosophical Analysis (Dordrecht:
Kluwer Academic Publishers, 1993).
David Papke, "Legally
Blonde" (October 2001) Picturing Justice.
Posted January 21, 2004
|


---
layout: null
section-type: faq
title: FAQ
---
## FAQ for Recruiters
**1. Are you interested in new opportunities?**
Depends. If it is your run-of-the-mill, straight-out-of-a-Dilbert-comic position, then No.
If it is a chance to work on exciting projects, build data visualizations, interact with different areas of business, all the while having fun with data, then yes.
**2. Where are you located? Are you open to relocation?**
I live in Minneapolis, Minnesota. Yes, I am open to relocation.
**3. Are you authorized to work in the U.S?**
Yes. I have an H1B work authorization.
**4. Why should I hire you?**
The snarky me says, isn't that for you to determine?
The sensible me says, because I know blah, have worked on blah and can do blah.
The smart me says, because I satisfy a need you have.


Input Data :
- Please enter Peak & intensity with space seperated list or tab seperated list
- Please enter Mass & intensity with space seperated list or tab seperated list
- Please enter protein sequence
C and N Terminus :
- select any of "a","b","c" as N Terminus
- select any of "x","y","z","z°" as C Terminus
Way to change Mass Shift :
- Add Fixed Ptm by clicking , provide "acid" on the left box and "mass shift" on the right box and click on submit
- Remove Fixed Ptm by clicking
- Change the mass shift of individual acids by clicking on the acid and entering the mass shift in the box provided and click on "ok"
Interacting with the spectrum graph :
- Scroll down to view the graph
- X-Axis represent the Mass and Y-Axis represent Intensity
- The vertical lines indicate the peak list entered and the circles represent the distribution calculated
- Zoom the X-Axis by keeping the mouse on X-Axis and scrolling
- Zoom the Y-Axis by keeping the mouse above X-Axis line and scrolling
- Drag the X-Axis by draging the graph at any part


Javascript Toolbox
I write Javascript most days and have done so for a few years now. I still find new tools, websites, frameworks and ways to do things. I thought I’d write them down and get the list online as it may help other people discover some useful tools of the trade. If you have any suggestions, stick them in the comments section.
IDEs and editors
Sublime Text 2
Your go to text editor. When you download it fresh, it won’t feel like much but once you load it full of plugins that you can find at Package Control. It becomes a great tool for knocking up Javascript. I’ll do another post on my sublime 2 plugins later.
Sublime Text 3
The younger more unstable brother of Sublime Text 2. I use this even though it’s still in beta because it allows JSGutter to run Node.js and jshint my code in real time instead of just on every save or load.
Webstorm
I used Webstorm in a project in my previous job, and I’m not sure whether it was my laptop being substandard or Webstorm being a resource hungry beast but it was slow and sluggish for a JS IDE. But, fast forward a year, I’m not sure if it got more efficient or my machine upgrades provide it with the juice it needs but WHOAAA! I’m running it on both Fedora 20 and OSX with i5 and i7 processors and 16Gb ram in each, it’s the tool I was expecting it to be. Fast, great linting, unmatched intellisense. It’s a great product. Sometimes you can get the feeling it’s got too much on screen but it’s just a case of finding the configuration that works for you. It is loaded with keyboard shortcuts so my advice is to print out a Webstorm cheatsheet and tack it to the wall beside your screen. When you start storing them in muscle memory, you’ll barely even need a mouse in your life! Check out the 30 day trial!
Atom
This is worth a mention and with a tagline of “The hackable text editor” its definitely one to keep an eye on. A Javascript editor written in Javascript! It’s being developed by GitHub. Imagine Sublime Text that you can write your own plugins in Javascript! Cool…eh? I got on the beta trial a few months ago and it seemed a bit unstable but definitely a watch this space product! You can check out the github page where the code is hosted, I was suprised to find it written in CoffeeScript. I’m quite happy about this as I’ve just made the move to CoffeeScript myself.
Online Javascript Playgrounds
Jsfiddle.net
I like this webapp to test out exactly what happens in a particular scenario that you’re not quite sure what way Javascript will react. Yesterday, I had a case during a code review I was doing where a setInterval as being assigned to a var and a clearInterval was being called a little later, but a deviation in the code path caused a second setInterval to be assigned to that same var. I had suspected then that the var would only hold reference to the last one and therefore keep the first one ticking on but just wanted to make sure. A few seconds later I confirmed it and dinged the commit explaining why. It’s also useful that you can send your JSFiddle to the person to explain what you mean.
JSbin.com
Exactly the same idea as JSFiddle except I like the fact that it live reloads so you don’t have to click a run button each time. Just write your JS and watch your logs appear in the console or output window
Codepen.io
A very clean interface that does much the same as the above two. I get the feeling this is more for mocking up full html pages rather than just knocking out a bit of Javascript though. Some very interesting demos on the “Picked Pens” section of the homepage
Performance
JSPerf.com
Great website for comparing the performance of different ways to do the same thing. For instance, whether an incrementing for loop is quicker than a decrementing for loop or while loop or a for in loop. My team mate did a blog post about this a few weeks ago (For Loop Performance). These are only micro-performance improvements, but in work, I write Javascript to run in a browser on embedded devices with limited resources so every little helps!
Podcasts
Javascript Jabber
My favorite Javascript podcast. They do weekly shows and have people on who are either working for some of the top Javascript companies or are big contributors to the open source JS community.
Frontside the podcast
I’ve just started listening to this podcast and they seem to have a ton of interesting topics of discussion. Worth checking out.
Node up (& Node down)
My teammate at CAM tech just told me about these podcasts, apparently NodeUp is an already established podcast and they’re starting a NodeDown for the Southern Hemisphere. I’ll be checking these out. You should too!
Meetups
I live in Sydney and there are many Javascript meetups. Just checkout Meetup.com. I’ve been meaning to get myself to SydJS and the Sydney NodeJs meetups. Someday I’ll get there.
MongoDb Meetup
MongoDb meetup is one I attend when I can. We use MongoDb in our side project so it’s interesting to listen to case studies and experts talk about it. Also, Stennie (@stennie) and the rest of the Mongo crew are super friendly and always willing to help out if you have any issues with your Mongo implementation.
Books
Javascript: The Good Parts – Douglas Crockford – O’Reilly
The first Javascript book I ever read. Takes you through all the concepts and topics you need to know about to get on your way to being a great Javascript programmer.
Clean Code – Robert C. Martin
This is actually a book written about Java but I constantly refer to it no matter what language I write in which is why I’m including it in my list. It takes you through examples of bad code and explains why they are bad and how to make them better by transforming them into great looking, readable code. Because after all, 99% of the time, you’re not writing code for you too look at, you’re writing code which other people need to be able to maintain with ease.
CoffeeScript Cookbook
Just started reading through this online when I was learning CoffeeScript last week. Some great examples well laid out of all the different constructs and how they translate into Javascript. Along with the CoffeeScript website, you should be up and running in CoffeeScript in no time.


# extends 'base.html' # import 'macro/forms.html' as forms # import 'macro/utils.html' as utils # block content
Missing a language here? Submit it.


public class ExperimentController
extends java.lang.Object
Has multiple constructors, each with differing reasons for use.
| Modifier and Type | Class and Description |
|---|---|
static interface |
ExperimentController.ExperimentLoadedObserver
Callback interface for when the experiment is loaded.
|
static interface |
ExperimentController.ExperimentUpdatedObserver
Callback interface for when the experiment is updated.
|
| Constructor and Description |
|---|
ExperimentController(com.google.firebase.firestore.DocumentSnapshot experimentDoc)
Initializes the controller from a known DocumentSnapshot object.
|
ExperimentController(Experiment experiment,
ExperimentType type)
Initializes the controller and sets the context to an existing Experiment object of known type.
|
ExperimentController(java.lang.String experimentId,
ExperimentController.ExperimentLoadedObserver loadedObserver,
ExperimentController.ExperimentUpdatedObserver updatedObserver)
Initializes the controller and sets the context to a string that refers to the experiment's document ID in Firestore.
|
| Modifier and Type | Method and Description |
|---|---|
void |
addTrial(Trial trial)
Adds a new trial to the experiment context handled by this controller
|
boolean |
addTrialFromUri(android.net.Uri data)
Creates a trial from a URI and adds it to the current experiment
|
void |
end()
Ends an experiment.
|
java.lang.String |
generateCountText()
Generates a standardized string stating how many trials have been completed for this experiment.
|
Experiment |
getExperimentContext()
Gets the current Experiment object owned by the controller.
|
java.lang.String |
getExperimentId()
Gets the document ID of the current experiment object owned by the controller.
|
java.util.List<? extends Trial> |
getListTrials()
Get a list of trials linked to this experiment.
|
int |
getTrialsCompleted()
Returns the number of trials that this experiment has completed.
|
ExperimentType |
getType()
Get the type of the experiment handled by this controller.
|
static ExperimentController |
newInstance(java.lang.String description,
java.lang.String region,
int minTrials,
boolean geolocationRequired,
ExperimentType type)
Sets the experiment context with the basic fields needed for a new Experiment.
|
void |
publish()
Publishes an experiment that already exists in Firebase.
|
void |
publishNewExperiment()
Publishes a new experiment and adds it to firestore.
|
void |
resume()
Resumes an experiment that was previously ended.
|
void |
unpublish()
Unpublishes an experiment that already exists in Firebase.
|
public ExperimentController(java.lang.String experimentId, @Nullable ExperimentController.ExperimentLoadedObserver loadedObserver, @Nullable ExperimentController.ExperimentUpdatedObserver updatedObserver)
Both observer parameters are optional, and behave differently. If a specific observer is to be ignored, set it to null.
experimentId
- Document ID of experiment in FirebaseloadedObserver
- Callback to use when experiment has been loaded. (Only called once)updatedObserver
- Callback to use for whenever the snapshot changes.public ExperimentController(Experiment experiment, ExperimentType type)
experiment
- An instance of Experiment.type
- Type of experimentpublic ExperimentController(@NonNull com.google.firebase.firestore.DocumentSnapshot experimentDoc)
experimentDoc
- DocumentSnapshot object to build experiment from.@NonNull public static ExperimentController newInstance(@NonNull java.lang.String description, java.lang.String region, int minTrials, boolean geolocationRequired, @NonNull ExperimentType type)
description
- The experiment description.region
- The region where the experiment is conducted.minTrials
- The minimum number of trials required for the experiment.geolocationRequired
- If geolocation is required for this experiment.type
- Type of experimentpublic java.lang.String getExperimentId()
public Experiment getExperimentContext()
public ExperimentType getType()
public void publishNewExperiment()
public int getTrialsCompleted()
public java.lang.String generateCountText()
When more than the minimum number of trials have been completed, it will print just the trial count. If less than the minimum number of trials have been completed, it will print both the minimum and current count.
public void publish()
public void unpublish()
public void end()
public void resume()
public void addTrial(Trial trial)
trial
- The new trial to add.public java.util.List<? extends Trial> getListTrials()
public boolean addTrialFromUri(android.net.Uri data)
data
- Uri which encodes a trial


Materialize, a CSS Framework based on material design
Chrome 35+, Firefox 31+, Safari 7+, IE 10+
Bolded styling surrounded by emojis indicates a breaking change.
v0.98.2 (April 14th)
v0.98.1 (March 21st)
v0.98.0 (January 25th)
v0.97.8 (October 30th, 2016)
We use Jasmine as our testing framework and we're trying to write a robust test suite for our components. If you want to help, here's a starting guide on how to write tests in Jasmine
Please read CONTRIBUTING.md for more information
If you want to help us translate the documentation into other languages, please send us an email at<EMAIL_ADDRESS>telling us which language team you want to join. We use Transifex as our localization platform and we will send you an invite there.


Toggle navigation
SWS3004 FER.
Live demo
Face expression recognition.
Talk is cheap, upload your face.
Selected image:
Upload image
Uploading image...


Since opening in 2012, Pho King IV has consistently held its deserved position at the top of the listings as one of Davis’ finest Vietnamese restaurant.
Serve delicious food at your party
Let us host your next fundraiser event
We deliver fresh food at your door
In a rush? We've got you covered
226 3rd St
Davis, CA 95616
(530) 589-8888
<EMAIL_ADDRESS>Monday-Saturday: 10a-11p
Sunday: 11a-10p


Credentials
Email
Password
Tell us something about yourself..
First name
Last name
What is your gender?
Male
Female
Create
to login


Update the values as desired, then press submit to save the changes to the server. Please note that any configuration changes will not take affect until the region is started/restarted in MGM, so that MGM can write the updated config files, and the region can load them on startup.


Toggle navigation
CBO Portal
Users
Program
Students
Heartbeat
{{ completeName }}
My Account
Edit My Account
Logout
Loading


Banka
Sign up
Firstname
Middlename
Lastname
Email
Choose Password
Confirm password
Already have an account?
Sign in
instead


CV from GitHub
Welcome,
Username
Sign out
Sign in
Sign up
Update account
User info
OAuth Apps GitHub
Get CV from GitHub


blockin(block)
Decodes that data from the block, storing it in the dsp state.
headerin(info, comment, packet)
Try to decode a vorbis header from the packet.
pcmout
Returns array of audio data
setup(info)
Initialize for decoding using the information obtained
from reading the Vorbis headers.
|


David-West, highly-principled, morally-upright Nigerian – Tinubu
by The Eagle OnlineThe All Progressives Congress National Leader, Asiwaju Bola Tinubu, has described the late former Petroleum Resources Minister, Prof. Tam David-West as a highly-principled and morally-upright Nigerian who always spoke truth to power.
Tinubu, who made the remarks in a statement issued in Lagos on Tuesday, said that the late professor of virology was a nationalist and exemplary social critic.
The News Agency of Nigeria reports that David-West died on Monday, at the age of 83.
“Tam David-West was a nationalist and social critic who always spoke truth to power.
“I will personally miss the former minister; he was one leader I admired and regularly exchanged ideas with,” he said.
Tinubu described the former minister as a leader of substance, whose voice regularly cautioned the leadership against unconstitutionality, adding that his intellectual pedigree would be sorely missed.
“Somebody who served as minister under Muhammadu Buhari as military leader and won his respect and admiration must be a man of integrity and honesty.
“I mourn with his family, both immediate and extended. I mourn with the people of Buguma, Kalabari Kingdom, the government and people of Rivers State and Nigeria, which he served selflessly.
“My prayer is that God Almighty grants him eternal rest. I also hope and pray that his good legacies will continue to endure,” he said.
Previous Post
FG to go tough on miners engaging in sharp practices
Next Post
Gov. Yahaya Bello’s re-election will change the fortunes of Kogi - Minister


While most shells are themselves fully-featured programming languages, the most common use of shell scripting to automate or tie together other programs using relatively simple sequences of commands.
We’ll practice writing scripts for a couple different scenarios and think about how shell scripts can be useful in day-to-day life, even for students.
We almost always want to start our scripts with a “shebang” line, which tells the shell how to execute the script. For example, the line below tells the shell to use the program located at /bin/sh
(a simple, but universal shell that ships with all Unix-like systems) to run the script.
#!/bin/sh
We can use other programs as well. The shebang line below will run the script with the user’s standard Python 3 interpreter.
#!/usr/bin/env python3
When we use /bin/sh
or another, similar, shell, there are options that we can set to change how the interpreter behaves. One common options is set -x
, which causes the script to terminate if any of the commands within it fail.
Putting these things together, a trivially simple script might look like this:
#!/bin/sh
set -x
echo hello world
Variables in shell scripts are used like those in other programming languages, but there are some differences in syntax and semantics.
#!/bin/sh
set -e
# Set a to a string
a="hi there"
echo $a
# This won't do quite what it seems
a="hi there"
echo $a
If we run this code, we get mostly what we expect, but why doesn’t the second version print the extra spaces? That’s because variables in shell scripts are simply interpolated into the script, so echo $a
becomes echo hi there
, which is a call to echo
with two arguments. As we know, echo joins its arguments with a single space and then prints the result.
If we want the extra spaces, we need to wrap the variable in quotes where we use it so that the shell knows it is supposed to be treated as a single value.
a="hi there"
echo "$a"
We have most of the usual stuff here. See control.sh
for a couple examples. Do note, however, that the syntax is, as with variable assignment, specific and inflexible.
We can run a command and save its output in two ways. The first is older, and still often used, but the second is the modern recommendation.
files=`ls`
files=$(ls)
We have a couple constructs that can help us combine commands together to achieve more complicated outcomes easily.
The double ampersand can be thought of a little like a logical “and” in many programming languages in that it will “short circuit”. The first command to fail will prevent the rest from running. It can also be used to run a command in a different directory.
<command> && <command>
For example:
# Run a script inside a specific directory
cd data && ../process_data.py
# Prepare to run a command, then run it,
# if the first step fails, the second step won't happen
./prep_data.py && ./process_data.py
The double pipe can be thought of like a logical “or”. If the first command succeeds then the second command will not run because the overall expression is already “true”.
<command> || <command>
For example:
# Prepare some data only if it hasn't already been done
./check_data.py || ./prep_data.py
# Print a custom error if a command fails
./process_data.py || echo "failed to process data"


Gecode::ViewArray< View > Class Template Reference
[Programming actors]
View arrays. More...
#include <array.hpp>
Public Member Functions | |
| bool | assigned (void) const |
| Test if all variables are assigned. | |
Related Functions | |
(Note that these are not member functions.) | |
| template<class ViewX , class ViewY > | |
| bool | shared (ViewArray< ViewX > x, ViewArray< ViewY > y) |
| Test whether array x together with array y contains shared views. | |
| template<class ViewX , class ViewY > | |
| bool | shared (ViewArray< ViewX > x, ViewY y) |
| Test whether array x contains a view shared with y. | |
| template<class ViewX , class ViewY > | |
| bool | shared (ViewX x, ViewArray< ViewY > y) |
| Test whether array y contains a view shared with x. | |
| template<class View > | |
| bool | shared (ViewArray< View > x) |
| Test whether array x contains shared views. | |
| template<class Char , class Traits , class View > | |
| std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &os, const ViewArray< View > &x) |
| Print array elements enclosed in curly brackets. | |
Associated types | |
|
| |
| typedef View | value_type |
| Type of the view stored in this array. | |
| typedef View & | reference |
| Type of a reference to the value type. | |
| typedef const View & | const_reference |
| Type of a constant reference to the value type. | |
| typedef View * | pointer |
| Type of a pointer to the value type. | |
| typedef const View * | const_pointer |
| Type of a read-only pointer to the value type. | |
| typedef View * | iterator |
| Type of the iterator used to iterate through this array's elements. | |
| typedef const View * | const_iterator |
| Type of the iterator used to iterate read-only through this array's elements. | |
| typedef std::reverse_iterator < View * > | reverse_iterator |
| Type of the iterator used to iterate backwards through this array's elements. | |
| typedef std::reverse_iterator < const View * > | const_reverse_iterator |
| Type of the iterator used to iterate backwards and read-only through this array's elements. | |
Constructors and initialization | |
|
| |
| ViewArray (void) | |
| Default constructor (array of size 0). | |
| ViewArray (Space &home, int m) | |
| Allocate array with m views. | |
| ViewArray (Region &r, int m) | |
| Allocate array with m views. | |
| ViewArray (const ViewArray< View > &a) | |
| Initialize from view array a (share elements). | |
| ViewArray (Space &home, const ViewArray< View > &a) | |
| Initialize from view array a (copy elements). | |
| ViewArray (Region &r, const ViewArray< View > &a) | |
| Initialize from view array a (copy elements). | |
| const ViewArray< View > & | operator= (const ViewArray< View > &a) |
| Initialize from view array a (share elements). | |
| template<class Var > | |
| ViewArray (Space &home, const VarArgArray< Var > &a) | |
| Initialize from variable argument array a (copy elements). | |
| template<class Var > | |
| ViewArray (Region &r, const VarArgArray< Var > &a) | |
| Initialize from variable argument array a (copy elements). | |
Array size | |
|
| |
| int | size (void) const |
| Return size of array (number of elements). | |
| void | size (int n) |
| Decrease size of array (number of elements). | |
Array elements | |
|
| |
| View & | operator[] (int i) |
| Return view at position i. | |
| const View & | operator[] (int i) const |
| Return view at position i. | |
Array iteration | |
|
| |
| iterator | begin (void) |
| Return an iterator at the beginning of the array. | |
| const_iterator | begin (void) const |
| Return a read-only iterator at the beginning of the array. | |
| iterator | end (void) |
| Return an iterator past the end of the array. | |
| const_iterator | end (void) const |
| Return a read-only iterator past the end of the array. | |
| reverse_iterator | rbegin (void) |
| Return a reverse iterator at the end of the array. | |
| const_reverse_iterator | rbegin (void) const |
| Return a reverse and read-only iterator at the end of the array. | |
| reverse_iterator | rend (void) |
| Return a reverse iterator past the beginning of the array. | |
| const_reverse_iterator | rend (void) const |
| Return a reverse and read-only iterator past the beginning of the array. | |
Dependencies | |
|
| |
| void | subscribe (Space &home, Propagator &p, PropCond pc, bool schedule=true) |
| Subscribe propagator p with propagation condition pc to variable. | |
| void | cancel (Space &home, Propagator &p, PropCond pc) |
| Cancel subscription of propagator p with propagation condition pc to all views. | |
| void | subscribe (Space &home, Advisor &a) |
| Subscribe advisor a to variable. | |
| void | cancel (Space &home, Advisor &a) |
| Cancel subscription of advisor a. | |
| void | reschedule (Space &home, Propagator &p, PropCond pc) |
| Re-schedule propagator p with propagation condition pc. | |
Cloning | |
|
| |
| void | update (Space &home, ViewArray< View > &a) |
| Update array to be a clone of array a. | |
Moving elements | |
|
| |
| void | move_fst (int i) |
| Move view from position 0 to position i (shift elements to the left). | |
| void | move_lst (int i) |
Move view from position size()-1 to position i (truncate array by one). | |
| void | move_fst (int i, Space &home, Propagator &p, PropCond pc) |
| Move view from position 0 to position i (shift elements to the left). | |
| void | move_lst (int i, Space &home, Propagator &p, PropCond pc) |
Move view from position size()-1 to position i (truncate array by one). | |
| void | move_fst (int i, Space &home, Advisor &a) |
| Move view from position 0 to position i (shift elements to the left). | |
| void | move_lst (int i, Space &home, Advisor &a) |
Move view from position size()-1 to position i (truncate array by one). | |
Dropping elements | |
|
| |
| void | drop_fst (int i) |
| Drop views from positions 0 to i-1 from array. | |
| void | drop_lst (int i) |
Drop views from positions i+1 to size()-1 from array. | |
| void | drop_fst (int i, Space &home, Propagator &p, PropCond pc) |
| Drop views from positions 0 to i-1 from array. | |
| void | drop_lst (int i, Space &home, Propagator &p, PropCond pc) |
Drop assigned views from positions i+1 to size()-1 from array. | |
| void | drop_fst (int i, Space &home, Advisor &a) |
| Drop views from positions 0 to i-1 from array. | |
| void | drop_lst (int i, Space &home, Advisor &a) |
Drop assigned views from positions i+1 to size()-1 from array. | |
View equality | |
|
| |
| bool | same (void) const |
| Test whether array has multiple occurence of the same view. | |
| bool | same (const View &y) const |
| Test whether array contains a view being the same as y. | |
| void | unique (void) |
| Remove all duplicate views from array (changes element order). |
Detailed Description
template<class View>
class Gecode::ViewArray< View >
View arrays.
View arrays store views. They are typically used for storing the views with which propagators and branchers compute.
Definition at line 235 of file array.hpp.
Member Typedef Documentation
template<class View>
| typedef View Gecode::ViewArray< View >::value_type |
template<class View>
| typedef View& Gecode::ViewArray< View >::reference |
template<class View>
| typedef const View& Gecode::ViewArray< View >::const_reference |
template<class View>
| typedef View* Gecode::ViewArray< View >::pointer |
template<class View>
| typedef const View* Gecode::ViewArray< View >::const_pointer |
template<class View>
| typedef View* Gecode::ViewArray< View >::iterator |
template<class View>
| typedef const View* Gecode::ViewArray< View >::const_iterator |
template<class View>
| typedef std::reverse_iterator<View*> Gecode::ViewArray< View >::reverse_iterator |
template<class View>
| typedef std::reverse_iterator<const View*> Gecode::ViewArray< View >::const_reverse_iterator |
Constructor & Destructor Documentation
template<class View >
| Gecode::ViewArray< View >::ViewArray | ( | void | ) | [inline] |
template<class View >
| Gecode::ViewArray< View >::ViewArray | ( | Space & | home, | |
| int | m | |||
| ) | [inline] |
template<class View >
| Gecode::ViewArray< View >::ViewArray | ( | Region & | r, | |
| int | m | |||
| ) | [inline] |
template<class View>
| Gecode::ViewArray< View >::ViewArray | ( | const ViewArray< View > & | a | ) | [inline] |
template<class View>
| Gecode::ViewArray< View >::ViewArray | ( | Space & | home, | |
| const ViewArray< View > & | a | |||
| ) | [inline] |
template<class View>
| Gecode::ViewArray< View >::ViewArray | ( | Region & | r, | |
| const ViewArray< View > & | a | |||
| ) | [inline] |
template<class View>
template<class Var >
| Gecode::ViewArray< View >::ViewArray | ( | Space & | home, | |
| const VarArgArray< Var > & | a | |||
| ) | [inline] |
template<class View>
template<class Var >
| Gecode::ViewArray< View >::ViewArray | ( | Region & | r, | |
| const VarArgArray< Var > & | a | |||
| ) | [inline] |
Member Function Documentation
template<class View>
| const ViewArray< View > & Gecode::ViewArray< View >::operator= | ( | const ViewArray< View > & | a | ) | [inline] |
template<class View >
| int Gecode::ViewArray< View >::size | ( | void | ) | const [inline] |
template<class View >
| void Gecode::ViewArray< View >::size | ( | int | n | ) | [inline] |
template<class View >
| View & Gecode::ViewArray< View >::operator[] | ( | int | i | ) | [inline] |
template<class View >
| const View & Gecode::ViewArray< View >::operator[] | ( | int | i | ) | const [inline] |
template<class View >
| ViewArray< View >::iterator Gecode::ViewArray< View >::begin | ( | void | ) | [inline] |
template<class View >
| ViewArray< View >::const_iterator Gecode::ViewArray< View >::begin | ( | void | ) | const [inline] |
template<class View >
| ViewArray< View >::iterator Gecode::ViewArray< View >::end | ( | void | ) | [inline] |
template<class View >
| ViewArray< View >::const_iterator Gecode::ViewArray< View >::end | ( | void | ) | const [inline] |
template<class View >
| ViewArray< View >::reverse_iterator Gecode::ViewArray< View >::rbegin | ( | void | ) | [inline] |
template<class View >
| ViewArray< View >::const_reverse_iterator Gecode::ViewArray< View >::rbegin | ( | void | ) | const [inline] |
template<class View >
| ViewArray< View >::reverse_iterator Gecode::ViewArray< View >::rend | ( | void | ) | [inline] |
template<class View >
| ViewArray< View >::const_reverse_iterator Gecode::ViewArray< View >::rend | ( | void | ) | const [inline] |
template<class View >
| void Gecode::ViewArray< View >::subscribe | ( | Space & | home, | |
| Propagator & | p, | |||
| PropCond | pc, | |||
| bool | schedule = true | |||
| ) | [inline] |
template<class View >
| void Gecode::ViewArray< View >::cancel | ( | Space & | home, | |
| Propagator & | p, | |||
| PropCond | pc | |||
| ) | [inline] |
template<class View >
| void Gecode::ViewArray< View >::subscribe | ( | Space & | home, | |
| Advisor & | a | |||
| ) | [inline] |
template<class View >
| void Gecode::ViewArray< View >::cancel | ( | Space & | home, | |
| Advisor & | a | |||
| ) | [inline] |
template<class View >
| void Gecode::ViewArray< View >::reschedule | ( | Space & | home, | |
| Propagator & | p, | |||
| PropCond | pc | |||
| ) | [inline] |
template<class View>
| void Gecode::ViewArray< View >::update | ( | Space & | home, | |
| ViewArray< View > & | a | |||
| ) | [inline] |
template<class View >
| void Gecode::ViewArray< View >::move_fst | ( | int | i | ) | [inline] |
template<class View >
| void Gecode::ViewArray< View >::move_lst | ( | int | i | ) | [inline] |
template<class View >
| void Gecode::ViewArray< View >::move_fst | ( | int | i, | |
| Space & | home, | |||
| Propagator & | p, | |||
| PropCond | pc | |||
| ) | [inline] |
template<class View >
| void Gecode::ViewArray< View >::move_lst | ( | int | i, | |
| Space & | home, | |||
| Propagator & | p, | |||
| PropCond | pc | |||
| ) | [inline] |
template<class View >
| void Gecode::ViewArray< View >::move_fst | ( | int | i, | |
| Space & | home, | |||
| Advisor & | a | |||
| ) | [inline] |
template<class View >
| void Gecode::ViewArray< View >::move_lst | ( | int | i, | |
| Space & | home, | |||
| Advisor & | a | |||
| ) | [inline] |
template<class View >
| void Gecode::ViewArray< View >::drop_fst | ( | int | i | ) | [inline] |
template<class View >
| void Gecode::ViewArray< View >::drop_lst | ( | int | i | ) | [inline] |
template<class View >
| void Gecode::ViewArray< View >::drop_fst | ( | int | i, | |
| Space & | home, | |||
| Propagator & | p, | |||
| PropCond | pc | |||
| ) | [inline] |
template<class View >
| void Gecode::ViewArray< View >::drop_lst | ( | int | i, | |
| Space & | home, | |||
| Propagator & | p, | |||
| PropCond | pc | |||
| ) | [inline] |
template<class View >
| void Gecode::ViewArray< View >::drop_fst | ( | int | i, | |
| Space & | home, | |||
| Advisor & | a | |||
| ) | [inline] |
template<class View >
| void Gecode::ViewArray< View >::drop_lst | ( | int | i, | |
| Space & | home, | |||
| Advisor & | a | |||
| ) | [inline] |
template<class View >
| bool Gecode::ViewArray< View >::assigned | ( | void | ) | const [inline] |
template<class View >
| bool Gecode::ViewArray< View >::same | ( | void | ) | const [inline] |
template<class View>
| bool Gecode::ViewArray< View >::same | ( | const View & | y | ) | const [inline] |
template<class View >
| void Gecode::ViewArray< View >::unique | ( | void | ) | [inline] |
Friends And Related Function Documentation
template<class ViewX , class ViewY >
| bool shared | ( | ViewArray< ViewX > | x, | |
| ViewY | y | |||
| ) | [related] |
template<class ViewX , class ViewY >
| bool shared | ( | ViewX | x, | |
| ViewArray< ViewY > | y | |||
| ) | [related] |
template<class View >
| bool shared | ( | ViewArray< View > | x | ) | [related] |
template<class Char , class Traits , class View >
| std::basic_ostream< Char, Traits > & operator<< | ( | std::basic_ostream< Char, Traits > & | os, | |
| const ViewArray< View > & | x | |||
| ) | [related] |
The documentation for this class was generated from the following file:
- gecode/kernel/data/array.hpp


About Me & Skills
Welcome. My name is Arnold Kibira. I am a FullStack Web Developer who believes Batman is the greatest superhero in the mutiverse. I started my web development journey in 2019. I can write fully responsive web applications and also work very well with people. My strengths are that I deliver great work according meeting the required standards and communicate effectively and efficiently. I am proficient in the languages indicated below.
My Projects
Below are a few projects that i have worked on. Click on the image to visit the site
La Casa Della Pizza
This is a pizza website made with HTML, CSS and JavaScript that allows users to place and make their pizza and place their orders.
View source codeNewsroom
A Python-Flask web app that consumes the NEWSAPI and can allow users to view news from different sources and by different categories.
View source codeNeighbourhood
A python-django app simulating a neighbourhood application where users can login and view updates and search for businesses in their neighbourhood.
View source code


Unsubscribe a user from a post.
user id.
post id.
Get data from response.
the http response,
a string reponse.
Post ID and username to see if an entry matches. If one is found the user is following given post.
users id.
users id.
Get post by ID.
the post id.
Get all posts.
Get all news/information posts.
Get all funny/entertaining posts.
Get all users posts.
Get recent posts made by a user using username.
id of user.
Get saved posts.
users username.
Handles http errors.
an observable with a user-facing error message.
Create a post using post details object.
the post data.
Create user posts using post details object.
the post data.
Posts which have been saved by the user using username and post ID.
the post data.
Generated using TypeDoc
RedditApiService handles function calls to the API.
RedditApiService


Hello, and welcome to my porftolio website. Here you will learn about my personal and professional interests, namely within software engineering and design. When I'm not busy working on school or personal projects related to software development, these are some of the other 'hats' I enjoy wearing:


The legacy of Owl Den One
Owl Den One was the first product that I produced way back in the late 80's/early 90's.
I rediscovered a lot of the artifacts that I thought I lost due to moving, family cleansing, and other events that occur over the course of a lifetime. However, in cleaning out an old storage locker I rediscovered its rich history. I am still proud of the accomplishment.
The company and product went belly up in the early 90's at the tail end of the recession. Losing the company was a painful experience for me but it never deterred me from the great challenge it is to build something from scratch.
In many ways Owl Den One taught me how to take an idea, no matter how ill defined, and internalize it in order to convert its idea into a functioning model. Then with the model in hand create, implement, and deploy. Throughout my career I have honed the skill to endeavor designs for customers that were as far fetched as you can imagine with stunning results. Owl Den One wasn't far fetched, but it was such an endeavor.
I am eternally grateful for all the efforts of BarbaraLee Copas who was the office manager, tester, friend, and lover, who loved the product as much as I did. John Wrenn who was responsible for the project status screen and the first manual during the development of the third major rewrite. Though he did not stay long his impact was as profound as his knowledge and left a void that was never filled. As the programmer and writer of the second manual, John was really missed 8^). I would be remiss if I failed to give a shout out to Gary Wagner who was our salesman who striven valiantly to sell in the mist of a recession, to those who faced a similar fate.


--- tags: - data - deq - environment author: display_name: JP email<EMAIL_ADDRESS>date: 2011-12-08 14:21:24 -0700 categories: [] BFTARGETED: downloads: - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mV3JldlpqTGFOejg&export=download label: 'Brownfields Targeted for Cleanup: File Geodatabase' - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mWEd1TG94djhtQVE&export=download label: 'Brownfields Targeted for Cleanup: Shapefile' updates: - Nightly BFNONTARGETED: downloads: - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mc3AwY0lPT1dXUlU&export=download label: 'Brownfields Not Targeted For Cleanup: File Geodatabase' - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mWUlUSHZzMDJObUU&export=download label: 'Brownfields Not Targeted For Cleanup: Shapefile' updates: - Nightly DWMRCHazWasteUsedOilFacilities: downloads: - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mWDBsNzRMR2o4azA&export=download label: 'Hazardous Waste and Used Oil Facilities: File Geodatabase' - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mbjhlenQwdXVnMTg&export=download label: 'Hazardous Waste and Used Oil Facilities: Shapefile' updates: - Nightly DWMRCLLRWUMillFacilities: downloads: - url: https://drive.google.com/a/utah.gov/uc?id=183ENDt537lVXzgZc-qQKqCnOOL0gQ0-i&export=download label: 'Low Level Waste Disposal and Uranium Mills: File Geodatabase' - url: https://drive.google.com/a/utah.gov/uc?id=1X-DSvC4I4UDCk08y0W220SmO1GiB1uIz&export=download label: 'Low Level Waste Disposal and Uranium Mills: Shapefile' updates: - Nightly SolidWasteLandfills: downloads: - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mVnpRWVh6UmtOSlE&export=download label: 'Solid Waste Landfills: File Geodatabase' - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mNl9qSl9uWjgwM00&export=download label: 'Solid Waste Landfills: Shapefile' updates: - Nightly FormerlyUsedDefenseSites: downloads: - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mMlY0YmxLcXByUTQ&export=download label: 'FUDS: File Geodatabase' - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mLVhiWkljWHFVRzQ&export=download label: 'FUDS: Shapefile' updates: - Nighyly MilitaryMunitionsResponseProgram: downloads: - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mVEpkZW5oNWFfNFE&export=download label: 'MMRP: File Geodatabase' - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mdm4zSU9fUkNUT1E&export=download label: 'MMRP: Shapefile' updates: - Nightly EnforceableWrittenAssurances: downloads: - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7maXY4RmpObDgtdHM&export=download label: 'EWA: File Geodatabase' - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mVjh2YnBHWlFpVG8&export=download label: 'EWA: Shapefile' updates: - Nightly NationalPrioritiesList: downloads: - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mSjhoQVlmeDRyV0U&export=download label: 'NPL: File Geodatabase' - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7maDdBQUN4TU5ra2c&export=download label: 'NPL: Shapefile' updates: - Nightly SuperfundSites: downloads: - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7menpqMmh5QU16NVk&export=download label: 'SITEREM: File Geodatabase' - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mSEV2SWo5MExJU0U&export=download label: 'SITEREM: Shapefile' updates: - Nightly InstitutionalControlBufferZones: downloads: - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mMXhFdDIzN3hFbDA&export=download label: 'ICBUFFERZONES: File Geodatabase' - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mQjI2NjVEQ0pUV1U&export=download label: 'ICBUFFERZONES: Shapefile' updates: - Nightly UtahToxicReleaseInventoryTierII: downloads: - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mT0JEcVZGM3p4dEU&export=download label: 'TIER2: File Geodatabase' - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mcm4yZzFtSGdwSTg&export=download label: 'TIER2: Shapefile' updates: - Nightly ToxicReleaseInventory: downloads: - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mZTdkU2JWY1pwdTQ&export=download label: 'TRI: File Geodatabase' - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mLXBmWjh6cVVWQ3c&export=download label: 'TRI: Shapefile' updates: - Nightly VoluntaryCleanupProgram: downloads: - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mMXdCM2FNYkdualk&export=download label: 'VCP: File Geodatabase' - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mcllacW5VWXQyZFE&export=download label: 'VCP: Shapefile' updates: - Nightly FacilityUST: downloads: - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mZ1NJWWNWeWNXNzg&export=download label: 'FACILITYUST: File Geodatabase' - url: https://drive.google.com/a/utah.gov/uc?id=0ByStJjVZ7c7mLUlyNGVxVDhNdG8&export=download label: 'FACILITYUST: Shapefile' updates: - Nightly --- {% include abstract.html name="DEQ Land-Related Contaminant and Cleanup Data" stewards="Utah Department of Environmental Quality" webapp="https://enviro.deq.utah.gov/" abstract="US EPA and State designated hazardous materials storage sites and contamination clean up program sites including CERLA, National Priority List, Underground Storage Tanks (UST), Brownfields, Voluntary Cleanup (VCP), Tier 2, Toxic Release Inventory (TRI), User Oil Permitted Facilities, Formerly Used Defense (FUD), RCRA Large & Small Quantity Hazardous Waste Generators, Solid Waste Facilities, and Enforceable Written Assurance sites. To view all DEQ geographic data online, see the DEQ Interactive Map Viewer." %}
Environment.BFTARGETED contains the coordinates of Brownfields Projects targeted for cleanup. These locations were derived from maps and GPS data and represent sites, not contaminated areas. Brownfields are real property, the expansion, redevelopment, or reuse of which may be complicated by the presence or potential presence of a hazardous substance, pollutant, or contaminant. Cleaning up and reinvesting in these properties takes development pressures off of undeveloped open land, and both improves and protects the environment. For more information see: https://www.epa.gov/brownfields/.
{% include contact.html subject=page.title contact=site.data.contacts.brownfields %}
Environment.BFNONTARGETED contains the coordinates of Brownfields Projects not targeted for cleanup. These locations represent sites, not contaminated areas, and were derived from maps and GPS data. For more information see: https://www.epa.gov/brownfields/
{% include contact.html subject=page.title contact=site.data.contacts.brownfields %}
Environment.DWMRCHazWasteUsedOilFacilities contains sites that generate hazardous waste; that treat, store, or dispose of hazardous waste; and sites that transport, market, or recycle used oil.
{% include contact.html subject=page.title contact=site.data.contacts.waste %}
Environment.DWMRCLLRWUMillFacilities contains sites that treat or dispose of radioactive waste or process uranium ore.
{% include contact.html subject=page.title contact=site.data.contacts.waste %}
Environment.DWMRSolidWasteFacilities contains locations for open and closed Solid Waste Landfills in Utah.
{% include contact.html subject=page.title contact=site.data.contacts.waste %}
Environment.FUD contains locations of potential Formerly Used Defense sites. The Department of Defense (DoD) is responsible for environmental restoration of FUDS. FUD locations are based on coordinates derived from maps and GPS data. These locations represent sites, not contaminated areas.
{% include contact.html subject=page.title contact=site.data.contacts.military %}
Environment.MMRP contains locations of Military Munitions Response Program sites. MMRP manages the environmental, health and safety issues presented by unexploded ordnances (UXO), discarded military munitions (DMM) and munitions constituents (MC). Locations are based on coordinates derived from maps and GPS data. These locations represent sites, not contaminated areas.
{% include contact.html subject=page.title contact=site.data.contacts.military %}
Environment.EWA contains locations of potential Enforceable Written Assurance sites. EWAs will generally ensure to property owners or prospective property owners that there is no unacceptable risk to human health or the environment. EWA locations are based on coordinates derived from maps and GPS data. These locations represent sites, not contaminated areas.
{% include contact.html subject=page.title contact=site.data.contacts.ewa %}
Environment.NPL contains locations of Utah National Priorities List Sites. The NPL is the list of national priorities among the known releases or threatened releases of hazardous substances, pollutants, or contaminants throughout the United States. Locations are based on coordinates derived from maps and GPS data. These locations represent sites, not contaminated areas.
{% include contact.html subject=page.title contact=site.data.contacts.npl %}
Environment.SITEREM contains locations of potential EPA Superfund sites. The Comprehensive Environmental Response, Compensation, and Liability Act (CERCLA), commonly known as Superfund, imposes a tax on the chemical and petroleum industries and provides Federal authority to respond directly to releases or threatened releases of hazardous substances that may endanger public health or the environment. Locations are based on coordinates derived from maps and GPS data. These locations represent sites, not contaminated areas.
{% include contact.html subject=page.title contact=site.data.contacts.superfund %}
Environment.ICBUFFERZONES contains Institutional Control Buffer Zones in Utah.
Environment.TIER2 contains locations of Tier II facilities under the Emergency Planning and Community Right-to-Know Act (EPCRA). Qualifying facilities report on hazardous and toxic chemicals and are labeled either tier I or tier II. Locations are based on coordinates derived from maps and GPS data. These locations represent sites, not contaminated areas. The areas of contamination will be identified at a later stage.
{% include contact.html subject=page.title contact=site.data.contacts.toxic_release %}
Environment.TRI contains TRI locations in Utah. TRI is an EPA database containing data on disposal or release of toxic chemicals from U.S. facilities and information about how facilities manage those chemicals through recycling, energy recovery, and treatment. Locations are based on coordinates derived from maps and GPS data. These locations represent sites, not contaminated areas. The areas of contamination will be identified at a later stage.
{% include contact.html subject=page.title contact=site.data.contacts.toxic_release %}
Environment.VCP contains locations of Utah VCP. VCP is a program to encourage the voluntary cleanup of sites where there has been a contaminant release threatening public health and the environment. Locations are based on coordinates derived from maps and GPS data. These locations represent sites, not contaminated areas.
{% include contact.html subject=page.title contact=site.data.contacts.vcp %}
Environment.FacilityUST contains the locations of facilities with underground storage tanks.
{% include contact.html subject=page.title contact=site.data.contacts.ust %}


See: Description
| Interface | Description |
|---|---|
| ScanSchemaTracker |
Computes scan output schema from a variety of sources.
|
| Class | Description |
|---|---|
| AbstractSchemaTracker |
Base class for the projection-based and defined-schema-based
scan schema trackers.
|
| BaseTestSchemaTracker | |
| DynamicSchemaFilter |
Projection filter based on the scan schema which typically starts as fully
dynamic, then becomes more concrete as the scan progresses.
|
| DynamicSchemaFilter.DynamicTupleFilter |
Filter for a map, represented by a
TupleMetadata . |
| DynamicSchemaFilter.RowSchemaFilter |
Filter for the top-level dynamic schema.
|
| MutableTupleSchema |
A mutable form of a tuple schema.
|
| MutableTupleSchema.ColumnHandle |
Holder for a column to allow inserting and replacing columns within
the top-level project list.
|
| ProjectedColumn |
Enhanced form of a dynamic column which records all information from
the project list.
|
| ProjectionSchemaTracker |
Schema tracker for the "normal" case in which schema starts from a simple
projection list of column names, optionally with a provided schema.
|
| ScanProjectionParser |
Parse the projection list into a dynamic tuple schema.
|
| ScanProjectionParser.ProjectionParseResult | |
| ScanSchemaConfigBuilder |
Builds the configuration given to the
ScanSchemaTracker . |
| ScanSchemaResolver |
Resolves a schema against the existing scan schema.
|
| SchemaBasedTracker |
Simple "tracker" based on a defined, fixed schema.
|
| SchemaUtils |
Set of schema utilities that don't fit well as methods on the column
or tuple classes.
|
| TestDynamicSchemaFilter | |
| TestProjectedPath |
Projection creates a pattern which we match against a particular type
to see if the projection path is consistent with the type.
|
| TestProjectionParser |
Test the projection list parser: parses a list of SchemaPath
items into a detailed structure, handling duplicate or overlapping
items.
|
| TestScanSchemaTracker |
Test the scan operator schema tracker which computes the final
output schema from a variety of sources.
|
| TestScanSchemaTrackerMaps |
Maps add considerable complexity to the scan schema tracker, turning
a list of columns into a tree.
|
| TestSchemaTrackerDefined | |
| TestSchemaTrackerEarlyReaderSchema |
Tests early reader schema against a provided schema.
|
| TestSchemaTrackerInputSchema |
Test resolving various projection lists against a provided schema.
|
| TestSchemaTrackerProjection |
Test the first step of scan schema resolution: translating from the
projection parser to a dynamic schema ready for resolution.
|
| Enum | Description |
|---|---|
| DynamicSchemaFilter.NewColumnsMode |
Describes how to handle candidate columns not currently in the
scan schema, which turns out to be a surprisingly complex
question.
|
| ScanSchemaResolver.SchemaType |
Indicates the source of the schema to be analyzed.
|
| ScanSchemaTracker.ProjectionType |
Resolves a scan schema throughout the scan lifecycle. Schema resolution comes from a variety of sources. Resolution starts with preparing the schema for the first reader:
Internally, the schema may start as open (has a wildcard), but may transition to closed when processing a strict provided schema.
Once this class is complete, the scan can add columns only to an open schema. All such columns are inserted at the wildcard location. If the wildcard appears by itself, columns are appended. If the wildcard appears along with implicit columns, then the reader columns appear at the wildcard location, before the implicit columns.
Once we have the initial reader input schema, we can then further refine the schema with:
*
). In this case, the set of columns is
driven by the reader. Each scan might drive one, two or many readers. In an ideal
world, every reader would produce the same schema. In the real world, files tend
the evolve: early files have three columns, later files have five. In this case
some readers will produce one schema, other readers another. Much of the complexity
of Drill comes from this simple fact that Drill is a SQL engine that requires a
single schema for all rows, but Drill reads data sources which are free to return
any schema that they want.
A wildcard projection starts by accepting the schema produced by the first reader. In "classic" mode, later readers can add columns (causing a schema change to be sent downstream), but cannot change the types of existing columns. The code here supports a "no schema change" mode in which the first reader discovers the schema, which is then fixed for all subsequent readers. This mode cannot, however prevent schema conflicts across scans running in different fragments.
The projection list holds the columns
as requested by the user in the SELECT
clause of the query,
in the order which columns appear in that clause, along with additional
columns implied by other columns. The planner
determines which columns to project. In Drill, projection is speculative:
it is a list of names which the planner hopes will appear in the data
files. The reader must make up columns (the infamous nullable INT) when
it turns out that no such column exists. Else, the reader must figure out
the data type for any columns that does exist.
An explicit projection starts with the requested set of columns, then looks in the table schema to find matches. Columns not in the project list are not projected (not written to vectors). The reader columns provide the types of the projected columns, "resolving" them to a concrete type.
An explicit projection may include columns that do not exist in the source schema. In this case, we fill in null columns for unmatched projections.
The challenge in this case is that Drill cannot know the type of missing columns; Drill can only guess. If a reader in Scan 1 guesses a type, but a reader in Scan 2 reads a column with a different type, then a schema conflict will occur downstream.
m
, where m
is a map.
In this case, we project all members of the map. That is, the map itself
is open in the above sense. Note that a map can be open even if the scan
schema itself is closed. That is, if the projection list contains only
m
, the scan schema is closed, but the map is open (the reader will
discover the fields that make up the map.)m.x, m.y
. In this
case, we know that the downstream Project operator will pull just those two
members to the top level and discard the rest of the map. We can thus
project just those two members in the scan. As a result, the map is closed
in the above sense: any additional map members discovered by the reader will
be unprojected.m, m.x
. Here, the
generic projection takes precedence. If the specific projection includes
qualifiers, m, m.x[1]
, then that information is used to check the
type of column x
.Drill is unique in that it uses a dynamic schema with columns and/or types "to be named later." The scan must convert the dynamic schema into a concrete schema sent downstream. This class implements some of the steps in doing so.
The result of this class is a schema identical to a defined schema that a planner might produce. Since Drill is dynamic, the planner must be able to produce a dynamic schema of the form described above. If the planner has table metadata (here represented by a provided schema), then the planner could produce a concrete defined schema (all types are defined.) Or, with a lenient provided schema, the planner might produce a dynamic defined schema: one with some concrete columns, some dynamic (name-only) columns.
filename,
dir0
, etc. Implicit columns are available (at present) only for the file
storage plugin, but could be added for other storage plugins. The project list
can contain the names of implicit columns. If the query contains a wildcard,
then the project list may also contain implicit columns:
filename, *, dir0
.
Implicit columns are known to Drill, so Drill itself can provide type information
for those columns, by an external implicit column parser. That parser locates
implicit columns by name, marks the columns as implicit, and takes care of
populating the columns at read time. We use a column property,
IMPLICIT_COL_TYPE
, to mark a column as implicit. Later the scan mechanism
will omit such columns when preparing the reader schema.
If the planner were to provide a defined schema, then the planner would have parsed out the implicit columns, provided their types, and marked them as implicit. So, again, we see that this class produces, at scan time, the same defined schema that the planner might produce at plan time.
Because of the way we handle implicit columns, we can allow the provided
schema to include them. The provided schema simply adds a column (with any
name), and sets the IMPLICIT_COL_TYPE
property to indicate which
implicit column definition to use for that column. This is handy for allowing the
implicit column to include partition directories as regular columns.
We now have a parsing flow for this package:
Drill has long had a source of ambiguity: what happens if the reader has a column with the same name as an implicit column. In this flow, the ambiguity is resolved as follows:
The ProjectionFilter
classes handle projection. As it turns out, this
class must follow (variations of) the same rules when merging the provided
schema with the projection list and so on. To ensure a single implementation
of the complex projection rules, this class uses a projection filter when
resolving the provided schema. The devil is in the details, knowing when
a map is open or closed, enforcing consistency with known information, etc.
If the projection list is a wildcard, then the wildcard expands to include all columns from the provided schema, in the order of that schema. If the schema is strict, then the scan schema becomes fixed, as if an explicit projection list where used.
If the projection list is explicit, then each column is resolved against the provided schema. If the projection list includes a column not in the provided schema, then it falls to the reader (or missing columns mechanism) to resolve that particular column.
An early reader schema can work with a provided schema. In this case, the early reader schema must declare the same column type as the provided schema. This is not a large obstacle: the provided schema should have originally come from the reader (or a description of the reader) so conflicts should not occur in normal operation.
ResultSetLoader
) the reader's output schema: the set of columns
actually read by the reader.
If the projection list contained a wildcard, then the reader output schema will determine the set of columns that replaces the wildcard. (That is, all reader columns are projected and the scan schema expands to reflect the actual columns.)
If the projection list is explicit (or made so by a strict provided schema),
then the reader output schema must be a subset of the scan schema: it is an error
for the reader to include extra columns as the scan mechanism won't know what to
do with those vectors. The projection mechanism (see below) integrates with the
ResultSetLoader
to project only those columns needed; the others are
given to the reader as "dummy" column writers: writers that accept, but discard
their data.
Note the major difference between the early reader schema and the reader output schema. The early reader schema includes all the columns that the reader can read. The reader output schema includes only those columns that the reader actually read (as controlled by the projection filter.) For most readers (CSV, JSON, etc.), there is no early reader schema, there is only the reader output schema: the set of columns (modulo projection) that turned out to be in the data source.
The scan schema tracker tracks all three schemas together to form the scan output schema. Tracking the combined schema ensures we preserve the user's requested project ordering. The reader manager builds the vectors using the above mechanisms, then merges the vectors (very easy to do in a columnar system) to produce the output batch which matches the scan schema.
Scan Plan | v +--------------+ | Project List | | Parser | +--------------+ | v +-------------+ | Scan Schema | +-------------------+ | Tracker | --->| Projection Filter | +-------------+ +-------------------+ | | v v +------+ +------------+ +------------+ +-----------+ | File | ---> | Reader |---->| Result Set | ---> | Data File | | Data | | | | Loader | <--- | Reader | +------+ +------------+ +------------+ +-----------+ | | v | +------------+ Reader | | Reader | Schema | | Lifecycle | <----------+ +------------+ | | | v | +---------+ Loaded | | Output | Vectors | | Builder | <-----------+ +---------+ | v Output BatchOmitted are the details of implicit and missing columns. The scan lifecycle (not shown) orchestrates the whole process.
The result is a scan schema which can start entirely dynamic (just a wildcard or list of column names), which is then resolved via a series of steps (some of which involve the real work of the scanner: reading data.) The bottom is the output: a full-resolved scan schema which exactly describes an output data batch.
Copyright © 2021 The Apache Software Foundation. All rights reserved.