« CSS « CSS Reference
The :optional
CSS pseudo-class represents any
<input>
element that does not have the
required
attribute set on it. This allows forms to easily indicate optional fields, and to style them accordingly.
To provide an appearance for required form fields, the
:required
pseudo-class may be used.
| Feature | Firefox | Chrome | Internet Explorer | Safari | Opera |
|---|---|---|---|---|---|
| Basic support | 4 | 8 | -- | 5 | 9.5 |


For the sugar syrup, place all the ingredients into a pan and slowly bring to the boil, stirring occasionally with a wooden spoon.
Boil for about 2-3 minutes, skimming the surface if necessary. Pass the syrup through a fine sieve and leave until completely cold before using.
For the Italian meringue, place the sugar and water into a pan and slowly bring to the boil until the syrup reaches 110C/230F on a sugar thermometer.
At this stage, whisk the egg whites in the bowl of an electric mixer until firm peaks form when the whisk is removed.
As soon as the sugar reaches 121C/250F, remove the pan from the heat.
Immediately resume whisking the egg whites - with the beater at its lowest speed, pour in the melted sugar, in a thin, steady stream. CAUTION: Ensure the syrup is clear of the beaters, as it could be splashed on your hands. Continue beating for about five minutes, until the meringue is tepid.
For the passionfruit delice, blend the passion fruit pulp and the sugar syrup in a food processor until smooth. Strain the mixture through a fine sieve.
Reserve four tablespoons of the passion fruit purée and place the rest into a pan. Add the milk powder and vanilla pod and bring to the boil.
Whisk the egg yolks and sugar in a bowl until the mixture forms a ribbon when the whisk is removed.
Pour half of the passion fruit mixture onto the egg mixture, whisking continuously, then pour this custard mixture back into the pan.
Heat gently, stirring continuously with a spatula, until the custard is thick enough to coat the spatula. Do not allow it to boil.
Remove the pan from the heat and stir in the drained gelatine leaves. Set aside to cool slightly.
Discard the vanilla pod, and then pass the custard through a conical sieve into a bowl and leave to cool, stirring occasionally to prevent a skin forming.
For the base of the delice, place the sponge flan base onto a board or baking tray.
Mix together 50ml/2fl oz of the cold sugar syrup and the reserved passion fruit purée and brush this mixture over the sponge.
Place a 25cm/10in flan ring (6cm/2½in deep) onto the sponge and press down to cut out a circle, leaving the sponge as the base of the flan ring.
When the custard is lukewarm, gently fold in half of the Italian meringue (the remaining meringue can be used in another recipe). Stir in the passion fruit liqueur, and then fold in the whipped double cream. (You must now assemble the dessert immediately, before the gelatine causes the mixture to set.)
Fill the flan ring with the passion fruit custard mixture, leaving a small gap at the top, and carefully smooth the surface with a palette knife. Transfer to the freezer and chill for several hours.
Preheat the oven to 200C/400F/Gas 6.
For the tuiles, beat the butter, icing sugar and honey in a bowl until smooth.
Gradually beat in the egg whites, one at a time, until well combined. Then carefully fold in the flour using a metal spoon.
Take a piece of silicone or plastic and cut out long thin leaf shapes to create a stencil. Line a baking tray with baking parchment then place the stencil onto the tray. Using a palette knife, spread a thin layer of the tuile mixture into the cut-out part of the stencil. Carefully remove the template and repeat with the remaining mixture.
Place the tray into the oven and bake for 3-4 minutes, or until pale golden-brown.
For the glaze, place the sugar syrup and the passion fruit pulp into a pan and heat gently, then remove from the heat, stir in the drained gelatine and set aside to cool. Once cool, remove the delice from the freezer and spread the glaze over the top of the passion fruit filling. Transfer to the fridge to chill again before serving.
To serve, remove the flan ring by heating the outside of the ring with a blowtorch for a few seconds, then slide the ring upwards, rotating it slightly. Spoon the remaining passion fruit seeds into the centre of the delice. Place the tuiles upright around the edge of the delice to form a ring. Cut into slices to serve.


Van Basten reprimanded for “stupid” joke
The Dutch greater was heard using a phrase associated with Nazi Germany.
Marco van Basten has been suspended for a week by FOX Sports in Holland for his “stupid and inappropriate” on-air reference to Nazi Germany.
Van Basten, a three-time Ballon d’Or winner, was picked up using the words “Sieg Heil” following a pitchside interview with Heracles’ German manager Frank Wormuth on Saturday.
The phrase is associated with Nazi regime and the 55-year-old Ajax great issued an apology suggesting he was referring to his Fox colleague Hans Kraay’s pronunciation during the interview.
He has nevertheless been stood down by the broadcaster for next week’s programme, with his fee donated to a suitable charity.
A statement on foxsports.nl read: “Marco van Basten made a mistake last Saturday in the De Eretribune programme. With a wrong joke at the wrong time, he missed (the target) that evening.
“What happened was stupid and inappropriate and FOX Sports…has therefore decided this week to abandon the services of Marco van Basten as an analyst at FOX Sports. His donation is donated to the Netherlands Institute for War Documentation (NIOD), to promote awareness and knowledge about the history of the Second World War.
“Van Basten did not want to hurt anyone deliberately, apologised and accepted the consequences. FOX Sports supports the collaboration with Marco van Basten and welcomes him back to De Eretribune next Saturday, December 7.”


Search Tricks
Prefix searches with a type followed by a colon (e.g. fn:
) to restrict the search to a
given type.
Accepted types are: fn
, mod
, struct
, enum
, trait
,
type
, macro
, and const
.
Search functions by type signature (e.g. vec -> usize
or * -> vec
)
Search multiple things at once by splitting your query with comma (e.g. str,u8
or String,struct:Vec,test
)


Example:
void f(int i) {
long val = 65536 * i;
}
After the quick-fix is applied, the code changes to:
void x(int i) {
long val = 65536L * i;
}
Example:
void f(int i) {
long value = i << 24;
}
After the quick-fix is applied, the code changes to:
void f(int i) {
long value = (long) i << 24;
}
Such multiplications are often a mistake, as overflow truncation may occur unexpectedly.
Converting an int
literal to a long
literal (65536L
) fixes the problem.


STUDENT INFORMATION
INTRODUCTION
Welcome to the Professional Year Internship Program. Your work-based learning will focus on linking your knowledge and skills with situations in the workplace. It will provide you with the opportunity to put theory into practice and make you more ready for work.

An internship is a structured workplace learning experience that prepares you for the workforce. The experience with the placement provider will:
- Enable you to gain real-life experience in the workplace and improve communication skills;
- Help you link knowledge and skills with jobs; and
- Assist you into better understand theory learnt by putting it into practice.
WHAT ARE THE ADVANTAGES?
The advantages of the Internship component are:
- Learn, develop and apply knowledge and skills relevant to the workplace;
- Achieve skills that are recognised by industry;
- Obtain skills that will assist you in seeking employment;
- Gain knowledge of employers’ expectations; and
- Make contacts with employers.
- Build your Network
WHAT ARE THE INTERNS RESPONSIBILITIES?
ATTITUDES & BEHAVIOURS
You will need to:
- Show enthusiasm and initiative;
- Accept and complete duties assigned;
- Be willing to learn;
- Listen to instructions and ask questions;
- Accept and act on advice given;
- Ask for jobs when you have nothing to do;
- Be polite, courteous and well-mannered;
- Display safe practice by abiding by the policies and procedures of the placement provider;
- Avoid distracting other employees unnecessarily; and
- Dress appropriately to industry standards.
ATTENDANCE AND PUNCTUALITY
The Intern will be expected to:
- Attend your internship placement during work hours and be prepared to start your placement on time each day; take only the allocated time for meal breaks and return promptly to your work; and
- Contact your workplace supervisor and your Internship Placement Coordinator immediately if you are unable to attend.
WHAT IF I AM ILL OR CANNOT ATTEND?
If you are unable to attend your scheduled internship placement for any reason, you must inform your workplace supervisor as well as the ATMC Internship Placement Coordinator. You must submit documentary evidence such as a medical certificate to substantiate your non-attendance.
CONFIDENTIALITY
You may be exposed to information about the business and clients that will be confidential. You will be expected to maintain privacy by not repeating any of this information. In some cases, employers may want you to sign a confidentiality contract.
Discuss with your workplace supervisor what is considered confidential.
WHAT YOU NEED TO DO TO SUCCEED?
Take responsibility for your actions, discuss learning needs and concerns with your workplace supervisor, continually reflect on your performance and ensure you obtain adequate feedback on your performance from your workplace supervisor.
PLACEMENT ORIENTATION
By the end of your first day, the intern and supervisor need to read the checklist below and sign at the bottom.
ORIENTATION CHECKLIST
- Completed induction/tour of the workplace.
- Verified dates for placement and start/finish/break times.
- Identified workplace supervisor (and other key staff).
- Discussed any specific issues or concerns.
-
Aware of evacuation and fire safety arrangements.
- Emergency phone numbers;
- Extinguishers/fire blankets;
- Exit signs and assembly points; and
- Understand my responsibilities in the event of an emergency.
-
Aware of Incident / Accident arrangements.
- Know who to report to and which documentation to complete.
-
Aware of organisation’s privacy and confidentiality requirements.
-
Aware of organisation’s complaints policy and procedure.
| Student | Supervisor |
| Name: [INTERN.PRI_NAME] | Name: [SUPERVISOR.PRI_NAME] |
| Date:[INTERNSHIP_COMPLIANCE.PRI_INTERN_INDUCT_SIGNED_DATE.((dd-MMM-yyyy))] | Date:[INTERNSHIP_COMPLIANCE.PRI_SUPERVISOR_INDUCT_SIGNED_DATE.((dd-MMM-yyyy))] |
| Signature: |
Signature: |


Project Roadmap¶
Simple Returns is an active project, and like most active projects, we have an approximate roadmap for where we see the project heading. While it is not an absolute guarantee, we will try our best to honor the projections we make herein, and will make note when a projection is changing.
If you have any feedback or concerns, please feel free to submit an issue.
Carriers¶
Fedex [Supported]
UPS [Supported]
USPS [Jan. 2020]
DHL [TBD]
REST API¶
RMA [Jan. 2020]
Package [Feb. 2020]
Label [Mar. 2020]
Events¶
RMA [Available]
Package [TBD]
Label [TBD]
GraphQL¶
RMA [TBD]
Package [TBD]
Label [TBD]


t1a05-web-Joako.html
This is
bold
this is
italic
This is
both
and this isn't.
This is an online image
This is my image
This is a link
https://www.google.ca


{% extends "base.html" %} {% load i18n %} {% get_current_language as LANGUAGE_CODE %} {% block headtitle %}{% trans "Videos and Presentations" %}{% endblock %} {% block head %} {% endblock %} {% block body %}
{% blocktrans %} Below you can get your hands on the most recent presentations by Google Chrome Developer Relations and friends. Video is shared if available and you can view them by person, topic or event. {% endblocktrans %}
{% blocktrans %}Filter the talks to your liking{% endblocktrans %}


