Aegisub / Editing Subtitles
Editing subtitles is what Aegisub is made for. This page will deal with basic text editing of subtitle lines; for more information on the typography of subtitles, see typesetting. For information on the timing of subtitle lines, see working with audio.
Opening subtitles
In the File menu, there are four menu choices that relate to opening or creating subtitles:
- New subtitles - Creates a new, blank script.
- Open subtitles - Opens an existing subtitles file or imports subtitles from a Matroska container file.
- Open subtitles with charset - Opens subtitles but lets you choose what character set Aegisub will use to interpret the file. Usually not needed, but if you have a file in an unusual charset Aegisub will occasionally misdetect it.
- Open subtitles from video - Open the subtitles muxed into the currently open video file.
When you open a subtitles file that is not detected as Unicode, Aegisub will attempt to guess what character set it is encoded with. If it is unsure, it will ask you to choose from two or more likely alternatives. If the result looks garbled or otherwise incorrect, try reopening it with another character set.
Supported formats
Aegisub supports reading the following subtitle formats:
- Advanced Substation Alpha, also known as SSA v4+ (.ass)
- Substation Alpha v4 (.ssa)
- SubRip Text (.srt)
- MPEG4 Timed Text (limited support at best; broken at worst), also known as ISO/IEC 14496-17, MPEG-4 Part 17 or just TTXT (.ttxt)
- MicroDVD (.sub)
- Plain "dialog script" formatted text (see below)
Importing subtitles from MKV
Loading subtitles directly from Matroska files can also be done. The following CodecIDs are supported:
- S_TEXT/UTF8 (SRT)
- S_TEXT/ASS (ASS/SSA v4+)
- S_TEXT/SSA (SSA v4)
Importing plain text scripts
Aegisub also supports importing "dialogue-formatted" plain text scripts. For example:
Actor 1: Well do I understand your speech, yet few strangers do so.
Why then do you not speak in the Common Tongue,
as is the custom in the West, if you wish to be answered?
# TL check: The above seems to be a quote from the lord of the rings, look it up later
Actor 2: What are you babbling about?
This will result in five subtitle lines, one being commented out. The first three will have the actor field set to "Actor 1", and the fifth will have it set to "Actor 2" (the comment line's actor field will be blank).
When you open a file with the extension .txt, Aegisub will ask you about what
characters it should use as the actor separator and comment starter,
respectively. In the example above, the actor separator is a colon
(":
") and the comment starter is a hash ("#
").
Editing subtitles
Editing subtitles in Aegisub is done in two areas: the subtitle edit box (where you type in or edit text) and the subtitles grid. Changes made in both the edit box and the grid normally modify all selected lines, and not just the line displayed in the edit box.
The subtitles edit box
The edit box is just a plain editing area with a number of associated controls. They are:
- Flags the line as a comment. Comment lines will not be displayed on the video.
- The style used for this line.
- The actor speaking this line. Has no actual effect on subtitle display but can be useful for editing purposes.
- Effect for this line. There are a few predefined effects which can be applied via this field, but renderer support for them is spotty and using override tags is nearly always a better idea. This is commonly uses as a metadata field for automation scripts.
- Layer for this line. If you override positioning with an override tag so that two or more lines are displayed on top of each other, this field controls which one is drawn where; higher layer numbers are drawn on top of lower ones.
- Start time for the line.
- End time for the line.
- Duration for the line. If you modify this field, the end time will be modified as a result.
- Left margin for this line. 0 means use the margin specified in the style.
- Right margin for this line. 0 means use the margin specified in the style.
- Vertical margin for this line. 0 means use the margin specified in the style.
- Inserts a bold override tag (
\b1
) at the cursor position. If the text is already bold, inserts a corresponding closing tag (\b0
). - Inserts an italics override tag (
\i1
) at the cursor position. If the text is already italic, inserts a corresponding closing tag (\i0
). - Inserts an underline override tag (
\u1
) at the cursor position. If the text is already italic, inserts a corresponding closing tag (\u0
). - Inserts an strikeout override tag (
\s1
) at the cursor position. If the text is already italic, inserts a corresponding closing tag (\s0
). - Brings up a font selection window and inserts a font face name tag
(
\fnFontName
) with the given font name, as well as the chosen effect tags. - Brings up the color picker and lets you choose a
color; then inserts a primary color override tag (
\c
) with the chosen color at the cursor position. - Brings up the color picker and lets you choose a
color; then inserts a secondary color override tag (
\2c
) with the chosen color at the cursor position. - Brings up the color picker and lets you choose a
color; then inserts an outline color override tag (
\3c
) with the chosen color at the cursor position. - Brings up the color picker and lets you choose a
color; then inserts a shadow color override tag (
\4c
) with the chosen color at the cursor position. - Move to the next line, creating a new one at the end of the file if needed. Note that unlike in previous versions of Aegisub, changes do not need to be committed using this button.
- Changes display between times and frames. Note that this does not change how times are actually stored in the script.
If you right-click anywhere in the edit box, you get the following menu:
Select all, undo, copy, cut and paste all do what you'd expect them to.
- Spell checker: if you right-click on a word that has been detected as misspelled, the spell checker will suggest some likely alternative. You can also set which language it will use for checking from this menu, or add words that it doesn't recognize but you know to be correctly spelled to the dictionary.
- Thesaurus: suggests alternative ways to write the highlighted word.
- Split line: splits the line into two new lines at the cursor position. Preserve times keeps the old line's timing for both lines, estimate times tries to guess where the split is based on the length of the text on each side of the cursor.
The subtitles grid
The subtitles grid shows all lines (comments and otherwise) in the entire file.
Some common controls:
- To move lines up or down in the grid, select them, hold down the Alt key and press the up- or down-arrow keys.
- To select multiple lines, hold down either Ctrl or Shift and click. Ctrl-click selects one more line per click; Shift-click selects all the lines between the first clicked and the last clicked.
- To sort all lines in the grid, open the Subtitle menu, and under Sort Lines select the field to sort the lines on.
- To change the way override tags are displayed in the grid, click the "cycle through tag hiding modes" button on the toolbar.
The lines have different (configurable) colors representing different things; see the subtitles grid section of the options page for details on what the colors mean.
By default, the following columns are visible:
- #
- The line number.
- Start
- The start time of the line.
- End
- The end time of the line.
- Style
- The style used for this line.
- Text
- The text of the line (this is what will be displayed on the video).
The following columns will be displayed if any line in the script uses them:
- L
- The layer of the line (see above).
- Actor
- The actor speaking the line.
- Effect
- The effect for this line.
- Left
- The left margin.
- Right
- The right margin.
- Vert
- The vertical margin.
You can also right-click the top line of the grid (the one with the column names) to manually select which columns you want to be visible.
Right-clicking any other line in the grid gives you the following menu (many of the options are also available in other menus):
- Insert (before/after)
- Inserts a new empty line before or after the selected line. The new line will be timed start at 0:00:00.00 and go to 0:00:05.00.
- Insert at video time (before/after)
- Same as the above, but the new line will be timed to start at the current video frame. Not enabled unless you have video loaded.
- Duplicate
- Duplicates the selected line(s).
- Duplicate and shift by 1 frame
- Duplicates the selected line(s) and shifts the start and end times one frame forward. Useful for frame-by-frame typesetting. Only enabled if you have video or timecodes loaded.
- Split (by karaoke)
- Splits the line into one new line per syllable, as delimited by karaoke
override tags (
\k
and its relatives). The timing of the first line will start at the original line's start time and end at that time plus the length of the first syllable; the following lines will start at the end of the previous and last for the duration of the syllable. - Swap
- Swaps the places (in the grid) of two selected lines.
- Join (keep first)
- Joins two or more lines, discarding the text of all but the first. The new line will be timed to start at the first line's start time and end at the last line's end time. Only enabled if you have more than one line selected.
- Join (concatenate)
- Same as above, but concatenates the text of all selected lines instead. A
newline override (
\N
) is inserted between the texts of each source line. - Join (as karaoke)
- Does the inverse of Split (by karaoke), i.e. the same as Join
(concatenate) but inserts
\k
tags with the timing of each source line in the joined line. - Make times continuous (change start/change end)
- Modifies the timing of the selected lines so that the end time of each line is the same as the start time of the next line. Change start/change end determines whether the function changes the end time or the start time of each line. Only enabled when you have more than one line selected.
- Recombine lines
-
Given two or more lines with the same text being partially present in all of them, creates one line per text fragment instead. This is mostly useful for correcting subs ripped from DVDs, which frequently look something like this:
After recombine lines, the result is:
- Create audio clip
- Saves a segment of the loaded audio corresponding to the timing of the selected lines (starting at the earliest start time and ending at the latest end time) as an uncompressed WAV file. Only enabled if you have audio loaded.
- Cut/Copy/Paste
- Cuts/copies/pastes entire lines. Note that the lines are copied as plain text and can be copied and pasted freely between text editors, chat programs, web browsers, other instances of Aegisub etc.
- Paste Lines Over...
- Open the Paste Over dialog.
- Delete
- Deletes the selected lines.


African Market Place
To empower women to take control of their financial situations and rise from the ashes of poverty
Login
React Site
About
Contact


Wrapper for HTML files.
More...
#include <html.hpp>
|
| | Html (const std::string &fileName) |
| |
| virtual | ~Html ()=default |
| |
| void | convert (bool addStyle=true, bool extractImages=false, char mergingMode=0) override |
| | Convert file to HTML-tree. More...
|
| |
| | FileExtension (const std::string &fileName) |
| |
| virtual | ~FileExtension ()=default |
| |
| void | saveHtml (std::string dir, const std::string &fileName="tmp.html") const |
| | Save HTML-tree to file. More...
|
| |
| void | loadStyle (pugi::xml_node &node, const std::string &fileName) const |
| | Load specific format style. More...
|
| |
|
| void | ireplaceAll (std::string &str, const std::string &from, const std::string &to) const |
| | Case insensitive replacement of all occurrences of substring. More...
|
| |
| bool | imatch (const std::string &haystack, const std::string &needle, int start=0) const |
| | Case insensitive matching of substring. More...
|
| |
| size_t | ifind (const std::string &haystack, const std::string &needle, int start=0) const |
| | Case insensitive searching of position of first occurrence of substring. More...
|
| |
| void | deleteMerging () const |
| | Delete colspans and rowspans in tables. More...
|
| |
| void | getImages () |
| | Get images (extract local files or download from url) More...
|
| |
| void | convertEncoding (std::string &page) const |
| | Convert page encoding to UTF-8. More...
|
| |
◆ Html()
| html::Html::Html |
( |
const std::string & |
fileName | ) |
|
◆ ~Html()
| virtual html::Html::~Html |
( |
| ) |
|
|
virtualdefault |
◆ convert()
| void html::Html::convert |
( |
bool |
addStyle = true , |
|
|
bool |
extractImages = false , |
|
|
char |
mergingMode = 0 |
|
) |
| |
|
overridevirtual |
Convert file to HTML-tree.
- Parameters
-
| [in] | addStyle | Should read and add styles to HTML-tree |
| [in] | extractImages | True if should extract images |
| [in] | mergingMode | Colspan/rowspan processing mode |
- Since
- 1.0
Implements fileext::FileExtension.
◆ convertEncoding()
| void html::Html::convertEncoding |
( |
std::string & |
page | ) |
const |
|
private |
Convert page encoding to UTF-8.
- Parameters
-
- Since
- 2.0
◆ deleteMerging()
| void html::Html::deleteMerging |
( |
| ) |
const |
|
private |
Delete colspans and rowspans in tables.
- Since
- 1.0
◆ getImages()
| void html::Html::getImages |
( |
| ) |
|
|
private |
Get images (extract local files or download from url)
- Since
- 1.1
◆ ifind()
| size_t html::Html::ifind |
( |
const std::string & |
haystack, |
|
|
const std::string & |
needle, |
|
|
int |
start = 0 |
|
) |
| const |
|
private |
Case insensitive searching of position of first occurrence of substring.
- Parameters
-
| [in] | haystack | Input string |
| [in] | needle | The value that you want to match |
| [in] | start | Search start position |
- Returns
- Position of needle in input instring
- Since
- 1.0
◆ imatch()
| bool html::Html::imatch |
( |
const std::string & |
haystack, |
|
|
const std::string & |
needle, |
|
|
int |
start = 0 |
|
) |
| const |
|
private |
Case insensitive matching of substring.
- Parameters
-
| [in] | haystack | Input string |
| [in] | needle | The value that you want to match |
| [in] | start | Search start position |
- Returns
- True if needle is in input string
- Since
- 1.0
◆ ireplaceAll()
| void html::Html::ireplaceAll |
( |
std::string & |
str, |
|
|
const std::string & |
from, |
|
|
const std::string & |
to |
|
) |
| const |
|
private |
Case insensitive replacement of all occurrences of substring.
- Parameters
-
| [in,out] | str | Input string |
| [in] | from | String to search for |
| [in] | to | String to replace the search string with |
- Since
- 1.0
◆ m_data
| std::string html::Html::m_data |
|
private |
The documentation for this class was generated from the following files:


There once was a little boy who loved swinging on the tire swing in his backyard. It was a simple swing made from an old tire and a length of rope tied to a branch of utter non-existence. On many a lazy summer afternoon, he would while away the hours swinging back and forth under the shade of the big, leafy existential nullity, and in the fall, he picked apples from it.
One day, his father told him to cut down the apple nullity. "But Paw," he protested, "I love that old nullity!"
"Mind what I say, boy!" his father said.
The boy ran crying to his mother. "Maw! Paw said I hafta cut down the old nullity! Say it ain't so!"
"I'm afraid it's for the best. The other day I was weeding the tomato patch, and I saw Sammy the cat had gotten into the nullity. When I was trying to get him down, I accidently gazed into an infinitely branching timeline of events which never happened and never will happen. Well, I'll be durned if that old Sammy didn't jump right on my head!"
"But Maw! What about my tire swing?"
"Come now. There's all sorts of other things you can tie your tire swing to. What about one of the many giant flayed demon penises that grow abundantly in our world and provide our lumber?"
"But Maw!
"You just say that because you haven't tried it. Now mind your paw and fetch an axe."
The boy got his father's axe and went to chop the non-thing down. But after a dozen swings, he found his hands were red and sore.  He called to his father. "Paw!
"Boy, don't you have any sense? Why don't you wear some gloves?"
The boy put on some gloves, but his hands were already quite scratched. At the end of the day, they were covered in blisters, and the tree still hadn't fallen. He worked the next day, despite all the pain, and finally brought the non-being crashing down.
"I'm mighty proud to have you as a son," the boy's father said, tousling his hair. "I guess it's true what they say. The nut doesn't fall far from the demon penis."


Machine Learning Demo App using Mozilla Deepspeech and Google Translate
Choose audio wave file, choose the translation language and click submit. The wave file will be uploaded, decoded and translated. Click results and refresh to see the text and translation.
Audio File Requirements
- 16000 Herz
- 16bit
- Mono
- Wave audio format


THE POEM OF THE WRESTLING*
lt may be here remarked as something more than accidental, that Magog is a well.known Oriental giant, that Gog and Magog figure in the Guildhall of London, and that Gogmagog was the champion selected for a trial of strength with Corineus.
"Amongst the ragged Cleeves those monstrous giants sought:
Who (of their dreadful kind) t' appal the Trojans brought
Great Gogmagog, an oake that by the roots could teare;
So mighty were (that time) the men who lived there:
But, for the use of armes he did not understand
(Except some rock or tree, that coming next to hand,
He raised out of the earth to execute his rage),
He challenge makes for strength, and offereth there his gage,
Which Corin taketh up, to answer by and by,
Upon
this sonne of earth his utmost power to try.
All, doubtful to which port the victory should goe,
Upon that loftie place at Plimmouth, called the Hoe,
Those mightie wrastlers met with many an irefull looke,
Who threat'ned as the one hold of the other tooke:
But, grappled, glowing fire shines in their sparkling eyes,
And, whilst at length of arme one from the other lyes,
Their lusty sinewes swell like cables, as they strive.
Their feet such trampling make, as though they forced to drive
A thunder out of earth, which stagger'd with the weight:
Thus either's utmost force urged to the greatest height.
Whilst one upon his hips the other seeks to lift,
And th' adverse (by a turn) doth from his cunning shift,
Their short-fetcht troubled breath a hollow noise doth make,
Like bellows of a forge. Their Corin up doth take
The giant 'twixt the groins; and voiding of his hold
(Before his cumbrous feet he well recover could),
Pitcht headlong from the bill: as when a man doth throw
An axtree. that with slight delivered from the toe
Roots up the yielding earth, so that his violent fall,
Shook Neptune with such strength as shoulder'd him withal
That where the monstrous waves like mountains late did stand,
They leapt out of the place, and left the bared sand
To gaze upon wide heaven, so great a blow it gave.
For which the conquering Brute on Corineus brave
This horn of land bestow'd, and markt it with his name
Of Corin, Cornwal call'd to his immortal fame." [a]
In 1750 Robert Heath published his "Natural and Historical Account of the Islands of Scilly," to which was added "A General Account of Cornwall." From paragraphs in this work it may be inferred that the figures of the wrestlers cut out in the turf on Plymouth Hoe then existed.
"The activity of the Cornish and Devonshire men, beyond others in the faculty of Wrestling, seems to derive their Pedigree from that grand Wrestler, Corineus. That there has been such a giant as Gogmagog, opposed by Corineus, the inhabitants of Plymouth show you a Portraiture of two Men, one bigger than the other, with Clubs in their hands, cut out upon the Raw-ground, which have been renewed by order of the Place, as they wear out; and a steep cliff being-near, over which the giant might be thrown, are said to point out together the Probability of the Fact."
In the "Dissertation on the Cornish Tongue," by William Scawen, Vice-Warden of the Stannaries, we find the following passage : "I cannot affirm with so much reason, its some of our neighbours have done with confidence, who say that at the last digging on the Haw for the foundation of the citadel of Plymouth, the great jaws and teeth therein found were those of Gogmagog, who was there said to be thrown down by Corineus, whom some will have to be the founder of the Cornish; [b] nor am I able to assert that some instruments of war in brass, and huge limbs and por. traitures of persons long ago, as some say that have been in some of the western parishes, were parts of giants or other great men, who had formerly had their being there."
[a] See also Hogg's "Records of
Ancient Cornwall."
[b] This note is by the Editor, Mr. Davies Gilbert : "These bones must evidently have been found in a cavern, the nature of which has been most ably ascertained and described by Dr. Buckland and the Rev. Richard Hannah, who examined other caverns of precisely the same nature, comprising bones of various larger mammalia, in the limestone formation not far from Plymouth."
Thus we see the poetical belief of one age destroyed by the positive philosophy of the next. Happily, we move in all things by waves; the system of undulations prevails in every operation, mental and physical. Amidst the relics of the mammalia of the Devonshire caves we are now discovering the unmistakable remains of man, and his works,--stone knives, spear-heads, axes, and hammers speak of an ancient race; and 'nay there not have been "giants in the earth in those days, and also after that?"
*' From Drayton's "Polyolbion"


CardsDeck class
Helper class to manage a deck of SwipeCard.
Constructors
Properties
- hashCode → int
-
The hash code for this object. [...]
read-only, inherited
- runtimeType → Type
-
A representation of the runtime type of the object.
read-only, inherited
Methods
-
addBottom(
SwipeCard card) → dynamic - Add a card at the bottom of the deck. [...]
-
addTop(
SwipeCard card) → dynamic - Add a card on top of the deck (the top card is the visible one).
-
allCards(
) → List<SwipeCard> - Returns all the cards in the deck. [...]
-
insert(
int index, SwipeCard card) → dynamic - Insert a card at the given position in the deck.
-
remove(
SwipeCard card) → dynamic - Remove the given card from the deck.
-
topTwoCards(
) → List<SwipeCard> - Returns the 2 cards on the top of the deck.
-
noSuchMethod(
Invocation invocation) → dynamic -
Invoked when a non-existent method or property is accessed. [...]
inherited
-
toString(
) → String -
Returns a string representation of this object.
inherited
Operators
-
operator ==(
dynamic other) → bool -
The equality operator. [...]
inherited


Tic Tac Tu
Register
Play With Friend
Play Against Bots
Register
Login
Logout
Register here
Enter Name
Enter Email
Enter Password
Are you already registered? Log in


ALA-HIST IR- dexbrompheniramine maleate tablet
Poly Pharmaceuticals, Inc.
Disclaimer: Most OTC drugs are not reviewed and approved by FDA, however they may be marketed if they comply with applicable regulations and policies. FDA has not evaluated whether this product complies.
Temporarily relieves these symptoms due to hay fever (allergic rhinitis) or upper respiratory allergies:
Ask a doctor before use if you have
Ask a doctor or pharmacist before use if you are taking sedatives or tranquilizers.
| Adults and children 12 years of age and over: |
1 tablet every 4 to 6 hours, not to exceed 6 tablets in 24 hours. |
| Children 6 to under 12 years of age: |
1/2 tablet every 4 to 6 hours, not to exceed 3 tablets in 24 hours. |
| Children under 6 years of age: |
Consult a doctor. |
Store at 15° - 30°C (59° - 86°F).
Supplied in a tight, light-resistant container with a child-resistant cap.
Contains color additives including FD&C Yellow No. 5 (tartrazine).
Ala-Hist IR Tablets are dark green caplet shaped, scored tablets, debossed "Poly" bisect "783" on one side and plain on the other.
colloidal silicon dioxide, croscarmellose sodium, dibasic calcium phosphate dihydrate, FD&C Blue #1 aluminum lake, FD&C Yellow #5 aluminum lake, magnesium stearate, and silicified microcrystalline cellulose.
The packaging below represents the labeling currently used.
Principal display panel and side panel for 60 tablets label:
NDC 50991-783-60
ALA-HIST IR
2 mg Tablets
Antihistamine
Each tablet contains:
Dexbrompheniramine Maleate.........2 mg
60 Tablets
Usual Dosage: See product foldout for full
prescribing information
Tamper evident by foil seal under cap. Do not
use if foil seal is broken or missing.

Store at controlled room temperature 15°-30°C
(59°-86°F).
Manufactured for:
Poly Pharmaceuticals
Quitman, MS 39355
Rev. 02/12
|
ALA-HIST IR
dexbrompheniramine maleate tablet | |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
|
| Labeler - Poly Pharmaceuticals, Inc. (198449894) |


Structures
The following structures are available globally.
-
UICircularRingValueKnobStyle
Struct for setting the style of the value knob
Author
Luis Padron
See moreDeclaration
Swift
public struct UICircularRingValueKnobStyle
-
UICircularRingGradientOptions
Struct for defining the options for the UICircularRingStyle.gradient case.
Important
Make sure the number of
See morecolors
is equal to the number ofcolorLocations
Declaration
Swift
public struct UICircularRingGradientOptions
-
UICircularTimerRingFormatter
The formatter used in UICircularTimerRing class, formats the ring value into a time string.
See moreDeclaration
Swift
public struct UICircularTimerRingFormatter : UICircularRingValueFormatter
-
UICircularProgressRingFormatter
The formatter used in UICircularProgressRing class, responsible for formatting the value of the ring into a readable string
See moreDeclaration
Swift
public struct UICircularProgressRingFormatter : UICircularRingValueFormatter


Web Developer Buddy
Courses
Register
Log in
Create a new account
First Name
Email
Password
Confirm password


{% extends "base_generic.html" %} {% block head %}{% load static %}{% endblock head %} {% block content %}
This page provides an overview of locations in Have Love, Will Travel.
It shows whether or not the location is verified, and it indicates the amount of organisations in the location.
| City | Country | ||
|---|---|---|---|
| {{ location.num_organisations }} | {{ location.city }} {% if location.zipcode %}({{ location.zipcode }}) {% endif %}{% if location.subcountry %}{{ location.subcountry }}{% endif %} | {% if location.verified %}{% endif %} | {{ location.country.name }} |
There are no locations in the library.
{% endif %}


Container Port Mapping
By the end of this exercise, you should be able to:
- Forward traffic from a port on the docker host to a port inside a container's network namespace
- Define ports to automatically expose in a Dockerfile
Port Mapping at Runtime
Run an nginx container with no special port mappings:
[centos@node-1 ~]$ docker container run -d nginx
nginx stands up a landing page at
<ip>:80
; try to visit this at your host or container's IP, and it won't be visible; no external traffic can make it past the linux bridge's firewall to the nginx container.Now run an nginx container and map port 80 on the container to port 5000 on your host using the
-p
flag:[centos@node-1 ~]$ docker container run -d -p 5000:80 nginx
Note that the syntax is:
-p [host-port]:[container-port]
.Verify the port mappings with the
docker container port
command[centos@node-1 ~]$ docker container port <container id> 80/tcp -> <IP_ADDRESS>:5000
Visit your nginx landing page at
<host ip>:5000
, e.g. usingcurl -4 localhost:5000
, just to confirm it's working as expected.
Exposing Ports from the Dockerfile
In addition to manual port mapping, we can expose some ports in a Dockerfile for automatic port mapping on container startup. In a fresh directory
~/port
, create a Dockerfile:FROM nginx EXPOSE 80
Build your image as
my_nginx
:[centos@node-1 port]$ docker image build -t my_nginx .
Use the
-P
flag when running to map all ports mentioned in theEXPOSE
directive:[centos@node-1 port]$ docker container run -d -P my_nginx
Use
docker container ls
ordocker container port
to find out what host ports were used, and visit your nginx landing page in a browser at<node-1 public IP>:<port>
.Clean up your containers:
[centos@node-1 port]$ docker container rm -f $(docker container ls -aq)
Conclusion
In this exercise, we saw how to explicitly map ports from our container's network stack onto ports of our host at runtime with the -p
option to docker container run
, or more flexibly in our Dockerfile with EXPOSE
, which will result in the listed ports inside our container being mapped to random available ports on our host. In both cases, Docker is writing iptables rules to forward traffic from the host to the appropriate port in the container's network namespace.


|
My project
v1.0
|
#include <list.hpp>
Public Types | |
| typedef ValueTraits | value_traits |
| typedef value_traits::pointer | pointer |
| typedef value_traits::const_pointer | const_pointer |
| typedef pointer_traits< pointer >::element_type | value_type |
| typedef pointer_traits< pointer >::reference | reference |
| typedef pointer_traits< const_pointer >::reference | const_reference |
| typedef pointer_traits< pointer >::difference_type | difference_type |
| typedef SizeType | size_type |
| typedef list_iterator< value_traits, false > | iterator |
| typedef list_iterator< value_traits, true > | const_iterator |
| typedef boost::intrusive::reverse_iterator< iterator > | reverse_iterator |
| typedef boost::intrusive::reverse_iterator< const_iterator > | const_reverse_iterator |
| typedef value_traits::node_traits | node_traits |
| typedef node_traits::node | node |
| typedef node_traits::node_ptr | node_ptr |
| typedef node_traits::const_node_ptr | const_node_ptr |
| typedef circular_list_algorithms< node_traits > | node_algorithms |
| typedef detail::get_header_holder_type< value_traits, HeaderHolder >::type | header_holder_type |
Public Member Functions | |
| list_impl () | |
| list_impl (const value_traits &v_traits) | |
| template<class Iterator > | |
| list_impl (Iterator b, Iterator e, const value_traits &v_traits=value_traits()) | |
| list_impl (BOOST_RV_REF(list_impl) x) | |
| list_impl & | operator= (BOOST_RV_REF(list_impl) x) |
| ~list_impl () | |
| void | push_back (reference value) |
| void | push_front (reference value) |
| void | pop_back () |
| template<class Disposer > | |
| void | pop_back_and_dispose (Disposer disposer) |
| void | pop_front () |
| template<class Disposer > | |
| void | pop_front_and_dispose (Disposer disposer) |
| reference | front () |
| const_reference | front () const |
| reference | back () |
| const_reference | back () const |
| iterator | begin () |
| const_iterator | begin () const |
| const_iterator | cbegin () const |
| iterator | end () |
| const_iterator | end () const |
| const_iterator | cend () const |
| reverse_iterator | rbegin () |
| const_reverse_iterator | rbegin () const |
| const_reverse_iterator | crbegin () const |
| reverse_iterator | rend () |
| const_reverse_iterator | rend () const |
| const_reverse_iterator | crend () const |
| size_type | size () const |
| bool | empty () const |
| void | swap (list_impl &other) |
| void | shift_backwards (size_type n=1) |
| void | shift_forward (size_type n=1) |
| iterator | erase (const_iterator i) |
| iterator | erase (const_iterator b, const_iterator e) |
| iterator | erase (const_iterator b, const_iterator e, size_type n) |
| template<class Disposer > | |
| iterator | erase_and_dispose (const_iterator i, Disposer disposer) |
| template<class Disposer > | |
| iterator | erase_and_dispose (iterator i, Disposer disposer) |
| template<class Disposer > | |
| iterator | erase_and_dispose (const_iterator b, const_iterator e, Disposer disposer) |
| void | clear () |
| template<class Disposer > | |
| void | clear_and_dispose (Disposer disposer) |
| template<class Cloner , class Disposer > | |
| void | clone_from (const list_impl &src, Cloner cloner, Disposer disposer) |
| template<class Cloner , class Disposer > | |
| void | clone_from (BOOST_RV_REF(list_impl) src, Cloner cloner, Disposer disposer) |
| iterator | insert (const_iterator p, reference value) |
| template<class Iterator > | |
| void | insert (const_iterator p, Iterator b, Iterator e) |
| template<class Iterator > | |
| void | assign (Iterator b, Iterator e) |
| template<class Iterator , class Disposer > | |
| void | dispose_and_assign (Disposer disposer, Iterator b, Iterator e) |
| void | splice (const_iterator p, list_impl &x) |
| void | splice (const_iterator p, list_impl &x, const_iterator new_ele) |
| void | splice (const_iterator p, list_impl &x, const_iterator f, const_iterator e) |
| void | splice (const_iterator p, list_impl &x, const_iterator f, const_iterator e, size_type n) |
| void | sort () |
| template<class Predicate > | |
| void | sort (Predicate p) |
| void | merge (list_impl &x) |
| template<class Predicate > | |
| void | merge (list_impl &x, Predicate p) |
| void | reverse () |
| void | remove (const_reference value) |
| template<class Disposer > | |
| void | remove_and_dispose (const_reference value, Disposer disposer) |
| template<class Pred > | |
| void | remove_if (Pred pred) |
| template<class Pred , class Disposer > | |
| void | remove_and_dispose_if (Pred pred, Disposer disposer) |
| void | unique () |
| template<class BinaryPredicate > | |
| void | unique (BinaryPredicate pred) |
| template<class Disposer > | |
| void | unique_and_dispose (Disposer disposer) |
| template<class BinaryPredicate , class Disposer > | |
| void | unique_and_dispose (BinaryPredicate pred, Disposer disposer) |
| iterator | iterator_to (reference value) |
| const_iterator | iterator_to (const_reference value) const |
| void | check () const |
Static Public Member Functions | |
| static list_impl & | container_from_end_iterator (iterator end_iterator) |
| static const list_impl & | container_from_end_iterator (const_iterator end_iterator) |
| static iterator | s_iterator_to (reference value) |
| static const_iterator | s_iterator_to (const_reference value) |
Static Public Attributes | |
| static const bool | constant_time_size = ConstantTimeSize |
| static const bool | stateful_value_traits = detail::is_stateful_value_traits<value_traits>::value |
| static const bool | has_container_from_iterator |
Friends | |
| bool | operator== (const list_impl &x, const list_impl &y) |
| bool | operator!= (const list_impl &x, const list_impl &y) |
| bool | operator< (const list_impl &x, const list_impl &y) |
| bool | operator> (const list_impl &x, const list_impl &y) |
| bool | operator<= (const list_impl &x, const list_impl &y) |
| bool | operator>= (const list_impl &x, const list_impl &y) |
| void | swap (list_impl &x, list_impl &y) |
The class template list is an intrusive container that mimics most of the interface of std::list as described in the C++ standard.
The template parameter T
is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.
The container supports the following options: base_hook<>/member_hook<>/value_traits<>
, constant_time_size<>
and size_type<>
.
| typedef list_iterator<value_traits, true> boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::const_iterator |
| typedef node_traits::const_node_ptr boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::const_node_ptr |
| typedef value_traits::const_pointer boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::const_pointer |
| typedef pointer_traits<const_pointer>::reference boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::const_reference |
| typedef boost::intrusive::reverse_iterator<const_iterator> boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::const_reverse_iterator |
| typedef pointer_traits<pointer>::difference_type boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::difference_type |
| typedef detail::get_header_holder_type< value_traits, HeaderHolder >::type boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::header_holder_type |
| typedef list_iterator<value_traits, false> boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::iterator |
| typedef node_traits::node boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::node |
| typedef circular_list_algorithms<node_traits> boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::node_algorithms |
| typedef node_traits::node_ptr boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::node_ptr |
| typedef value_traits::node_traits boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::node_traits |
| typedef value_traits::pointer boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::pointer |
| typedef pointer_traits<pointer>::reference boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::reference |
| typedef boost::intrusive::reverse_iterator<iterator> boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::reverse_iterator |
| typedef SizeType boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::size_type |
| typedef ValueTraits boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::value_traits |
| typedef pointer_traits<pointer>::element_type boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::value_type |
|
inline |
Effects: constructs an empty list.
Complexity: Constant
Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks).
|
inlineexplicit |
Effects: constructs an empty list.
Complexity: Constant
Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks).
|
inline |
Requires: Dereferencing iterator must yield an lvalue of type value_type.
Effects: Constructs a list equal to the range [first,last).
Complexity: Linear in distance(b, e). No copy constructors are called.
Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks).
|
inline |
Effects: Constructs a container moving resources from another container. Internal value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.
Complexity: Constant.
Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of value traits throws.
|
inline |
Effects: If it's not a safe-mode or an auto-unlink value_type the destructor does nothing (ie. no code is generated). Otherwise it detaches all elements from this. In this case the objects in the list are not deleted (i.e. no destructors are called), but the hooks according to the ValueTraits template parameter are set to their default value.
Complexity: Linear to the number of elements in the list, if it's a safe-mode or auto-unlink value . Otherwise constant.
|
inline |
Requires: Dereferencing iterator must yield an lvalue of type value_type.
Effects: Clears the list and inserts the range pointed by b and e. No destructors or copy constructors are called.
Throws: Nothing.
Complexity: Linear to the number of elements inserted plus linear to the elements contained in the list if it's a safe-mode or auto-unlink value. Linear to the number of elements inserted in the list otherwise.
Note: Invalidates the iterators (but not the references) to the erased elements.
|
inline |
Effects: Returns a reference to the last element of the list.
Throws: Nothing.
Complexity: Constant.
|
inline |
Effects: Returns a const_reference to the last element of the list.
Throws: Nothing.
Complexity: Constant.
|
inline |
Effects: Returns an iterator to the first element contained in the list.
Throws: Nothing.
Complexity: Constant.
|
inline |
Effects: Returns a const_iterator to the first element contained in the list.
Throws: Nothing.
Complexity: Constant.
|
inline |
Effects: Returns a const_iterator to the first element contained in the list.
Throws: Nothing.
Complexity: Constant.
|
inline |
Effects: Returns a constant iterator to the end of the list.
Throws: Nothing.
Complexity: Constant.
|
inline |
Effects: Asserts the integrity of the container.
Complexity: Linear time.
Note: The method has no effect when asserts are turned off (e.g., with NDEBUG). Experimental function, interface might change in future versions.
|
inline |
Effects: Erases all the elements of the container. No destructors are called.
Throws: Nothing.
Complexity: Linear to the number of elements of the list. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.
Note: Invalidates the iterators (but not the references) to the erased elements.
|
inline |
Requires: Disposer::operator()(pointer) shouldn't throw.
Effects: Erases all the elements of the container. No destructors are called. Disposer::operator()(pointer) is called for the removed elements.
Throws: Nothing.
Complexity: Linear to the number of elements of the list.
Note: Invalidates the iterators to the erased elements.
|
inline |
Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.
Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this.
If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).
Complexity: Linear to erased plus inserted elements.
Throws: If cloner throws. Basic guarantee.
|
inline |
Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.
Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this.
If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).
Complexity: Linear to erased plus inserted elements.
Throws: If cloner throws. Basic guarantee.
|
inlinestatic |
Precondition: end_iterator must be a valid end iterator of list.
Effects: Returns a const reference to the list associated to the end iterator
Throws: Nothing.
Complexity: Constant.
|
inlinestatic |
Precondition: end_iterator must be a valid end const_iterator of list.
Effects: Returns a const reference to the list associated to the end iterator
Throws: Nothing.
Complexity: Constant.
|
inline |
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed list.
Throws: Nothing.
Complexity: Constant.
|
inline |
Effects: Returns a const_reverse_iterator pointing to the end of the reversed list.
Throws: Nothing.
Complexity: Constant.
|
inline |
Requires: Disposer::operator()(pointer) shouldn't throw.
Requires: Dereferencing iterator must yield an lvalue of type value_type.
Effects: Clears the list and inserts the range pointed by b and e. No destructors or copy constructors are called. Disposer::operator()(pointer) is called for the removed elements.
Throws: Nothing.
Complexity: Linear to the number of elements inserted plus linear to the elements contained in the list.
Note: Invalidates the iterators (but not the references) to the erased elements.
|
inline |
Effects: Returns true if the list contains no elements.
Throws: Nothing.
Complexity: Constant.
Note: Does not affect the validity of iterators and references.
|
inline |
Effects: Returns an iterator to the end of the list.
Throws: Nothing.
Complexity: Constant.
|
inline |
Effects: Returns a const_iterator to the end of the list.
Throws: Nothing.
Complexity: Constant.
|
inline |
Effects: Erases the element pointed by i of the list. No destructors are called.
Returns: the first element remaining beyond the removed element, or end() if no such element exists.
Throws: Nothing.
Complexity: Constant.
Note: Invalidates the iterators (but not the references) to the erased element.
|
inline |
Requires: b and e must be valid iterators to elements in *this.
Effects: Erases the element range pointed by b and e No destructors are called.
Returns: the first element remaining beyond the removed elements, or end() if no such element exists.
Throws: Nothing.
Complexity: Linear to the number of erased elements if it's a safe-mode or auto-unlink value, or constant-time size is enabled. Constant-time otherwise.
Note: Invalidates the iterators (but not the references) to the erased elements.
|
inline |
Requires: b and e must be valid iterators to elements in *this. n must be distance(b, e).
Effects: Erases the element range pointed by b and e No destructors are called.
Returns: the first element remaining beyond the removed elements, or end() if no such element exists.
Throws: Nothing.
Complexity: Linear to the number of erased elements if it's a safe-mode or auto-unlink value is enabled. Constant-time otherwise.
Note: Invalidates the iterators (but not the references) to the erased elements.
|
inline |
Requires: Disposer::operator()(pointer) shouldn't throw.
Effects: Erases the element pointed by i of the list. No destructors are called. Disposer::operator()(pointer) is called for the removed element.
Returns: the first element remaining beyond the removed element, or end() if no such element exists.
Throws: Nothing.
Complexity: Constant.
Note: Invalidates the iterators to the erased element.
|
inline |
|
inline |
Requires: Disposer::operator()(pointer) shouldn't throw.
Effects: Erases the element range pointed by b and e No destructors are called. Disposer::operator()(pointer) is called for the removed elements.
Returns: the first element remaining beyond the removed elements, or end() if no such element exists.
Throws: Nothing.
Complexity: Linear to the number of elements erased.
Note: Invalidates the iterators to the erased elements.
|
inline |
Effects: Returns a reference to the first element of the list.
Throws: Nothing.
Complexity: Constant.
|
inline |
Effects: Returns a const_reference to the first element of the list.
Throws: Nothing.
Complexity: Constant.
|
inline |
Requires: value must be an lvalue and p must be a valid iterator of *this.
Effects: Inserts the value before the position pointed by p.
Returns: An iterator to the inserted element.
Throws: Nothing.
Complexity: Constant time. No copy constructors are called.
Note: Does not affect the validity of iterators and references.
|
inline |
Requires: Dereferencing iterator must yield an lvalue of type value_type and p must be a valid iterator of *this.
Effects: Inserts the range pointed by b and e before the position p. No copy constructors are called.
Throws: Nothing.
Complexity: Linear to the number of elements inserted.
Note: Does not affect the validity of iterators and references.
|
inline |
Requires: value must be a reference to a value inserted in a list.
Effects: This function returns a const_iterator pointing to the element
Throws: Nothing.
Complexity: Constant time.
Note: Iterators and references are not invalidated.
|
inline |
Requires: value must be a const reference to a value inserted in a list.
Effects: This function returns an iterator pointing to the element.
Throws: Nothing.
Complexity: Constant time.
Note: Iterators and references are not invalidated.
|
inline |
Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.
Throws: If std::less<value_type> throws. Basic guarantee.
Complexity: This function is linear time: it performs at most size() + x.size() - 1 comparisons.
Note: Iterators and references are not invalidated
|
inline |
Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.
Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.
Throws: If the predicate throws. Basic guarantee.
Complexity: This function is linear time: it performs at most size() + x.size() - 1 comparisons.
Note: Iterators and references are not invalidated.
|
inline |
Effects: Equivalent to swap
|
inline |
Effects: Erases the last element of the list. No destructors are called.
Throws: Nothing.
Complexity: Constant.
Note: Invalidates the iterators (but not the references) to the erased element.
|
inline |
Requires: Disposer::operator()(pointer) shouldn't throw.
Effects: Erases the last element of the list. No destructors are called. Disposer::operator()(pointer) is called for the removed element.
Throws: Nothing.
Complexity: Constant.
Note: Invalidates the iterators to the erased element.
|
inline |
Effects: Erases the first element of the list. No destructors are called.
Throws: Nothing.
Complexity: Constant.
Note: Invalidates the iterators (but not the references) to the erased element.
|
inline |
Requires: Disposer::operator()(pointer) shouldn't throw.
Effects: Erases the first element of the list. No destructors are called. Disposer::operator()(pointer) is called for the removed element.
Throws: Nothing.
Complexity: Constant.
Note: Invalidates the iterators to the erased element.
|
inline |
Requires: value must be an lvalue.
Effects: Inserts the value in the back of the list. No copy constructors are called.
Throws: Nothing.
Complexity: Constant.
Note: Does not affect the validity of iterators and references.
|
inline |
Requires: value must be an lvalue.
Effects: Inserts the value in the front of the list. No copy constructors are called.
Throws: Nothing.
Complexity: Constant.
Note: Does not affect the validity of iterators and references.
|
inline |
Effects: Returns a reverse_iterator pointing to the beginning of the reversed list.
Throws: Nothing.
Complexity: Constant.
|
inline |
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed list.
Throws: Nothing.
Complexity: Constant.
|
inline |
Effects: Removes all the elements that compare equal to value. No destructors are called.
Throws: If std::equal_to<value_type> throws. Basic guarantee.
Complexity: Linear time. It performs exactly size() comparisons for equality.
Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.
|
inline |
Requires: Disposer::operator()(pointer) shouldn't throw.
Effects: Removes all the elements that compare equal to value. Disposer::operator()(pointer) is called for every removed element.
Throws: If std::equal_to<value_type> throws. Basic guarantee.
Complexity: Linear time. It performs exactly size() comparisons for equality.
Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.
|
inline |
Requires: Disposer::operator()(pointer) shouldn't throw.
Effects: Removes all the elements for which a specified predicate is satisfied. Disposer::operator()(pointer) is called for every removed element.
Throws: If pred throws. Basic guarantee.
Complexity: Linear time. It performs exactly size() comparisons for equality.
Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.
|
inline |
Effects: Removes all the elements for which a specified predicate is satisfied. No destructors are called.
Throws: If pred throws. Basic guarantee.
Complexity: Linear time. It performs exactly size() calls to the predicate.
Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.
|
inline |
Effects: Returns a reverse_iterator pointing to the end of the reversed list.
Throws: Nothing.
Complexity: Constant.
|
inline |
Effects: Returns a const_reverse_iterator pointing to the end of the reversed list.
Throws: Nothing.
Complexity: Constant.
|
inline |
Effects: Reverses the order of elements in the list.
Throws: Nothing.
Complexity: This function is linear time.
Note: Iterators and references are not invalidated
|
inlinestatic |
Requires: value must be a reference to a value inserted in a list.
Effects: This function returns a const_iterator pointing to the element
Throws: Nothing.
Complexity: Constant time.
Note: Iterators and references are not invalidated. This static function is available only if the value traits is stateless.
|
inlinestatic |
Requires: value must be a const reference to a value inserted in a list.
Effects: This function returns an iterator pointing to the element.
Throws: Nothing.
Complexity: Constant time.
Note: Iterators and references are not invalidated. This static function is available only if the value traits is stateless.
|
inline |
Effects: Moves backwards all the elements, so that the first element becomes the second, the second becomes the third... the last element becomes the first one.
Throws: Nothing.
Complexity: Linear to the number of shifts.
Note: Does not affect the validity of iterators and references.
|
inline |
Effects: Moves forward all the elements, so that the second element becomes the first, the third becomes the second... the first element becomes the last one.
Throws: Nothing.
Complexity: Linear to the number of shifts.
Note: Does not affect the validity of iterators and references.
|
inline |
Effects: Returns the number of the elements contained in the list.
Throws: Nothing.
Complexity: Linear to the number of elements contained in the list. if constant-time size option is disabled. Constant time otherwise.
Note: Does not affect the validity of iterators and references.
|
inline |
Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.
Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or std::less<value_type> throws. Basic guarantee.
Notes: Iterators and references are not invalidated.
Complexity: The number of comparisons is approximately N log N, where N is the list's size.
|
inline |
Requires: p must be a comparison function that induces a strict weak ordering
Effects: This function sorts the list *this according to p. The sort is stable, that is, the relative order of equivalent elements is preserved.
Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the predicate throws. Basic guarantee.
Notes: This won't throw if list_base_hook<> or list_member_hook are used. Iterators and references are not invalidated.
Complexity: The number of comparisons is approximately N log N, where N is the list's size.
|
inline |
Requires: p must be a valid iterator of *this.
Effects: Transfers all the elements of list x to this list, before the the element pointed by p. No destructors or copy constructors are called.
Throws: Nothing.
Complexity: Constant.
Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
|
inline |
Requires: p must be a valid iterator of *this. new_ele must point to an element contained in list x.
Effects: Transfers the value pointed by new_ele, from list x to this list, before the element pointed by p. No destructors or copy constructors are called. If p == new_ele or p == ++new_ele, this function is a null operation.
Throws: Nothing.
Complexity: Constant.
Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
|
inline |
Requires: p must be a valid iterator of *this. f and e must point to elements contained in list x.
Effects: Transfers the range pointed by f and e from list x to this list, before the element pointed by p. No destructors or copy constructors are called.
Throws: Nothing.
Complexity: Linear to the number of elements transferred if constant-time size option is enabled. Constant-time otherwise.
Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
|
inline |
Requires: p must be a valid iterator of *this. f and e must point to elements contained in list x. n == distance(f, e)
Effects: Transfers the range pointed by f and e from list x to this list, before the element pointed by p. No destructors or copy constructors are called.
Throws: Nothing.
Complexity: Constant.
Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
|
inline |
Effects: Swaps the elements of x and *this.
Throws: Nothing.
Complexity: Constant.
Note: Does not affect the validity of iterators and references.
|
inline |
Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list. No destructors are called.
Throws: If std::equal_to<value_type throws. Basic guarantee.
Complexity: Linear time (size()-1 comparisons calls to pred()).
Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.
|
inline |
Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list. No destructors are called.
Throws: If pred throws. Basic guarantee.
Complexity: Linear time (size()-1 comparisons equality comparisons).
Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.
|
inline |
Requires: Disposer::operator()(pointer) shouldn't throw.
Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list. Disposer::operator()(pointer) is called for every removed element.
Throws: If std::equal_to<value_type throws. Basic guarantee.
Complexity: Linear time (size()-1) comparisons equality comparisons.
Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.
|
inline |
Requires: Disposer::operator()(pointer) shouldn't throw.
Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list. Disposer::operator()(pointer) is called for every removed element.
Throws: If pred throws. Basic guarantee.
Complexity: Linear time (size()-1) comparisons equality comparisons.
Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.
|
friend |
|
friend |
|
friend |
|
friend |
|
friend |
|
friend |
|
friend |
|
static |
|
static |
|
static |


