The Slack channel is the main place where you can easily talk to other members in GDI, but you can also easily message me with questions. If you haven't joined yet, you definitely should! Make sure you join the #intro-to-javascript channel, where you can ask me and your other classmates questions.
CodeNewbies is a great resource no matter where you are at in your coding journey. I find their podcasts to be both informational and inspirational. They also have a Slack channel where you can connect with other #CodeNewbies.


Bolts whip B-Pier
MERALCO gave its best in the fourth quarter to bring down NorthPort, 103-89, and keep its hot streak going in the PBA Governors’ Cup on Sunday at the Ynares Center.
The Bolts fought the Batang Pier in an intense contest for three full quarters before they seized control in the fourth period and chalk up their fifth straight win in the season-ending conference.
With their eighth win in 10 outings, the Bolts have now cemented their place in the top four and earned twice-to-beat advantage in the 8-team quarterfinal round.
As usual, Allen Durham delivered yeoman job for the Bolts, scoring 26 points and cornering 19 rebounds as he continued to tally big numbers that could pretty bolster his chances for another best import award.
However, it was Anjo Caram and Chris Newsome who spewed steady fires for the Bolts who sent the Batang Pier reeling to their sixth loss in nine games.
Caram cut loose with 30 points, including four triples, while Newsome added 17 points and seven rebounds
“This win is really nice because we really had a goal of making it to the top four and we really want to get the twice-to-beat advantage to have a slight advantage going into the playoffs,” said Meralco coach Norman Black.
“I’m really happy for my players. They are focused on the goal and they achieved it tonight by getting their eighth win. It wasn’t a pretty game but a lot of games aren’t pretty. Just have to grind it out and win it,” added Black.
The scores:
Meralco (103) - Caram 30, Durham 26, Newsome 17, Almazan 8, Pinto 8, Maliksi 6, Faundo 4, Hugnatan 2, Amer 2, Quinto 0, Jackson 0, Jose 0, Hodge 0, Jamito 0.
NorthPort (89) - Qualls 27, Standhardinger 20, Anthony 19, Mercado 9, Lanete 8, Taha 3, Ferrer 3, Elorde 0, Cruz 0, King 0, Escoto 0.
Quarterscores: 20-23, 50-45, 72-69, 103-89.


{% import "forms/form_macros.jinja" as form %} {% set report_type = 'event' %} {% set post_path = '/reports/event/create' %} {% set report_script = '/static/js/event-report-form-handling.js' %} {% set metric_options = event_metrics %} {% set default_metrics = event_metrics.keys() %} {% extends "forms/base/base_report_form.html" %} {% block quality_flag_field %}
Observation data flagged with any of the checked quality flags is excluded from analysis. The corresponding forecast data is also excluded.
USER FLAGGED


Back
file path
Last saved snapshots
Current medadata
File name
File size (bytes)
Last modified time
Last accessed time
Permission
File name
File size (bytes)
Last modified time
Last modified time
Last accessed time
Permission


categorized by programming focuses
This folder contains applications built using jQuery.
This folder contains my work using CSS3 tricks.
This contains work using HTML5 video/audio and canvas.
This folder contains applications I've built using Angular 2.
This folder contains applications I've built using meteorjs.