Storage and Playback In a Nutshell
PubNub's Storage and Playback feature, also referred as History API, enables you to store messages temporary as they are published, and retrieve the previously-published messages at a later time. (API)Demo
See the previous section to see How to Play Tic-Tac-Toe.
You (X):
- Stay on this browser
- Play when your opponent is ready
Your opponent (O) should be playing from this URL:
To demonstrate how PubNub Storage and Playback (History API) works, each move is recorded by sending the data to PubNub data stream with timestamp. You will see how the API works after the game!
Game ID:
You:
It is your turn!
You:
It is your turn!
History API Explained
This game has maximum 9 moves. Each move data is sent to PubNub, so that you can track back 9 messages using History API. Let's see how the API with these optional attributes works:
History count:
Reverse the traversal order
True will return messages in first-in-first-out (FIFO) order.
This is disregarded, when the time is specified.
Specific Time span


new Cache(game)
Phaser.Cache constructor.
Parameters:
| Name | Type | Description |
|---|---|---|
game |
Phaser.Game | A reference to the currently running game. |
- Source:
Members
-
game
-
- Source:
Properties:
Name Type Description game
Phaser.Game Local reference to game.
-
onSoundUnlock
-
- Source:
Properties:
Name Type Description onSoundUnlock
Phaser.Signal This event is dispatched when the sound system is unlocked via a touch event on cellular devices.
Methods
-
addBitmapData(key, bitmapData) → {Phaser.BitmapData}
-
Add a BitmapData object in to the cache.
Parameters:
Name Type Description key
string Asset key for this BitmapData.
bitmapData
Phaser.BitmapData The BitmapData object to be addded to the cache.
- Source:
Returns:
The BitmapData object to be addded to the cache.
- Type
- Phaser.BitmapData
-
addBitmapFont(key, url, data, xmlData)
-
Add a new Bitmap Font.
Parameters:
Name Type Description key
string The unique key by which you will reference this object.
url
string URL of this font xml file.
data
object Extra font data.
xmlData
object Texture atlas frames data.
- Source:
-
addCanvas(key, canvas, context)
-
Add a new canvas object in to the cache.
Parameters:
Name Type Description key
string Asset key for this canvas.
canvas
HTMLCanvasElement Canvas DOM element.
context
CanvasRenderingContext2D Render context of this canvas.
- Source:
-
addDefaultImage()
-
Adds a default image to be used in special cases such as WebGL Filters. Is mapped to the key __default.
- Source:
-
addImage(key, url, data)
-
Add a new image.
Parameters:
Name Type Description key
string The unique key by which you will reference this object.
url
string URL of this image file.
data
object Extra image data.
- Source:
-
addMissingImage()
-
Adds an image to be used when a key is wrong / missing. Is mapped to the key __missing.
- Source:
-
addRenderTexture(key, texture)
-
Add a new Phaser.RenderTexture in to the cache.
Parameters:
Name Type Description key
string The unique key by which you will reference this object.
texture
Phaser.Texture The texture to use as the base of the RenderTexture.
- Source:
-
addSound(key, url, data, webAudio, audioTag)
-
Add a new sound.
Parameters:
Name Type Description key
string Asset key for the sound.
url
string URL of this sound file.
data
object Extra sound data.
webAudio
boolean True if the file is using web audio.
audioTag
boolean True if the file is using legacy HTML audio.
- Source:
-
addSpriteSheet(key, url, data, frameWidth, frameHeight, frameMax)
-
Add a new sprite sheet in to the cache.
Parameters:
Name Type Description key
string The unique key by which you will reference this object.
url
string URL of this sprite sheet file.
data
object Extra sprite sheet data.
frameWidth
number Width of the sprite sheet.
frameHeight
number Height of the sprite sheet.
frameMax
number How many frames stored in the sprite sheet.
- Source:
-
addText(key, url, data)
-
Add a new text data.
Parameters:
Name Type Description key
string Asset key for the text data.
url
string URL of this text data file.
data
object Extra text data.
- Source:
-
addTextureAtlas(key, url, data, atlasData, format)
-
Add a new texture atlas.
Parameters:
Name Type Description key
string The unique key by which you will reference this object.
url
string URL of this texture atlas file.
data
object Extra texture atlas data.
atlasData
object Texture atlas frames data.
format
number The format of the texture atlas.
- Source:
-
addTilemap(key, url, mapData, format)
-
Add a new tilemap.
Parameters:
Name Type Description key
string The unique key by which you will reference this object.
url
string URL of the tilemap image.
mapData
object The tilemap data object.
format
number The format of the tilemap data.
- Source:
-
addTileset(key, url, data, tileWidth, tileHeight, tileMax, tileMargin, tileSpacing)
-
Add a new tile set in to the cache.
Parameters:
Name Type Argument Default Description key
string The unique key by which you will reference this object.
url
string URL of this tile set file.
data
object Extra tile set data.
tileWidth
number Width of the sprite sheet.
tileHeight
number Height of the sprite sheet.
tileMax
number How many tiles stored in the sprite sheet.
tileMargin
number <optional>
0 If the tiles have been drawn with a margin, specify the amount here.
tileSpacing
number <optional>
0 If the tiles have been drawn with spacing between them, specify the amount here.
- Source:
-
checkImageKey(key) → {boolean}
-
Checks if an image key exists.
Parameters:
Name Type Description key
string Asset key of the image you want.
- Source:
Returns:
True if the key exists, otherwise false.
- Type
- boolean
-
decodedSound(key, data)
-
Add a new decoded sound.
Parameters:
Name Type Description key
string Asset key for the sound.
data
object Extra sound data.
- Source:
-
destroy()
-
Clears the cache. Removes every local cache object reference.
- Source:
-
getBitmapData(key) → {Phaser.BitmapData}
-
Get a BitmapData object from the cache by its key.
Parameters:
Name Type Description key
string Asset key of the BitmapData object you want.
- Source:
Returns:
The requested BitmapData object if found, or null if not.
- Type
- Phaser.BitmapData
-
getCanvas(key) → {object}
-
Get a canvas object from the cache by its key.
Parameters:
Name Type Description key
string Asset key of the canvas you want.
- Source:
Returns:
The canvas you want.
- Type
- object
-
getFrame(key) → {Phaser.Frame}
-
Get a single frame by key. You'd only do this to get the default Frame created for a non-atlas/spritesheet image.
Parameters:
Name Type Description key
string Asset key of the frame data you want.
- Source:
Returns:
The frame data you want.
- Type
- Phaser.Frame
-
getFrameByIndex(key) → {Phaser.Frame}
-
Get a single frame out of a frameData set by key.
Parameters:
Name Type Description key
string Asset key of the frame data you want.
- Source:
Returns:
The frame data you want.
- Type
- Phaser.Frame
-
getFrameByName(key) → {Phaser.Frame}
-
Get a single frame out of a frameData set by key.
Parameters:
Name Type Description key
string Asset key of the frame data you want.
- Source:
Returns:
The frame data you want.
- Type
- Phaser.Frame
-
getFrameData(key) → {Phaser.FrameData}
-
Get frame data by key.
Parameters:
Name Type Description key
string Asset key of the frame data you want.
- Source:
Returns:
The frame data you want.
- Type
- Phaser.FrameData
-
getImage(key) → {object}
-
Get image data by key.
Parameters:
Name Type Description key
string Asset key of the image you want.
- Source:
Returns:
The image data you want.
- Type
- object
-
getImageKeys() → {Array}
-
Returns an array containing all of the keys of Images in the Cache.
- Source:
Returns:
The string based keys in the Cache.
- Type
- Array
-
getKeys(array) → {Array}
-
Get the cache keys from a given array of objects. Normally you don't call this directly but instead use getImageKeys, getSoundKeys, etc.
Parameters:
Name Type Description array
Array An array of items to return the keys for.
- Source:
Returns:
The array of item keys.
- Type
- Array
-
getSound(key) → {Phaser.Sound}
-
Get sound by key.
Parameters:
Name Type Description key
string Asset key of the sound you want.
- Source:
Returns:
The sound you want.
- Type
- Phaser.Sound
-
getSoundData(key) → {object}
-
Get sound data by key.
Parameters:
Name Type Description key
string Asset key of the sound you want.
- Source:
Returns:
The sound data you want.
- Type
- object
-
getSoundKeys() → {Array}
-
Returns an array containing all of the keys of Sounds in the Cache.
- Source:
Returns:
The string based keys in the Cache.
- Type
- Array
-
getText(key) → {object}
-
Get text data by key.
Parameters:
Name Type Description key
string Asset key of the text data you want.
- Source:
Returns:
The text data you want.
- Type
- object
-
getTextKeys() → {Array}
-
Returns an array containing all of the keys of Text Files in the Cache.
- Source:
Returns:
The string based keys in the Cache.
- Type
- Array
-
getTexture(key) → {Phaser.RenderTexture}
-
Get a RenderTexture by key.
Parameters:
Name Type Description key
string Asset key of the RenderTexture you want.
- Source:
Returns:
The RenderTexture you want.
- Type
- Phaser.RenderTexture
-
getTextureFrame(key) → {Phaser.Frame}
-
Get a single frame by key. You'd only do this to get the default Frame created for a non-atlas/spritesheet image.
Parameters:
Name Type Description key
string Asset key of the frame data you want.
- Source:
Returns:
The frame data you want.
- Type
- Phaser.Frame
-
getTilemap(key) → {Object}
-
Get tilemap data by key.
Parameters:
Name Type Description key
string Asset key of the tilemap you want.
- Source:
Returns:
The tilemap data. The tileset image is in the data property, the map data in mapData.
- Type
- Object
-
getTileset(key) → {Phaser.Tileset}
-
Get tile set image data by key.
Parameters:
Name Type Description key
string Asset key of the image you want.
- Source:
Returns:
The tileset data. The tileset image is in the data property, the tile data in tileData.
- Type
- Phaser.Tileset
-
getTileSetImage(key) → {object}
-
Get tile set image data by key.
Parameters:
Name Type Description key
string Asset key of the image you want.
- Source:
Returns:
The image data you want.
- Type
- object
-
isSoundDecoded(key) → {boolean}
-
Check if the given sound has finished decoding.
Parameters:
Name Type Description key
string Asset key of the sound you want.
- Source:
Returns:
The decoded state of the Sound object.
- Type
- boolean
-
isSoundReady(key) → {boolean}
-
Check if the given sound is ready for playback. A sound is considered ready when it has finished decoding and the device is no longer touch locked.
Parameters:
Name Type Description key
string Asset key of the sound you want.
- Source:
Returns:
True if the sound is decoded and the device is not touch locked.
- Type
- boolean
-
isSpriteSheet(key) → {boolean}
-
Check whether an image asset is sprite sheet or not.
Parameters:
Name Type Description key
string Asset key of the sprite sheet you want.
- Source:
Returns:
True if the image is a sprite sheet.
- Type
- boolean
-
reloadSound(key)
-
Reload a sound.
Parameters:
Name Type Description key
string Asset key for the sound.
- Source:
-
reloadSoundComplete(key)
-
Description.
Parameters:
Name Type Description key
string Asset key for the sound.
- Source:
-
removeCanvas(key)
-
Removes a canvas from the cache.
Parameters:
Name Type Description key
string Key of the asset you want to remove.
- Source:
-
removeImage(key)
-
Removes an image from the cache.
Parameters:
Name Type Description key
string Key of the asset you want to remove.
- Source:
-
removeSound(key)
-
Removes a sound from the cache.
Parameters:
Name Type Description key
string Key of the asset you want to remove.
- Source:
-
removeText(key)
-
Removes a text from the cache.
Parameters:
Name Type Description key
string Key of the asset you want to remove.
- Source:
-
updateSound(key)
-
Description.
Parameters:
Name Type Description key
string Asset key for the sound.
- Source:


Vertically scrolls through the active window one window at a time. Use VPAGE to change the displayed area of a worksheet or macro sheet.
Syntax
VPAGE(num_windows)
Num_windows specifies the number of windows to scroll through the active window vertically. A window is defined as the number of visible rows. If 20 rows are visible in the window, VPAGE scrolls in increments of 20 rows.
If num_windows is positive, VPAGE scrolls down.
If num_windows is negative, VPAGE scrolls up.
Related Functions
HPAGE Horizontally scrolls through the active window one window at a time
HSCROLL Horizontally scrolls through a worksheet by percentage or by column number
VLINE Vertically scrolls through the active window by rows
VSCROLL Vertically scrolls through a worksheet by percentage or by row number
Return to index


JavaScript allows the omission of parentheses when invoking a function via the new
keyword and the constructor has no arguments. However, some coders believe that omitting the parentheses is inconsistent with the rest of the language and thus makes code less clear.
var person = new Person;
This rule requires parentheses when invoking a constructor with no arguments using the new
keyword in order to increase code clarity.
Examples of incorrect code for this rule:
/*eslint new-parens: "error"*/
var person = new Person;
Examples of correct code for this rule:
/*eslint new-parens: "error"*/
var person = new Person();
This rule was introduced in ESLint 0.0.6.


-
adpeps.ipeps.config
-
adpeps.ipeps.ctm
-
adpeps.ipeps.ipeps
-
adpeps.ipeps.ipeps.evaluation
-
adpeps.ipeps.models
-
adpeps.ipeps.models.common
-
adpeps.ipeps.models.heisenberg
-
adpeps.simulation
-
adpeps.simulation.run_ipeps_exci
|
-
adpeps.simulation.run_ipeps_gs
-
adpeps.utils
-
adpeps.utils.ctmtensors
-
adpeps.utils.empty_tensor
-
adpeps.utils.io
-
adpeps.utils.nested
-
adpeps.utils.printing
-
adpeps.utils.tlist
|