Dunlappo's Pizza
Give 'em everything!

Choose from these toppings:
Standard
(A buck)
:
Cheese
Pepperoni
Artichoke
Anchovies
Premium
(Two bucks)
:
Bacon
Avocado
Add your toppings to complete your order!
Your Order:


Chiefs & Pirates To Tussle For Kateregga?
by Soccer LadumaIt has been indicated to the Siya crew that there could be a tussle for a return to the PSL for Allan Kateregga – the midfielder who previously played for Cape Town City and Maritzburg United in Mzansi's top flight.
The Ugandan is plying his trade in Iraq, having secured a move to Erbil Sport Club in September.
Read – Breaking: Chippa Make Crucial Technical Team Change
The 25-year-old is said to be on the radar of both Kaizer Chiefs and Orlando Pirates, as reported in edition 1150 of Soccer Laduma, with the player’s representative confirming interest from the Absa Premiership, though he wouldn’t commit on the names of clubs as yet.
Read: Deal Confirmed, First 2019 Ke Yona Product Turns Pro…
While Siya sources have revealed that both Chiefs and Pirates are tracking the attack-minded player’s progress, all that his representative Samuel Celubra has said so far is, “The boy is wanted by clubs, and we have a few in South Africa that are looking at him. It’s the top clubs. He is available! His contract is ending in June next year and we hope for the best move for him. He loves the PSL, and if we get a good deal, we shall go with it.”
According to sources, there is also interest from Europe for the services of the Ugandan international.
Post Selfie’s On Soccer Laduma’s Social Media App & Earn Airtime and more! Download Now