| +---amethyst | | | +---k56_j56 | | | +---k56x4_j56y7 | | | +---j136y7_k135x4 | | | +---j36_k15 | | | +---j3k5x4_k1j6y7 | | | +---j167y2_k345x2 | | | +---j6_k5 | | | `---n167x4_n345y7 |


Akash is a graduate fresher engineer. He is a budding software developer, an machine learning enthusiast and hobby UI/UX designer.
He is a great leader and always tries to stand out of the crowd. He loves dedicating his free time in hobby electronics projects.


| Delegator | Frozen reward | Pending reward | Paid reward |
|---|---|---|---|
| {{d.alias}} | {{d.frozen|balance}} | {{d.pending|balance}} | {{d.paid|balance}} |
| Delegator | Percentage | Estimated reward | Frozen reward | Reward |
|---|---|---|---|---|
| {{d.alias}} | {{d.percentage}} | {{((cycle.rights.estimated_reward - (cycle.rights.estimated_reward / 100 * (100 - data.percentage))) / 100 * d.percentage)|balance}} | {{paylog.deleguees[d.address]['cycles'][cycle.cycle].frozen|balance}} | {{paylog.deleguees[d.address]['cycles'][cycle.cycle].reward|balance}} |


Number Guess
Current Player:
Guess
Login
Register
Logout
Guess a number!
Game Info
Response
Points
Change


Can we design a world without boundaries? And if so, do we want to? Many designs enable us to seamlessly maneuver between spaces, contexts and environments (for example: switching mobile cells). However, certain boundaries might be important for us (and sometimes difficult) to maintain (for example: separating home from work). Technology and design can shape our environments and create new boundaries.
How can we design meaningful boundaries? Are there boundaries that we can 'push', or make invisible?
South Africans have more ready access to cellphones than they do to fresh water. In a world with war, conflict, poverty and poor access to the most basic of necessities, mobile devices play a powerful role in connecting people with each other. How might we imagine leveraging our mobile devices to bring about a more equitable, livable and harmonious world?
Other axes: farming/distance collaboration/environment/ecology
The government is going digital. As movements promoting open data in the public sector gain traction, more and more opportunities are emerging to integrate this data into our daily lives, allowing us as citizens to be more well-informed and engaged. Technology can be utilized at a variety of scales, from creating good in local communities to providing the momentum to fuel national movements. In the United States, election season is just around the corner, but political empowerment from the bottom up is not something that you might just imagine for this country alone.
How do you go about discovering unmet needs with such a charged and polarized domain?
Start with a challenge
Mobile devices are transforming health and medicine at a rapid pace. Diabetes patients can better manage their blood-glucose (chronic disease management), radiologists can flip through and annotate x-rays from their patient records in their pockets (diagnosis) , medical students reference key anatomy on fly (medical EDU), and consumers can stay physically active (health behavior change) - to name a few. But the mobile devices that we see today don't always meet the design needs of their medical users. Where do current devices and interactions fall short ? What hacks and workarounds can we observe? How might we better solve needs in health and medicine by redesigning the mobile health experience?
Possible needfinding spots with the Stanford Medical School and PAMF.
Quantified self is a new movement centered around the idea that we can use data to collect information about ourselves. You may have heard of Nick Felton and his Feltron Report- it’s so popular now that it goes out of print shortly after they’re made available. When you collect data about your eating/sleeping/walking/living habits, you gain new and interesting insights into the human mind, and, more importantly, into our health. While you may choose not to go as detailed as such, this design brief will prompt you to examine the ways we approach our own health (as well as those around us) and identify and provide solutions for unmet needs.
Even with the amount of time we spend communicating with people at a distance through a screen, face to face communication has not become obsolete and cities are the medium of choice for people to do this. Cities continue to grow in population all over the world. People move to densely populated areas to be inspired, find opportunity, and to be a part of cultural events. Jane Jacobs, an advocate for cities and a critic of urban planning practices that isolated people, described the successful city as a dance that encourages weak connections that inspire new ideas, but also conceded that "Big cities have difficulties in abundance, because they have people in abundance.” One example of how cities have invested in digital infrastructure and policies to help their city run smoother, as well as help their citizens engage with the government and each other comes from the NYC digital Initiative in New York. What can we do here in San Diego?
How can we design applications that enhance the best parts of living in a city while also minimizing some of the disadvantages?
How do cities inspire design? What can we learn from cities that can help us design successful online communities? What applications would only make sense if deployed in a city?
Mobile devices have become pervasive with people increasingly using them in all aspects of their lives. As a result of their size and portability, mobile devices can be kept in someone’s pocket or bag so as to be ready at hand 24/7. While the access to real-time data or information can be extremely beneficial, along with the access to real-time data is a constant stream of information that can fracture one’s attention. How might we design an application to help us filter the types of information that are being sent to us based on our context? Context might mean…
With the rise of AirBnB, ZipCar, Kickstarter and a host of book/bike/car/clothes/material and monetary sharing (crowdfunding, for example), we live in a world where we’re increasingly keen on sharing our resources in exchange for others. You may even have heard of the concept of a time bank -- where instead of saving and storing money, you’re storing time for services (e.g. TaskRabbit) -- and all of this helps reduce over-consumption too.


Colorimeter plotting program¶
This program allows users to generate calibration curves that are typically used to find the concentration of a solution. For an example of a lab using this program see Lab 2: Beer’s Law and Molar Extinction Coefficients.
Procedure: Connect-Calibrate-Measure-Plot-Export¶
- With the plotting program window open enter the serial port corresponding to your device in the program window and click on the “Connect” button in the lower left-hand side.
- Select which LED to use from the options in the upper bar. Unlike the basic program, you can only use one LED for the plotting measurements.
- Calibrate sensor. Place a cuvette with your ‘blank’ measurement (e.g. water) inside the colorimeter and click “Calibrate”. After calibration, click on “Measure” with your ‘blank’ cuvette still in place. The colorimeter should return a zero absorbance value.
- Place a cuvette containing your first sample into the colorimeter and click “Measure”. The absorbance value will be displayed in the table. You can either enter the corresponding concentration value at this time or skip ahead to the next measurement.
- At any point after calibration you can plot the data in the table by clicking “Plot”. A second window will automatically open, and display a scatter plot of the data.
- Once you finished measuring and plotting you can export the data for later use with the concentration program using the “Options-> Export Test Solution” menu item at the top of the program window. After exporting, this file will be automatically available for use with the concentration program.
Additional software features¶
See Software features for more information on these features.
- Custom wavelengths.
- Save data at any point after calibration using the “File -> Save” menu item at the top of the program window.
- Change sample rate.


Trump heads back to Louisiana for late rally in race for Governor
by Jamie DupreeTrying to boost Republican efforts to defeat Democratic Gov. John Bel Edwards, President Donald Trump rallies again in Louisiana on Thursday evening, just two days before a Saturday runoff election that's being closely watched by leaders in both parties.
It's second time in eight days that the President has come to the Bayou State for a campaign rally to help Republican Eddie Rispone, as polls have basically shown a dead heat.
"You're going out to replace a radical, liberal Democrat," Mr. Trump said to cheers last week, using an attack line which has had mixed success for Republicans in recent elections.
"John Bel Edwards has not done the job," the President added ahead of Louisiana's unusual November 16 runoff.
For Republicans, the Louisiana race for Governor is a chance to offset a loss earlier this month in Kentucky, where GOP Gov. Matt Bevin lost by just over 5,000 votes to Democrat Andy Beshear.
While the President campaigned for Bevin - as he has for Rispone in Louisiana - Bevin was an unpopular Governor, as he netted fewer votes than other Republicans on the ballot running in statewide elections.
After making various unsupported claims about possible voter fraud, and holding out the possibility of an extended challenge to the results, Bevin on Thursday afternoon conceded defeat.
That came after a recanvass in each Kentucky county showed no evidence of any changes in vote totals, as the Governor never produced any evidence of voter fraud.
There were three races for Governor in 2019 - Democrats won in Kentucky, and Republicans kept control with a victory in Mississippi.
That makes the Louisiana runoff the rubber match for this political year. Recent polls have shown a dead heat between Edwards and Rispone.


[Reviewer Note by Barmar: This description is hard to follow.]
Methods for update-instance-for-redefined-class may be defined to specify actions to be taken when an instance is updated. If only after methods for update-instance-for-redefined-class are defined, they will be run after the system-supplied primary method for initialization and therefore will not interfere with the default behavior of update-instance-for-redefined-class. Because no initialization arguments are passed to update-instance-for-redefined-class when it is called by the system, the initialization forms for slots that are filled by before methods for update-instance-for-redefined-class will not be evaluated by shared-initialize.
Methods for shared-initialize may be defined to customize class redefinition. For more information, see shared-initialize.


/**
* Provides network functionalty
*
* @author costmo
*/
class CW_Network
{
/**
* Create a new instance
*
* @author costmo
*/
constructor()
{
}
/**
* Ping a server that's known to accept ICMP packets and never go down to make sure the local Internet connection is working.
*
* @author costmo
* @returns Promise
*/
checkLocalNetwork()
{
let CW_PromiseResolver = require( "./CW_PromiseResolver" );
let resolver = new CW_PromiseResolver();
return new Promise(
(resolve, reject ) =>
{
resolver.resolve_localNetwork( resolve, reject, {pingHosts: null} );
}
);
} // checkLocalNetwork()
/**
* Make sure the local Internet connection can resolve a hostname
*
* @author costmo
* @returns Promise
*/
checkLocalDns()
{
let CW_PromiseResolver = require( "./CW_PromiseResolver" );
let resolver = new CW_PromiseResolver();
return new Promise(
(resolve, reject ) =>
{
resolver.resolve_checkLocalDns( resolve, reject, {dnsHost: null} );
});
} // checkDns()
/**
* Verify essential HTML tags on the user's site
*
* @author costmo
* @returns Promise
* @param {*} url The URL of the site to check
*/
checkWebsiteContent( { url = null } )
{
let CW_PromiseResolver = require( "./CW_PromiseResolver" );
let resolver = new CW_PromiseResolver();
return new Promise(
( resolve, reject ) =>
{
resolver.resolve_checkWebsiteContent( resolve, reject, { url: url } )
.catch(
( error ) =>
{
reject( error );
}
);
});
} // checkWebsiteResponse()
/**
* Verify that the user's website status and redirect URL
*
* @author costmo
* @returns Promise
* @param {*} url The URL of the site to check
* @param {*} port The port to check (80 or 443)
*/
checkWebsiteResponse( { url = null, port = 80 } )
{
let CW_PromiseResolver = require( "./CW_PromiseResolver" );
let resolver = new CW_PromiseResolver();
return new Promise(
( resolve, reject ) =>
{
resolver.resolve_checkWebsiteResponse( resolve, reject, { url: url, port: port } );
});
} // checkWebsiteResponse()
/**
* Verify that the user's website is responding and get the average connection latency
*
* @author costmo
* @returns Promise
* @param {*} domain The domain name of the site to check
* @param {*} port The port to check (80 or 443)
*/
checkWebsiteAvailability( { domain = null, port = 80 } )
{
let CW_PromiseResolver = require( "./CW_PromiseResolver" );
let resolver = new CW_PromiseResolver();
return new Promise(
( resolve, reject ) =>
{
resolver.resolve_checkWebsiteAvailability( resolve, reject, { domain: domain, port: port } );
});
} // checkWebsiteAvailability()
/**
* Perform a whois query for the given domain. Currently (only) used to check pending domaind expiration.
*
* IMPORTANT NOTE: The keys and values that are returned by the query are strings that have no rules from registrar from registrar or OS to OS (the implementation of the local whois executable makes a difference). This parser is likely to fail for some registrars.
*
* @author costmo
* @returns Promise
* @param {*} domain The domain name to lookup
*/
getWhoisInfo( { domain = null } )
{
let CW_PromiseResolver = require( "./CW_PromiseResolver" );
let resolver = new CW_PromiseResolver();
return new Promise(
( resolve, reject ) =>
{
resolver.resolve_getWhoisInfo( resolve, reject, { domain: domain } );
}
);
}
/**
* Perform a `dig` query to get domain information
*
* @returns Promise
* @param {*} domain The domain/URL to query
* @param {*} recordType The type of record to find ("A", "CNAME", "MX" etc.)
* @param {*} queryServer The server to query. If null, will use the current user's configured DNS server
*/
checkDomain( { domain = null, recordType = null, queryServer = null } )
{
let CW_PromiseResolver = require( "./CW_PromiseResolver" );
let resolver = new CW_PromiseResolver();
return new Promise(
( resolve, reject ) =>
{
resolver.resolve_checkDomain( resolve, reject, { domain: domain, recordType: recordType, queryServer: queryServer } );
}
);
}
/**
* Check a server's SSL certificate
*
* @returns Promise
* @param {*} url The domain/URL to query
*/
checkSSL( { url = null } )
{
let CW_PromiseResolver = require( "./CW_PromiseResolver" );
let resolver = new CW_PromiseResolver();
return new Promise(
( resolve, reject ) =>
{
resolver.resolve_checkSSL( resolve, reject, { url: url } );
}
);
}
/**
* Check a server's SSL certificate expiration date
*
* @returns Promise
* @param {*} url The domain/URL to query
*/
checkSSLExpiration( { url = null } )
{
let CW_PromiseResolver = require( "./CW_PromiseResolver" );
let resolver = new CW_PromiseResolver();
return new Promise(
( resolve, reject ) =>
{
resolver.resolve_checkSSLExpiration( resolve, reject, { url: url } );
}
);
}
}
module.exports = CW_Network;


NEWS.md
“Best Guess” was sometimes misinterpreted so we changed “Best Guess” to “User’s Prior Projection”. User’s Prior Projection is only displayed if niter < 100.
PDF now includes short-term (dates of observed data) and long-term (until Projection End Date) plots
plot.observed.data.long.term
, plot.observed.data.short.term
added to internal.args (Internal sheet). These logicals control plotting the observed data bounds on the long-term and short-term plots.
lower.bound.label
, upper.bound.label
added to internal.args (Internal sheet). For example, in San Francisco these are “Confirmed COVID19” and “Confirmed COVID19 + 30%PUI”.


|
Gephi Toolkit Javadoc | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object org.gephi.data.attributes.type.Interval<T>
T
- type of datapublic final class Interval<T>
This class represents an interval with some value.
| Constructor Summary | |
|---|---|
Interval(double low,
double high)
Constructs a new interval instance with no value and left and right endpoints included by default. |
|
Interval(double low,
double high,
boolean lopen,
boolean ropen)
Constructs a new interval instance with no value. |
|
Interval(double low,
double high,
boolean lopen,
boolean ropen,
T value)
Constructs a new interval instance. |
|
Interval(double low,
double high,
T value)
Constructs a new interval instance with left and right endpoints included by default. |
|
Interval(Interval interval,
T value)
Constructs a new interval instance Note that value cannot be null if you want use this
interval as a value storage. |
| Method Summary | |
|---|---|
int |
compareTo(Interval interval)
Compares this interval with the specified interval for order. |
boolean |
equals(java.lang.Object obj)
Compares this interval with the specified object for equality. |
double |
getHigh()
Returns the right endpoint. |
double |
getLow()
Returns the left endpoint. |
T |
getValue()
Returns the value stored in this interval. |
int |
hashCode()
|
boolean |
isHighExcluded()
Indicates if the right endpoint is excluded. |
boolean |
isLowExcluded()
Indicates if the left endpoint is excluded. |
java.lang.String |
toString()
Returns a string representation of this interval in one of the formats: [low, high, value]
(low, high, value]
[low, high, value)
(low, high, value)
Times are always shown as doubles |
java.lang.String |
toString(boolean timesAsDoubles)
Creates a string representation of the interval with its value. |
| Methods inherited from class java.lang.Object |
|---|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
| Constructor Detail |
|---|
public Interval(Interval interval, T value)
Note that value
cannot be null if you want use this
interval
as a value storage. If it is null some estimators
could not work and generate exceptions.
interval
- the interval to copy the values fromvalue
- the value stored in this interval
java.lang.IllegalArgumentException
- if low
> high
.public Interval(double low, double high, boolean lopen, boolean ropen, T value)
Note that value
cannot be null if you want use this
interval
as a value storage. If it is null some estimators
could not work and generate exceptions.
low
- the left endpointhigh
- the right endpointlopen
- indicates if the left endpoint is excluded (true in this case)ropen
- indicates if the right endpoint is excluded (true in this case)value
- the value stored in this interval
java.lang.IllegalArgumentException
- if low
> high
.public Interval(double low, double high, boolean lopen, boolean ropen)
low
- the left endpointhigh
- the right endpointlopen
- indicates if the left endpoint is excluded (true in this case)ropen
- indicates if the right endpoint is excluded (true in this case)
java.lang.IllegalArgumentException
- if low
> high
.public Interval(double low, double high, T value)
Note that value
cannot be null if you want use this
interval
as a value storage. If it is null some estimators
could not work and generate exceptions.
low
- the left endpointhigh
- the right endpointvalue
- the value stored in this interval
java.lang.IllegalArgumentException
- if low
> high
.public Interval(double low, double high)
low
- the left endpointhigh
- the right endpoint
java.lang.IllegalArgumentException
- if low
> high
.| Method Detail |
|---|
public int compareTo(Interval interval)
Any two intervals i and i' satisfy the interval
trichotomy
; that is, exactly one of the following three properties
holds:
Note that if two intervals are equal (i.low = i'.low
and
i.high = i'.high
), they overlap as well. But if they simply
overlap (for instance i.low < i'.low
and i.high >
i'.high
) they aren't equal. Remember that if two intervals are equal,
they have got the same bounds excluded or included.
compareTo
in interface java.lang.Comparable<Interval>
interval
- the interval to be compared
java.lang.NullPointerException
- if interval
is null.public double getLow()
public double getHigh()
public boolean isLowExcluded()
true
if the left endpoint is excluded,
false
otherwise.public boolean isHighExcluded()
true
if the right endpoint is excluded,
false
otherwise.public T getValue()
public boolean equals(java.lang.Object obj)
Note that two intervals are equal if i.low = i'.low
and
i.high = i'.high
and they have got the bounds excluded/included.
equals
in class java.lang.Object
obj
- object to which this interval is to be compared
true
if and only if the specified Object
is a
Interval
whose low and high are equal to this
Interval's
.compareTo(org.gephi.data.attributes.type.Interval)
,
hashCode()
public int hashCode()
hashCode
in class java.lang.Object
public java.lang.String toString(boolean timesAsDoubles)
timesAsDoubles
- indicates if times should be shown as doubles or dates
public java.lang.String toString()
[low, high, value]
(low, high, value]
[low, high, value)
(low, high, value)
Times are always shown as doubles
toString
in class java.lang.Object
|
Gephi Toolkit Javadoc | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


A B C E G I J L M O P R S T
All Classes All Packages
All Classes All Packages
All Classes All Packages
S
- Senior - Class in assignment.core
- Senior(String, char, Date, Date, int) - Constructor for class assignment.core.Senior
-
Construct a Senior object with specified name , gender, date of birth values ID number auto increments and set to that value
- Senior(Date, int) - Constructor for class assignment.core.Senior
-
Construct a default Senior object
- setBookingDate(Date) - Method in class assignment.core.Booking
-
Sets date of booking date
- setBookingOrder(Booking) - Method in class assignment.core.InRestrOrder
-
set Booking order with given booking
- setBookings(ArrayList<Booking>) - Method in class assignment.core.Customer
- setCreditDetails(String) - Method in class assignment.core.Customer
- setCustomerList(ArrayList<Customer>) - Method in class assignment.core.PopulateData
-
Set customer list
- setDateOfBirth(Date) - Method in class assignment.support.Person
-
Set Date of Birth of staff
- setDeliveredBy(Junior) - Method in class assignment.core.OnlineOrder
-
sets deliveredBy with given Junior
- setExtraNotes(String) - Method in class assignment.support.Order
-
Set a new extra notes
- setGender(char) - Method in class assignment.support.Person
-
Set a new gender
- setGrossSalaryYearly(int) - Method in class assignment.core.Senior
-
Set gross salary of Senior
- setName(String) - Method in class assignment.support.Person
-
Set a new name
- setOrderDate(Date) - Method in class assignment.support.Order
-
Set a new order date
- setOrderDetails(String) - Method in class assignment.support.Order
-
Set a new details
- setOrders(ArrayList<Order>) - Method in class assignment.core.Customer
- setPaymentType(String) - Method in class assignment.core.OnlineOrder
-
Sets payment type with given paymentType
- setRegistrationDate(Date) - Method in class assignment.core.Customer
- setResponsibleFrom(ArrayList<Junior>) - Method in class assignment.core.Senior
-
Set resposible from Senior
- setRestrOrder(ArrayList<InRestrOrder>) - Method in class assignment.core.Booking
-
sets RestOrder wtih given InRestOrder arraylist
- setStaffList(ArrayList<Staff>) - Method in class assignment.core.PopulateData
-
Set Staff list
- setStartDate(Date) - Method in class assignment.core.Staff
-
set start date with given start date
- setTableNumber(int) - Method in class assignment.core.InRestrOrder
-
set table number with given table number
- Staff - Class in assignment.core
- Staff(String, char, Date, Date) - Constructor for class assignment.core.Staff
-
Construct a default Staff object with given values
- Staff(Date) - Constructor for class assignment.core.Staff
-
Construct a default Staff object
All Classes All Packages


{% extends 'nehlwebsite/base.html' %} {% load static %} {% block css %} {% endblock %} {% block content %}
The North East Hockey League is a (field) hockey league based in the north east of England.
The North East Hockey League exists to promote outdoor hockey in Durham & Northumberland. It is currently divided into 4 divisions, with Division 4 acting as a more relaxed, Conference-style league.
In 1956, Ashmores Hockey Club (formed by employees of Davey Ashmores Ltd of Stockton) wrote to local clubs asking for support for a proposed league in County Durham. At the time, all clubs were playing matches as friendlies, though teams tended to play the same clubs on the same weekends year-to-year. At the 1971 Durham County AGM, Sunderland, one of the stronger clubs in the area, resurrected the idea, and proposed that Northumberland be included.
The first season was 1972/73 and consisted of the first XIs of 18 clubs. Clubs were expected to play 60% of other clubs to determine league positions, with league positions based on a win precentage. Sunderland was the inaugural winner with an 88% success rate, followed by Furness on 78%. The first committee was chaired by Ken Burton assisted by Jim Rutherford as secretary, with Eric Ryan becoming the league's first elected Secretary.
From those early league matches it was obvious that impartial umpiring was badly needed. Eric Ryan was instrumental in the setting up what is now the Northumberland & Durham Hockey Umpires Association (NDHUA) to provide neutral umpires for league games.
In 1973 the number of clubs increased to 21 a separate league for second XIs was started, also with 21 teams. 1975 saw the leagues split into two divisions in each league, with 12 teams in each division. After the formation of the Northern Premier League the winner was promoted automatically into it, which increased the interest and standard of play in the North East.
In 1991 the league became an open integrated arrangement, with the first XI league becoming Divisions 1 and 2, and the second XI league Divisions 3 and 4, and league hockey being opened up to any club side wanting to participate. 1998 saw the Conference division appear for the first time, for lower sides wishing to participate within a more relaxed format. In 2007 this became the Club Development League.
In 2019 England Hockey reorganised the national leagues, increasing the number of teams from 40 to 60. The subsequent reorganization led to the NEHL Premier League (what was the first XI league, then Division 1) becoming Division 3 North East of the North League.


Andrew Donato Portfolio
about me
blog
projects
reach me
My interests and hobbies
My resume
Phase 0
Phase 1
DBC projects
Personal projects
Contact Information
Social Media


Vacation request
event
From
event
To
Annual leave
Special leave
Compensatory time off
Type
Kommentar
Comment
Ok
Placeholder


MHS Global
MHS GLOBAL was created to contribute to the major challenge currently faced by companies that have packaging as part of its value chain: inovation, sustentability and cost reduction.
MHS GLOBAL offers engineering consulting services in the areas of packaging materials and machinery to meet customers’ needs in the whole packaging value chain.
Mission
Contribute to increase the competitive advantage of companies where packaging has a strategic position in the results, acting on every link of the value chain involved.
Who we are
|


|
gLogger Mini
1.6
A simple and small GPS logging device
|
Library for accessing a NoFS (NoFileSystem) on the memory card. More...
Go to the source code of this file.
Defines | |
| #define | NOFS_BUFFER_SIZE SDMMC_SECTOR_SIZE |
| Size of the NoFS-Buffer (equals the block size on a memory card) | |
| #define | NOFS_HEADER "k621.de" |
| The header which identifies a valid NoFS memory card. | |
| #define | NOFS_HEADER_LENGTH 7 |
| The length of NOFS_HEADER. | |
| #define | NOFS_TERMINAL ETX |
| The byte which is written to indicate the end of a NoFS partition. | |
Functions | |
| void | nofs_init () |
| Initializes the NoFS. Locks the processor in case of error. | |
| void | nofs_writeString (char *pString) |
| Appends a character string to the present data. | |
| void | nofs_flush () |
| Writes the current data buffer onto the memory card. |
Library for accessing a NoFS (NoFileSystem) on the memory card.
Some notes regarding the NoFS:
| #define NOFS_BUFFER_SIZE SDMMC_SECTOR_SIZE |
Size of the NoFS-Buffer (equals the block size on a memory card)
| #define NOFS_HEADER "k621.de" |
The header which identifies a valid NoFS memory card.
| #define NOFS_HEADER_LENGTH 7 |
The length of NOFS_HEADER.
| #define NOFS_TERMINAL ETX |
The byte which is written to indicate the end of a NoFS partition.
| void nofs_flush | ( | ) |
Writes the current data buffer onto the memory card.
The buffer gets written to the sector specified by the global field fCurrentSector. Additionally, there will be written a NOFS_TERMINAL into the respective next sector (i.e. fCurrentSector + 1). This ensures that the scanning algorithm during initialization won't fail to find a terminal symbol.
| void nofs_init | ( | ) |
Initializes the NoFS. Locks the processor in case of error.
| void nofs_writeString | ( | char * | pString | ) |
Appends a character string to the present data.
| pString | A null-terminated character string which should be written |


Id: 335
Name: Steve
Status: Alive
Species: Human
Type:
Gender: Male
OriginName: Earth (Replacement Dimension)
OriginUrl: https://rickandmortyapi.com/api/location/20
LocationName: Earth (Replacement Dimension)
LocationUrl: https://rickandmortyapi.com/api/location/20
Image: https://rickandmortyapi.com/api/character/avatar/335.jpeg
Episode: ['https://rickandmortyapi.com/api/episode/31']
Url: https://rickandmortyapi.com/api/character/335
Created: 2018-01-10T16:39:34.837Z


15%
off
categories
archive
latest-blogs
February 3, 2015 in Personal life
February 3, 2015 in Personal life
February 3, 2015 in Personal life
we accept
15%OFF
your first order
our advantages
paper feauters
discounts
for the
1st order
for more than
20 pages
for more than
50 pages
for more than
100 pages


multi_index_container
Academic movitations aside, there is a practical interest in emulating standard
associative containers by means of multi_index_container
, namely to take
advantage of extended functionalities provided by multi_index_container
for
lookup, range querying and updating.
In order to emulate a std::set
one can follow the substitution
rule:
std::set<Key,Compare,Allocator> -> multi_index_container< Key, indexed_by<ordered_unique<identity<Key>,Compare> >, Allocator >
In the default case where Compare=std::less<Key>
and
Allocator=std::allocator<Key>
, the substitution rule is
simplified as
std::set<Key> -> multi_index_container<Key>
The substitution of multi_index_container
for std::set
keeps
the whole set of functionality provided by std::set
, so in
principle it is a drop-in replacement needing no further adjustments.
std::multiset
can be emulated in a similar manner, according to the
following rule:
std::multiset<Key,Compare,Allocator> -> multi_index_container< Key, indexed_by<ordered_non_unique<identity<Key>,Compare> >, Allocator >
When default values are taken into consideration, the rule takes the form
std::multiset<Key> -> multi_index_container< Key, indexed_by<ordered_non_unique<identity<Key> > > >
The emulation of std::multiset
s with multi_index_container
results in a slight difference with respect to the interface offered: the member
function insert(const value_type&)
does not return an
iterator
as in std::multiset
s, but rather a
std::pair<iterator,bool>
in the spirit of std::set
s.
In this particular case, however, the bool
member of the returned
pair is always true
.
The case of std::map
s and std::multimap
s does not lend
itself to such a direct emulation by means of multi_index_container
. The main
problem lies in the fact that elements of a multi_index_container
are treated
as constant, while the std::map
and std::multimap
handle
objects of type std::pair<const Key,T>
, thus allowing for free
modification of the value part. To overcome this difficulty we need to create an ad
hoc pair class:
template <typename T1,typename T2> struct mutable_pair { typedef T1 first_type; typedef T2 second_type; mutable_pair():first(T1()),second(T2()){} mutable_pair(const T1& f,const T2& s):first(f),second(s){} mutable_pair(const std::pair<T1,T2>& p):first(p.first),second(p.second){} T1 first; mutable T2 second; };
and so the substitution rules are:
std::map<Key,T,Compare,Allocator> -> multi_index_container< Element, indexed_by< ordered_unique<member<Element,Key,&Element::first>,Compare> >, typename Allocator::template rebind<Element>::other > std::multimap<Key,T,Compare,Allocator> -> multi_index_container< Element, indexed_by< ordered_non_unique<member<Element,Key,&Element::first>,Compare> >, typename Allocator::template rebind<Element>::other > (with Element=mutable_pair<Key,T>)
If default values are considered, the rules take the form:
std::map<Key,T> -> multi_index_container< Element, indexed_by<ordered_unique<member<Element,Key,&Element::first> > > > std::multimap<Key,T> -> multi_index_container< Element, indexed_by<ordered_non_unique<member<Element,Key,&Element::first> > > > (with Element=mutable_pair<Key,T>)
Unlike as with standard sets, the interface of these multi_index_container
-emulated
maps does not exactly conform to that of std::map
s and
std::multimap
s. The most obvious difference is the lack of
operator []
, either in read or write mode; this, however, can be
emulated with appropriate use of find
and insert
.
These emulations of standard associative containers with multi_index_container
are comparable to the original constructs in terms of space and time efficiency.
See the performance section for further details.
std::list
Unlike the case of associative containers, emulating std::list
in Boost.MultiIndex does not add any significant functionality, so the following
is presented merely for completeness sake.
Much as with standard maps, the main difficulty to overcome when emulating
std::list
derives from the constant nature of elements of a
multi_index_container
. Again, some sort of adaption class is needed, like
for instance the following:
template <typename T> struct mutable_value { mutable_value(const T& t):t(t){} operator T&()const{return t;} private: mutable T t; };
which allows us to use the substitution rule:
std::list<T,Allocator> -> multi_index_container< Element, indexed_by<sequenced<> >, typename Allocator::template rebind<Element>::other > (with Element=mutable_value<T>)
or, if the default value Allocator=std::allocator<T>
is used:
std::list<T> -> multi_index_container<mutable_value<T>,indexed_by<sequenced<> > >
multi_index_container
Boost.MultiIndex provides a number of facilities intended to allow the analysis and
synthesis of multi_index_container
instantiations by
MPL metaprograms.
Given a multi_index_container
instantiation, the following nested types are
provided for compile-time inspection of the various types occurring in the
definition of the multi_index_container
:
index_specifier_type_list
,index_type_list
,iterator_type_list
,const_iterator_type_list
.multi_index_container
: for instance, the n
-th
element of iterator_type_list
is the same as
nth_index<n>::type::iterator
.
A subtle but important distinction exists between
index_specifier_type_list
and index_type_list
:
the former typelist holds the index specifiers
with which the multi_index_container
instantiation was defined,
while the latter gives access to the actual implementation classes
corresponding to each specifier. An example will help to clarify
this distinction. Given the instantiation:
typedef multi_index_container< int, indexed_by< ordered_unique<identity<int> >, sequenced<> > > indexed_t;
indexed_t::index_specifier_type_list
is a type list with
elements
ordered_unique<identity<int> > sequenced<>
while indexed_t::index_type_list
holds the types
multi_index_container::nth_type<0>::type multi_index_container::nth_type<1>::type
so the typelists are radically different. Check the reference for the exact MPL sequence concepts modeled by these type lists.
Although typically indices are specified by means of the
indexed_by
construct, actually any MPL sequence of
index specifiers can be provided instead:
typedef mpl::vector<ordered_unique<identity<int> >,sequenced<> > index_list_t; typedef multi_index_container< int, index_list_t > indexed_t;
This possibility enables the synthesis of instantiations of
multi_index_container
through MPL metaprograms, as the following
example shows:
// original multi_index_container instantiation typedef multi_index_container< int, indexed_by< ordered_unique<identity<int> > > > indexed_t1; // we take its index list and add an index typedef boost::mpl::push_front< indexed_t1::index_specifier_type_list, sequenced<> >::type index_list_t; // augmented multi_index_container typedef multi_index_container< int, index_list_t > indexed_t2;
Revised November 7th 2008
© Copyright 2003-2008 Joaquín M López Muñoz. Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)


person
Not logged in
Talk
Contributions
Create account
Login
Main page
Talk
Read
View source
View history
WIKI-KNOW
Knowledge at hand
Main page
Contents
Current events
Random article
About Wiki-know
Contact us
Donate
Contribute
Help
Community portal
Recent changes
Upload files
Tools
What links here
Related changes
Special pages
Permanent link
Page information
Wiki-data item


Write.Speak.Code. is dedicated to providing a harassment-free conference experience for everyone, regardless of gender, sexual orientation, disability, physical appearance, body size, race, or religion. We do not tolerate harassment of conference participants in any form. Sexual language and imagery is not appropriate for any conference venue, including talks. Conference participants violating these rules may be sanctioned or expelled from the conference without a refund at the discretion of the conference organizers.  Participants asked to stop any harassing behavior are expected to comply immediately. If a participant engages in harassing behavior, the conference organizers may take any action they deem appropriate, including warning the offender or expulsion from the conference with no refund. If you are being harassed, notice that someone else is being harassed, or have any other concerns, please contact a member of conference staff immediately. Conference staff will be happy to help participants contact hotel/venue security or local law enforcement, provide escorts, or otherwise assist those experiencing harassment to feel safe for the duration of the conference. We value your attendance.
Conference organizers can be contacted by email at<EMAIL_ADDRESS>If the matter is especially urgent, please call/contact any of these individuals:
- Rachel Ober:<PHONE_NUMBER>
- Rebecca Miller-Webster:<PHONE_NUMBER>
Pace University Director of Safety and Security
Vincent Beatty
(914) 773-3700
<EMAIL_ADDRESS>We expect participants to follow these rules at all conference venues and conference-related social events.
Staff Procedure for incident handling
Warnings
Any member of conference staff can issue a verbal warning to a participant
that their behavior violates the conference's anti-harassment policy.
Warnings should be reported to<EMAIL_ADDRESS>as soon as practical.
The report should include:
- Identifying information (name/badge number) of the participant
- The time you issued the warning
- The behavior that was in violation
- The approximate time of the behavior (if different than the time of warning)
- The circumstances surrounding the incident
- Your identity
- Other people involved in the incident
Presentations
Presentations or similar events should not be stopped for one-time gaffes or
minor problems, although a member of conference staff should speak to the
presenter afterward. However, staff should take immediate action to politely
and calmly stop any presentation or event that repeatedly or seriously
violates the anti-harassment policy. For example, simply say "I'm sorry,
this presentation cannot be continued at the present time" with no further
explanation.
Taking Reports
When taking a report from someone experiencing harassment you should record
what they say and reassure them they are being taken seriously, but avoid
making specific promises about what actions the organizers will take. Ask
for any other information if the reporter has not volunteered it (such as
time, place) but do not pressure them to provide it if they are reluctant.
Even if the report lacks important details such as the identity of the person
taking the harassing actions, it should still be recorded and passed along
to the appropriate staff member(s). If the reporter desires it, arrange for
an escort by conference staff or a trusted person, contact a friend, and
contact local law enforcement. Do not pressure the reporter to take any
action if they do not want to do it. Respect the reporter's privacy by not
sharing unnecessary details with others, especially individuals who were not
involved with the situation or non-staff members.
The report should include:
- Identifying information (name/badge number) of the participant
- The time you issued the warning
- The behavior that was in violation
- The approximate time of the behavior (if different than the time of warning)
- The circumstances surrounding the incident
- Your identity
- Other people involved in the incident
Expulsion
A participant may be expelled by the decision of any of the above listed
entities for whatever reasons they deem sufficient. However, here are some
general guidelines for when a participant should be expelled:
- A third offense resulting in a warning from staff
- Continuing to harass after any "No" or "Stop" instruction
- A pattern of harassing behavior, with or without warnings
- A single serious offense (e.g., punching or groping someone)
- A single obviously intentional offense (e.g., taking up-skirt photos)
Hotel/venue security and local authorities should be contacted when appropriate.
Pace University Director of Safety and Security
Vincent Beatty
(914) 773-3700
<EMAIL_ADDRESS>Public Statements
As a general rule, conference staff should not make any public statements
about the behavior of individual people during or after the conference.
In general, consult with other staff members when possible but act when necessary.
This anti-harassment policy is based on the example policy from the Geek Feminism wiki, created by the Ada Initiative and other volunteers.


Energy and materials help S&P/TSX composite trade higher, U.S. stocks also up
by The Canadian Press, StaffTORONTO -- Canada's main stock index continued its journey into record territory in midmorning trading as gains in the key energy and materials sectors helped offset losses in the health-care sector that includes the big names in the cannabis business.
The S&P/TSX composite index was up 54.49 points at 17,026.67.
In New York, the Dow Jones industrial average was up 143.66 points at 27,925.62. The S&P 500 index was up 17.03 points at 3,113.66, while the Nasdaq composite was up 55.44 points at 8,534.38.
The Canadian dollar traded for 75.62 cents US compared with an average of 75.43 cents US on Thursday.
The December crude contract was up 48 cents at US$57.25 per barrel and the December natural gas contract was unchanged at US$2.65 per mmBTU.
The December gold contract was down US$5.50 at US$1,467.90 an ounce and the December copper contract was up 1.5 cents at US$2.64 a pound.
This report by The Canadian Press was first published Nov. 15, 2019


| Event Type | Date | Description | Course Materials |
|---|---|---|---|
| Lecture | Tuesday, Jan. 23 | Intro to Deep Learning, historical context. |
[slides] [python/numpy tutorial] [jupyter tutorial] |
| Lecture | Thursday, Jan. 25 | Image classification and the data-driven approach k-nearest neighbor Linear classification |
[slides] [image classification notes] [linear classification notes] |
| Optional Discussion | Friday, Jan. 26 | No discussion section | |
| Lecture | Tuesday, Jan. 30 | Loss functions |
[slides] |
| Lecture | Thursday, Feb. 1 | Optimization: Stochastic Gradient Descent and Backpropagation |
[slides] [optimization notes] |
| Optional Discussion | Friday, Feb. 2 | Slicing and broadcasting in Python | |
| Lecture | Tuesday, Feb. 6 | Backpropagation & Neural Networks I |
[slides] [backprop notes] [Efficient BackProp] (optional) related: [1], [2], [3] (optional) |
| Lecture | Thursday, Feb. 8 |
Neural Networks II Higher-level representations, image features Vector, Matrix, and Tensor Derivatives |
[slides] handout 1: Vector, Matrix, and Tensor Derivatives handout 2: Derivatives, Backpropagation, and Vectorization Deep Learning [Nature] (optional) |
| Optional Discussion | Friday, Feb. 9 | Reviewing the chain rule, applying the chain rule to vectors | |
| Lecture | Tuesday, Feb. 13 | Neural Networks III |
[slides] tips/tricks: [1], [2] (optional) |
| Lecture | Thursday, Feb. 15 |
Training Neural Networks I: Activation Functions |
[slides] [Neural Nets notes 1] |
| Optional Discussion | Friday, Feb. 16 | No discussion section | |
| Lecture | Tuesday, Feb. 20 |
Training Neural Networks II: weight initialization, batch normalization |
[slides] [Neural Nets notes 2] [Batch Norm] Copula Normalization (optional) |
| Lecture | Thursday, Feb. 22 |
Training Neural Network III: babysitting the learning process, hyperparameter optimization |
[slides] [Bengio 2012] (optional) |
| Optional Discussion | Friday, Feb. 23 | A closer look at the maths inside batch normalization | |
| Lecture | Tuesday, Feb. 27 |
Training Neural Network III: babysitting the learning process, hyperparameter optimization Training Neural Network IV: model ensembles, dropout |
[slides] [slides] [Neural Nets notes 3] LeNet (optional) |
| Lecture | Thursday, Mar. 1 |
Training Neural Network V: parameter updates Convolutional Neural Networks: convolution layer, pooling layer, fully connected layer |
[slides] [slides] |
| Optional Discussion | Friday, Mar. 2 | Convolutional neural networks | [slides] |
| Lecture | Tuesday, Mar. 6 |
Convolutional Neural Networks: (cont.) convolution layer, pooling layer, fully connected layer |
[slides] |
| Lecture | Thursday, Mar. 8 |
ConvNets for spatial localization, Object detection Final project information |
[slides] [slides] [Stanford cs231n project reports] [2016 Fall project reports] |
| Optional Discussion | Friday, Mar. 9 | No discussion section | |
| No class | Tuesday, Mar. 13 | Spring break | |
| No class | Thursday, Mar. 15 | Spring break | |
| No discussion | Friday, Mar. 16 | Spring break | |
| Lecture | Tuesday, Mar. 20 | ConvNets for spatial localization, Object detection |
[slides] |
| Lecture | Thursday, Mar. 22 | ConvNets for spatial localization, Object detection (cont.) |
[slides] FCN |
| Optional Discussion | Friday, Mar. 23 | Midterm review | |
| Midterm | Tuesday, Mar. 27 | In-class midterm | |
| Lecture | Thursday, Mar. 29 | ConvNets for spatial localization, Object detection (cont.) | |
| Optional Discussion | Friday, Mar. 30 | No discussion section | |
| Lecture | Tuesday, Apr. 3 |
Understanding and visualizing Convolutional Neural Networks Backprop into image: Visualizations, deep dream |
[slides] [visualization notes] |
| Lecture | Thursday, Apr. 5 |
Understanding and visualizing Convolutional Neural Networks (cont.) Backprop into image: Visualizations, deep dream (cont.) |
[slides] [visualization notes] |
| Optional Discussion | Friday, Apr. 6 | Go through midterm problems | |
| Lecture | Tuesday, Apr. 10 |
Artistic style transfer Adversarial fooling examples Recurrent Neural Networks (RNN) |
[slides] DL book RNN chapter (optional) min-char-rnn, char-rnn, neuraltalk2 |
| Lecture | Thurday, Apr. 12 |
Recurrent Neural Networks (RNN) (cont.) Long Short Term Memory (LSTM) |
[slides] (cont.) The Unreasonable Effectiveness of RNN (optional) Understanding LSTM Networks (optional) |
| Optional Discussion | Friday, Apr. 13 | Review of RMM, LSTM, Adversarial examples, Visualization | |
| No class | Tuesday, Apr. 17 | Monday class schedule will be followed (Patriot's Day: Monday, Apr. 16) | |
| Lecture | Thursday, Apr. 19 | Training ConvNets in practice |
[slides] |
| Optional Discussion | Friday, Apr. 20 | No discussion section | |
| Lecture | Tuesday, Apr. 24 | TBD | |
| Lecture | Thursday, Apr. 26 | TBD | |
| Optional Discussion | Friday, Apr. 27 | No discussion section | |
| Presentation | Tuesday, May 1 |
Poster presentations Two sessions, both at CS150/151: 8-10am (regular time) 12-2:30pm |


--- layout: post status: publish published: true title: 'Podcast Episode #2 - NL Central Breakdown' author: display_name: Corey Fineran login: Corey email<EMAIL_ADDRESS>url: '' author_login: Corey author_email<EMAIL_ADDRESS>wordpress_id: 383 wordpress_url: http://ivyenvy.com/?p=383 date: '2009-03-23 21:22:06 +0000' date_gmt: '2009-03-24 03:22:06 +0000' categories: - Podcast tags: - NL Central - Podcast comments: - id: 228 author: Ivy Envy » NL Central. The best in baseball? author_email: '' author_url: http://ivyenvy.com/?p=849 date: '2009-05-15 15:17:31 +0000' date_gmt: '2009-05-15 21:17:31 +0000' content: "[...] podcast #2 we break down the NL Central and in this post some of us make our preseason predictions. The rest [...]" ---
Corey, Andy, Kurt and Paul get together to break-down the NL Central. Paul also talks about his recent trip to Mesa for Spring Training.
The improved sound quality is reason enough to listen to this episode. Thanks to Jason for stepping in and taking over the recording aspect.


Specify default Allure report issues tracker pattern.
In this pattern, the %s placeholder will be replaced with the issue key from the annotation.
Default value (%s) is not taken into account and can be overridden (e.g. with JVM argument -Dallure.issues.tracker.pattern=%s).


1922 - Born in Arima, Trinidad and Tobago as Aldwyn Roberts.
1936 - Became an orphan at the age of 14. Dropped out of school and became a full-time musician.
1938-42 - Won the Arima borough council's calypso competition five times.
1943 - Moved to Port of Spain, Trinidad and Tobago. Joined the Roving Brigade. Was given the name, Lord Kitchener, by fellow calypsonian, Growling Tiger. Was known familarly as, "Kitch".
1946 - Won his very first official Road March title with the catchy calypso, "Jump in the Line"
1947-8 - Toured Jamaica for six months with Lord Beginner (Egbert Moore) and Lord Woodbine (Harold Phillips).
1948 - Took passage on the Empire Windrush to England. Performed the specially-written song "London Is the Place for Me" on arrival.
1950-9 - Helped calypso achieve international success by building a large following in the United Kingdom, opening a nightclub in Manchester, and performing in the United Kingdom and the United States of America.
1962 - Returned to Trinidad. Began to dominate local calypso competitions with another influential calypsonian, the Mighty Sparrow.
1963-76 - Won the Road March title 10 times.
1975 - Won his only Calypso King title with "Tribute to Spree Simon".
1977 - Saw the potential of the soca phenomena of the late 70's. Recorded his most commercially successful song, "Sugar Bum Bum". Continued recording and producing albums, while nuturing younger and upcoming talent.
1999 - Delivered his final album, "Vintage Kitch". Retired after being diagnosed with bone marrow cancer.
2000 - Died at the age of 77 in Port of Spain, Trinidad and Tobago. Buried in Arima, Trinidad and Tobago.


public enum OWLRDFVocabulary extends java.lang.Enum<OWLRDFVocabulary>
| Enum Constant and Description |
|---|
OWL_ALL_DIFFERENT
http://www.w3.org/2002/07/owl#AllDifferent
|
OWL_ALL_DISJOINT_CLASSES
http://www.w3.org/2002/07/owl#AllDisjointClasses
|
OWL_ALL_DISJOINT_PROPERTIES
http://www.w3.org/2002/07/owl#AllDisjointProperties
|
OWL_ALL_VALUES_FROM
http://www.w3.org/2002/07/owl#allValuesFrom
|
OWL_ANNOTATED_PROPERTY
http://www.w3.org/2002/07/owl#annotatedProperty
|
OWL_ANNOTATED_SOURCE
http://www.w3.org/2002/07/owl#annotatedSource
|
OWL_ANNOTATED_TARGET
http://www.w3.org/2002/07/owl#annotatedTarget
|
OWL_ANNOTATION
http://www.w3.org/2002/07/owl#Annotation
|
OWL_ANNOTATION_PROPERTY
http://www.w3.org/2002/07/owl#AnnotationProperty
|
OWL_ANTI_SYMMETRIC_PROPERTY
Deprecated.
|
OWL_ASSERTION_PROPERTY
http://www.w3.org/2002/07/owl#assertionProperty
|
OWL_ASYMMETRIC_PROPERTY
http://www.w3.org/2002/07/owl#AsymmetricProperty
|
OWL_AXIOM
http://www.w3.org/2002/07/owl#Axiom
|
OWL_BACKWARD_COMPATIBLE_WITH
http://www.w3.org/2002/07/owl#backwardCompatibleWith
|
OWL_BOTTOM_DATA_PROPERTY
http://www.w3.org/2002/07/owl#bottomDataProperty
|
OWL_BOTTOM_OBJECT_PROPERTY
http://www.w3.org/2002/07/owl#bottomObjectProperty
|
OWL_CARDINALITY
http://www.w3.org/2002/07/owl#cardinality
|
OWL_CLASS
http://www.w3.org/2002/07/owl#Class
|
OWL_COMPLEMENT_OF
http://www.w3.org/2002/07/owl#complementOf
|
OWL_DATA_PROPERTY
http://www.w3.org/2002/07/owl#DatatypeProperty
|
OWL_DATA_PROPERTY_DOMAIN
Deprecated.
|
OWL_DATA_PROPERTY_RANGE
Deprecated.
|
OWL_DATA_RANGE
http://www.w3.org/2002/07/owl#DataRange
|
OWL_DATA_RESTRICTION
Deprecated.
|
OWL_DATATYPE
http://www.w3.org/2002/07/owl#Datatype
|
OWL_DATATYPE_COMPLEMENT_OF
http://www.w3.org/2002/07/owl#datatypeComplementOf
|
OWL_DECLARED_AS
Deprecated.
|
OWL_DEPRECATED
http://www.w3.org/2002/07/owl#deprecated
|
OWL_DEPRECATED_CLASS
http://www.w3.org/2002/07/owl#DeprecatedClass
|
OWL_DEPRECATED_PROPERTY
http://www.w3.org/2002/07/owl#DeprecatedProperty
|
OWL_DIFFERENT_FROM
http://www.w3.org/2002/07/owl#differentFrom
|
OWL_DISJOINT_DATA_PROPERTIES
Deprecated.
|
OWL_DISJOINT_OBJECT_PROPERTIES
Deprecated.
|
OWL_DISJOINT_UNION_OF
http://www.w3.org/2002/07/owl#disjointUnionOf
|
OWL_DISJOINT_WITH
http://www.w3.org/2002/07/owl#disjointWith
|
OWL_DISTINCT_MEMBERS
http://www.w3.org/2002/07/owl#distinctMembers
|
OWL_EQUIVALENT_CLASS
http://www.w3.org/2002/07/owl#equivalentClass
|
OWL_EQUIVALENT_DATA_PROPERTIES
Deprecated.
|
OWL_EQUIVALENT_OBJECT_PROPERTIES
Deprecated.
|
OWL_EQUIVALENT_PROPERTY
http://www.w3.org/2002/07/owl#equivalentProperty
|
OWL_FUNCTIONAL_DATA_PROPERTY
Deprecated.
|
OWL_FUNCTIONAL_OBJECT_PROPERTY
Deprecated.
|
OWL_FUNCTIONAL_PROPERTY
http://www.w3.org/2002/07/owl#FunctionalProperty
|
OWL_HAS_KEY
http://www.w3.org/2002/07/owl#hasKey
|
OWL_HAS_SELF
http://www.w3.org/2002/07/owl#hasSelf
|
OWL_HAS_VALUE
http://www.w3.org/2002/07/owl#hasValue
|
OWL_IMPORTS
http://www.w3.org/2002/07/owl#imports
|
OWL_INCOMPATIBLE_WITH
http://www.w3.org/2002/07/owl#incompatibleWith
|
OWL_INDIVIDUAL
http://www.w3.org/2002/07/owl#Individual
|
OWL_INTERSECTION_OF
http://www.w3.org/2002/07/owl#intersectionOf
|
OWL_INVERSE_FUNCTIONAL_PROPERTY
http://www.w3.org/2002/07/owl#InverseFunctionalProperty
|
OWL_INVERSE_OBJECT_PROPERTY_EXPRESSION
http://www.w3.org/2002/07/owl#inverseObjectPropertyExpression
|
OWL_INVERSE_OF
http://www.w3.org/2002/07/owl#inverseOf
|
OWL_IRREFLEXIVE_PROPERTY
http://www.w3.org/2002/07/owl#IrreflexiveProperty
|
OWL_MAX_CARDINALITY
http://www.w3.org/2002/07/owl#maxCardinality
|
OWL_MAX_QUALIFIED_CARDINALITY
http://www.w3.org/2002/07/owl#maxQualifiedCardinality
|
OWL_MEMBERS
http://www.w3.org/2002/07/owl#members
|
OWL_MIN_CARDINALITY
http://www.w3.org/2002/07/owl#minCardinality
|
OWL_MIN_QUALIFIED_CARDINALITY
http://www.w3.org/2002/07/owl#minQualifiedCardinality
|
OWL_NAMED_INDIVIDUAL
http://www.w3.org/2002/07/owl#NamedIndividual
|
OWL_NEGATIVE_DATA_PROPERTY_ASSERTION
Deprecated.
|
OWL_NEGATIVE_OBJECT_PROPERTY_ASSERTION
Deprecated.
|
OWL_NEGATIVE_PROPERTY_ASSERTION
http://www.w3.org/2002/07/owl#NegativePropertyAssertion
|
OWL_NOTHING
http://www.w3.org/2002/07/owl#Nothing
|
OWL_OBJECT
Deprecated.
|
OWL_OBJECT_PROPERTY
http://www.w3.org/2002/07/owl#ObjectProperty
|
OWL_OBJECT_PROPERTY_DOMAIN
Deprecated.
|
OWL_OBJECT_PROPERTY_RANGE
Deprecated.
|
OWL_OBJECT_RESTRICTION
Deprecated.
|
OWL_ON_CLASS
http://www.w3.org/2002/07/owl#onClass
|
OWL_ON_DATA_RANGE
http://www.w3.org/2002/07/owl#onDataRange
|
OWL_ON_DATA_TYPE
http://www.w3.org/2002/07/owl#onDatatype
|
OWL_ON_PROPERTY
http://www.w3.org/2002/07/owl#onProperty
|
OWL_ONE_OF
http://www.w3.org/2002/07/owl#oneOf
|
OWL_ONTOLOGY
http://www.w3.org/2002/07/owl#Ontology
|
OWL_ONTOLOGY_PROPERTY
Deprecated.
|
OWL_PREDICATE
Deprecated.
|
OWL_PRIOR_VERSION
http://www.w3.org/2002/07/owl#priorVersion
|
OWL_PROPERTY_CHAIN
Deprecated.
|
OWL_PROPERTY_CHAIN_AXIOM
http://www.w3.org/2002/07/owl#propertyChainAxiom
|
OWL_PROPERTY_DISJOINT_WITH
http://www.w3.org/2002/07/owl#propertyDisjointWith
|
OWL_QUALIFIED_CARDINALITY
http://www.w3.org/2002/07/owl#qualifiedCardinality
|
OWL_REFLEXIVE_PROPERTY
http://www.w3.org/2002/07/owl#ReflexiveProperty
|
OWL_RESTRICTION
http://www.w3.org/2002/07/owl#Restriction
|
OWL_SAME_AS
http://www.w3.org/2002/07/owl#sameAs
|
OWL_SELF_RESTRICTION
Deprecated.
|
OWL_SOME_VALUES_FROM
http://www.w3.org/2002/07/owl#someValuesFrom
|
OWL_SOURCE_INDIVIDUAL
http://www.w3.org/2002/07/owl#sourceIndividual
|
OWL_SUB_DATA_PROPERTY_OF
Deprecated.
|
OWL_SUB_OBJECT_PROPERTY_OF
Deprecated.
|
OWL_SUBJECT
Deprecated.
|
OWL_SYMMETRIC_PROPERTY
http://www.w3.org/2002/07/owl#SymmetricProperty
|
OWL_TARGET_INDIVIDUAL
http://www.w3.org/2002/07/owl#targetIndividual
|
OWL_TARGET_VALUE
http://www.w3.org/2002/07/owl#targetValue
|
OWL_THING
http://www.w3.org/2002/07/owl#Thing
|
OWL_TOP_DATA_PROPERTY
http://www.w3.org/2002/07/owl#topDataProperty
|
OWL_TOP_OBJECT_PROPERTY
http://www.w3.org/2002/07/owl#topObjectProperty
|
OWL_TRANSITIVE_PROPERTY
http://www.w3.org/2002/07/owl#TransitiveProperty
|
OWL_UNION_OF
http://www.w3.org/2002/07/owl#unionOf
|
OWL_VERSION_INFO
http://www.w3.org/2002/07/owl#versionInfo
|
OWL_VERSION_IRI
http://www.w3.org/2002/07/owl#versionIRI
|
OWL_WITH_RESTRICTIONS
http://www.w3.org/2002/07/owl#withRestrictions
|
RDF_DESCRIPTION
http://www.w3.org/1999/02/22-rdf-syntax-ns#Description
|
RDF_FIRST
http://www.w3.org/1999/02/22-rdf-syntax-ns#first
|
RDF_LIST
http://www.w3.org/1999/02/22-rdf-syntax-ns#List
|
RDF_NIL
http://www.w3.org/1999/02/22-rdf-syntax-ns#nil
|
RDF_OBJECT
Deprecated.
|
RDF_PLAIN_LITERAL
http://www.w3.org/1999/02/22-rdf-syntax-ns#PlainLiteral
|
RDF_PREDICATE
Deprecated.
|
RDF_PROPERTY
http://www.w3.org/1999/02/22-rdf-syntax-ns#Property
|
RDF_REST
http://www.w3.org/1999/02/22-rdf-syntax-ns#rest
|
RDF_SUBJECT
Deprecated.
|
RDF_TYPE
http://www.w3.org/1999/02/22-rdf-syntax-ns#type
|
RDF_XML_LITERAL
http://www.w3.org/1999/02/22-rdf-syntax-ns#XMLLiteral
|
RDFS_CLASS
http://www.w3.org/2000/01/rdf-schema#Class
|
RDFS_COMMENT
http://www.w3.org/2000/01/rdf-schema#comment
|
RDFS_DATATYPE
http://www.w3.org/2000/01/rdf-schema#subClassOf
|
RDFS_DOMAIN
http://www.w3.org/2000/01/rdf-schema#domain
|
RDFS_IS_DEFINED_BY
http://www.w3.org/2000/01/rdf-schema#isDefinedBy
|
RDFS_LABEL
http://www.w3.org/2000/01/rdf-schema#label
|
RDFS_LITERAL
http://www.w3.org/2000/01/rdf-schema#Literal
|
RDFS_RANGE
http://www.w3.org/2000/01/rdf-schema#range
|
RDFS_RESOURCE
http://www.w3.org/2000/01/rdf-schema#Resource
|
RDFS_SEE_ALSO
http://www.w3.org/2000/01/rdf-schema#seeAlso
|
RDFS_SUB_PROPERTY_OF
http://www.w3.org/2000/01/rdf-schema#subPropertyOf
|
RDFS_SUBCLASS_OF
http://www.w3.org/2000/01/rdf-schema#subClassOf
|
| Modifier and Type | Field and Description |
|---|---|
static java.util.Set<IRI> |
BUILT_IN_ANNOTATION_PROPERTY_IRIS
http://www.w3.org/2000/01/rdf-schema#label
http://www.w3.org/2000/01/rdf-schema#comment http://www.w3.org/2002/07/owl#versionInfo http://www.w3.org/2002/07/owl#backwardCompatibleWith http://www.w3.org/2002/07/owl#priorVersion http://www.w3.org/2000/01/rdf-schema#seeAlso http://www.w3.org/2000/01/rdf-schema#isDefinedBy http://www.w3.org/2002/07/owl#incompatibleWith http://www.w3.org/2002/07/owl#deprecated |
static java.util.Set<IRI> |
BUILT_IN_VOCABULARY_IRIS
Set of all IRIs for this enum values
|
| Modifier and Type | Method and Description |
|---|---|
IRI |
getIRI() |
Namespaces |
getNamespace() |
java.lang.String |
getShortName() |
java.net.URI |
getURI()
Deprecated.
Use getIRI() instead.
|
java.lang.String |
toString() |
static OWLRDFVocabulary |
valueOf(java.lang.String name)
Returns the enum constant of this type with the specified name.
|
static OWLRDFVocabulary[] |
values()
Returns an array containing the constants of this enum type, in
the order they are declared.
|
public static final OWLRDFVocabulary OWL_THING
public static final OWLRDFVocabulary OWL_NOTHING
public static final OWLRDFVocabulary OWL_CLASS
public static final OWLRDFVocabulary OWL_ONTOLOGY
@Deprecated public static final OWLRDFVocabulary OWL_ONTOLOGY_PROPERTY
public static final OWLRDFVocabulary OWL_IMPORTS
public static final OWLRDFVocabulary OWL_VERSION_IRI
public static final OWLRDFVocabulary OWL_VERSION_INFO
public static final OWLRDFVocabulary OWL_EQUIVALENT_CLASS
public static final OWLRDFVocabulary OWL_OBJECT_PROPERTY
public static final OWLRDFVocabulary OWL_DATA_PROPERTY
public static final OWLRDFVocabulary OWL_FUNCTIONAL_PROPERTY
public static final OWLRDFVocabulary OWL_INVERSE_FUNCTIONAL_PROPERTY
@Deprecated public static final OWLRDFVocabulary OWL_ANTI_SYMMETRIC_PROPERTY
public static final OWLRDFVocabulary OWL_ASYMMETRIC_PROPERTY
public static final OWLRDFVocabulary OWL_SYMMETRIC_PROPERTY
public static final OWLRDFVocabulary OWL_RESTRICTION
@Deprecated public static final OWLRDFVocabulary OWL_DATA_RESTRICTION
@Deprecated public static final OWLRDFVocabulary OWL_OBJECT_RESTRICTION
public static final OWLRDFVocabulary OWL_ON_PROPERTY
public static final OWLRDFVocabulary OWL_INTERSECTION_OF
public static final OWLRDFVocabulary OWL_UNION_OF
public static final OWLRDFVocabulary OWL_ALL_VALUES_FROM
public static final OWLRDFVocabulary OWL_SOME_VALUES_FROM
public static final OWLRDFVocabulary OWL_HAS_VALUE
public static final OWLRDFVocabulary OWL_DISJOINT_WITH
public static final OWLRDFVocabulary OWL_ONE_OF
@Deprecated public static final OWLRDFVocabulary OWL_SELF_RESTRICTION
public static final OWLRDFVocabulary OWL_HAS_SELF
public static final OWLRDFVocabulary OWL_DISJOINT_UNION_OF
public static final OWLRDFVocabulary OWL_MIN_CARDINALITY
public static final OWLRDFVocabulary OWL_MIN_QUALIFIED_CARDINALITY
public static final OWLRDFVocabulary OWL_CARDINALITY
public static final OWLRDFVocabulary OWL_QUALIFIED_CARDINALITY
public static final OWLRDFVocabulary OWL_ANNOTATION_PROPERTY
public static final OWLRDFVocabulary OWL_ANNOTATION
@Deprecated public static final OWLRDFVocabulary OWL_DECLARED_AS
public static final OWLRDFVocabulary OWL_INDIVIDUAL
public static final OWLRDFVocabulary OWL_NAMED_INDIVIDUAL
public static final OWLRDFVocabulary OWL_DATATYPE
public static final OWLRDFVocabulary RDFS_SUBCLASS_OF
public static final OWLRDFVocabulary RDFS_SUB_PROPERTY_OF
public static final OWLRDFVocabulary RDF_TYPE
public static final OWLRDFVocabulary RDF_NIL
public static final OWLRDFVocabulary RDF_REST
public static final OWLRDFVocabulary RDF_FIRST
public static final OWLRDFVocabulary RDF_LIST
public static final OWLRDFVocabulary OWL_MAX_CARDINALITY
public static final OWLRDFVocabulary OWL_MAX_QUALIFIED_CARDINALITY
@Deprecated public static final OWLRDFVocabulary OWL_NEGATIVE_OBJECT_PROPERTY_ASSERTION
@Deprecated public static final OWLRDFVocabulary OWL_NEGATIVE_DATA_PROPERTY_ASSERTION
public static final OWLRDFVocabulary OWL_NEGATIVE_PROPERTY_ASSERTION
public static final OWLRDFVocabulary RDFS_LABEL
public static final OWLRDFVocabulary RDFS_COMMENT
public static final OWLRDFVocabulary RDFS_SEE_ALSO
public static final OWLRDFVocabulary RDFS_IS_DEFINED_BY
public static final OWLRDFVocabulary RDFS_RESOURCE
public static final OWLRDFVocabulary RDFS_LITERAL
public static final OWLRDFVocabulary RDF_PLAIN_LITERAL
public static final OWLRDFVocabulary RDFS_DATATYPE
public static final OWLRDFVocabulary OWL_TRANSITIVE_PROPERTY
public static final OWLRDFVocabulary OWL_REFLEXIVE_PROPERTY
public static final OWLRDFVocabulary OWL_IRREFLEXIVE_PROPERTY
public static final OWLRDFVocabulary OWL_INVERSE_OF
public static final OWLRDFVocabulary OWL_COMPLEMENT_OF
public static final OWLRDFVocabulary OWL_DATATYPE_COMPLEMENT_OF
public static final OWLRDFVocabulary OWL_ALL_DIFFERENT
public static final OWLRDFVocabulary OWL_DISTINCT_MEMBERS
public static final OWLRDFVocabulary OWL_SAME_AS
public static final OWLRDFVocabulary OWL_DIFFERENT_FROM
public static final OWLRDFVocabulary OWL_DEPRECATED_PROPERTY
public static final OWLRDFVocabulary OWL_EQUIVALENT_PROPERTY
public static final OWLRDFVocabulary OWL_DEPRECATED_CLASS
public static final OWLRDFVocabulary OWL_DATA_RANGE
public static final OWLRDFVocabulary RDFS_DOMAIN
public static final OWLRDFVocabulary RDFS_RANGE
public static final OWLRDFVocabulary RDFS_CLASS
public static final OWLRDFVocabulary RDF_PROPERTY
@Deprecated public static final OWLRDFVocabulary RDF_SUBJECT
@Deprecated public static final OWLRDFVocabulary RDF_PREDICATE
@Deprecated public static final OWLRDFVocabulary RDF_OBJECT
@Deprecated public static final OWLRDFVocabulary OWL_SUBJECT
@Deprecated public static final OWLRDFVocabulary OWL_PREDICATE
@Deprecated public static final OWLRDFVocabulary OWL_OBJECT
public static final OWLRDFVocabulary RDF_DESCRIPTION
public static final OWLRDFVocabulary RDF_XML_LITERAL
public static final OWLRDFVocabulary OWL_PRIOR_VERSION
public static final OWLRDFVocabulary OWL_DEPRECATED
public static final OWLRDFVocabulary OWL_BACKWARD_COMPATIBLE_WITH
public static final OWLRDFVocabulary OWL_INCOMPATIBLE_WITH
@Deprecated public static final OWLRDFVocabulary OWL_OBJECT_PROPERTY_DOMAIN
@Deprecated public static final OWLRDFVocabulary OWL_DATA_PROPERTY_DOMAIN
@Deprecated public static final OWLRDFVocabulary OWL_DATA_PROPERTY_RANGE
@Deprecated public static final OWLRDFVocabulary OWL_OBJECT_PROPERTY_RANGE
@Deprecated public static final OWLRDFVocabulary OWL_SUB_OBJECT_PROPERTY_OF
@Deprecated public static final OWLRDFVocabulary OWL_SUB_DATA_PROPERTY_OF
@Deprecated public static final OWLRDFVocabulary OWL_DISJOINT_DATA_PROPERTIES
@Deprecated public static final OWLRDFVocabulary OWL_DISJOINT_OBJECT_PROPERTIES
public static final OWLRDFVocabulary OWL_PROPERTY_DISJOINT_WITH
@Deprecated public static final OWLRDFVocabulary OWL_EQUIVALENT_DATA_PROPERTIES
@Deprecated public static final OWLRDFVocabulary OWL_EQUIVALENT_OBJECT_PROPERTIES
@Deprecated public static final OWLRDFVocabulary OWL_FUNCTIONAL_DATA_PROPERTY
@Deprecated public static final OWLRDFVocabulary OWL_FUNCTIONAL_OBJECT_PROPERTY
public static final OWLRDFVocabulary OWL_ON_CLASS
public static final OWLRDFVocabulary OWL_ON_DATA_RANGE
public static final OWLRDFVocabulary OWL_ON_DATA_TYPE
public static final OWLRDFVocabulary OWL_WITH_RESTRICTIONS
public static final OWLRDFVocabulary OWL_INVERSE_OBJECT_PROPERTY_EXPRESSION
public static final OWLRDFVocabulary OWL_AXIOM
@Deprecated public static final OWLRDFVocabulary OWL_PROPERTY_CHAIN
public static final OWLRDFVocabulary OWL_PROPERTY_CHAIN_AXIOM
public static final OWLRDFVocabulary OWL_ALL_DISJOINT_CLASSES
public static final OWLRDFVocabulary OWL_MEMBERS
public static final OWLRDFVocabulary OWL_ALL_DISJOINT_PROPERTIES
public static final OWLRDFVocabulary OWL_TOP_OBJECT_PROPERTY
public static final OWLRDFVocabulary OWL_BOTTOM_OBJECT_PROPERTY
public static final OWLRDFVocabulary OWL_TOP_DATA_PROPERTY
public static final OWLRDFVocabulary OWL_BOTTOM_DATA_PROPERTY
public static final OWLRDFVocabulary OWL_HAS_KEY
public static final OWLRDFVocabulary OWL_ANNOTATED_SOURCE
public static final OWLRDFVocabulary OWL_ANNOTATED_PROPERTY
public static final OWLRDFVocabulary OWL_ANNOTATED_TARGET
public static final OWLRDFVocabulary OWL_SOURCE_INDIVIDUAL
public static final OWLRDFVocabulary OWL_ASSERTION_PROPERTY
public static final OWLRDFVocabulary OWL_TARGET_INDIVIDUAL
public static final OWLRDFVocabulary OWL_TARGET_VALUE
public static final java.util.Set<IRI> BUILT_IN_VOCABULARY_IRIS
public static final java.util.Set<IRI> BUILT_IN_ANNOTATION_PROPERTY_IRIS
public static OWLRDFVocabulary[] values()
for (OWLRDFVocabulary c : OWLRDFVocabulary.values()) System.out.println(c);
public static OWLRDFVocabulary valueOf(java.lang.String name)
name
- the name of the enum constant to be returned.java.lang.IllegalArgumentException
- if this enum type has no constant
with the specified namejava.lang.NullPointerException
- if the argument is null@Deprecated public java.net.URI getURI()
public IRI getIRI()
public Namespaces getNamespace()
public java.lang.String getShortName()
public java.lang.String toString()
toString
in class java.lang.Enum<OWLRDFVocabulary>


| Top |
SoupDate * soup_date_new (int year
,int month
,int day
,int hour
,int minute
,int second
);
Creates a SoupDate representing the indicated time, UTC.
SoupDate *
soup_date_new_from_string (const char *date_string
);
Parses date_string
and tries to extract a date from it. This
recognizes all of the "HTTP-date" formats from RFC 2616, all ISO
8601 formats containing both a time and a date, RFC 2822 dates,
and reasonable approximations thereof. (Eg, it is lenient about
whitespace, leading "0"s, etc.)
SoupDate *
soup_date_new_from_time_t (time_t when
);
Creates a SoupDate corresponding to when
SoupDate *
soup_date_new_from_now (int offset_seconds
);
Creates a SoupDate representing a time offset_seconds
after the
current time (or before it, if offset_seconds
is negative). If
offset_seconds is 0, returns the current time.
If offset_seconds
would indicate a time not expressible as a
char * soup_date_to_string (SoupDate *date
,SoupDateFormat format
);
Converts date
to a string in the format described by format
.
time_t
soup_date_to_time_t (SoupDate *date
);
Converts date
to a time_t.
If date
is not representable as a time_t, it will be
clamped into range. (In particular, some HTTP cookies have
expiration dates after "Y2.038k" (2038-01-19T03:14:07Z).)
void soup_date_to_timeval (SoupDate *date
,GTimeVal *time
);
Converts date
to a GTimeVal.
Since 2.24
gboolean
soup_date_is_past (SoupDate *date
);
Determines if date
is in the past.
Since 2.24
int
soup_date_get_offset (SoupDate *date
);
Gets date
's offset from UTC.
date
's offset from UTC. If soup_date_get_utc()
returns FALSE
but soup_date_get_offset()
returns 0, that means the
date is a "floating" time with no associated offset information.
Since 2.32
guint soup_headers_parse_request (const char *str
,int len
,SoupMessageHeaders *req_headers
,char **req_method
,char **req_path
,SoupHTTPVersion *ver
);
Parses the headers of an HTTP request in str
and stores the
results in req_method
, req_path
, ver
, and req_headers
.
Beware that req_headers
may be modified even on failure.
str |
the headers (up to, but not including, the trailing blank line) |
|
len |
length of |
|
req_headers |
SoupMessageHeaders to store the header values in |
|
req_method |
if non- |
[out][allow-none] |
req_path |
if non- |
[out][allow-none] |
ver |
if non- |
[out][allow-none] |
SOUP_STATUS_OK
if the headers could be parsed, or an
HTTP error to be returned to the client if they could not be.
gboolean soup_headers_parse_response (const char *str
,int len
,SoupMessageHeaders *headers
,SoupHTTPVersion *ver
,guint *status_code
,char **reason_phrase
);
Parses the headers of an HTTP response in str
and stores the
results in ver
, status_code
, reason_phrase
, and headers
.
Beware that headers
may be modified even on failure.
str |
the headers (up to, but not including, the trailing blank line) |
|
len |
length of |
|
headers |
SoupMessageHeaders to store the header values in |
|
ver |
if non- |
[out][allow-none] |
status_code |
if non- |
[out][allow-none] |
reason_phrase |
if non- |
[out][allow-none] |
gboolean soup_headers_parse_status_line (const char *status_line
,SoupHTTPVersion *ver
,guint *status_code
,char **reason_phrase
);
Parses the HTTP Status-Line string in status_line
into ver
,
status_code
, and reason_phrase
. status_line
must be terminated by
either "\0" or "\r\n".
gboolean soup_headers_parse (const char *str
,int len
,SoupMessageHeaders *dest
);
Parses the headers of an HTTP request or response in str
and
stores the results in dest
. Beware that dest
may be modified even
on failure.
This is a low-level method; normally you would use
soup_headers_parse_request()
or soup_headers_parse_response()
.
str |
the header string (including the Request-Line or Status-Line, but not the trailing blank line) |
|
len |
length of |
|
dest |
SoupMessageHeaders to store the header values in |
Since 2.26
GSList *
soup_header_parse_list (const char *header
);
Parses a header whose content is described by RFC2616 as "something", where "something" does not itself contain commas, except as part of quoted-strings.
GSList * soup_header_parse_quality_list (const char *header
,GSList **unacceptable
);
Parses a header whose content is a list of items with optional "qvalue"s (eg, Accept, Accept-Charset, Accept-Encoding, Accept-Language, TE).
If unacceptable
is not NULL
, then on return, it will contain the
items with qvalue 0. Either way, those items will be removed from
the main list.
gboolean soup_header_contains (const char *header
,const char *token
);
Parses header
to see if it contains the token token
(matched
case-insensitively). Note that this can't be used with lists
that have qvalues.
GHashTable *
soup_header_parse_param_list (const char *header
);
Parses a header which is a comma-delimited list of something like:
token [ "=" ( token | quoted-string ) ]
.
Tokens that don't have an associated value will still be added to
the resulting hash table, but with a NULL
value.
This also handles RFC5987 encoding (which in HTTP is mostly used for giving UTF8-encoded filenames in the Content-Disposition header).
a
GHashTable of list elements, which can be freed with
soup_header_free_param_list()
.
[element-type utf8 utf8][transfer full]
GHashTable *
soup_header_parse_semi_param_list (const char *header
);
Parses a header which is a semicolon-delimited list of something
like: token [ "=" ( token | quoted-string ) ]
.
Tokens that don't have an associated value will still be added to
the resulting hash table, but with a NULL
value.
This also handles RFC5987 encoding (which in HTTP is mostly used for giving UTF8-encoded filenames in the Content-Disposition header).
a
GHashTable of list elements, which can be freed with
soup_header_free_param_list()
.
[element-type utf8 utf8][transfer full]
Since 2.24
void
soup_header_free_param_list (GHashTable *param_list
);
Frees param_list
.
param_list |
a GHashTable returned from |
[element-type utf8 utf8] |
void soup_header_g_string_append_param (GString *string
,const char *name
,const char *value
);
Appends something like
to name
=value
string
,
taking care to quote value
if needed, and if so, to escape any
quotes or backslashes in value
.
Alternatively, if value
is a non-ASCII UTF-8 string, it will be
appended using RFC5987 syntax. Although in theory this is supposed
to work anywhere in HTTP that uses this style of parameter, in
reality, it can only be used portably with the Content-Disposition
"filename" parameter.
If value
is NULL
, this will just append name
to string
.
string |
a GString being used to construct an HTTP header value |
|
name |
a parameter name |
|
value |
a parameter value, or |
Since 2.26
void soup_header_g_string_append_param_quoted (GString *string
,const char *name
,const char *value
);
Appends something like
to
name
="value
"string
, taking care to escape any quotes or backslashes in value
.
If value
is (non-ASCII) UTF-8, this will instead use RFC 5987
encoding, just like soup_header_g_string_append_param()
.
string |
a GString being used to construct an HTTP header value |
|
name |
a parameter name |
|
value |
a parameter value |
Since 2.30
gboolean soup_str_case_equal (gconstpointer v1
,gconstpointer v2
);
Compares v1
and v2
in a case-insensitive manner
guint
soup_str_case_hash (gconstpointer key
);
Hashes key
in a case-insensitive manner.
GSource * soup_add_completion (GMainContext *async_context
,GSourceFunc function
,gpointer data
);
Adds function
to be executed from inside async_context
with the
default priority. Use this when you want to complete an action in
async_context
's main loop, as soon as possible.
async_context |
the GMainContext to dispatch the I/O
watch in, or |
[allow-none] |
function |
the callback to invoke |
|
data |
user data to pass to |
Since 2.24
GSource * soup_add_idle (GMainContext *async_context
,GSourceFunc function
,gpointer data
);
Adds an idle event as with g_idle_add()
, but using the given
async_context
.
If you want function
to run "right away", use
soup_add_completion()
, since that sets a higher priority on the
GSource than soup_add_idle()
does.
GSource * soup_add_io_watch (GMainContext *async_context
,GIOChannel *chan
,GIOCondition condition
,GIOFunc function
,gpointer data
);
Adds an I/O watch as with g_io_add_watch()
, but using the given
async_context
.
GSource * soup_add_timeout (GMainContext *async_context
,guint interval
,GSourceFunc function
,gpointer data
);
Adds a timeout as with g_timeout_add()
, but using the given
async_context
.
typedef struct { int year; int month; int day; int hour; int minute; int second; gboolean utc; int offset; } SoupDate;
A date and time. The date is assumed to be in the (proleptic)
Gregorian calendar. The time is in UTC if utc
is TRUE
. Otherwise,
the time is a local time, and offset
gives the offset from UTC in
minutes (such that adding offset
to the time would give the
correct UTC time). If utc
is FALSE
and offset
is 0, then the
SoupDate
represents a "floating" time with no associated timezone
information.
Date formats that soup_date_to_string()
can use.
SOUP_DATE_HTTP
and SOUP_DATE_COOKIE
always coerce the time to
UTC. SOUP_DATE_ISO8601_XMLRPC
uses the time as given, ignoring the
offset completely. SOUP_DATE_RFC2822
and the other ISO 8601
variants use the local time, appending the offset information if
available.
This enum may be extended with more values in future releases.
|
RFC 1123 format, used by the HTTP "Date" header. Eg "Sun, 06 Nov 1994 08:49:37 GMT" |
||
|
The format for the "Expires" timestamp in the Netscape cookie specification. Eg, "Sun, 06-Nov-1994 08:49:37 GMT". |
||
|
RFC 2822 format, eg "Sun, 6 Nov 1994 09:49:37 -0100" |
||
|
ISO 8601 date/time with no optional punctuation. Eg, "19941106T094937-0100". |
||
|
ISO 8601 date/time with all optional punctuation. Eg, "1994-11-06T09:49:37-01:00". |
||
|
An alias for |
||
|
ISO 8601 date/time as used by XML-RPC. Eg, "19941106T09:49:37". |


| Overview | Namespace | Class | Index | Help |
| PUBLIC MEMBERS: | CLASSES | STRUCTS | UNIONS | ENUMS | TYPEDEFS | METHODS | STATIC METHODS | DATA | STATIC DATA |
| PRIVATE MEMBERS: | CLASSES | STRUCTS | UNIONS | ENUMS | TYPEDEFS | METHODS | STATIC METHODS | DATA | STATIC DATA |
| virtual | abstract | interface | template |
| NO | NO | NO | NO |
String buffers are safe for use by multiple threads. The methods are synchronized where necessary so that all the operations on any particular instance behave as if they occur in some serial order.
String buffers are used by the compiler to implement the binary
string concatenation operator +
. For example, the code:
x = "a" + 4 + "c"
is compiled to the equivalent of:
x = new OStringBuffer().append("a").append(4).append("c") .toString()
The principal operations on a OStringBuffer
are the
append
and insert
methods, which are
overloaded so as to accept data of any type. Each effectively
converts a given datum to a string and then appends or inserts the
characters of that string to the string buffer. The
append
method always adds these characters at the end
of the buffer; the insert
method adds the characters at
a specified point.
For example, if z
refers to a string buffer object
whose current contents are "start
", then
the method call z.append("le")
would cause the string
buffer to contain "startle
", whereas
z.insert(4, "le")
would alter the string buffer to
contain "starlet
".
Every string buffer has a capacity. As long as the length of the character sequence contained in the string buffer does not exceed the capacity, it is not necessary to allocate a new internal buffer array. If the internal buffer overflows, it is automatically made larger.
Methods |
|
| OStringBuffer( ); |
Constructs a string buffer with no characters in it and an initial capacity of 16 characters. |
| OStringBuffer( const OStringBuffer & value ); |
Allocates a new string buffer that contains the same sequence of characters as the string buffer argument. |
| OStringBuffer( sal_Int32 length ); |
Constructs a string buffer with no characters in it and an initial capacity specified by the length argument. |
| OStringBuffer( OString value ); |
Constructs a string buffer so that it represents the same sequence of characters as the string argument. |
| OStringBuffer & operator=( const OStringBuffer & value ); |
Assign to this a copy of value. |
| ~OStringBuffer( ); |
Release the string data. |
| OString makeStringAndClear( ); |
Fill the string data in the new string and clear the buffer. |
| sal_Int32 getLength( ) const; |
Returns the length (character count) of this string buffer. |
| sal_Int32 getCapacity( ) const; |
Returns the current capacity of the String buffer. |
| void ensureCapacity( sal_Int32 minimumCapacity ); |
Ensures that the capacity of the buffer is at least equal to the specified minimum. |
| void setLength( sal_Int32 newLength ); |
Sets the length of this String buffer. |
| sal_Char charAt( sal_Int32 index ); |
Returns the character at a specific index in this string buffer. |
| operator const sal_Char *( ) const; |
Return a null terminated character array. |
| const sal_Char * getStr( ) const; |
Return a null terminated character array. |
| OStringBuffer & setCharAt( sal_Int32 index, sal_Char ch ); |
The character at the specified index of this string buffer is set to ch. |
| OStringBuffer & append( const OString & str ); |
Appends the string to this string buffer. |
| OStringBuffer & append( const sal_Char * str ); |
Appends the string representation of the char array argument to this string buffer. |
| OStringBuffer & append( const sal_Char * str, sal_Int32 len ); |
Appends the string representation of the char array argument to this string buffer. |
| OStringBuffer & append( sal_Bool b ); |
Appends the string representation of the sal_Bool argument to the string buffer. |
| OStringBuffer & append( sal_Char c ); |
Appends the string representation of the char argument to this string buffer. |
| OStringBuffer & append( sal_Int32 i, sal_Int16 radix = 10 ); |
Appends the string representation of the sal_Int32 argument to this string buffer. |
| OStringBuffer & append( sal_Int64 l, sal_Int16 radix = 10 ); |
Appends the string representation of the long argument to this string buffer. |
| OStringBuffer & append( float f ); |
Appends the string representation of the float argument to this string buffer. |
| OStringBuffer & append( double d ); |
Appends the string representation of the double argument to this string buffer. |
| OStringBuffer & insert( sal_Int32 offset, const OString & str ); |
Inserts the string into this string buffer. |
| OStringBuffer & insert( sal_Int32 offset, const sal_Char * str ); |
Inserts the string representation of the char array argument into this string buffer. |
| OStringBuffer & insert( sal_Int32 offset, const sal_Char * str, sal_Int32 len ); |
Inserts the string representation of the char array argument into this string buffer. |
| OStringBuffer & insert( sal_Int32 offset, sal_Bool b ); |
Inserts the string representation of the sal_Bool argument into this string buffer. |
| OStringBuffer & insert( sal_Int32 offset, sal_Char c ); |
Inserts the string representation of the char argument into this string buffer. |
| OStringBuffer & insert( sal_Int32 offset, sal_Int32 i, sal_Int16 radix = 10 ); |
Inserts the string representation of the second sal_Int32 argument into this string buffer. |
| OStringBuffer & insert( sal_Int32 offset, sal_Int64 l, sal_Int16 radix = 10 ); |
Inserts the string representation of the long argument into this string buffer. |
| OStringBuffer insert( sal_Int32 offset, float f ); |
Inserts the string representation of the float argument into this string buffer. |
| OStringBuffer & insert( sal_Int32 offset, double d ); |
Inserts the string representation of the double argument into this string buffer. |
Data |
|
| rtl_String * pData; | A pointer to the data structur which contains the data. |
| sal_Int32 nCapacity; | The len of the pData->buffer. |
Copyright © 2012, The Apache Software Foundation, Licensed under the Apache License, Version 2.0. Apache, the Apache feather logo, Apache OpenOffice and OpenOffice.org are trademarks of The Apache Software Foundation. Other names may be trademarks of their respective owners.


Try out our Premium Member services: Virtual Legal Assistant, Query Alert Service and an ad-free experience. Free for one month and pay only if you like it.
IN THE HIGH COURT OF JUDICATURE AT PATNA Civil Writ Jurisdiction Case No.7208 of 2016 ===========================================================
M/s Shree Ram Int. Udyog through its Proprietor Sri Pramod Kumar 'Amar', S/o Sri Anand Lal Sah, Resident of At, P.O. & P.S. - Madhepur, District - Madhubani.
.... .... Petitioner/s Versus
1. The State of Bihar through the Collector cum District Magistrate, Madhubani.
2. The Circle Officer, Madhepur, District - Madhubani.
3. The Superintendent of Police, Madhubani.
4. The Dy. S.P., Jhanjharpur, District - Madhubani.
5. The Officer in charge, Madhepur Police Station, District - Madhubani.
6. The Chowkidar, Madhepur Police Station, District - Madhubani.
7. The District Industries Officer, Madhubani.
8. The District Manager, District Industries Centre, Madhubani.
9. The Chairman (Sri Subhash Chandra Singh), Bihar State Pollution Control Board, Beltrol Bhawan, Shastri Nagar, Patna - 23.
10. The Member Secretary, Bihar State Pollution Control Board, Patna.
11. The District Mining Officer, Madhubani, District - Madhubani.
.... .... Respondent/s =========================================================== Appearance :
For the Petitioner/s : Mr. Kameshwar Prasad Gupta For the Respondent/s : Mr. Ajit Pratap Singh, SC-15 For Pollution Control Board : Mr. Shivendra Kishore, Sr. Advocate =========================================================== CORAM: HONOURABLE MR. JUSTICE JYOTI SARAN ORAL JUDGMENT Date: 20-05-2016 Heard Mr. Kameshwar Prasad Gupta, learned counsel appearing for the petitioner, counsel for the State and Mr. Shivendra Kishore, learned senior counsel appearing for the Bihar State Pollution Control Board and its authorities.
The petitioner is a firm running a brick kiln in the district of Madhubani and is aggrieved by the order dated 7.1.2016 passed by the Chairman, Bihar State Pollution Control Board (hereinafter referred to as 'the Board'), whereby the operation of the brick kiln has been stopped with immediate effect, inter alia, on grounds that it is being operated without complying with the provisions of Air (Prevention and Control of Patna High Court CWJC No.7208 of 2016 dt.20-05-2016 2 Pollution) Act, 1981 (hereinafter referred to as 'the Act').
Mr. Kameshwar Prasad Gupta, learned counsel appearing for the petitioner has submitted that the brick kiln is being operated by the petitioner since last couple of years and has continuously been granted consent by the respondent and copy of the last consent is placed at Annexure-7/e at page 47 which is dated 19.10.2015 and whereunder the petitioner has been granted Emission Consent Order for the period up to 30.6.2018. He thus submits that this single document is sufficient to indicate that the order impugned dated 7.1.2016 putting a restraint on the operation of the petitioner-unit is without application of mind.
Mr. Shivendra Kishore, learned senior counsel appearing for the Board has tried to defend the action of 'the Board' on the proceedings arising from CWJC No.19471 of 2015 as well as the order passed by the National Green Tribunal, Eastern Zone Bench at Kolkata in O.A. No.61 of 2015/EZ (Joydeep Mukherjee vs. Pollution Control Board, State of Bihar) on the issue, in which the petitioner has been arraigned as respondent no.239 and to submit that certain directives have been issued by the Tribunal in relation to operation of brick kilns under the control and supervision of 'the Board'. A copy of the order passed by the National Green Tribunal, Eastern Zone Bench at Kolkata (hereinafter referred to as 'the Tribunal'), passed on 6.5.2016 in O.A. No.61 of 2015/EZ has also been produced by Mr. Kishore and with reference to the operative part imposing compensation/penalty on the defaulting and illegally operated brick kilns, it is submitted by Mr. Kishore, learned Patna High Court CWJC No.7208 of 2016 dt.20-05-2016 3 counsel appearing for 'the Board' that the petitioner would also have to abide by the directives. The order passed by the 'Tribunal' takes note of the stand of the Member, Bihar State Pollution Control Board in which he has admitted that in all 6186 brick kilns have been identified and out of them 5908 brick kilns have been granted consent to establish and of these 5908 brick kilns only 2824 have been granted consent to operate. It is the stand taken by the 'Board' that those brick kilns who are operating without consent to operate have been issued notice against the proposed action and it is in consideration of such stand taken that the 'Tribunal' has allowed 'the Board' to take necessary steps in this regard but in accordance with law after following the principles of Natural Justice.
In so far as those brick kilns are concerned who are operating even after expiry of the validity period of the consent order as well as the brick kilns who are operating without any such permission from inception, the 'Tribunal' has imposed a compensation/penalty of Rs.1,00 lakh and 1.5 lakh respectively, to be deposited with the 'Board'. The 'Tribunal' has further directed the respondents against whom show cause notices have been issued to approach 'the Board' with supportive documents enabling 'the Board' to pass appropriate orders. Let the order passed by the National Green Tribunal, Easter Zone Bench at Kolkata dated 6.5.2016 be maintained on the records of the proceedings.
In my opinion, the order of the 'Tribunal' does not in any manner casts any obligation on the petitioner for the directions requiring a brick kiln to respond, is only in respect of those brick kilns to whom Patna High Court CWJC No.7208 of 2016 dt.20-05-2016 4 any show cause notice has been issued in this regard. In so far as the petitioner is concerned understandably, since the consent order is issued in favour of the petitioner and is operative and valid up to 30.6.2018 there was no occasion for 'the Board' to issue any show cause notice to the petitioner. In my opinion a mere arraignment of this petitioner in the proceedings before the National Green Tribunal in the nature of the order passed by the Tribunal, neither casts any obligation on the petitioner nor can be a foundation for the impugned orders. In fact in view of the Emission Consent Order granted by 'the Board' dated 19.10.2015 present at Annexure-7/e, the order dated 7.1.2016 passed by the Chairman of 'the Board' impugned at Annexure-1 together with the order dated 15.3.2016 of the District Magistrate, Madhubani in so far as it relates to the petitioner as well as the order of the Circle Officer, Madhepur dated 19.3.2016 impugned at Annexure- 3 and 5 respectively are held unsustainable and are accordingly set aside.
The writ petition is allowed (Jyoti Saran, J) SKPathak/-
AFR CAV DATE Uploading Date 23-052016 Transmission Date


public static interface Protos.CommandInfo.URIOrBuilder
| Modifier and Type | Method and Description |
|---|---|
boolean |
getCache()
optional bool cache = 4; |
boolean |
getExecutable()
optional bool executable = 2; |
boolean |
getExtract()
optional bool extract = 3 [default = true]; |
java.lang.String |
getOutputFile()
optional string output_file = 5; |
com.google.protobuf.ByteString |
getOutputFileBytes()
optional string output_file = 5; |
java.lang.String |
getValue()
required string value = 1; |
com.google.protobuf.ByteString |
getValueBytes()
required string value = 1; |
boolean |
hasCache()
optional bool cache = 4; |
boolean |
hasExecutable()
optional bool executable = 2; |
boolean |
hasExtract()
optional bool extract = 3 [default = true]; |
boolean |
hasOutputFile()
optional string output_file = 5; |
boolean |
hasValue()
required string value = 1; |
boolean hasValue()
required string value = 1;
java.lang.String getValue()
required string value = 1;
com.google.protobuf.ByteString getValueBytes()
required string value = 1;
boolean hasExecutable()
optional bool executable = 2;
boolean getExecutable()
optional bool executable = 2;
boolean hasExtract()
optional bool extract = 3 [default = true];
In case the fetched file is recognized as an archive, extract its contents into the sandbox. Note that a cached archive is not copied from the cache to the sandbox in case extraction originates from an archive in the cache.
boolean getExtract()
optional bool extract = 3 [default = true];
In case the fetched file is recognized as an archive, extract its contents into the sandbox. Note that a cached archive is not copied from the cache to the sandbox in case extraction originates from an archive in the cache.
boolean hasCache()
optional bool cache = 4;
If this field is "true", the fetcher cache will be used. If not, fetching bypasses the cache and downloads directly into the sandbox directory, no matter whether a suitable cache file is available or not. The former directs the fetcher to download to the file cache, then copy from there to the sandbox. Subsequent fetch attempts with the same URI will omit downloading and copy from the cache as long as the file is resident there. Cache files may get evicted at any time, which then leads to renewed downloading. See also "docs/fetcher.md" and "docs/fetcher-cache-internals.md".
boolean getCache()
optional bool cache = 4;
If this field is "true", the fetcher cache will be used. If not, fetching bypasses the cache and downloads directly into the sandbox directory, no matter whether a suitable cache file is available or not. The former directs the fetcher to download to the file cache, then copy from there to the sandbox. Subsequent fetch attempts with the same URI will omit downloading and copy from the cache as long as the file is resident there. Cache files may get evicted at any time, which then leads to renewed downloading. See also "docs/fetcher.md" and "docs/fetcher-cache-internals.md".
boolean hasOutputFile()
optional string output_file = 5;
The fetcher's default behavior is to use the URI string's basename to name the local copy. If this field is provided, the local copy will be named with its value instead. If there is a directory component (which must be a relative path), the local copy will be stored in that subdirectory inside the sandbox.
java.lang.String getOutputFile()
optional string output_file = 5;
The fetcher's default behavior is to use the URI string's basename to name the local copy. If this field is provided, the local copy will be named with its value instead. If there is a directory component (which must be a relative path), the local copy will be stored in that subdirectory inside the sandbox.
com.google.protobuf.ByteString getOutputFileBytes()
optional string output_file = 5;
The fetcher's default behavior is to use the URI string's basename to name the local copy. If this field is provided, the local copy will be named with its value instead. If there is a directory component (which must be a relative path), the local copy will be stored in that subdirectory inside the sandbox.