Hey Portland, this one is going to burn a little.
While the global perception of Portland is of a liberal weirdo wonderland, some of our city's beloved bars and world-renowned products and brands are part of the Trump support network in the Pacific Northwest.
Meet Gordon Sondland, who donated $1,000,000 for Donald Trump inauguration parties, and has received the ambassadorship to the EU. Read more about him on Wikipedia.
He's the founder and CEO of Provenance Hotels, a company that owns a group of hotels in the Pacific Northwest, and a few other places around the country..
I started to make a list of these hotels, so I could recommend to people to stay elsewhere. While reading the Provenance website, I found this page:
Whoa. These are some of the most successful names in Portland independent businesses. These are the people who make the things I love, and the spaces and menus I enjoy on a Friday night.
The Provenance website lists these "co-conspirators" (their words, not mine... but apt!) in Portland.
I know these businesses aren't evil. But I believe that the world around us is constructed by the decisions we make. So I cannot support these businesses while they partner with Provenance Hotel group and Gordon Sondland.
Please support these businesses by letting them know your concern about the part they play in enriching the people that keep Trump in power, and support a civil society by spending your money elsewhere until they've stopped doing business with Provenance.
- Jacobsen Salt
- Salt & Straw
- Lightning Bar Collective (Bye and Bye, Sweet Hereafter, Jackknife, Century)
- Quin Candy
- Austin Howe
- Imperial, Vitaly Paley
- Feast Portland
- Steven Smith Teas
- 503 Media and Events, David Rae
- Gemo Wong, Nike
I hope these business will cut ties with Provenance, so I can support them again someday.
Hotels Owned By Provenance
Portfolio of Provenance Hotels Group
- Portland, OR
- Hotel deLuxe
- Hotel Lucia
- Sentinel
- Dossier
- Heathman Hotel
- Westin Portland
- The Benson
- Seattle, OR
- Hotel Max
- Hotel Theodore
- Tacoma, WA
- Hotel Murano
- Nashville, TN
- Hotel Preston
- New Orleans, LA
- Old No. 77 Hotel and Chandlery
- Stillwater, MN
- Lora
Contribute? Feedback?
Contact Dietrich Ayala (@dietrich on Twitter or https://mastodon.social/@dietrich )
If you're a Portland business owner listed above, and have stopped doing business with Provenance, thank you! Please reach out and I'll add a note about it.


Npt documentation.

If x
is not a hold variable, x
is returned to ret
as is.
lisp_hold_set
void lisp_hold_set(addr x, addr value);
: x Hold variable
Input: value Object Input
Stores the object in the x
hold variable.
If value
is a hold variable, the object held by value
is stored in x
.
Lisp_holdv
(addr x);
addr Lisp_holdv
: x Object
Input: Object Return
Same as the function lisp_hold_value
, but returns an object.
If x
is a hold variable, the stored object is returned.
If x
is not a hold variable, the input is returned as is.
lisp_hold
void lisp_hold(addr *ret, addr value);
: value Object
input: ret Hold variable Output
Create a hold variable and store the value
and return it to ret
.
If value
is a hold variable, the value held by the function is used.
Lisp_hold
(void);
addr Lisp_hold
: hold variable Return
Creates and returns a hold variable.
The value of the hold variable is NIL
.
Function of the boolean.
void lisp_nil(addr x);
void lisp_t(addr x);
(void);
addr Lisp_nil(void); addr Lisp_t
lisp_nil
void lisp_nil(addr x);
: x Hold variable Output
Store the nil
object in the x
hold variable.
lisp_t
void lisp_t(addr x);
: x Hold variable Output
Store the t
object in the x
hold variable.
Lisp_nil
(void);
addr Lisp_nil
: nil Return
Return a nil
object.
Lisp_t
(void);
addr Lisp_t
: t Return
Return a t
object.
Function of the system object.
int lisp_nil_p(addr x);
int lisp_t_p(addr x);
int lisp_null_p(addr x);
int lisp_character_p(addr x);
int lisp_cons_p(addr x);
int lisp_list_p(addr x);
int lisp_string_p(addr x);
int lisp_symbol_p(addr x);
int lisp_strvect_p(addr x);
int lisp_array_p(addr x);
int lisp_vector_p(addr x);
lisp_nil_p
int lisp_nil_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is nil
, a non-zero value is returned.
lisp_t_p
int lisp_t_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is t
, a non-zero value is returned.
lisp_null_p
int lisp_null_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is a NULL pointer, a non-zero pointer is returned.
The NULL pointer is the same as (void *)0
in C. It is not the same as NIL
in Common Lisp.
lisp_character_p
int lisp_character_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is a character type, a non-zero value is returned.
lisp_cons_p
int lisp_cons_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is a cons, a non-zero value is returned.
lisp_list_p
int lisp_list_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is a list, a non-zero value is returned. A list is a NIL
or cons.
lisp_string_p
int lisp_string_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is a string, a non-zero value is returned.
A string is an object of type LISPTYPE_STRING
or a specialized array of one dimensional characters of type LISPTYPE_ARRAY
.
lisp_strvect_p
int lisp_strvect_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is LISPTYPE_STRING
type, a non-zero value is returned.
This is different from stringp
in Common Lisp.
lisp_symbol_p
int lisp_symbol_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is a symbol, a non-zero value is returned.
lisp_array_p
int lisp_array_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is LISPTYPE_ARRAY
type, a non-zero value is returned.
This is different from arrayp
in Common Lisp.
lisp_vector_p
int lisp_vector_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is LISPTYPE_VECTOR
type, a non-zero value is returned.
This is different from vectorp
in Common Lisp.
Function of the number object.
int lisp_fixnum_p(addr x);
int lisp_bignum_p(addr x);
int lisp_integer_p(addr x);
int lisp_ratio_p(addr x);
int lisp_rational_p(addr x);
int lisp_single_float_p(addr x);
int lisp_double_float_p(addr x);
int lisp_long_float_p(addr x);
int lisp_float_p(addr x);
int lisp_real_p(addr x);
int lisp_complex_p(addr x);
int lisp_number_p(addr x);
lisp_fixnum_p
int lisp_fixnum_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is LISPTYPE_FIXNUM
type, a non-zero value is returned.
This is not exactly the same as (typep x 'fixnum)
in Common Lisp, but it is not different in normal use.
lisp_bignum_p
int lisp_bignum_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is LISPTYPE_BIGNUM
type, a non-zero value is returned.
lisp_integer_p
int lisp_integer_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is integer
type, a non-zero value is returned.
lisp_ratio_p
int lisp_ratio_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is ratio
type, a non-zero value is returned.
lisp_rational_p
int lisp_rational_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is rational
type, a non-zero value is returned.
lisp_single_float_p
int lisp_single_float_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is single-float
type, a non-zero value is returned.
lisp_double_float_p
int lisp_double_float_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is double-float
type, a non-zero value is returned.
lisp_long_float_p
int lisp_long_float_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is long-float
type, a non-zero value is returned.
lisp_float_p
int lisp_float_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is float
type, a non-zero value is returned.
lisp_real_p
int lisp_real_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is real
type, a non-zero value is returned.
lisp_complex_p
int lisp_complex_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is complex
type, a non-zero value is returned.
lisp_number_p
int lisp_number_p(addr x);
: x Object
Input: boolean Return
If x
is a hold variable, the value held by the variable is evaluated.
If x
is number
type, a non-zero value is returned.


Please use the text box below to give us some feedback about the site.
You have already provided feedback recently.


This diagram was generated by
<SCRIPT Language="JavaScript">
document.open();
var D=new Diagram();
D.SetFrame(80, 160, 640, 460);
D.SetBorder(6, 18, 0, 6);
D.XGridDelta=1;
D.SetGridColor("#808080");
D.Draw("#FF80FF", "#000000", false);
var Size, Type, x;
Color=new Array("#000000","#FF0000","#0000FF","#000000","#FF0000","#0000FF");
for (Size=6; Size<=18; Size++)
{ x=D.ScreenX(Size);
new Dot(x, D.ScreenY(0), Size, 'smile.gif', "", "Type: smile.gif, Size:"+Size);
for (Type=1; Type<7; Type++)
new Dot(x, D.ScreenY(Type), Size, Type, Color[Type-1], "Type:"+Type+", Size:"+Size);
}
document.close();
</SCRIPT>
You can use the following methods:
- var D = new Dot(theX, theY, theSize, theType, theColor[, theTooltipText
[, theOnClickAction[, theOnMouseoverAction[, theOnMouseoutAction]]]])
//Constructor and Display, size should be 6..18, type should be 1..6 or an image
- D.SetColor(theColor) //Color
- D.SetVisibility(isVisible) //Show or Hide
- D.SetTitle(theTitle) //TooltipText
- D.MoveTo(theX, theY) //Move
- D.Delete() //Delete DIV object of D from the document
- delete D //Destructor


WordPress REST API URL for Categories.
WordPress REST API URL for Posts.
WordPress REST API URL.
Retrieves all Categories from WordPress.
Retrieves all Categories with respective first page of Posts
Get all Posts for a specific Category. OffSet controls the position among all existing Posts. Offset is initialy set to 0 and it will be increased when loading more pages.
Gets the latest post. In the HTML it's the largest one displayed on top of the TOP STORIES page.
Gets posts number 2 and 3 from the latest posts.
Gets posts number 4 and 5 from the latest posts.
Retrieves a Post from WordPress given an id.
Retrieve Posts for some ids.
Get all Posts related to a Category.
Generated using TypeDoc
This class is responsible for all requests to WordPress REST API.


Scope
What is scope?
Scope is the "environment" in which a variable lives. A variable can only be accessed and modified within it's own environment. Scope is a general programming principle, but it's important to fully understand the quirks of scoping specific to Javascript. This will help identify otherwise mysterious bugs. In Javascript, the scope of a variable is determined by the function in which it is defined. A variable defined outside of any function will have global scope.
//this variable has global scope
var globalScope = 1;
//this will print out 1
console.log(globalScope);
//if this code is being run through a JS engine in a browser, all globally scoped variables are
//attached to the "window" object.
window.globalScope = 2;
//this will print out 2
console.log(globalScope);
function func() {
/*
We are now in the scope/environment of "func"!
You'd expect the following to print out 2 as well, and with good reason. However in JS, declarations
are moved to the top of the enclosing function (this also applies to global scope declarations),
and will have a value of "undefined" until assigned otherwise. This is called "hoisting".
The variable here is being declared later in the function as a local variable, which overrides
the global declaration.
So this will print out "undefined" when the function is called.
*/
console.log(globalScope);
//Another interesting quirk is that in non-strict mode, variables assigned without a declaration
//will not throw a reference error but rather move the declaration to the global scope!
anotherGlobal = 'hi';
var globalScope = 3;
var localScope = 4;
//prints 3 when the function is called as the variable has now been assigned
console.log(globalScope);
//prints 4
console.log(localScope);
//Although globalScope is a local variable in this function, the outer globalScope can be accessed through
//the window object (again only if this code being run in the browser).
//this will print 2
console.log(window.globalScope);
window.globalScope = 5;
//this will print 5 as it's after the reassignment
console.log(window.globalScope);
}
func();
//this will now print "hi"
console.log(anotherGlobal);
//this will now print 5
console.log(globalScope);
//this will throw a reference error because "localScope" has only been defined in "func",
//and doesn't exist globally.
console.log(localScope);
Another thing to note is that function declarations are hoisted as well, before variable declarations.
//Calls the function and prints the string correctly as the function declaration was hoisted.
console.log(func());
function func() {
return 'barFood';
}
Each scope inherits it's parents' scopes, the technical term for this being "scopeception" (note: no one actually calls it this). So any function within "func" has access to the global scope, func's variables and it's own variables, and any function within that function has access to all that and it's own variables, and so on. This leads to another important concept when talking about scope, called a closure.
Closures
In Javascript, each function has a special [[scope]]
property. A reference to a function will remember its surrounding scope each time it is called. This is illustrated by the following code:
//Here is a function that returns another function.
function funcCeption() {
var something = 'Something';
function anotherFunction() {
return something;
}
return anotherFunction;
}
//Storing the return value of funcCeption creates a closure
var closure = funcCeption();
//this will print 'Something'. A reference to "something" has been kept in this new function.
console.log(closure());
There's far more to closures - this is just a simple overview. But they are an important concept to be aware of when dealing with Javascript. Here's an explanation that goes into greater detail.


Oh, snap! Clearly, this is not the page you're looking for. The page may have been renamed or removed.
Were you trying to find one of the following?
You can also use your browser's back button to return to your previous page or go home to start again.
Questions or Comments? We'd love to hear from you!
{{ site.twitter_username }}
{{ site.facebook_username }}
{{ site.github_username }}
{{ site.email }}


...this is beginning of my new journey...
This is my first html script. Let me introduce myself I just finished HTML course at SoloLearn I am pleased that learnt quite a lot so far. Michal Dengusiak
I love opensource innitatives and therefore I am working with LadybugTools. Link
Therefore I would like to thank my amazing Team who are currently working on Spider project
| gbXML Viewer Aragog Link | RAD Viewer Link |
The End


Experienced software architect and technical manager with international career.
Interested in technology, science, education, volunteering and games.
Experiments with Swift, Kotlin, Python, Docker, Raspberry Pi and technical writing.


Center for Financial Literacy (CFL) CFL is a 501(c)(3) nonprofit agency providing research and development in consumer financial education. CFL conducted the first formal job/needs analysis of the debt management and debt settlement industries in conjunction with Florida Tech’s Center for Professional Development. Keys to Success curriculum is based, in part, on this important research.
Association of Debt Counselors (ADC) While ACE delivers educational resources, ADC Advisory Board sets and monitors curriculum and testing standards and awards designations to successful certification candidates. Certification includes membership with ADC.


Tmux on lxplus - first part
(This is actually a prequel to “Tmux on lxplus”, despite being uploaded after it)
The tmux version on CERN’s lxplus is very old, 1.8. Since version 2.0 tmux has a host of neat new features, which makes it worth the pain of installing it locally. Here are the steps I took to get tmux 2.3 running on my lxplus setup.
-
Download everything (tmux requires libevent and ncurses)
$ mkdir -p $HOME/tmux_tmp $ mkdir -p $HOME/local $ cd $HOME/tmux_tmp $ wget https://github.com/tmux/tmux/archive/2.3.tar.gz $ wget https://github.com/downloads/libevent/libevent/libevent-2.0.19-stable.tar.gz $ wget ftp://ftp.gnu.org/gnu/ncurses/ncurses-5.9.tar.gz
-
Install libevent
$ tar zxvf libevent-2.0.19-stable.tar.gz $ cd libevent-2.0.19-stable $ ./configure —-prefix=$HOME/local —-disable-shared $ make $ make install $ cd ..
After the make command you might get some errors related to building the man or documentation, but you can ignore it and move on to make install.
-
Install ncurses
$ tar zxvf ncurses-5.9.tar.gz $ cd ncurses-5.9 $ export CPPFLAGS=“-P" $ ./configure —-prefix=$HOME/local —-enable-symlinks $ make $ make install $ cd ..
Here again you might get some errors while compiling, but they seem to be all related to the man command so you should be able to ignore them. The export CPPFLAGS line is to avoid another compilation error (see here: https://stackoverflow.com/questions/37475222/ncurses-6-0-compilation-error-error-expected-before-int). —enable-symlinks is also required to avoid yet another error (see here: http://lists.bestpractical.com/pipermail/shipwright/2010-June/000029.html).
-
Install tmux
$ tar xzvf 2.3.tar.gz $ cd tmux-2.3 $ ./autogen.sh $ mkdir -p build; cd build $ ../configure CFLAGS="-I$HOME/local/include -I$HOME/local/include/ncurses" LDFLAGS="-L$HOME/local/lib -L$HOME/local/include/ncurses -L$HOME/local/include" CPPFLAGS="-I$HOME/local/include -I$HOME/local/include/ncurses" --prefix=$HOME/tmux_tmp/tmux-2.3 $ make $ cp tmux $HOME/local/bin
-
Clean up
$ rm -rf $HOME/tmux_tmp
-
Add local bin to $PATH
$ export PATH=$HOME/local/bin:$PATH
(ideally add this line to ~/.bash_profile so it gets executed every time)
Done! Now just source the bash_profile again and run tmux!
Source: adapted from tmux_local_install.sh script at https://gist.github.com/ryin/3106801
(See lxplus version from https://gist.github.com/pablodecm/151e90af9787e8340562)


Id: 454
Name: Arbolian Mentirososian
Status: Alive
Species: Alien
Type:
Gender: unknown
OriginName: Árboles Mentirosos
OriginUrl: https://rickandmortyapi.com/api/location/75
LocationName: St. Gloopy Noops Hospital
LocationUrl: https://rickandmortyapi.com/api/location/16
Image: https://rickandmortyapi.com/api/character/avatar/454.jpeg
Episode: ['https://rickandmortyapi.com/api/episode/16', 'https://rickandmortyapi.com/api/episode/19', 'https://rickandmortyapi.com/api/episode/21']
Url: https://rickandmortyapi.com/api/character/454
Created: 2018-05-01T15:30:21.493Z


We are looking for a ui/ux web designer to redesign our website which is a subscription snack box company.


@*
* Copyright 2023 HM Revenue & Customs
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*@
@import uk.gov.hmrc.hmrcemailrenderer.templates.onlinepaymentservice.partials.html.surcharge_recon_row
@(params: Map[String, Any])
@uk.gov.hmrc.hmrcemailrenderer.templates.helpers.html.template_main(params, params("subject").toString) {
Telephone payments via DAPI
|
Corporate Debit Card Volume |
Corporate Debit Card Commission Value |
Credit Card Volume |
Credit Card Commission Value |
Grand Total Volume |
Grand Total Commission Value |
| SA |
@surcharge_recon_row(params("tpsDapiSurchargeReport_sa").toString.split(",").toArray)
| COTAX |
@surcharge_recon_row(params("tpsDapiSurchargeReport_ct").toString.split(",").toArray)
| NTC |
@surcharge_recon_row(params("tpsDapiSurchargeReport_ntc").toString.split(",").toArray)
| NPS/NIRS |
@surcharge_recon_row(params("tpsDapiSurchargeReport_nps").toString.split(",").toArray)
| Total |
@surcharge_recon_row(params("tpsDapiSurchargeReport_total").toString.split(",").toArray)
|
|
|
|
|
To agree with 210102014 GL balance |
Face to Face payments via DAPI
|
Corporate Debit Card Volume |
Corporate Debit Card Commission Value |
Credit Card Volume |
Credit Card Commission Value |
Grand Total Volume |
Grand Total Commission Value |
| F2F All HODS |
@surcharge_recon_row(params("f2fDapiSurchargeReport_total").toString.split(",").toArray)
| Total |
@surcharge_recon_row(params("f2fDapiSurchargeReport_total").toString.split(",").toArray)
|
|
|
|
|
To agree with 210102014 GL balance |
Online payments via DAPI
|
Corporate Debit Card Volume |
Corporate Debit Card Commission Value |
Credit Card Volume |
Credit Card Commission Value |
Grand Total Volume |
Grand Total Commission Value |
| SA |
@surcharge_recon_row(params("opsDapiSurchargeReport_sa").toString.split(",").toArray)
| COTAX |
@surcharge_recon_row(params("opsDapiSurchargeReport_cotax").toString.split(",").toArray)
| Total |
@surcharge_recon_row(params("opsDapiSurchargeReport_totalShipley").toString.split(",").toArray)
|
|
|
|
|
To agree with 210102014 GL balance |
Telephone payments via DES plus MODS
|
Corporate Debit Card Volume |
Corporate Debit Card Commission Value |
Credit Card Volume |
Credit Card Commission Value |
Grand Total Volume |
Grand Total Commission Value |
| SDLT |
@surcharge_recon_row(params("tpsTpsoCombineDesSurchargeReport_sdlt").toString.split(",").toArray)
| VAT |
@surcharge_recon_row(params("tpsTpsoCombineDesSurchargeReport_vat").toString.split(",").toArray)
| ETMP (SAFE) |
@surcharge_recon_row(params("tpsTpsoCombineDesSurchargeReport_safe").toString.split(",").toArray)
| PAYE |
@surcharge_recon_row(params("tpsTpsoCombineDesSurchargeReport_epaye").toString.split(",").toArray)
| P800 |
@surcharge_recon_row(params("tpsTpsoCombineDesSurchargeReport_p800").toString.split(",").toArray)
| PNGR |
@surcharge_recon_row(params("tpsTpsoCombineDesSurchargeReport_pngr").toString.split(",").toArray)
| FChB |
@surcharge_recon_row(params("tpsTpsoCombineDesSurchargeReport_childBenefitRepayments").toString.split(","))
| PPT |
@surcharge_recon_row(params("tpsTpsoCombineDesSurchargeReport_ppt").toString.split(","))
| Total |
@surcharge_recon_row(params("tpsTpsoCombineDesSurchargeReport_total").toString.split(",").toArray)
|
|
|
|
|
|
To agree with 210102014 GL balance |
|
Corporate Debit Card Volume |
Corporate Debit Card Commission Value |
Credit Card Volume |
Credit Card Commission Value |
Grand Total Volume |
Grand Total Commission Value |
| MODS |
@surcharge_recon_row(params("topsJustModsSurchargeReport_mods").toString.split(",").toArray)
Face to Face payments via DES
|
Corporate Debit Card Volume |
Corporate Debit Card Commission Value |
Credit Card Volume |
Credit Card Commission Value |
Grand Total Volume |
Grand Total Commission Value |
| F2F All HODS |
@surcharge_recon_row(params("f2fDesSurchargeReport_total").toString.split(",").toArray)
| Total |
@surcharge_recon_row(params("f2fDesSurchargeReport_total").toString.split(",").toArray)
|
|
|
|
|
To agree with 210102014 GL balance |
Online payments via DES plus MODS
|
Corporate Debit Card Volume |
Corporate Debit Card Commission Value |
Credit Card Volume |
Credit Card Commission Value |
Grand Total Volume |
Grand Total Commission Value |
| SDLT |
@surcharge_recon_row(params("opsDesNoModsSurchargeReport_sdlt").toString.split(",").toArray)
| VAT |
@surcharge_recon_row(params("opsDesNoModsSurchargeReport_vat").toString.split(",").toArray)
| PAYE |
@surcharge_recon_row(params("opsDesNoModsSurchargeReport_paye").toString.split(",").toArray)
| ETMP (MISC) |
@surcharge_recon_row(params("opsDesNoModsSurchargeReport_misc").toString.split(",").toArray)
| P800 |
@surcharge_recon_row(params("opsDesNoModsSurchargeReport_p800").toString.split(",").toArray)
| SIMPLE ASS. |
@surcharge_recon_row(params("opsDesNoModsSurchargeReport_simpleAssessment").toString.split(",").toArray)
| CGT |
@surcharge_recon_row(params("opsDesNoModsSurchargeReport_cgt").toString.split(",").toArray)
| PNGR |
@surcharge_recon_row(params("opsDesNoModsSurchargeReport_pngr").toString.split(",").toArray)
| CDS |
@surcharge_recon_row(params("opsDesNoModsSurchargeReport_cds").toString.split(",").toArray)
| FChB |
@surcharge_recon_row(params("opsDesNoModsSurchargeReport_childBenefitRepayments").toString.split(","))
| VOSS |
@surcharge_recon_row(params("opsDesNoModsSurchargeReport_vatOss").toString.split(","))
| PPT |
@surcharge_recon_row(params("opsDesNoModsSurchargeReport_ppt").toString.split(","))
| Total |
@surcharge_recon_row(params("opsDesNoModsSurchargeReport_total").toString.split(",").toArray)
|
|
|
|
|
|
To agree with 210102014 GL balance |
|
Corporate Debit Card Volume |
Corporate Debit Card Commission Value |
Credit Card Volume |
Credit Card Commission Value |
Grand Total Volume |
Grand Total Commission Value |
| MODS |
@surcharge_recon_row(params("opsDesJustModsSurchargeReport_mods").toString.split(",").toArray)
From HMRC Online Payments team
}


Science Hack Day is a two-day event where anyone excited about making weird, silly or serious things with science comes together in the same physical space to see what they can prototype within 30 consecutive hours.
The mission of Science Hack Day is to get excited and make things with science! People organically form multidisciplinary teams over the course of a weekend: particle physicists team up with designers, marketers join forces with open source rocket scientists, writers collaborate with molecular biologists, and developers partner with school kids. By collaborating on focused tasks during this short period, small groups of hackers are capable of producing remarkable results.
Science Hack Day is organized with the motive of collaborating on focused tasks during a short period of time, small groups of hackers are capable of producing remarkable results given the right conditions
Workshops will run parallel to the main event. About 200 students from various highschools in and around Belgaum will participate in the workshops. A dedicated team of volunteers, mainly engineering students and Science teachers, will conduct these hands on workshops.
Sponsorship helps keep Science Hack Day a free and fun event for the community to attend. In addition to being free to attend, Science Hack Day is organized by volunteers and wouldn’t be possible without sponsors.
-
------------------


Test 2 Javascript
Link to test1.html
Javscript evaluate test
JQuery test
This text should be replaced by the JQuery test
JS function in body test
JS function in head test
JS function in external file test
JS function in external file referenced in body test


The tiles in some particular bathroom form the following pattern:
Up to a certain height, the tiles form a typical up/down/left/right grid, and above that height, the tiles form a grid at a 45 degree angle to the original grid.
At the line where the two intersect are the long diagonals of the 45 degree rotated tiles. The tiles above and below the line are the same tiles, so the
diagonals are √2 times as long as the sides of the lower tiles.
Notice that they don't line up perfectly: 2 of the longer diagonals is just short of the length of 3 of the sides, and 5 of the longer diagonals is just
slightly longer than the length of 7 of the sides. This gives us the following approximations:
The interactive below allows you to explore how we can use this sort of tiling to come up with rational approximations to all sorts of numbers:
Rational Approximations
Instructions
On the number line below, multiples of the selected number (α) are shown above a standard number line.
Click and drag or use the left and right arrow buttons to move the number line back and forth until the center blue line is over a spot where a multiple of α nearly lines up with a whole number on the number line.
This will give you a good rational approximation for α. A comparison of this approximation with the true value is shown above.
Further information about this approximation is shown below.
You can zoom in and out on the number line using the scroll wheel, or by adjusting the minimum x value and maximum x value shown in the window (xmin and xmax).
Increasing the info tolerance value will cause information about approximations to pop up more frequently (i.e. for worse approximations).
It may be helpful for finding good approximations to jump from some point on the number line to some multiple of it. The multiplier feature will help you do that.
Interactive
α = √n n:
α = n√m n:
m:
α = logm(n)
n:
m:
α =
α =
Click and drag or use the buttons below to scroll left/right, use the scroll wheel to zoom.
xmin:
xmax:
info tolerance: (increase this number to get information about more (worse) rational approximations)
multiplier:


Source code for azblobexplorer.delete
from .base import BlobBase
from .exceptions import NoBlobsFound
[docs]class AzureBlobDelete(BlobBase):
"""
Delete file and folder from Azure blob storage.
"""
[docs] def delete_file(self, file_name: str, timeout: int = 10) -> bool:
"""
Delete a file from Azure Storage Blob.
:param str file_name:
Give a file name to delete
:param int timeout: Request timeout in seconds
.. versionadded:: 2.0
:rtype: bool
:returns: ``True`` if a file is deleted.
>>> from azblobexplorer import AzureBlobDelete
>>> az = AzureBlobDelete('account name', 'account key', 'container name')
>>> az.delete_file('file_name.txt')
True
"""
blob = self.container_client.get_blob_client(file_name)
blob.delete_blob(timeout=timeout)
return True
[docs] def delete_files(self, file_names: list, timeout: int = 10) -> bool:
"""
Delete a list of file from Azure Storage Blob.
:param str file_names:
Give a list of file names to delete
:param int timeout: Request timeout in seconds
.. versionadded:: 2.0
:rtype: bool
:returns: ``True`` if files are deleted.
>>> from azblobexplorer import AzureBlobDelete
>>> az = AzureBlobDelete('account name', 'account key', 'container name')
>>> blob_list = [
... 'folder_1/file1.txt',
... 'file3.txt'
... ]
>>> az.delete_files(blob_list)
True
"""
for file in file_names:
self.delete_file(file, timeout=timeout)
return True
[docs] def delete_folder(self, blob_folder_name: str, timeout: int = 10) -> bool:
"""
Delete a folder from Azure Storage Blob.
:param str blob_folder_name:
Give a folder name to delete
:param int timeout: Request timeout in seconds
.. versionadded:: 2.0
:rtype: bool
:returns: ``True`` if a folder is deleted.
:raises NoBlobsFound: If the blob folder is empty or is not found.
>>> from azblobexplorer import AzureBlobDelete
>>> az = AzureBlobDelete('account name', 'account key', 'container name')
>>> az.delete_folder('temp/')
True
"""
blobs = list(self.container_client.list_blobs(blob_folder_name))
if len(blobs) == 0:
raise NoBlobsFound(
"There where 0 blobs found with blob path '{}'".format(blob_folder_name))
for blob in blobs:
self.delete_file(blob.name, timeout=timeout)
return True
[docs] def delete_container(self, timeout: int = 10) -> bool:
"""
Delete the current container.
:param int timeout: Request timeout in seconds
.. versionadded:: 2.0
:rtype: bool
:return: Returns ``True`` is the current container is deleted.
>>> from azblobexplorer import AzureBlobDelete
>>> az = AzureBlobDelete('account name', 'account key', 'container name')
>>> az.delete_container()
True
"""
self.container_client.delete_container(timeout=10)
return True


I am thinking of a number between 1-100
Can you guess it?
Guess
No. Of Guesses: 0
Guessed Numbers: None


First panel content goes here...
First panel content goes here...
First panel content goes here...
First panel content goes here...
First panel content goes here...
First panel content goes here...
First panel content goes here...
First panel content goes here...


Not Alone
About
Make a Square
Resources
Contact
Your browser does not support the
video
element.
Your browser does not support the
audio
element.
Your browser does not support the
audio
element.
Your browser does not support the
video
element.
TIPS
Click a quilt square for related multimedia.
To stich your own quilt, [COMING SOON!]


|
The Red Matrix
|
Public Member Functions | |
| __construct ($data) | |
| get_template_data ($alike, $dlike, $thread_level=1) | |
| get_id () | |
| is_threaded () | |
| add_child ($item) | |
| get_child ($id) | |
| get_children () | |
| remove_child ($item) | |
| set_conversation ($conv) | |
| get_conversation () | |
| get_data () | |
| get_data_value ($name) | |
| Public Member Functions inherited from BaseObject | |
| get_app () | |
Public Attributes | |
| $data = array() | |
Protected Member Functions | |
| set_parent ($item) | |
| remove_parent () | |
| get_parent () | |
| check_wall_to_wall () | |
Private Member Functions | |
| get_template () | |
| is_toplevel () | |
| count_descendants () | |
| get_comment_box_template () | |
| get_comment_box ($indent) | |
| get_redirect_url () | |
| is_wall_to_wall () | |
| get_owner_url () | |
| get_owner_photo () | |
| get_owner_name () | |
| is_visiting () | |
Private Attributes | |
| $template = 'conv_item.tpl' | |
| $comment_box_template = 'comment_item.tpl' | |
| $toplevel = false | |
| $children = array() | |
| $parent = null | |
| $conversation = null | |
| $redirect_url = null | |
| $owner_url = '' | |
| $owner_photo = '' | |
| $owner_name = '' | |
| $wall_to_wall = false | |
| $threaded = false | |
| $visiting = false | |
| $channel = null | |
Additional Inherited Members | |
| Static Public Member Functions inherited from BaseObject | |
| static | set_app ($app) |
An item
| Item::__construct | ( | $data | ) |
| Item::add_child | ( | $item | ) |
Add a child item
Referenced by __construct().
|
protected |
Check if we are a wall to wall item and set the relevant properties
Referenced by get_template_data().
|
private |
Count the total of our descendants
Referenced by get_template_data().
| Item::get_child | ( | $id | ) |
Get a child by its ID
Referenced by add_child().
| Item::get_children | ( | ) |
Get all our children
Referenced by count_descendants(), get_child(), get_template_data(), remove_child(), and set_conversation().
|
private |
Get the comment box
Returns: _ The comment box string (empty if no comment box) _ false on failure
Referenced by get_template_data().
|
private |
Get the template for the comment box
Referenced by get_comment_box().
| Item::get_conversation | ( | ) |
get conversation
Referenced by check_wall_to_wall(), get_comment_box(), and get_template_data().
| Item::get_data | ( | ) |
| Item::get_data_value | ( | $name | ) |
Get a data value
Returns: _ value on success _ false on failure
Referenced by __construct(), check_wall_to_wall(), get_id(), and get_template_data().
| Item::get_id | ( | ) |
Referenced by __construct(), get_comment_box(), and get_template_data().
|
private |
Referenced by get_template_data().
|
private |
Referenced by get_template_data().
|
private |
Referenced by get_template_data().
|
protected |
Get parent item
Referenced by set_parent().
|
private |
|
private |
Get template
Referenced by get_template_data().
| Item::get_template_data | ( | $alike, | |
| $dlike, | |||
$thread_level = 1 |
|||
| ) |
Get data in a form usable by a conversation template
Returns: _ The data requested on success _ false on failure
| Item::is_threaded | ( | ) |
Referenced by get_comment_box(), and get_template_data().
|
private |
Check if this is a toplevel post
Referenced by check_wall_to_wall(), get_comment_box(), and get_template_data().
|
private |
|
private |
| Item::remove_child | ( | $item | ) |
Remove a child
|
protected |
Remove our parent
| Item::set_conversation | ( | $conv | ) |
set conversation
Referenced by set_parent().
|
protected |
Set our parent
|
private |
|
private |
Referenced by count_descendants(), get_children(), and get_template_data().
|
private |
Referenced by get_comment_box_template().
|
private |
Referenced by get_conversation().
| Item::$data = array() |
Referenced by __construct(), and get_data().
|
private |
Referenced by get_owner_name().
|
private |
Referenced by get_owner_photo().
|
private |
Referenced by get_owner_url().
|
private |
Referenced by get_parent(), and set_parent().
|
private |
Referenced by get_redirect_url().
|
private |
Referenced by get_comment_box(), and get_template().
|
private |
Referenced by is_threaded().
|
private |
Referenced by is_toplevel().
|
private |
Referenced by is_visiting().
|
private |
Referenced by is_wall_to_wall().


Did you experience any of the following problems with the application at the moment?
If you are experiencing problems with this computer at the moment, please report below. Use the application tabs if problems are specific to a single application.
Did you experience any of the following problems with the application at the moment?


Open source automated aquaponics done right!
Aquaponics systems are closed/semi-closed eco systems that grow fish and vegetables biologically. Nebulair has an open source Github Repository with all the information about how to make your own automated aquaponics system, including the code and order list for the hardware.
Check out our repoYou can find all the information to make your own automated aquaponics system in our repo
We connect all the sensing data, pumping and lighting to the internet so you can controll your aquaponics system from anywhere.
We have written all the code so you can get started right away. A awesome APi to optimize your system is coming soon!
We started this project to try and make a difference. Aquaponics means no fertilizers and 90% reduction in water usage compared to traditional farming methods!


CSV means comma separated values and is often found with quite varying specifications. pgloader allows you to describe those specs in its command.
To load data with pgloader you need to define in a command the operations in some details. Here's our example for loading CSV data:
LOAD CSV
FROM 'path/to/file.csv' (x, y, a, b, c, d)
INTO postgresql:///pgloader?csv (a, b, d, c)
WITH truncate,
skip header = 1,
fields optionally enclosed by '"',
fields escaped by double-quote,
fields terminated by ','
SET client_encoding to 'latin1',
work_mem to '12MB',
standard_conforming_strings to 'on'
BEFORE LOAD DO
$$ drop table if exists csv; $$,
$$ create table csv (
a bigint,
b bigint,
c char(2),
d text
);
$$;
You can see the full list of options in the pgloader reference manual, with a complete description of the options you see here.
This command allows loading the following CSV file content:
Header, with a © sign
"<IP_ADDRESS>","<IP_ADDRESS>","33996344","33996351","GB","United Kingdom"
"<IP_ADDRESS>","<IP_ADDRESS>","50331648","68257567","US","United States"
"<IP_ADDRESS>","<IP_ADDRESS>","68257568","68257599","CA","Canada"
"<IP_ADDRESS>","<IP_ADDRESS>","68257600","68259583","US","United States"
"<IP_ADDRESS>","<IP_ADDRESS>","68259584","68259599","CA","Canada"
"<IP_ADDRESS>","<IP_ADDRESS>","68259600","68296775","US","United States"
Here's how to start loading the data. Note that the ouput here has been edited so as to facilitate its browsing online.
$ pgloader csv.load
... LOG Starting pgloader, log system is ready.
... LOG Parsing commands from file "/Users/dim/dev/pgloader/test/csv.load"
table name read imported errors time
----------------- --------- --------- --------- --------------
before load 2 2 0 0.039s
----------------- --------- --------- --------- --------------
csv 6 6 0 0.019s
----------------- --------- --------- --------- --------------
Total import time 6 6 0 0.058s
As you can see, the command described above is filtering the input and only importing some of the columns from the example data file. Here's what gets loaded in the PostgreSQL database:
pgloader# table csv;
a | b | c | d
----------+----------+----+----------------
33996344 | 33996351 | GB | United Kingdom
50331648 | 68257567 | US | United States
68257568 | 68257599 | CA | Canada
68257600 | 68259583 | US | United States
68259584 | 68259599 | CA | Canada
68259600 | 68296775 | US | United States
(6 rows)


The beginning of everything… Target audience, goals, tasks, context – blended and fused into meaningful requirements.
UX designers' main goal is to solve the end-users' problems, and thus the ability to communicate the design to stakeholders and developers is critical to the ultimate success of the design.
Great code is its own form of artistry, and it is expressive and beautifully elegant when done well. A great solution to a development challenge shows ingenuity and imagination just as much as a design challenge shows logic and science.
Qranio is an online platform where people can check their knowledge and get prizes. By signing up, users can choose a category and answer questions. For each correct answer they will receive a specific amount of iQ$ (virtual currency).
Update the layout but keep the existing identity, redesigned all icons and images. Work in the design and implematation of the windows app.
Working on a product's identity is a never-ending challenge, it always has something that can be improve or just might be different. But we managed to keep the deadlines for new versions and features during the year.
Interactive web and mobile app for the TV Show "O fantástico mundo de Saramandaia". In the mobile version you can interact with the characters and elements by touching and moving the device. Design and development of the front-end with HTML, CSS3 and JavaScript.
It had to work perfectly on all mobile devices and on the web.
I had to make two versions to get the most of the touch feature on the mobile devices.
Animations for the mobile app "Vamos Desenhar", for teaching kids how to draw. Created using After Effects.
The real job was figuring out the best software because there were a lot of steps for each character.
In the end making the animations in After Effects was the best solution I found, the challenge was interesting but the process a bit repetitive.
Illustration for "DocBrown", a Brazilian brand of t-shirts.
We had some restriction like, size and number of colors so it was necessary to make many optimizations to obtain a result similar to the idealized.
It was a successful partnership that lasted 2 years and several prints still in the market for sale.


- EMPTY - Static variable in class com.pcloud.networking.client.RequestBody
-
Used to construct an empty
RequestBody when there is no need to write any data to it
- EMPTY - Static variable in class com.pcloud.networking.protocol.DataSource
-
- endArray() - Method in class com.pcloud.networking.protocol.BytesReader
-
- endArray() - Method in class com.pcloud.networking.protocol.ForwardingProtocolReader
-
- endArray() - Method in class com.pcloud.networking.protocol.ForwardingProtocolResponseReader
-
- endArray() - Method in interface com.pcloud.networking.protocol.ProtocolReader
-
End reading an array from the source
- endObject() - Method in class com.pcloud.networking.protocol.BytesReader
-
- endObject() - Method in class com.pcloud.networking.protocol.ForwardingProtocolReader
-
- endObject() - Method in class com.pcloud.networking.protocol.ForwardingProtocolResponseReader
-
- endObject() - Method in interface com.pcloud.networking.protocol.ProtocolReader
-
End reading an object from the source
- endpoint() - Method in interface com.pcloud.networking.client.ApiChannel
-
- Endpoint - Class in com.pcloud.networking.client
-
Implementation to wrap the details of an endpoint - a host address, a port and a SocketAddress.
- Endpoint(String, int)
- Constructor for class com.pcloud.networking.client.Endpoint
-
- endpoint()
- Method in interface com.pcloud.networking.client.EndpointProvider
-
- endpoint(Endpoint)
- Method in class com.pcloud.networking.client.Request.Builder
-
- endpoint() - Method in class
com.pcloud.networking.client.Request
-
- endpoint() - Method in class
com.pcloud.networking.client.ResponseBody
-
- endpointConnectionError(Endpoint, IOException)
- Method in interface com.pcloud.networking.client.EndpointProvider
-
Called when an exception is thrown while connecting to the given
Endpoint
- EndpointProvider -
Interface in com.pcloud.networking.client
-
A contract for a provider object able to provide an
Endpoint
- endpointProvider(EndpointProvider)
- Method in class com.pcloud.networking.client.PCloudAPIClient.Builder
-
- endpointProvider()
- Method in class com.pcloud.networking.client.PCloudAPIClient
-
- endpointReadError(Endpoint, IOException)
- Method in interface com.pcloud.networking.client.EndpointProvider
-
Called when an exception is thrown while reading from the given
Endpoint
- endpointWriteError(Endpoint, IOException)
- Method in interface com.pcloud.networking.client.EndpointProvider
-
Called when an exception is thrown while writing to the given
Endpoint
- endRequest()
- Method in class com.pcloud.networking.protocol.BytesWriter
-
- endRequest()
- Method in class com.pcloud.networking.protocol.ForwardingProtocolRequestWriter
-
- endRequest() -
Method in interface com.pcloud.networking.protocol.ProtocolRequestWriter
-
Finish a request
- endResponse()
- Method in class com.pcloud.networking.protocol.BytesReader
-
- endResponse()
- Method in class com.pcloud.networking.protocol.ForwardingProtocolResponseReader
-
- endResponse()
- Method in interface com.pcloud.networking.protocol.ProtocolResponseReader
-
End reading a response from the data source
- enqueue(Callback<T>)
- Method in interface com.pcloud.networking.api.Call
-
Asynchronously send the request and notify callback
of its response or if an
error
occurred talking to the server, creating the request, or processing the response.
- enqueue(MultiCallback<T, R>) - Method in interface com.pcloud.networking.api.MultiCall
-
Enqueues asynchronously and calls a
MultiCallback to notify progress, completion or failure
- enqueue(Callback) - Method in interface com.pcloud.networking.client.Call
-
Enqueues the
Call on another thread.
- enqueue(MultiCallback) - Method in interface com.pcloud.networking.client.MultiCall
-
Executes the call on another thread and does not block the calling thread
- enqueueAndWait() - Method in interface com.pcloud.networking.api.Call
-
Sends a request on another thread but blocks the calling thread
until the operation is complete or an exception is thrown.
- enqueueAndWait(long, TimeUnit) - Method in interface com.pcloud.networking.api.Call
-
Sends a request on another thread but blocks the calling thread for
at most the amount of time specified in the arguments.
- enqueueAndWait() - Method in interface com.pcloud.networking.api.MultiCall
-
Enqueues on another thread but blocks the calling thread until completion or until an exception is thrown
- enqueueAndWait(long, TimeUnit) - Method in interface com.pcloud.networking.api.MultiCall
-
Enqueues on another thread but blocks the calling thread for
at most the amount of time specified in the arguments.
- enqueueAndWait() - Method in interface com.pcloud.networking.client.Call
-
Enqueues the call on another thread and blocks the calling thread
until the
Response is received or an exception is thrown.
- enqueueAndWait(long, TimeUnit) - Method in interface com.pcloud.networking.client.Call
-
Enqueues the call on another thread and blocks the calling thread
for at most the given time period after
which provides the
Response if ready.
- enqueueAndWait() - Method in interface com.pcloud.networking.client.MultiCall
-
Executes the calls on another thread but blocks the calling thread until the operation is complete or an exception is thrown.
- enqueueAndWait(long, TimeUnit) - Method in interface com.pcloud.networking.client.MultiCall
-
Executes the calls on another thread but blocks the calling thread for at most the duration specified in the arguments.
- equals(Object) - Method in class com.pcloud.networking.client.Endpoint
-
- equals(Object) - Method in class com.pcloud.networking.client.MultiResponse
-
- evictAll() - Method in class com.pcloud.networking.client.ConnectionPool
-
Close and remove all idle connections in the pool.
- execute() - Method in interface com.pcloud.networking.api.Call
-
Synchronously send the request and return its response.
- execute() - Method in interface com.pcloud.networking.api.MultiCall
-
Executes synchronously and blocks until completion or until an exception is thrown
- execute() - Method in interface com.pcloud.networking.client.Call
-
Executes the call.
- execute() - Method in interface com.pcloud.networking.client.MultiCall
-
Executes the calls on the same thread and blocks it until the operation is complete or an exception is thrown.


Texas band Shane Smith & The Saints plays on in OKC tonight after bus fire
by Brandy McDonnellAustin, Texas-based Shane Smith & The Saints survived a harrowing bus fire en route to their Thursday night show in Lubbock, Texas. The band escaped uninjured, but their bus and trailer were completely destroyed along with their instruments, merchandise, and personal possessions.
Still, the band is playing on in Oklahoma City, performing their previously scheduled concert at 8 tonight at the Tower Theatre, 425 NW 23. Doors open at 7 p.m. For tickets and information, go to www.towertheatreokc.com.
On the highway in Coleman, Texas, passersby alerted the driver that something was wrong with the bus, so he pulled over to investigate. To his shock he discovered flames shooting out from the undercarriage, according to a news release. The band was asleep in their bunks at the time, but luckily the driver and tour manager were able to get everyone off of the bus safely. Within minutes, the bus and trailer were completely engulfed in flames and burned down to the shell. The band was unable to remove their possessions or instruments from the fire due to the flames.
“We are thanking God that we’re all okay and everyone made it out safe. I don’t even know what to say, we lost everything. We’re so grateful for the outpouring of support from fans and fellow musicians. We’re still playing the shows, see you on the road," said Smith in a statement.
The group found transportation to their show at Cook’s Garage in Lubbock and performed on schedule Thursday with borrowed instruments loaned from fans and friends. The band plans on keeping all scheduled performances, including the show tonight at the Tower Theatre and Saturday at The Cotillion Ballroom in Wichita, Kansas.
Cook's Garage donated all the door proceeds from the show last night to the band. Organically, fans (including Tower Theatre management) have already started posting on socials to rally ticket sales and merch purchases. Additional details will be available soon for fans who wish to show their support.
Amazingly, this is not the first time the band has escaped harm with members having survived and triumphed through three previous near-death experiences: a rattlesnake bite, a motorcycle accident, and a pulmonary embolism while on tour in Malaysia.
Shane Smith and the Saints released their third album, "Hail Mary," earlier this year and have earned their large following from extensive touring in 40 states and on three different continents. The band has and more than 13 million streams on Spotify and is currently on tour. To learn more, visit ShaneSmithMusic.com.
-BAM
Related Photos


In the above, the magnetic ﬁeld is assumed to be axisymmetric. With this assumption, the poloidal magnetic ﬁeld (having two components) can be expressed in terms of a single component of the vector potential A, Aϕ (speciﬁcally the poloid ﬂux function Ψ ≡ AϕR). This kind of simpliﬁcation can not be achieved if the axisymmetricity assumption is dropped, because other components of the vector potential (namely AR and AZ) will appear in the expression of the poloidal magnetic ﬁeld. Let us re-examine Eq. (2) for a magnetic perturbation:
In the study of tokamak tearing modes and turbulence, most authors narrow the possible perturbed magnetic ﬁeld by setting δAR = δAZ = 0, i.e.,|
| (44) |
|
| (45) |
|
| (46) |
where δΨ = RδAϕ. Therefore this kind of magnetic perturbation can be written in the same form of the equilibrium poloidal magnetic ﬁeld:
|
| (47) |
The above approximation is widely used in tokmaka plasma theory and simulation (e.g., tearing mode theory; turbulence simulation, where δAϕ is replaced by δA∥.) Do we miss some magnetic perturbations that is important for plasma transport by using the above speciﬁc form of magnetic ﬁeld?
The total magnetic ﬁeld is then written as
|
| (48) |
**check**Can the projection of the total magnetic ﬁeld line in the poloidal plane can be traced by tracing the contour of Ψ + δΨ? No. The contours of Ψ + δΨ will not show island structures in the poloidal plane. To show the expected island structures, we need to subtract non-reconnecting poloidal magnetic ﬁeld from the total poloidal ﬁeld. I will discuss this in Sec. (), where I show that contours of the so-called helical ﬂux will give the expected island structures near the resonant surfaces.


"Hi, I'm Bass and a developer. I love coding."
Adding this for pushing a new local branch
1
2
3
3
3
4
About
works
My works sofar


module TSort
TSort implements topological sorting using Tarjan's algorithm for strongly connected components.
TSort is designed to be able to be used with any object which can be interpreted as a directed graph.
TSort requires two methods to interpret an object as a graph, #tsort_each_node and tsort_each_child.
-
#tsort_each_node is used to iterate for all nodes over a graph.
-
#tsort_each_child is used to iterate for child nodes of a given node.
The equality of nodes are defined by eql? and hash since TSort uses Hash internally.
A Simple Example¶ ↑
The following example demonstrates how to mix the TSort module into an existing class (in this case, Hash). Here, we're treating each key in the hash as a node in the graph, and so we simply alias the required tsort_each_node method to Hash's each_key method. For each key in the hash, the associated value is an array of the node's child nodes. This choice in turn leads to our implementation of the required tsort_each_child method, which fetches the array of child nodes and then iterates over that array using the user-supplied block.
require 'tsort' class Hash include TSort alias tsort_each_node each_key def tsort_each_child(node, &block) fetch(node).each(&block) end end {1=>[2, 3], 2=>[3], 3=>[], 4=>[]}.tsort #=> [3, 2, 1, 4] {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}.strongly_connected_components #=> [[4], [2, 3], [1]]
A More Realistic Example¶ ↑
A very simple `make' like tool can be implemented as follows:
require 'tsort' class Make def initialize @dep = {} @dep.default = [] end def rule(outputs, inputs=[], &block) triple = [outputs, inputs, block] outputs.each {|f| @dep[f] = [triple]} @dep[triple] = inputs end def build(target) each_strongly_connected_component_from(target) {|ns| if ns.length != 1 fs = ns.delete_if {|n| Array === n} raise TSort::Cyclic.new("cyclic dependencies: #{fs.join ', '}") end n = ns.first if Array === n outputs, inputs, block = n inputs_time = inputs.map {|f| File.mtime f}.max begin outputs_time = outputs.map {|f| File.mtime f}.min rescue Errno::ENOENT outputs_time = nil end if outputs_time == nil || inputs_time != nil && outputs_time <= inputs_time sleep 1 if inputs_time != nil && inputs_time.to_i == Time.now.to_i block.call end end } end def tsort_each_child(node, &block) @dep[node].each(&block) end include TSort end def command(arg) print arg, "\n" system arg end m = Make.new m.rule(%w[t1]) { command 'date > t1' } m.rule(%w[t2]) { command 'date > t2' } m.rule(%w[t3]) { command 'date > t3' } m.rule(%w[t4], %w[t1 t3]) { command 'cat t1 t3 > t4' } m.rule(%w[t5], %w[t4 t2]) { command 'cat t4 t2 > t5' } m.build('t5')
Bugs¶ ↑
-
'tsort.rb' is wrong name because this library uses Tarjan's algorithm for strongly connected components. Although 'strongly_connected_components.rb' is correct but too long.
References¶ ↑
-
Tarjan, “Depth First Search and Linear Graph Algorithms”,
-
SIAM Journal on Computing, Vol. 1, No. 2, pp. 146-160, June 1972.
Public Class Methods
The iterator version of the #strongly_connected_components method.
The graph is represented by each_node and each_child.
each_node should have call
method which yields for
each node in the graph. each_child should have call
method which takes a node argument and yields for each child node.
g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]} each_node = lambda {|&b| g.each_key(&b) } each_child = lambda {|n, &b| g[n].each(&b) } TSort.each_strongly_connected_component(each_node, each_child) {|scc| p scc } #=> [4] # [2] # [3] # [1] g = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]} each_node = lambda {|&b| g.each_key(&b) } each_child = lambda {|n, &b| g[n].each(&b) } TSort.each_strongly_connected_component(each_node, each_child) {|scc| p scc } #=> [4] # [2, 3] # [1]
# File lib/tsort.rb, line 341 def TSort.each_strongly_connected_component(each_node, each_child) # :yields: nodes return to_enum(__method__, each_node, each_child) unless block_given? id_map = {} stack = [] each_node.call {|node| unless id_map.include? node TSort.each_strongly_connected_component_from(node, each_child, id_map, stack) {|c| yield c } end } nil end
Iterates over strongly connected components in a graph. The graph is represented by node and each_child.
node is the first node. each_child should have
call
method which takes a node argument and yields for each
child node.
Return value is unspecified.
#TSort.each_strongly_connected_component_from is a class method and it doesn't need a class to represent a graph which includes TSort.
graph = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]} each_child = lambda {|n, &b| graph[n].each(&b) } TSort.each_strongly_connected_component_from(1, each_child) {|scc| p scc } #=> [4] # [2, 3] # [1]
# File lib/tsort.rb, line 407 def TSort.each_strongly_connected_component_from(node, each_child, id_map={}, stack=[]) # :yields: nodes return to_enum(__method__, node, each_child, id_map, stack) unless block_given? minimum_id = node_id = id_map[node] = id_map.size stack_length = stack.length stack << node each_child.call(node) {|child| if id_map.include? child child_id = id_map[child] minimum_id = child_id if child_id && child_id < minimum_id else sub_minimum_id = TSort.each_strongly_connected_component_from(child, each_child, id_map, stack) {|c| yield c } minimum_id = sub_minimum_id if sub_minimum_id < minimum_id end } if node_id == minimum_id component = stack.slice!(stack_length .. -1) component.each {|n| id_map[n] = nil} yield component end minimum_id end
Returns strongly connected components as an array of arrays of nodes. The array is sorted from children to parents. Each elements of the array represents a strongly connected component.
The graph is represented by each_node and each_child.
each_node should have call
method which yields for
each node in the graph. each_child should have call
method which takes a node argument and yields for each child node.
g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]} each_node = lambda {|&b| g.each_key(&b) } each_child = lambda {|n, &b| g[n].each(&b) } p TSort.strongly_connected_components(each_node, each_child) #=> [[4], [2], [3], [1]] g = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]} each_node = lambda {|&b| g.each_key(&b) } each_child = lambda {|n, &b| g[n].each(&b) } p TSort.strongly_connected_components(each_node, each_child) #=> [[4], [2, 3], [1]]
# File lib/tsort.rb, line 279 def TSort.strongly_connected_components(each_node, each_child) TSort.each_strongly_connected_component(each_node, each_child).to_a end
Returns a topologically sorted array of nodes. The array is sorted from children to parents, i.e. the first element has no child and the last node has no parent.
The graph is represented by each_node and each_child.
each_node should have call
method which yields for
each node in the graph. each_child should have call
method which takes a node argument and yields for each child node.
If there is a cycle, TSort::Cyclic is raised.
g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]} each_node = lambda {|&b| g.each_key(&b) } each_child = lambda {|n, &b| g[n].each(&b) } p TSort.tsort(each_node, each_child) #=> [4, 2, 3, 1] g = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]} each_node = lambda {|&b| g.each_key(&b) } each_child = lambda {|n, &b| g[n].each(&b) } p TSort.tsort(each_node, each_child) # raises TSort::Cyclic
# File lib/tsort.rb, line 174 def TSort.tsort(each_node, each_child) TSort.tsort_each(each_node, each_child).to_a end
The iterator version of the #tsort method.
The graph is represented by each_node and each_child.
each_node should have call
method which yields for
each node in the graph. each_child should have call
method which takes a node argument and yields for each child node.
g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]} each_node = lambda {|&b| g.each_key(&b) } each_child = lambda {|n, &b| g[n].each(&b) } TSort.tsort_each(each_node, each_child) {|n| p n } #=> 4 # 2 # 3 # 1
# File lib/tsort.rb, line 222 def TSort.tsort_each(each_node, each_child) # :yields: node return to_enum(__method__, each_node, each_child) unless block_given? TSort.each_strongly_connected_component(each_node, each_child) {|component| if component.size == 1 yield component.first else raise Cyclic.new("topological sort failed: #{component.inspect}") end } end
Public Instance Methods
The iterator version of the strongly_connected_components
method. obj.each_strongly_connected_component
is
similar to obj.strongly_connected_components.each
,
but modification of obj during the iteration may lead to
unexpected results.
each_strongly_connected_component
returns nil
.
class G include TSort def initialize(g) @g = g end def tsort_each_child(n, &b) @g[n].each(&b) end def tsort_each_node(&b) @g.each_key(&b) end end graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}) graph.each_strongly_connected_component {|scc| p scc } #=> [4] # [2] # [3] # [1] graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}) graph.each_strongly_connected_component {|scc| p scc } #=> [4] # [2, 3] # [1]
# File lib/tsort.rb, line 312 def each_strongly_connected_component(&block) # :yields: nodes each_node = method(:tsort_each_node) each_child = method(:tsort_each_child) TSort.each_strongly_connected_component(each_node, each_child, &block) end
Iterates over strongly connected component in the subgraph reachable from node.
Return value is unspecified.
each_strongly_connected_component_from doesn't call tsort_each_node.
class G include TSort def initialize(g) @g = g end def tsort_each_child(n, &b) @g[n].each(&b) end def tsort_each_node(&b) @g.each_key(&b) end end graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}) graph.each_strongly_connected_component_from(2) {|scc| p scc } #=> [4] # [2] graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}) graph.each_strongly_connected_component_from(2) {|scc| p scc } #=> [4] # [2, 3]
# File lib/tsort.rb, line 382 def each_strongly_connected_component_from(node, id_map={}, stack=[], &block) # :yields: nodes TSort.each_strongly_connected_component_from(node, method(:tsort_each_child), id_map, stack, &block) end
Returns strongly connected components as an array of arrays of nodes. The array is sorted from children to parents. Each elements of the array represents a strongly connected component.
class G include TSort def initialize(g) @g = g end def tsort_each_child(n, &b) @g[n].each(&b) end def tsort_each_node(&b) @g.each_key(&b) end end graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}) p graph.strongly_connected_components #=> [[4], [2], [3], [1]] graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}) p graph.strongly_connected_components #=> [[4], [2, 3], [1]]
# File lib/tsort.rb, line 253 def strongly_connected_components each_node = method(:tsort_each_node) each_child = method(:tsort_each_child) TSort.strongly_connected_components(each_node, each_child) end
Returns a topologically sorted array of nodes. The array is sorted from children to parents, i.e. the first element has no child and the last node has no parent.
If there is a cycle, TSort::Cyclic is raised.
class G include TSort def initialize(g) @g = g end def tsort_each_child(n, &b) @g[n].each(&b) end def tsort_each_node(&b) @g.each_key(&b) end end graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}) p graph.tsort #=> [4, 2, 3, 1] graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}) p graph.tsort # raises TSort::Cyclic
# File lib/tsort.rb, line 148 def tsort each_node = method(:tsort_each_node) each_child = method(:tsort_each_child) TSort.tsort(each_node, each_child) end
The iterator version of the tsort
method. obj.tsort_each
is similar to
obj.tsort.each
, but modification of obj
during the iteration may lead to unexpected results.
tsort_each returns
nil
. If there is a cycle, TSort::Cyclic is raised.
class G include TSort def initialize(g) @g = g end def tsort_each_child(n, &b) @g[n].each(&b) end def tsort_each_node(&b) @g.each_key(&b) end end graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}) graph.tsort_each {|n| p n } #=> 4 # 2 # 3 # 1
# File lib/tsort.rb, line 201 def tsort_each(&block) # :yields: node each_node = method(:tsort_each_node) each_child = method(:tsort_each_child) TSort.tsort_each(each_node, each_child, &block) end
Should be implemented by a extended class.
tsort_each_child is used to iterate for child nodes of node.
# File lib/tsort.rb, line 448 def tsort_each_child(node) # :yields: child raise NotImplementedError.new end
Should be implemented by a extended class.
tsort_each_node is used to iterate for all nodes over a graph.
# File lib/tsort.rb, line 440 def tsort_each_node # :yields: node raise NotImplementedError.new end


Returns the char value at the specified index.
Returns the char value at the specified index.
Returns the character (Unicode code point) at the specified index.
Returns the character (Unicode code point) before the specified index.
Returns the number of Unicode code points in the specified text range of this
Compares two strings lexicographically.
Compares two strings lexicographically, ignoring case differences.
Returns a String that represents the character sequence in the array specified.
Tests if this string ends with the specified suffix.
Compares this string to the specified object.
Copies characters from this string into the destination character array.
Returns a hash code for this
Returns the index within this string of the first occurrence of the specified character.
Returns the index within this string of the first occurrence of the specified character, starting the search at the specified index.
Returns the index within this string of the first occurrence of the specified sub
Returns a canonical representation for the string object.
Returns true if, and only if, length() is 0.
Returns the index within this string of the last occurrence of the specified character.
Returns the index within this string of the last occurrence of the specified character, searching backward starting at the specified index.
Returns the index within this string of the rightmost occurrence of the specified sub
Returns the index within this string of the last occurrence of the specified substring, searching backward starting at the specified index.
Returns the length of this
Tells whether or not this string matches the given regular expression.
Returns the index within this String that is offset from the given index by codePointOffset code points.
Tests if two string regions are equal.
Tests if two string regions are equal.
Returns a new string resulting from replacing all occurrences of oldChar in this string with newChar.
Replaces each substring of this string that matches the literal target sequence with the specified literal replacement sequence.
Replaces each substring of this string that matches the given regular expression with the given replacement.
Replaces the first substring of this string that matches the given regular expression with the given replacement.
Splits this string around matches of the given regular expression.
Splits this string around matches of the given regular expression.
Tests if this string starts with the specified prefix.
Returns a new character sequence that is a subsequence of this sequence.
Returns a new string that is a substring of this
Converts this string to a new character array.
Converts all of the characters in this String to lower case using the rules of the default locale.
Converts all of the characters in this String to lower case using the rules of the given Locale.
This object (which is already a string!) is itself returned.
Converts all of the characters in this String to upper case using the rules of the default locale.
Converts all of the characters in this String to upper case using the rules of the given Locale.
Returns a copy of the string, with leading and trailing whitespace omitted.
Returns the string representation of the double argument.
Returns the string representation of the float argument.
Returns the string representation of the long argument.