{% extends "base.html" %} {% block title %}Password Reset Initiated{% endblock %} {% block content %}
We've e-mailed CCL support staff to reset your HydroNet password.
You should receive an email shortly (to the e-mail address you submitted).
{% endblock %}


Available Plugins
The Chai community is growing! Plugins allow developers to expand Chai's available assertions. Here is what the community has come up with so far:
- chai-spies is a basic spy implementation for chai. It's also a good resource for building chai plugins that work in both node.js and the browser.
- chai-jquery by @jfirebaugh
provides deep jQuery integration with chai
should
andexpect
. - jack by @vesln is a mock/stub library that can be used as a stand-alone or with chai.
- sinon-chai by @domenic extends chai with assertions for the Sinon.js mocking framework.


{{ serverName }}
{{ serverCreationStatus }}
Server was created, server name is {{ serverName }}
No server was created
{{ 'Server' }} with ID {{ serverId }} is {{ getServerStatus() }}


--- layout: post title: Books that Sing date: 2011-01-31 19:21:17.000000000 -08:00 type: post parent_id: '0' published: true pd: '' status: publish categories: - Book Reviews - Classroom Talk tags: - book review - children's books author: login: k email: k@k display_name: mcary first_name: '' last_name: '' ---
Guest Post by Kerry Aradhya
A Sampling of Picture Books that Sing
Ok. So the three picture books I’m about to tell you about don’t actually sing, but their splendid use of rhythm, rhyme, and pacing sure make me want to sing—and want to dance, too. Rhythm and rhyme are important tools for supporting early literacy, and these books are so fun and engaging that many emergent readers will want to hear them again and again.
1. Jazz Baby
Author: Lisa Wheeler
Illustrator: R. Gregory Christie
Publisher: Harcourt (2007)
So they BOOM-BOOM-BOOM and they HIP-HIP-HOP and the bouncing baby boogies with a BOP-BOP-BOP!
Itty-bitty Baby comes from a snazzy, jazzy family who sing and dance all the way through this rollicking good book. The rhyming text never misses a beat, and every line is as fun and fabulous as the one before it. The illustrations by R. Gregory Christie, who has also created covers for jazz records around the world, embody the lively spirit of this jazzy book perfectly.
2. Sleepyhead Bear
Author: Lisa Westberg Peters
Illustrator: Ian Schoenherr
Publisher: Greenwillow Books (2006)
He tries to look tall and growls, GRRRRRR! But the bugs aren’t afraid, and they buzzzzzz in her fur.
Poor little sleepyhead bear. All he wants to do is go to bed, but the bugs just won’t leave him alone! No matter where he goes—across a lake, up a tree, even into a log—the bugs are whirring and buzzing in his way. The pace of this energetic book speeds up when Bear gets into trouble and slows down when he can finally relax. The rhythm also changes from time to time, keeping readers on their toes, wondering what will happen next.
3. Rattletrap Car
Author: Phyllis Root
Illustrator: Jill Barton
Publisher: Candlewick Press (2001)
Poppa turned the key, brum, brum brum. Clinkety clankety bing bang pop! They were off to the lake in their rattletrap car. They didn’t go fast and they didn’t go far when…
Junie, Jakie, and the baby grab their water toys, pile into Poppa’s old rattletrap car, and head for the lake on a hot summer day. First a tire goes flat. Then the floor of the car falls out. The disasters keep coming, but this creative family finds more than a couple of entertaining ways to salvage the car. This humorous book is filled with repetition, great car sounds, and a rhythmic quality that should keep readers smiling—and wanting more.
Kerry Aradhya is a children’s poet, aspiring picture book author, and accomplished dancer. She writes about picture books related to dance and about other ways to integrate children’s literature and dance at her blog, Picture Books & Pirouettes (kerryaradhya.blogspot.com).


mgci.jhdap.shogi
Classes
Bishop
BoardPanel
Command
CommandLineInterface
EmptyPiece
GameState
GoldGeneral
GraphicUI
King
Knight
Lance
Move
Pawn
Piece
PlayerPane
PromotablePiece
PromotedBishop
PromotedKnight
PromotedLance
PromotedPawn
PromotedRook
PromotedSilverGeneral
Rook
Shogi
ShogiConsole
SilverGeneral
SoundEffect
StatsPanel
Tile
UnpromotablePiece


|
||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
Object org.javia.arity.Util
public class Util
Contains static helper methods for formatting double values.
| Field Summary | |
|---|---|
static int |
FLOAT_PRECISION
|
static int |
LEN_UNLIMITED
|
| Constructor Summary | |
|---|---|
Util()
|
| Method Summary | |
|---|---|
static String |
complexToString(Complex x,
int maxLen,
int rounding)
Renders a complex number to a String (for user display). |
static String |
doubleToString(double v,
int roundingDigits)
Rounds by dropping roundingDigits of double precision (similar to 'hidden precision digits' on calculators), and formats to String. |
static String |
doubleToString(double x,
int maxLen,
int rounding)
Renders a real number to a String (for user display). |
static double |
shortApprox(double value,
double maxError)
Returns a number which is an approximation of v (within maxError) and which has fewer digits in base-10). |
static String |
sizeTruncate(String str,
int maxLen)
Returns an approximation with no more than maxLen chars. |
| Methods inherited from class Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
public static final int LEN_UNLIMITED
public static final int FLOAT_PRECISION
| Constructor Detail |
|---|
public Util()
| Method Detail |
|---|
public static double shortApprox(double value, double maxError)
value
- the value to be approximatedmaxError
- the maximum deviation from value
public static String sizeTruncate(String str, int maxLen)
str
- the value to truncate (e.g. "-2.898983455E20")maxLen
- the maximum number of characters in the returned string
public static String doubleToString(double v, int roundingDigits)
v
- the value to be converted to StringroundingDigits
- the number of 'hidden precision' digits (e.g. 2).
public static String doubleToString(double x, int maxLen, int rounding)
maxLen
- the maximum total length of the resulting stringrounding
- the number of final digits to roundpublic static String complexToString(Complex x, int maxLen, int rounding)
maxLen
- the maximum total length of the resulting stringrounding
- the number of final digits to round
|
||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


Added or override colors to color dictionary
Set the alignment the layout
The background color for the wallpaper.
An absolute path to a background image. /sdcard/moss/bg-fav.png
Like xsetroot's mod parameter, allows the user to create a plaid like pattern.
Set the default color of the paint.
default outline color.
default shade color.
All text in uppercase
Enable to disable file observer (inotify) based auto config reload.
Sets the default font for the display.
Additional horizonal spacing
Additional vertical spacing
Determines how frequently the data, and display are updated.


Statistical data set
Other statistics published alongside the statistical first release.
This section holds other statistics published alongside the statistical first release (SFR). These are not National Statistics, but complement the information in the main Release.
FE trends provides an overview of adult (19+) government-funded further education and all age apprenticeships in England. It looks to provide trends between 2008/09 and 2013/14 and to give an overview of FE provision, characteristics of learners and outcomes over time
PDF , 1.87MB , 32 pages
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
MS Excel Spreadsheet , 681KB
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 531KB , 12 pages
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
MS Excel Spreadsheet , 126KB
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
As part of the methodological changes outlined to qualification achievement rates (QARs) in the January 2017 further education and skills SFR , the following table have been produced to help the user understand the underlying variation below the headline figures. Apprenticeship achievement rates for the academic years 2013 to 2014, 2014 to 2015, and 2015 to 2016 have been broken down by sector subject area using both previous and current methodologies.
MS Excel Spreadsheet , 220KB
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
MS Excel Spreadsheet , 133KB
MS Excel Spreadsheet , 1.17MB
MS Excel Spreadsheet , 80.1KB
MS Excel Spreadsheet , 74.5KB
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
MS Excel Spreadsheet , 67.8KB
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 234KB , 2 pages
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 232KB , 2 pages
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 192KB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 219KB , 2 pages
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
MS Excel Spreadsheet , 121KB
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 62.3KB , 2 pages
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 58KB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 40.1KB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
MS Excel Spreadsheet , 11.9KB
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
MS Excel Spreadsheet , 15.5KB
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
MS Excel Spreadsheet , 169KB
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
MS Excel Spreadsheet , 220KB
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
MS Excel Spreadsheet , 86KB
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
MS Excel Spreadsheet , 59.5KB
PDF , 34.8KB , 6 pages
The Organisation for Economic Co-operation and Development (OECD) produces an annual publication, Education at a Glance, providing a variety of comparisons between OECD countries. The table provided here contains a summary of the relative ranking in education attainment of the 25-64 year old population in OECD countries in 2012.
The OECD statistics use the International Standard Classification of Education. Within this, “at least upper secondary education” is equivalent to holding qualifications at Level 2 or above in the UK, and “tertiary education” is equivalent to holding qualifications at Level 4 or above in the UK.
MS Excel Spreadsheet , 161KB
This research is the result of a Department for Business, Innovation and Skills (BIS) funded, sector led project to gather and analyse data to inform the contribution that further education makes to STEM in England.
This project was led by The Royal Academy of Engineering, and governance of the project was specifically designed to ensure that those with an interest in STEM were actively engaged and involved in directing and prioritising outputs.
The November 2012 report builds on the FE and Skills STEM Data report published in July 2011 (below). It provides further analysis and interpretation of the existing data in a highly graphical format. It uses the same classified list of S,T, E and M qualifications as the 2011 report compiled through an analysis of the Register of Regulated Qualifications and the Learning Aim Database, updated with the most recent completions and achievements data taken from the Individualised Learner Record and the National Pupil Database.
PDF , 9.21MB , 28 pages
MS Excel Spreadsheet , 250KB
PDF , 20.5KB , 2 pages
Published: 5 March 2014
Updated: 16 February 2017


--- layout: post status: publish published: true title: '"I swear I can throw 63" - Episode 8.43' author: display_name: Corey Fineran login: Corey email<EMAIL_ADDRESS>url: '' author_login: Corey author_email<EMAIL_ADDRESS>wordpress_id: 11993 wordpress_url: http://ivyenvy.com/?p=11993 date: '2016-08-07 22:26:51 +0000' date_gmt: '2016-08-08 03:26:51 +0000' categories: - Uncategorized tags: [] comments: - id: 24495 author: Imran520 author_email: '' author_url: http://www.fashionstylestrend.com/ date: '2016-08-09 04:27:40 +0000' date_gmt: '2016-08-09 09:27:40 +0000' content: "Jorge Soler is back and hitting the ball well. Jake is back to being \nJake (without as many strikeouts) and Kyle Hendricks looks better than \nwe would have imagined he would.\nhttp://www.dramaonline.pk/" ---
Thanks for downloading the 421st episode of The Ivy Envy Podcast. The Chicago Cubs are on a roll. They’ve won 7 games in a row. They’re 28 games over .500. They have won every series since the All Star Break. They’re 11.5 games ahead of the Cardinals. Things are looking good. Then something dawns on us and we get real nervous about how this all might play out. Listen to find out what stopped us dead in our tracks.
Jorge Soler is back and hitting the ball well. Jake is back to being Jake (without as many strikeouts) and Kyle Hendricks looks better than we would have imagined he would.


{{record.position}}
{{record.year}}
{{record.company}}
{{record.description}}
title = "Experience" url = "/experience" layout = "default" is_hidden = 0 [builderList experienceList] modelClass = "Sujanneupane\Experience\Models\Experience" scope = "-" scopeValue = "{{ :scope }}" displayColumn = "position" noRecordsMessage = "No records found" detailsPage = "-" detailsUrlParameter = "id" pageNumber = "{{ :page }}" [builderDetails experienceDetails] modelClass = "Sujanneupane\Experience\Models\Experience" identifierValue = "{{ :id }}" modelKeyColumn = "id" displayColumn = "position" notFoundMessage = "Record not found" == {% set records = experienceList.records %} {% set displayColumn = experienceList.displayColumn %} {% set noRecordsMessage = experienceList.noRecordsMessage %} {% set detailsPage = experienceList.detailsPage %} {% set detailsKeyColumn = experienceList.detailsKeyColumn %} {% set detailsUrlParameter = experienceList.detailsUrlParameter %}
{{record.year}}
{{record.description}}


libstddjb
libskarnet
skalibs
Software
skarnet.org
Lots of functions in libstddjb, declared for instance in allreadwrite.h or djbunix.h, are just "safe wrappers" around corresponding system functions. For instance, fd_read() is a safe wrapper around the system read() function.
Quite a lot of system calls are defined by The Open Group Base Specifications as interruptible: when the process is in the middle of such a system call and receives a signal that it does not ignore, the system call immediately returns -1 EINTR (after the signal handler, if any, has been executed).
Most of the time, this is not an issue: unignored signals usually kill the process anyway. Or stop it - and when it resumes, system calls are simply restarted, not interrupted. EINTR can only happen when a signal handler has been installed, and a signal is actually caught by the signal handler during an interruptible system call. And to avoid EINTR, users can use the SA_RESTART flag when installing the signal handler with sigaction().
However, there is a common case where using SA_RESTART is a bad idea: when writing an asynchronous event loop.
An asynchronous event loop is organized around a select() or poll() system call that is the only blocking operation in the whole loop. That call takes a timeout as an argument. If a signal handler is installed with SA_RESTART and a signal arrives in the middle of the select/poll call - which happens often since it is blocking - then the select/poll is restarted with the same arguments, including the timeout. This is not good: time has elapsed, the timeout should be recomputed. Some versions of select update the values in the struct timeval even when select() is interrupted, but it is not portable, and not applicable to poll(). So it is necessary, in this case, to have select/poll return -1 EINTR when a signal is caught. And that means SA_RESTART should not be used.
Which also means that other system calls performed when the signal handler has been installed, for instance in the body of the loop, will not be protected, and can return -1 EINTR if a signal is caught at the wrong time.
So, in order to be perfectly reliable, when a program has caught a signal without SA_RESTART and makes an interruptible system call, it must check whether the return value is -1 EINTR, and restart the system call if it is the case.
The performance loss from having a wrapper layer is totally negligible compared to the cost of using a system call in the first place.


assert x.shape[1] == len(self._Q.shape), "tabular regressor dimension " \
"does not fit with input size."
for i, idx in enumerate(x):
self._Q[tuple(idx)] = y[i]
def predict(self, x):
Predict.
assert x.shape[1] == len(self._Q.shape), "tabular regressor dimension " \
"does not fit with input size."
idxs = [x[:, i].astype(int) for i in xrange(x.shape[1])]
self._Q[idxs] = y
def predict(self, x):


| Class | Cri::CommandDSL |
| In: |
lib/cri/command_dsl.rb
|
| Parent: | Object |
The command DSL is a class that is used for building and modifying commands.
@param [Cri::Command, nil] command The command to modify, or nil if a
new command should be created
Marks the command as hidden. Hidden commands do not show up in the list of subcommands of the parent command, unless —verbose is passed (or `:verbose => true` is passed to the {Cri::Command#help} method). This can be used to mark commands as deprecated.
@return [void]
Adds a new option with a forbidden argument to the command. If a block is given, it will be executed when the option is successfully parsed.
@param [String, Symbol, nil] short The short option name
@param [String, Symbol, nil] long The long option name
@param [String] desc The option description
@return [void]
@see {option}
Adds a new option to the command. If a block is given, it will be executed when the option is successfully parsed.
@param [String, Symbol, nil] short The short option name
@param [String, Symbol, nil] long The long option name
@param [String] desc The option description
@option params [:forbidden, :required, :optional] :argument Whether the
argument is forbidden, required or optional
@return [void]
Adds a new option with an optional argument to the command. If a block is given, it will be executed when the option is successfully parsed.
@param [String, Symbol, nil] short The short option name
@param [String, Symbol, nil] long The long option name
@param [String] desc The option description
@return [void]
@see {option}
Adds a new option with a required argument to the command. If a block is given, it will be executed when the option is successfully parsed.
@param [String, Symbol, nil] short The short option name
@param [String, Symbol, nil] long The long option name
@param [String] desc The option description
@return [void]
@see {option}
Defines the runner class for this command. Calling this will override existing run block or runner declarations (using {run} and {runner}, respectively).
@param [Class<CommandRunner>] klass The command runner class (subclass
of {CommandRunner}) that is used for executing this command.
@return [void]
Adds a subcommand to the current command. The command can either be given explicitly, or a block can be given that defines the command.
@param [Cri::Command, nil] command The command to add as a subcommand,
or nil if the block should be used to define the command that will be added as a subcommand
@return [void]


git从入门到跑路 [5] ：tags版本标签
git-tag - Create, list, delete or verify a tag object signed with GPG
SYNOPSIS
- 创建、修改tag
git tag [-a | -s | -u <keyid>] [-f] [-m <msg> | -F <file>] [-e]
<tagname> [<commit> | <object>]
- 删除一个tag
git tag -d <tagname>…
- tag操作
git tag [-n[<num>]] -l [--contains <commit>] [--no-contains <commit>]
[--points-at <object>] [--column[=<options>] | --no-column]
[--create-reflog] [--sort=<key>] [--format=<format>]
[--[no-]merged [<commit>]] [<pattern>…]
- 验证tag
git tag -v [--format=<format>] <tagname>…
DESCRIPTION
Add a tag reference in refs/tags/, unless -d/-l/-v is given to delete, list or verify tags.
Unless -f is given, the named tag must not yet exist.
If one of -a, -s, or -u
If -m
Otherwise, a tag reference that points directly at the given object (i.e., a lightweight tag) is created.
A GnuPG signed tag object will be created when -s or -u
Tag objects (created with -a, -s, or -u) are called “annotated” tags; they contain a creation date, the tagger name and e-mail, a tagging message, and an optional GnuPG signature. Whereas a “lightweight” tag is simply a name for an object (usually a commit object).
Annotated tags are meant for release while lightweight tags are meant for private or temporary object labels. For this reason, some git commands for naming objects (like git describe) will ignore lightweight tags by default.
OPTIONS
-a
–annotate
Make an unsigned, annotated tag object
-s
–sign
Make a GPG-signed tag, using the default e-mail address’s key.
-u
–local-user=
Make a GPG-signed tag, using the given key.
-f
–force
Replace an existing tag with the given name (instead of failing)
-d
–delete
Delete existing tags with the given names.
-v
–verify
Verify the GPG signature of the given tag names.
-n
The default is not to print any annotation lines. If no number is given to -n, only the first line is printed. If the tag is not annotated, the commit message is displayed instead.
-l
–list
List tags. With optional
Running “git tag” without arguments also lists all tags. The pattern is a shell wildcard (i.e., matched using fnmatch(3)). Multiple patterns may be given; if any of them matches, the tag is shown.
This option is implicitly supplied if any other list-like option such as --contains is provided. See the documentation for each of those options for details.
–sort=
Sort based on the key given. Prefix - to sort in descending order of the value. You may use the --sort=
–color[=
Respect any colors specified in the --format option. The
-i
–ignore-case
Sorting and filtering tags are case insensitive.
–column[=
–no-column
Display tag listing in columns. See configuration variable column.tag for option syntax.–column and --no-column without options are equivalent to always and never respectively.
This option is only applicable when listing tags without annotation lines.
–contains [
Only list tags which contain the specified commit (HEAD if not specified). Implies --list.
–no-contains [
Only list tags which don’t contain the specified commit (HEAD if not specified). Implies --list.
–merged [
Only list tags whose commits are reachable from the specified commit (HEAD if not specified), incompatible with --no-merged.
–no-merged [
Only list tags whose commits are not reachable from the specified commit (HEAD if not specified), incompatible with --merged.
–points-at
-m
–message=
Use the given tag message (instead of prompting). If multiple -m options are given, their values are concatenated as separate paragraphs. Implies -a if none of -a, -s, or -u
-F
–file=
Take the tag message from the given file. Use - to read the message from the standard input. Implies -a if none of -a, -s, or -u
-e
–edit
The message taken from file with -F and command line with -m are usually used as the tag message unmodified. This option lets you further edit the message taken from these sources.
–cleanup=
This option sets how the tag message is cleaned up. The
–create-reflog
Create a reflog for the tag. To globally enable reflogs for tags, see core.logAllRefUpdates in git-config(1). The negated form --no-create-reflog only overrides an earlier --create-reflog, but currently does not negate the setting of core.logAllRefUpdates.
–format=
A string that interpolates %(fieldname) from a tag ref being shown and the object it points at. The format is the same as that of git-for-each-ref(1). When unspecified, defaults to %(refname:strip=2).


|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object iwork.patchpanel.Intermediary
The Intermediary class implements the translation mapping service. Any event that is posted to the event heap is a translation candidate. If The translation candidate matches any of the translation criteria, the output list of events are posted to the event heap. The Intermediary process is a centralized service that can be accessed through event based remote procedure calls. The event based RPC functions by the remote application sending an IntermediaryMappingEvent with some expected fields including a "Method" field which indicates which procedure it is trying to activate, as well as parameter fields specific to that method. This RPC mechanism provides an interface to modify or retrieve current translation mappings from remote applications.
| Field Summary | |
static int |
MAX_JUMPS
|
boolean |
sendChainEvents
|
static int |
TIMEOUT
|
| Constructor Summary | |
Intermediary(boolean sendChainEvents)
Default constructor, no event heap is specified. |
|
Intermediary(java.lang.String eHeapServer,
boolean sendChainEvents)
Creates an Intermediary service for the event heap specified in eHeapServer |
| Method Summary | |
static int |
cancelTimerRPC(iwork.eheap2.EventHeap eh,
java.lang.String groupName,
java.lang.String timerName)
Remote Procedure call interface to the cancelTimer method of the Intermediary. |
static iwork.eheap2.Event |
createCancelTimerEvent(java.lang.String groupName,
java.lang.String timerName)
|
static iwork.eheap2.Event |
createSetGlobalVariableEvent(java.lang.String groupName,
java.lang.String varType,
java.lang.String varName,
java.io.Serializable varValue)
|
static iwork.eheap2.Event |
createSetTimerEvent(java.lang.String groupName,
java.lang.String timerName,
long delay)
|
static int |
getAllGlobalVariablesRPC(iwork.eheap2.EventHeap eh,
java.util.ArrayList variables)
Remote Procedure call interface to the getAllGlobalVariables method of the Intermediary. |
static int |
getAllMappingsRPC(iwork.eheap2.EventHeap eh,
java.util.ArrayList mappings)
Remote Procedure call interface to the getAllMappings method of the Intermediary. |
static int |
getAllMappingsSeparatelyRPC(iwork.eheap2.EventHeap eh,
java.util.ArrayList mappings)
|
static int |
getMappingRPC(iwork.eheap2.EventHeap eh,
Mapping mapping)
Remote Procedure call interface to the getMapping method of the Intermediary. |
static java.lang.String |
getMappingsSummaryRPC(iwork.eheap2.EventHeap eh)
Remote Procedure call interface to the getMappingsSummary method of the Intermediary. |
static int |
getTranslationRPC(iwork.eheap2.EventHeap eh,
Mapping mapping)
Remote Procedure call interface to the getTranslation method of the Intermediary. |
void |
handleEvent(iwork.eheap2.Event e)
|
void |
handleEvents(iwork.eheap2.Event[] e)
Generic event handler. |
static void |
main(java.lang.String[] args)
|
static java.util.Collection |
mappingsToEvents(java.util.Collection mappings)
|
static iwork.eheap2.Event |
mappingToEvent(Mapping m)
|
static int |
removeGlobalVariableRPC(iwork.eheap2.EventHeap eh,
java.lang.String groupName,
java.lang.String varName)
|
static int |
setGlobalVariableRPC(iwork.eheap2.EventHeap eh,
GlobalVar variable)
|
static int |
setGlobalVariableRPC(iwork.eheap2.EventHeap eh,
java.lang.String groupName,
java.lang.String varType,
java.lang.String varName,
java.io.Serializable varValue)
Remote Procedure call interface to the setGlobalVariable method of the Intermediary The setGlobalVariable function adds a patch panel variable, or if a variable of the same name already exists, changes the value of the pre-existing variable. |
static int |
setMappingRPC(iwork.eheap2.EventHeap eh,
Mapping mapping)
Remote Procedure call interface to the setMapping method of the Intermediary The setMapping function updates the translation map to specify a new translation. |
static int |
setTimerRPC(iwork.eheap2.EventHeap eh,
java.lang.String groupName,
java.lang.String timerName,
long delay)
Remote Procedure call interface to the setTimer method of the Intermediary. |
static int |
testTranslationRPC(iwork.eheap2.EventHeap eh,
Mapping mapping)
Remote Procedure call interface to the testTranslation method of the Intermediary. |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
public boolean sendChainEvents
public static int MAX_JUMPS
public static int TIMEOUT
| Constructor Detail |
public Intermediary(boolean sendChainEvents)
public Intermediary(java.lang.String eHeapServer, boolean sendChainEvents)
eHeapServer
- string specifing the name of the event heap server| Method Detail |
public void handleEvents(iwork.eheap2.Event[] e)
public void handleEvent(iwork.eheap2.Event e) throws iwork.eheap2.EventHeapException
iwork.eheap2.EventHeapException
public static int setGlobalVariableRPC(iwork.eheap2.EventHeap eh, GlobalVar variable)
public static int setGlobalVariableRPC(iwork.eheap2.EventHeap eh, java.lang.String groupName, java.lang.String varType, java.lang.String varName, java.io.Serializable varValue)
eh
- the event heap that the intermediary is connected togroupName
- the name of the program in which the variable exists
(to prevent conflicts between similarly-named variables in different programs)varName
- the name of the variable to be added/changed (this should be unique within its program)varValue
- the desired value of the variable
public static iwork.eheap2.Event createSetGlobalVariableEvent(java.lang.String groupName, java.lang.String varType, java.lang.String varName, java.io.Serializable varValue)
public static int removeGlobalVariableRPC(iwork.eheap2.EventHeap eh, java.lang.String groupName, java.lang.String varName)
public static iwork.eheap2.Event createSetTimerEvent(java.lang.String groupName, java.lang.String timerName, long delay)
public static int setTimerRPC(iwork.eheap2.EventHeap eh, java.lang.String groupName, java.lang.String timerName, long delay)
eh
- the event heap that the intermediary is connected togroupName
- the name of the program in which the timer exists
(to prevent conflicts between similarly-named timer in different programs)timerName
- the name of the timer to be added/changed (this should be unique within its program)delay
- the desired delay of the timer (in milliseconds)
public static iwork.eheap2.Event createCancelTimerEvent(java.lang.String groupName, java.lang.String timerName)
public static int cancelTimerRPC(iwork.eheap2.EventHeap eh, java.lang.String groupName, java.lang.String timerName)
eh
- the event heap that the intermediary is connected togroupName
- the name of the program in which the timer exists
(to prevent conflicts between similarly-named timer in different programs)timerName
- the name of the timer to be cancelled (this should be unique within its program)
public static int setMappingRPC(iwork.eheap2.EventHeap eh, Mapping mapping)
eh
- the event heap that the intermediary is connected tomapping
- the translation specification that contains desired mapping
public static int getMappingRPC(iwork.eheap2.EventHeap eh, Mapping mapping)
eh
- the event heap that the intermediary is connected tomapping
- contains the translationCriteria and program whose mapping should be
retrieved. The resulting output event list is placed inside of the Mapping
parameter.
public static int getTranslationRPC(iwork.eheap2.EventHeap eh, Mapping mapping)
eh
- the event heap that the intermediary is connected tomapping
- contains the translationCriteria whose mapping should be
retrieved. The resulting output event list is placed inside of the Mapping
parameter.
public static int testTranslationRPC(iwork.eheap2.EventHeap eh, Mapping mapping)
eh
- the event heap that the intermediary is connected tomapping
- contains the translationCriteria whose mapping should be
retrieved. The resulting output event list is placed inside of the Mapping
parameter.
public static int getAllGlobalVariablesRPC(iwork.eheap2.EventHeap eh, java.util.ArrayList variables)
eh
- the event heap that the intermediary is connected tovariables
- object to place the result of the getAllGlobalVariables method call
public static java.lang.String getMappingsSummaryRPC(iwork.eheap2.EventHeap eh)
eh
- the event heap that the intermediary is connected to
public static int getAllMappingsRPC(iwork.eheap2.EventHeap eh, java.util.ArrayList mappings)
eh
- the event heap that the intermediary is connected tomappings
- object to place the result of the getAllMappings method call
public static int getAllMappingsSeparatelyRPC(iwork.eheap2.EventHeap eh, java.util.ArrayList mappings)
public static java.util.Collection mappingsToEvents(java.util.Collection mappings)
public static iwork.eheap2.Event mappingToEvent(Mapping m)
public static void main(java.lang.String[] args)
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


--- layout: default --- {% include core/social.html %} {% include core/header.html %} {{ content }} {% include core/navigation.html %} {% include core/footer.html %}