Last week I started working on implementing Similarity Transform Method, which is an iterative method for quickly finding maximum eigen value along with respective eigen vector for a positive square matrix. Today I plan to go through this method step-by-step, while first developing its sequential implementation and finally moving to parallel implementation, written targeting heterogeneous platforms i.e. CPU, GPU, FPGA etc. using SYCL DPC++. Finally I'd like to do some performance comparison between sequential and parallel implementations, both written by me.
As Similarity Transform works with positive square matrices, I'd like to fix one matrix, which I'll work on. Let me call it AN x N, where N = 3.
I start with finding sum of elements across each row of AN x N. I can write 👇 code snippet for computing that.
Notice, I mark maximum row sum as we've to use it for computing eigen vector ( iteratively ) in next step. I initialise iteratively computed eigen vector with [1; N] and during each iteration following function is used for updating eigen vector, while reaching closer to desired values.
Now I'd like to present next step where I check whether we've converged to maximum eigen value or not. It's as simple
as checking whether all consecutive absolute differences between cells of sum_across_rows vector are below of preset
epsilon value, which I consider to be error induced during floating point arithmetics. If all consecutive differences are below
say, EPS = 1e-5, it denotes it's good time to stop this iterative method, as we've converged to maximum eigen value
of given matrix. I can take very first element of sum_across_rows vector ( in final round ) and consider it to be
maximum eigen value, we're looking for.
I write convergence criteria checker function as below. In very first iteration, we're far from convergence, as our row sum vector looks like
[6, 9, 12] --- so answer is negative and we'll continue to next iteration.
Before I prepare AN x N for next iteration, this is how current eigen vector looks like.
In final step, I take sum_across_rows vector and prepare diagonal matrix DN x N and DN x N-1, using those I compute A'N x N for next iteration. I programmatically express that logic 👇.
With completion of this step, I've following matrix, which is to be worked on during next iteration.
In second iteration, I already find sum_across_rows vector having lesser consecutive absolute differences --- tending to converge.
After going through each of these steps, during 5th iteration, convergence criteria is fully satisfied, resulting into following eigen value and corresponding eigen vector.
Just to check that these are correct, I assert following, while considering some floating point arithmetics error will probably be present.
I keep full sequential implementation of Similarity Transform Method here for future reference. Now it's good time to talk about parallel implementation of this method. First step i.e. summing N-many elements across N-many rows is easily parallelizable. I'm currently making use of atomic instructions for spawning N x N work-items, each reading value from cell Ai, i and atomically summing up values along each row. In second step, I find maximum value from just computed N-element vector i.e. sum_across_rows. Here also I make use of atomic instructions for parallelly computing maximum element of vector. Third step consists of updating eigen vector with sum_across_rows of this iteration, which is also a good candidate of parallel computing. Each of N-many work-items updating a single cell of eigen vector. Finally, it requires me to perform two matrix multiplications in last step, but given that two of these three operands are diagonal matrices and one is inverse of another, I can compute matrix for next round using 👇 trick. This trick lends itself to heavy parallelism and each cell of A N x N matrix can be computed independently using N x N work-items.
I've also parallel implementation for checking whether current round has reached convergence criteria or not, using atomic instructions. Empowered with these, I'm ready to run both sequential and data parallel implementation for performance comparison. Starting with sequential implementation I wrote in Python. This is a single threaded implementation using numpy for doing matrix algebra. Note performance when N = 1024 ( read last row ).
Data parallel implementation powered by Unified Shared Memory and atomics doesn't perform very well, compared to previous one. Note, for both data parallel and sequential implementations, I'm using randomly generated positive square matrices with each cell taking value from [0, 1).
I'd like to note few points, regarding why data parallel implementation doesn't do better than sequential one.
Keeping aforementioned points in mind, I end today's discussion. I keep full implementation of both sequential and parallel similarity transform methods
in this repository. In coming days, I'll try to
improve data parallel implementation, while also sharing my findings.
Have a great time !


25
Turns completed
7
Turns inadvance
4
Turns remaining
Turns pending today
{{currentdate | date: 'dd'}}
{{currentdate | date: 'MMM'}}
You have 2 turns today
{{userdetails.friends.length}}
Friends
{{userdetails.groups.length}}
Activities


"Lightning fast action firm with a history of success"
Home
About
Services
A History Of Success
About
About the business
Services
List of services with pictures and description
A History Of Success
Success In The Paper


WITNESS LIST Licensing & Administrative Procedures Committee March 27, 2003-8:00A HB 948 On: Frey, Dr. Demarious K. (Texas Veterinary Medical Association) HB 1264 For: Droemer, Carl (Self and Lehm Berg Winery) HB 1625 For: Edwards, Mike (Self) Wells, Charles (Self) HB 1754 For: Felts, Dr. Shawn (Self) Wasson, Mitchell (Self and Texas Pest Control Association)


Welcome to the Virtual Food Court!
As an adminstrator, you can manage the vendors of the food court
As a vendor, you can manage your food menu categories and menu items
As a customer, you can order food from the vendors in the food court


Headline
Jacqueline McGonigle of whatsonni.com shares her pick of family events across the north this week
Down
This Saturday in Bangor, expect family fun, food and craft market and seasonal entertainment, all leading to the lights switch on at McKee Clock arena with extra special guests The Snowman and The Snowdog followed by a fireworks finale.
Antrim
This year's Courtyard Theatre Newtownabbey's pantomime will be the 10th Anniversary Production of the Courtyard Theatre and Mr Hullabaloo Productions bringing timeless magic to your Christmas treat. Prepare to soar away on a magical carpet ride of non-stop laughs and thrills in one of the most spectacular pantomime adventures of all time – Aladdin. Run from November 23 to December 21.
Armagh
Enjoy a magical evening of festive song, dance and merriment with performances for all the family, including carol singing from local primary schools at the Portadown Twilight Market and Christmas Lights Switch On this Friday evening November 22 from 6pm.
Derry
Join in the fun in Magherafelt on Saturday November 23 for live entertainment and the Christmas market, before the street party kicks off and countdown begins to this year's Christmas lights switch on. The market is back again for a second day on Sunday November 24.
Fermanagh
On Sunday November 24, Share Slalom is back for the 16th year in a row at Ballyconnell Lock Gate. Waterways Ireland has developed this area with canoe steps and assisted flow boulders to provide a superb venue for this Paddle 4 Sport League event.
Tyrone
It's time to get signed up for Dog Trails NI's next race event in the magical and wild grounds of Lissan House, Cookstown this Sunday November 24. Muddy Mutts comprises a 5K, 3K and kids race. This is a canicross race... but one with a twist. As a location for equestrian events, Lissan House is going to be a muddy one, with jumps and swamps to challenge you and your dog.
Belfast
Every Sunday evening comedic improvisers at the Accidental Theatre, Shaftesbury Square put together scenes, songs, and stories from audience suggestions. All scenes are created in the moment, and no two shows are ever the same.
For further details on these events and to add your events free go to whatsonni.com. Follow us on twitter @whatsonNI and on facebook at fb.com/www.whatsonni for news, competitions and what's on near you.


Demo
1 / 1
Normal talk
15 / 5
Invited talk
35 / 5
Quick test
:10 / :10
Custom timer:
/
Auto-advance to Q/A
Resume countdown
JS Timer


Align next data item on specified byte boundary (0=byte, 1=half, 2=word, 3=double)
Store the string in the Data segment but do not add null terminator
Store the string in the Data segment and add null terminator
Store the listed value(s) as 8 bit bytes
Subsequent items stored in Data segment at next available address
Store the listed value(s) as double precision floating point
End macro definition. See .macro
Substitute second operand for first. First operand is symbol, second operand is expression (like #define)
Declare the listed label and byte length to be a global data field
Store the listed value(s) as single precision floating point
Declare the listed label(s) as global to enable referencing from other files
Store the listed value(s) as 16 bit halfwords on halfword boundary
Insert the contents of the specified file. Put filename in quotes.
Subsequent items stored in Kernel Data segment at next available address
Subsequent items (instructions) stored in Kernel Text segment at next available address
Begin macro definition. See .end_macro
Set assembler variables. Currently ignored but included for SPIM compatability
Reserve the next specified number of bytes in Data segment
Subsequent items (instructions) stored in Text segment at next available address
Store the listed value(s) as 32 bit words on word boundary


An PHP class to use for data objects, using JSON schema as a validation structure.
Dataset
.Now define the json schema. A simple method is to supply a class constant JSON_SCHEMA
with the schema value:
class SimpleExample extends Dataset {
const JSON_SCHEMA = '{"type": "object","required":["id"],"id":{"type":"integer"},"version":{"type":"string","default":"1.2.5"}}';
}
Most times however, your schema will live in a separate file. Therefore you will not define the class constant JSON_SCHEMA
, rather provide the path to the json schema as the return value of the public static method pathToJsonSchema
. You may follow the convention of appending .schema.json
to the classname, if you wish, as shown here:
/**
* {@inheritdoc}
*/
protected static function pathToJsonSchema() {
return __DIR__ . '/DatasetAlpha.schema.json';
}
Now create a json schema file to define your dataset at the path defined above.
pattern
keyword to define a regex expression that you do NOT include the delimiters like you do in PHP's preg_match
. This is corrent JSON: "pattern": "\\?[^#]+"
, notice there are no delimiters.Then implement an instance in your code like this:
<?php
$data = ['id' => 123];
...
try {
$timer = Timer::dataset($data)->validate()->throwFirstProblem();
} catch (\Exception $exception) {
// Do something if validation failed.
}
static::
You can provide class methods, constants, etc in your JSON schema files and they will be evaluated at runtime. For example, here we provide the regex pattern for the date
property with a class constant, and the default
value with a class method. The cornerstone of this process is that the value begin with static::
.
"date": {
"type": "string",
"default": "static::defaultDate()",
"pattern": "static::REGEX_DATEISO8601"
},
$array = $data->get()
$json = strval($data)
.$id = $data->id
$id = $data->userId
. Read about aliases for more info.Timer::getDefault('id')
.Timer::getDefaults()
$data->getProblems
.$data->throwFirstError
::mutate
.You may have aliases for property keys, which means you can access the same value using any of a number of keys. To define an alias use colon separation as seen below:
{
...
"properties": {
"mi:me:moi": {
"default": "myself",
"type": "string",
"pattern": "/^m.+/"
},
validate()
, but read the docs there for what needs to happen.ignoreKey()
instead, if possible.protected static function ignoreKey($key)
{
return $key === 'duration';
}
protected static function ignoreKey($key)
{
return strpos($key, '#') === 0;
}
static::ignoreKey()
in your class.The time to do this is during ::import
.
<?php
/**
* Import extra data based on a default value.
*
* In this example, the defaults set the user id by global var. During import
* we check for a user_id, either by import $data or the default data. Then we
* make sure the the $original import data doesn't contain session_id, and if
* so we pull that data from the user account object.
*/
class Alpha extends Dataset {
...
/**
* {@inheritdoc}
*/
protected static function defaults() {
global $user;
return [
'user_id' => $user->uid,
'session_id' => -1,
];
}
/**
* {@inheritdoc}
*/
public function import($data) {
$original = $data;
$data += static::getDefaults();
// Figure the session id based on the last time the user logged in.
// https://amplitude.zendesk.com/hc/en-us/articles/115002323627-Sessions
if ($data['user_id'] && empty($original['session_id'])) {
$account = user_load($data['user_id']);
// We will count our session based on last login.
// https://drupal.stackexchange.com/questions/21864/whats-the-difference-between-user-login-and-access#21873
$data['session_id'] = $account->login * 1000;
}
return parent::import($data);
}
}


-webkit-rtl-ordering
Overrides ordering defaults for right-to-left content.
The distinction between these two character orders is normally handled automatically as a side effect of character set. This property allows you to override whether the browser should treat the content as being in logical or visual order.
-webkit-rtl-ordering: logical | visual;
Raw content is in mixed order (requiring a bidirectional renderer).
Right-to-left content is encoded in reverse order so an entire line of text can be rendered from left to right in a unidirectional fashion.


| Package | Description |
|---|---|
| org.opensaml.xml.security.keyinfo |
Interfaces and classes for working with XML KeyInfo elements.
|
| org.opensaml.xml.security.keyinfo.provider |
Specific implementations of
KeyInfoProvider . |
| org.opensaml.xml.signature |
XMLObject interfaces and helper classes for representing digitally signed content and signing/validating content.
|
| org.opensaml.xml.signature.impl |
Implementations of the interfaces for XMLObjects that represent XML signature types.
|
| org.opensaml.xml.signature.validator |
| Modifier and Type | Method and Description |
|---|---|
static DSAKeyValue |
KeyInfoHelper.buildDSAKeyValue(DSAPublicKey dsaPubKey)
Builds a
DSAKeyValue XMLObject from the Java security DSA public key type. |
| Modifier and Type | Method and Description |
|---|---|
static PublicKey |
KeyInfoHelper.getDSAKey(DSAKeyValue keyDescriptor)
Builds an DSA key from a
DSAKeyValue element. |
static PublicKey |
KeyInfoHelper.getDSAKey(DSAKeyValue keyDescriptor,
DSAParams dsaParams)
Builds a DSA key from an
DSAKeyValue element and the supplied Java DSAParams ,
which supplies key material from a shared key family. |
static boolean |
KeyInfoHelper.hasCompleteDSAParams(DSAKeyValue keyDescriptor)
Check whether the specified
DSAKeyValue element has the all optional DSA
values which can be shared amongst many keys in a DSA "key family", and
are presumed to be known from context. |
| Modifier and Type | Method and Description |
|---|---|
protected DSAKeyValue |
DSAKeyValueProvider.getDSAKeyValue(XMLObject xmlObject)
Get the DSAKeyValue from the passed XML object.
|
| Modifier and Type | Method and Description |
|---|---|
DSAKeyValue |
KeyValue.getDSAKeyValue()
Get the DSAKeyValue child element
|
| Modifier and Type | Method and Description |
|---|---|
void |
KeyValue.setDSAKeyValue(DSAKeyValue newDSAKeyValue)
Set the DSAKeyValue child element
|
| Modifier and Type | Class and Description |
|---|---|
class |
DSAKeyValueImpl
Concrete implementation of
DSAKeyValue |
| Modifier and Type | Field and Description |
|---|---|
private DSAKeyValue |
KeyValueImpl.dsaKeyValue
DSAKeyValue child element
|
| Modifier and Type | Method and Description |
|---|---|
DSAKeyValue |
DSAKeyValueBuilder.buildObject()
Builds an XMLObject using the default name and namespace information provided XML Signature specifications.
|
DSAKeyValue |
DSAKeyValueBuilder.buildObject(String namespaceURI,
String localName,
String namespacePrefix)
Creates an XMLObject with a given fully qualified name.
|
DSAKeyValue |
KeyValueImpl.getDSAKeyValue()
Get the DSAKeyValue child element
|
| Modifier and Type | Method and Description |
|---|---|
void |
KeyValueImpl.setDSAKeyValue(DSAKeyValue newDSAKeyValue)
Set the DSAKeyValue child element
|
| Modifier and Type | Method and Description |
|---|---|
void |
DSAKeyValueSchemaValidator.validate(DSAKeyValue xmlObject)
Checks to see if a XMLObject is valid.
|
protected void |
DSAKeyValueSchemaValidator.validateChildrenPresence(DSAKeyValue xmlObject)
Validate that all children are present.
|
Copyright © 1999-2014. All Rights Reserved.


Choose file
Load New Model
Please choose a valid file (*.ifc)!
#
Structure
Segment
Assembly Code
Area
Formwork Price
Material
Volume
Material Price
Total Price


Sanwo-Olu seeks $1bn infrastructure investment from China DFI
by Maureen Ihua-MaduenyiMaureen Ihua-Maduenyi
The Lagos State Governor, Mr Babajide Sanwo-Olu, has asked the China Development Bank to increase its investment in Nigeria to $1bn.
Sanwo-Olu, who made the request during a meeting with the bank’s President, Mr Quyang Weimin, said it would help the state’s infrastructural needs.
The state government said in a statement on Friday that the governor was embarking on an investment drive to China.
Sanwo-Olu was quoted to have said there were huge developmental projects in Lagos the bank could support the state in developing.
He said, “We are determined to build a 21st century economy, and infrastructural development is one of the key deliverables for a modern economic system and society to run efficiently and effectively.
“With functional infrastructure, businesses will thrive and the city will be more habitable. So, as a government, we are talking to you now about our needs and the areas of intervention where we require your support.
“Even though I know that you have to consider a lot of factors as a bank, I can assure you that you cannot get it wrong with Lagos and Nigeria as a whole.
“Lagos is Africa’s seventh largest economy and the most populous on the continent. The state has enjoyed political stability for 20 years and has consistently grown across key economic indices.”
He said the bank should be involved in the Fourth Mainland Bridge construction, railway projects, road construction around the free trade zone and water projects.
Weimin was also quoted to have said he had confidence in Lagos State and Nigeria.
He said, “I am particularly happy that Lagos State has a vibrant and visionary leader who is ready to take the state forward.
“We are different from commercial banks because we are focused on development and greater good of humanity. We give loans at the lowest cost and very long loan maturity period.”
Weimin said he had deep interest in the ideas and looked forward to supporting the state.
Copyright PUNCH.
All rights reserved. This material, and other digital content on this website, may not be reproduced, published, broadcast, rewritten or redistributed in whole or in part without prior express written permission from PUNCH.
Contact: theeditor@punchng.com


Selector: Rule: Value: Inclusive:
This is a paragraph. #div0.divsA>.psA
This is a paragraph. #div0.divsA>.psA
This is a paragraph. #div0.divsA>.psA
This is a paragraph. #div1.divsA>.psB
This is a paragraph. #div1.divsA>.psA
This is a paragraph. #div1.divsA>.psB
This is a paragraph. #div2.divsB>.psA
This is a paragraph. #div2.divsB>.psB
This is a paragraph. #div2.divsB>.psA
This is a paragraph. #div3.divsB>.psB
This is a paragraph. #div3.divsB>.psB
This is a paragraph. #div3.divsB>.psB
This is a paragraph. #div4.divsC>.psC
This is a paragraph. #div4.divsC>.psC
This is a paragraph. #div4.divsC>.psC


Oops, something's not quite right - we can't find that page!
Sorted has been redesigned so your page might have been removed or the link may be broken. Or there might be a typo in the address.
Sorted has been redesigned so your page might have been removed or the link may be broken. Or there might be a typo in the address.
Update your browser to view this website correctly. Update my browser now


--- layout: hub title: Hub Page Example excerpt: ---
Data Science is an amazing field of research that is under active development both from the academia and the industry. One of the saddest facts in the real-world is that most data science projects in organizations fail. Here I’ll present a new iteration of an agile framework called Business Science Problem Framework (Download PDF here) to implement data science in a way that enables decision making to follow a systematic process that connects the models you create to Return On Investment (ROI) and show the value that your improvements bring to the business. The end result is that the BSPF is an agile framework, and we are working to develop a new visualization (BSPF 2.0) that conveys this agility.
Because of that I’ll start this article with my definition (or description) of how data science should be defined for a business:
Data science is the resolution to business problems through mathematics, programming and the scientific method that involves the creation of hypotheses, experiments and tests through the analysis of data and the generation of predictive models. It is responsible for transforming these problems into well-posed questions that can also respond to the initial hypothesis in a creative way finding the optimal threshold that maximizes the expected profit or savings. It must also include the effective communication of the results obtained and how the solution adds value to the business.
I’ll explain my definition step by step below so stick with me.
Modeling is the process of understanding the “reality”, the world around us, but creating a higher level prototype that will describe the things we are seeing, hearing and feeling, but it’s a representative thing, not the “actual” or “real” thing. This is what we actually do in science and data science is no exception.
Because of that I’ll start this article with my definition (or description) of how data science should be defined for a business:
Data science is the resolution to business problems through mathematics, programming and the scientific method that involves the creation of hypotheses, experiments and tests through the analysis of data and the generation of predictive models. It is responsible for transforming these problems into well-posed questions that can also respond to the initial hypothesis in a creative way finding the optimal threshold that maximizes the expected profit or savings. It must also include the effective communication of the results obtained and how the solution adds value to the business.
I’ll explain my definition step by step below so stick with me.
Modeling is the process of understanding the “reality”, the world around us, but creating a higher level prototype that will describe the things we are seeing, hearing and feeling, but it’s a representative thing, not the “actual” or “real” thing. This is what we actually do in science and data science is no exception.
What I’m saying here is that data science is very much linked to the business, but it is a science in the end. A lot of people can disagree with me in the part that data science is a science. But keep your mind open and read this carefully. I think it could be very useful that we define data science as a science because, if that’s the case, every project in data science should be at least:
If we don’t follow those basic principles it would be very hard to conduct a proper data science practice. Data science should be implemented in a way that enables decision making to follow a systematic process.
.


Cloud Employee App
People
By last name
By department
By title
LOADING...
All form fields are required.
First Name
Last Name
Email
Phone
Birthdate
Title
Department
All form fields are required.
First Name
Last Name
Email
Phone
Birthdate
Title
Department


This is a notebook about physics. It’s not done yet. (Maybe I’ll never finish it because there are too many topics in physics.)
Use the source. Keep the source open.
Some notes continued from the full theoretical physics notes are here.
This work is licensed under a Attribution-NonCommercial-ShareAlike 3.0.
This open source project is hosted on GitHub: Physics Research Manual .


Do you have a normal group of friends you like to hang out with? Such as your Fantasy Football League, Thursday Movie Night, or Game night.
Even if you have a recurring event, plans tend to change or someone seems to always miss the updates.
With Our Events users can register under their group name and have a central hub to keep track of all upcoming plans. Any user to create, update, and text those within the group about the fun happenings to come.


{{ _('Wanna share a few more details?') }}
{{ _("If you do, you'll get to unlock even more cool challenges and get to see your Spark transform.") }}
{{ _('Click on the button below so we can find out where you are.') }}
{{ _("Select your location manually") }}
{% trans %} Did someone send you a spark? Enter their username or email address below so you guys can be connected, help visualize where your Spark has travelled and make cool stuff happen. {% endtrans %}


|
JavaTM 2 Platform Standard Ed. 5.0 |
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object java.lang.StringBuilder
public final class StringBuilder
A mutable sequence of characters. This class provides an API compatible
with StringBuffer
, but with no guarantee of synchronization.
This class is designed for use as a drop-in replacement for
StringBuffer
in places where the string buffer was being
used by a single thread (as is generally the case). Where possible,
it is recommended that this class be used in preference to
StringBuffer
as it will be faster under most implementations.
The principal operations on a StringBuilder
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 builder. The
append
method always adds these characters at the end
of the builder; the insert
method adds the characters at
a specified point.
For example, if z
refers to a string builder object
whose current contents are "start
", then
the method call z.append("le")
would cause the string
builder to contain "startle
", whereas
z.insert(4, "le")
would alter the string builder to
contain "starlet
".
In general, if sb refers to an instance of a StringBuilder
,
then sb.append(x)
has the same effect as
sb.insert(sb.length(), x)
.
Every string builder has a capacity. As long as the length of the
character sequence contained in the string builder does not exceed
the capacity, it is not necessary to allocate a new internal
buffer. If the internal buffer overflows, it is automatically made larger.
Instances of StringBuilder
are not safe for
use by multiple threads. If such synchronization is required then it is
recommended that StringBuffer
be used.
StringBuffer
,
String
,
Serialized Form| Constructor Summary | |
|---|---|
StringBuilder()
Constructs a string builder with no characters in it and an initial capacity of 16 characters. |
|
StringBuilder(CharSequence seq)
Constructs a string builder that contains the same characters as the specified CharSequence . |
|
StringBuilder(int capacity)
Constructs a string builder with no characters in it and an initial capacity specified by the capacity argument. |
|
StringBuilder(String str)
Constructs a string builder initialized to the contents of the specified string. |
| Method Summary | |
|---|---|
StringBuilder |
append(boolean b)
Appends the string representation of the boolean
argument to the sequence. |
StringBuilder |
append(char c)
Appends the string representation of the char
argument to this sequence. |
StringBuilder |
append(char[] str)
Appends the string representation of the char array
argument to this sequence. |
StringBuilder |
append(char[] str,
int offset,
int len)
Appends the string representation of a subarray of the char array argument to this sequence. |
StringBuilder |
append(CharSequence s)
Appends the specified character sequence to this Appendable. |
StringBuilder |
append(CharSequence s,
int start,
int end)
Appends a subsequence of the specified CharSequence to this
sequence. |
StringBuilder |
append(double d)
Appends the string representation of the double
argument to this sequence. |
StringBuilder |
append(float f)
Appends the string representation of the float
argument to this sequence. |
StringBuilder |
append(int i)
Appends the string representation of the int
argument to this sequence. |
StringBuilder |
append(long lng)
Appends the string representation of the long
argument to this sequence. |
StringBuilder |
append(Object obj)
Appends the string representation of the Object
argument. |
StringBuilder |
append(String str)
Appends the specified string to this character sequence. |
StringBuilder |
append(StringBuffer sb)
Appends the specified StringBuffer to this sequence. |
StringBuilder |
appendCodePoint(int codePoint)
Appends the string representation of the codePoint
argument to this sequence. |
int |
capacity()
Returns the current capacity. |
char |
charAt(int index)
Returns the char value in this sequence at the specified index. |
int |
codePointAt(int index)
Returns the character (Unicode code point) at the specified index. |
int |
codePointBefore(int index)
Returns the character (Unicode code point) before the specified index. |
int |
codePointCount(int beginIndex,
int endIndex)
Returns the number of Unicode code points in the specified text range of this sequence. |
StringBuilder |
delete(int start,
int end)
Removes the characters in a substring of this sequence. |
StringBuilder |
deleteCharAt(int index)
Removes the char at the specified position in this
sequence. |
void |
ensureCapacity(int minimumCapacity)
Ensures that the capacity is at least equal to the specified minimum. |
void |
getChars(int srcBegin,
int srcEnd,
char[] dst,
int dstBegin)
Characters are copied from this sequence into the destination character array dst . |
int |
indexOf(String str)
Returns the index within this string of the first occurrence of the specified substring. |
int |
indexOf(String str,
int fromIndex)
Returns the index within this string of the first occurrence of the specified substring, starting at the specified index. |
StringBuilder |
insert(int offset,
boolean b)
Inserts the string representation of the boolean
argument into this sequence. |
StringBuilder |
insert(int offset,
char c)
Inserts the string representation of the char
argument into this sequence. |
StringBuilder |
insert(int offset,
char[] str)
Inserts the string representation of the char array
argument into this sequence. |
StringBuilder |
insert(int index,
char[] str,
int offset,
int len)
Inserts the string representation of a subarray of the str
array argument into this sequence. |
StringBuilder |
insert(int dstOffset,
CharSequence s)
Inserts the specified CharSequence into this sequence. |
StringBuilder |
insert(int dstOffset,
CharSequence s,
int start,
int end)
Inserts a subsequence of the specified CharSequence into
this sequence. |
StringBuilder |
insert(int offset,
double d)
Inserts the string representation of the double
argument into this sequence. |
StringBuilder |
insert(int offset,
float f)
Inserts the string representation of the float
argument into this sequence. |
StringBuilder |
insert(int offset,
int i)
Inserts the string representation of the second int
argument into this sequence. |
StringBuilder |
insert(int offset,
long l)
Inserts the string representation of the long
argument into this sequence. |
StringBuilder |
insert(int offset,
Object obj)
Inserts the string representation of the Object
argument into this character sequence. |
StringBuilder |
insert(int offset,
String str)
Inserts the string into this character sequence. |
int |
lastIndexOf(String str)
Returns the index within this string of the rightmost occurrence of the specified substring. |
int |
lastIndexOf(String str,
int fromIndex)
Returns the index within this string of the last occurrence of the specified substring. |
int |
length()
Returns the length (character count). |
int |
offsetByCodePoints(int index,
int codePointOffset)
Returns the index within this sequence that is offset from the given index by codePointOffset code
points. |
StringBuilder |
replace(int start,
int end,
String str)
Replaces the characters in a substring of this sequence with characters in the specified String . |
StringBuilder |
reverse()
Causes this character sequence to be replaced by the reverse of the sequence. |
void |
setCharAt(int index,
char ch)
The character at the specified index is set to ch . |
void |
setLength(int newLength)
Sets the length of the character sequence. |
CharSequence |
subSequence(int start,
int end)
Returns a new character sequence that is a subsequence of this sequence. |
String |
substring(int start)
Returns a new String that contains a subsequence of
characters currently contained in this character sequence. |
String |
substring(int start,
int end)
Returns a new String that contains a subsequence of
characters currently contained in this sequence. |
String |
toString()
Returns a string representing the data in this sequence. |
void |
trimToSize()
Attempts to reduce storage used for the character sequence. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface java.lang.CharSequence |
|---|
charAt, length, subSequence |
| Constructor Detail |
|---|
public StringBuilder()
public StringBuilder(int capacity)
capacity
argument.
capacity
- the initial capacity.
NegativeArraySizeException
- if the capacity
argument is less than 0
.public StringBuilder(String str)
16
plus the length of the string argument.
str
- the initial contents of the buffer.
NullPointerException
- if str
is null
public StringBuilder(CharSequence seq)
CharSequence
. The initial capacity of
the string builder is 16
plus the length of the
CharSequence
argument.
seq
- the sequence to copy.
NullPointerException
- if seq
is null
| Method Detail |
|---|
public StringBuilder append(Object obj)
Object
argument.
The argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then appended to this sequence.
obj
- an Object
.
String.valueOf(java.lang.Object)
,
append(java.lang.String)
public StringBuilder append(String str)
The characters of the String
argument are appended, in
order, increasing the length of this sequence by the length of the
argument. If str
is null
, then the four
characters "null"
are appended.
Let n be the length of this character sequence just prior to
execution of the append
method. Then the character at
index k in the new character sequence is equal to the character
at index k in the old character sequence, if k is less
than n; otherwise, it is equal to the character at index
k-n in the argument str
.
str
- a string.
public StringBuilder append(StringBuffer sb)
The characters of the StringBuffer argument are appended, in order, to this sequence, increasing the length of this sequence by the length of the argument. If sb is null, then the four characters "null" are appended to this sequence.
Let n be the length of this character sequence just prior to
execution of the append method. Then the character at index
k in the new character sequence is equal to the character at
index k in the old character sequence, if k is less than
n; otherwise, it is equal to the character at index k-n
in the argument sb
.
sb
- the StringBuffer to append.
public StringBuilder append(CharSequence s)
Appendable
Depending on which class implements the character sequence
csq, the entire sequence may not be appended. For
instance, if csq is a CharBuffer
then
the subsequence to append is defined by the buffer's position and limit.
append
in interface Appendable
s
- The character sequence to append. If csq is
null, then the four characters "null" are
appended to this Appendable.
IndexOutOfBoundsException
public StringBuilder append(CharSequence s, int start, int end)
CharSequence
to this
sequence.
Characters of the argument s
, starting at
index start
, are appended, in order, to the contents of
this sequence up to the (exclusive) index end
. The length
of this sequence is increased by the value of end - start
.
Let n be the length of this character sequence just prior to
execution of the append
method. Then the character at
index k in this character sequence becomes equal to the
character at index k in this sequence, if k is less than
n; otherwise, it is equal to the character at index
k+start-n in the argument s
.
If s
is null
, then this method appends
characters as if the s parameter was a sequence containing the four
characters "null"
.
append
in interface Appendable
s
- the sequence to append.start
- the starting index of the subsequence to be appended.end
- the end index of the subsequence to be appended.
IndexOutOfBoundsException
- if
start
or end
are negative, or
start
is greater than end
or
end
is greater than s.length()
public StringBuilder append(char[] str)
char
array
argument to this sequence.
The characters of the array argument are appended, in order, to the contents of this sequence. The length of this sequence increases by the length of the argument.
The overall effect is exactly as if the argument were converted to
a string by the method String.valueOf(char[])
and the
characters of that string were then appended
to this character sequence.
str
- the characters to be appended.
public StringBuilder append(char[] str, int offset, int len)
char
array argument to this sequence.
Characters of the char
array str
, starting at
index offset
, are appended, in order, to the contents
of this sequence. The length of this sequence increases
by the value of len
.
The overall effect is exactly as if the arguments were converted to
a string by the method String.valueOf(char[],int,int)
and the
characters of that string were then appended
to this character sequence.
str
- the characters to be appended.offset
- the index of the first char
to append.len
- the number of char
s to append.
public StringBuilder append(boolean b)
boolean
argument to the sequence.
The argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then appended to this sequence.
b
- a boolean
.
String.valueOf(boolean)
,
append(java.lang.String)
public StringBuilder append(char c)
char
argument to this sequence.
The argument is appended to the contents of this sequence.
The length of this sequence increases by 1
.
The overall effect is exactly as if the argument were converted to
a string by the method String.valueOf(char)
and the character
in that string were then appended
to this
character sequence.
append
in interface Appendable
c
- a char
.
public StringBuilder append(int i)
int
argument to this sequence.
The argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then appended to this sequence.
i
- an int
.
String.valueOf(int)
,
append(java.lang.String)
public StringBuilder append(long lng)
long
argument to this sequence.
The argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then appended to this sequence.
lng
- a long
.
String.valueOf(long)
,
append(java.lang.String)
public StringBuilder append(float f)
float
argument to this sequence.
The argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then appended to this string sequence.
f
- a float
.
String.valueOf(float)
,
append(java.lang.String)
public StringBuilder append(double d)
double
argument to this sequence.
The argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then appended to this sequence.
d
- a double
.
String.valueOf(double)
,
append(java.lang.String)
public StringBuilder appendCodePoint(int codePoint)
codePoint
argument to this sequence.
The argument is appended to the contents of this sequence.
The length of this sequence increases by
Character.charCount(codePoint)
.
The overall effect is exactly as if the argument were
converted to a char
array by the method Character.toChars(int)
and the character in that array were
then appended
to this character
sequence.
codePoint
- a Unicode code point
public StringBuilder delete(int start, int end)
start
and extends to
the character at index end - 1
or to the end of the
sequence if no such character exists. If
start
is equal to end
, no changes are made.
start
- The beginning index, inclusive.end
- The ending index, exclusive.
StringIndexOutOfBoundsException
- if start
is negative, greater than length()
, or
greater than end
.public StringBuilder deleteCharAt(int index)
char
at the specified position in this
sequence. This sequence is shortened by one char
.
Note: If the character at the given index is a supplementary
character, this method does not remove the entire character. If
correct handling of supplementary characters is required,
determine the number of char
s to remove by calling
Character.charCount(thisSequence.codePointAt(index))
,
where thisSequence
is this sequence.
index
- Index of char
to remove
StringIndexOutOfBoundsException
- if the index
is negative or greater than or equal to
length()
.public StringBuilder replace(int start, int end, String str)
String
. The substring
begins at the specified start
and extends to the character
at index end - 1
or to the end of the
sequence if no such character exists. First the
characters in the substring are removed and then the specified
String
is inserted at start
. (This
sequence will be lengthened to accommodate the
specified String if necessary.)
start
- The beginning index, inclusive.end
- The ending index, exclusive.str
- String that will replace previous contents.
StringIndexOutOfBoundsException
- if start
is negative, greater than length()
, or
greater than end
.public StringBuilder insert(int index, char[] str, int offset, int len)
str
array argument into this sequence. The subarray begins at the
specified offset
and extends len
char
s.
The characters of the subarray are inserted into this sequence at
the position indicated by index
. The length of this
sequence increases by len
char
s.
index
- position at which to insert subarray.str
- A char
array.offset
- the index of the first char
in subarray to
be inserted.len
- the number of char
s in the subarray to
be inserted.
StringIndexOutOfBoundsException
- if index
is negative or greater than length()
, or
offset
or len
are negative, or
(offset+len)
is greater than
str.length
.public StringBuilder insert(int offset, Object obj)
Object
argument into this character sequence.
The second argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then inserted into this sequence at the indicated
offset.
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
sequence.
offset
- the offset.obj
- an Object
.
StringIndexOutOfBoundsException
- if the offset is invalid.String.valueOf(java.lang.Object)
,
insert(int, java.lang.String)
,
length()
public StringBuilder insert(int offset, String str)
The characters of the String
argument are inserted, in
order, into this sequence at the indicated offset, moving up any
characters originally above that position and increasing the length
of this sequence by the length of the argument. If
str
is null
, then the four characters
"null"
are inserted into this sequence.
The character at index k in the new character sequence is equal to:
offset
-offset
in the
argument str
, if k is not less than
offset
but is less than offset+str.length()
-str.length()
in the
old character sequence, if k is not less than
offset+str.length()
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
sequence.
offset
- the offset.str
- a string.
StringIndexOutOfBoundsException
- if the offset is invalid.length()
public StringBuilder insert(int offset, char[] str)
char
array
argument into this sequence.
The characters of the array argument are inserted into the
contents of this sequence at the position indicated by
offset
. The length of this sequence increases by
the length of the argument.
The overall effect is exactly as if the argument were converted to
a string by the method String.valueOf(char[])
and the
characters of that string were then
inserted
into this
character sequence at the position indicated by
offset
.
offset
- the offset.str
- a character array.
StringIndexOutOfBoundsException
- if the offset is invalid.public StringBuilder insert(int dstOffset, CharSequence s)
CharSequence
into this sequence.
The characters of the CharSequence
argument are inserted,
in order, into this sequence at the indicated offset, moving up
any characters originally above that position and increasing the length
of this sequence by the length of the argument s.
The result of this method is exactly the same as if it were an invocation of this object's insert(dstOffset, s, 0, s.length()) method.
If s
is null
, then the four characters
"null"
are inserted into this sequence.
dstOffset
- the offset.s
- the sequence to be inserted
IndexOutOfBoundsException
- if the offset is invalid.public StringBuilder insert(int dstOffset, CharSequence s, int start, int end)
CharSequence
into
this sequence.
The subsequence of the argument s
specified by
start
and end
are inserted,
in order, into this sequence at the specified destination offset, moving
up any characters originally above that position. The length of this
sequence is increased by end - start
.
The character at index k in this sequence becomes equal to:
dstOffset
+start-dstOffset
in
the argument s
, if k is greater than or equal to
dstOffset
but is less than dstOffset+end-start
-(end-start)
in this
sequence, if k is greater than or equal to
dstOffset+end-start
The dstOffset argument must be greater than or equal to
0
, and less than or equal to the length of this
sequence.
The start argument must be nonnegative, and not greater than
end
.
The end argument must be greater than or equal to
start
, and less than or equal to the length of s.
If s
is null
, then this method inserts
characters as if the s parameter was a sequence containing the four
characters "null"
.
dstOffset
- the offset in this sequence.s
- the sequence to be inserted.start
- the starting index of the subsequence to be inserted.end
- the end index of the subsequence to be inserted.
IndexOutOfBoundsException
- if dstOffset
is negative or greater than this.length()
, or
start
or end
are negative, or
start
is greater than end
or
end
is greater than s.length()
public StringBuilder insert(int offset, boolean b)
boolean
argument into this sequence.
The second argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then inserted into this sequence at the indicated
offset.
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
sequence.
offset
- the offset.b
- a boolean
.
StringIndexOutOfBoundsException
- if the offset is invalid.String.valueOf(boolean)
,
insert(int, java.lang.String)
,
length()
public StringBuilder insert(int offset, char c)
char
argument into this sequence.
The second argument is inserted into the contents of this sequence
at the position indicated by offset
. The length
of this sequence increases by one.
The overall effect is exactly as if the argument were converted to
a string by the method String.valueOf(char)
and the character
in that string were then inserted
into
this character sequence at the position indicated by
offset
.
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
sequence.
offset
- the offset.c
- a char
.
IndexOutOfBoundsException
- if the offset is invalid.length()
public StringBuilder insert(int offset, int i)
int
argument into this sequence.
The second argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then inserted into this sequence at the indicated
offset.
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
sequence.
offset
- the offset.i
- an int
.
StringIndexOutOfBoundsException
- if the offset is invalid.String.valueOf(int)
,
insert(int, java.lang.String)
,
length()
public StringBuilder insert(int offset, long l)
long
argument into this sequence.
The second argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then inserted into this sequence at the position
indicated by offset
.
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
sequence.
offset
- the offset.l
- a long
.
StringIndexOutOfBoundsException
- if the offset is invalid.String.valueOf(long)
,
insert(int, java.lang.String)
,
length()
public StringBuilder insert(int offset, float f)
float
argument into this sequence.
The second argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then inserted into this sequence at the indicated
offset.
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
sequence.
offset
- the offset.f
- a float
.
StringIndexOutOfBoundsException
- if the offset is invalid.String.valueOf(float)
,
insert(int, java.lang.String)
,
length()
public StringBuilder insert(int offset, double d)
double
argument into this sequence.
The second argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then inserted into this sequence at the indicated
offset.
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
sequence.
offset
- the offset.d
- a double
.
StringIndexOutOfBoundsException
- if the offset is invalid.String.valueOf(double)
,
insert(int, java.lang.String)
,
length()
public int indexOf(String str)
isthis.toString().startsWith(str, k)
true
.
str
- any string.
-1
is returned.
NullPointerException
- if str
is
null
.public int indexOf(String str, int fromIndex)
If no such value of k exists, then -1 is returned.k >= Math.min(fromIndex, str.length()) && this.toString().startsWith(str, k)
str
- the substring for which to search.fromIndex
- the index from which to start the search.
NullPointerException
- if str
is
null
.public int lastIndexOf(String str)
this.length()
.
The returned index is the largest value k such that
is true.this.toString().startsWith(str, k)
str
- the substring to search for.
-1
is returned.
NullPointerException
- if str
is
null
.public int lastIndexOf(String str, int fromIndex)
If no such value of k exists, then -1 is returned.k <= Math.min(fromIndex, str.length()) && this.toString().startsWith(str, k)
str
- the substring to search for.fromIndex
- the index to start the search from.
NullPointerException
- if str
is
null
.public StringBuilder reverse()
char
values) just prior to
execution of the reverse
method. Then the
character at index k in the new character sequence is
equal to the character at index n-k-1 in the old
character sequence.
Note that the reverse operation may result in producing surrogate pairs that were unpaired low-surrogates and high-surrogates before the operation. For example, reversing "\uDC00\uD800" produces "\uD800\uDC00" which is a valid surrogate pair.
public String toString()
String
object is allocated and initialized to
contain the character sequence currently represented by this
object. This String
is then returned. Subsequent
changes to this sequence do not affect the contents of the
String
.
toString
in interface CharSequence
public int length()
length
in interface CharSequence
public int capacity()
public void ensureCapacity(int minimumCapacity)
minimumCapacity
argument.
2
.
minimumCapacity
argument is nonpositive, this
method takes no action and simply returns.
minimumCapacity
- the minimum desired capacity.public void trimToSize()
capacity()
method.
public void setLength(int newLength)
newLength
, the character at
index k in the new character sequence is the same as the
character at index k in the old sequence if k is less
than the length of the old character sequence; otherwise, it is the
null character '\u0000'
.
In other words, if the newLength
argument is less than
the current length, the length is changed to the specified length.
If the newLength
argument is greater than or equal
to the current length, sufficient null characters
('\u0000'
) are appended so that
length becomes the newLength
argument.
The newLength
argument must be greater than or equal
to 0
.
newLength
- the new length
IndexOutOfBoundsException
- if the
newLength
argument is negative.public char charAt(int index)
char
value in this sequence at the specified index.
The first char
value is at index 0
, the next at index
1
, and so on, as in array indexing.
The index argument must be greater than or equal to
0
, and less than the length of this sequence.
If the char
value specified by the index is a
surrogate, the surrogate
value is returned.
charAt
in interface CharSequence
index
- the index of the desired char
value.
char
value at the specified index.
IndexOutOfBoundsException
- if index
is
negative or greater than or equal to length()
.public int codePointAt(int index)
char
values
(Unicode code units) and ranges from 0
to
length()
- 1
.
If the char
value specified at the given index
is in the high-surrogate range, the following index is less
than the length of this sequence, and the
char
value at the following index is in the
low-surrogate range, then the supplementary code point
corresponding to this surrogate pair is returned. Otherwise,
the char
value at the given index is returned.
index
- the index to the char
values
index
IndexOutOfBoundsException
- if the index
argument is negative or not less than the length of this
sequence.public int codePointBefore(int index)
char
values
(Unicode code units) and ranges from 1
to length()
.
If the char
value at (index - 1)
is in the low-surrogate range, (index - 2)
is not
negative, and the char
value at (index -
2)
is in the high-surrogate range, then the
supplementary code point value of the surrogate pair is
returned. If the char
value at index -
1
is an unpaired low-surrogate or a high-surrogate, the
surrogate value is returned.
index
- the index following the code point that should be returned
IndexOutOfBoundsException
- if the index
argument is less than 1 or greater than the length
of this sequence.public int codePointCount(int beginIndex, int endIndex)
beginIndex
and extends to the char
at
index endIndex - 1
. Thus the length (in
char
s) of the text range is
endIndex-beginIndex
. Unpaired surrogates within
this sequence count as one code point each.
beginIndex
- the index to the first char
of
the text range.endIndex
- the index after the last char
of
the text range.
IndexOutOfBoundsException
- if the
beginIndex
is negative, or endIndex
is larger than the length of this sequence, or
beginIndex
is larger than endIndex
.public int offsetByCodePoints(int index, int codePointOffset)
index
by codePointOffset
code
points. Unpaired surrogates within the text range given by
index
and codePointOffset
count as
one code point each.
index
- the index to be offsetcodePointOffset
- the offset in code points
IndexOutOfBoundsException
- if index
is negative or larger then the length of this sequence,
or if codePointOffset
is positive and the subsequence
starting with index
has fewer than
codePointOffset
code points,
or if codePointOffset
is negative and the subsequence
before index
has fewer than the absolute value of
codePointOffset
code points.public void getChars(int srcBegin, int srcEnd, char[] dst, int dstBegin)
dst
. The first character to
be copied is at index srcBegin
; the last character to
be copied is at index srcEnd-1
. The total number of
characters to be copied is srcEnd-srcBegin
. The
characters are copied into the subarray of dst
starting
at index dstBegin
and ending at index:
dstbegin + (srcEnd-srcBegin) - 1
srcBegin
- start copying at this offset.srcEnd
- stop copying at this offset.dst
- the array to copy the data into.dstBegin
- offset into dst
.
NullPointerException
- if dst
is
null
.
IndexOutOfBoundsException
- if any of the following is true:
srcBegin
is negative
dstBegin
is negative
srcBegin
argument is greater than
the srcEnd
argument.
srcEnd
is greater than
this.length()
.
dstBegin+srcEnd-srcBegin
is greater than
dst.length
public void setCharAt(int index, char ch)
ch
. This
sequence is altered to represent a new character sequence that is
identical to the old character sequence, except that it contains the
character ch
at position index
.
The index argument must be greater than or equal to
0
, and less than the length of this sequence.
index
- the index of the character to modify.ch
- the new character.
IndexOutOfBoundsException
- if index
is
negative or greater than or equal to length()
.public String substring(int start)
String
that contains a subsequence of
characters currently contained in this character sequence. The
substring begins at the specified index and extends to the end of
this sequence.
start
- The beginning index, inclusive.
StringIndexOutOfBoundsException
- if start
is
less than zero, or greater than the length of this object.public CharSequence subSequence(int start, int end)
An invocation of this method of the form
behaves in exactly the same way as the invocationsb.subSequence(begin, end)
This method is provided so that this class can implement thesb.substring(begin, end)
CharSequence
interface.
subSequence
in interface CharSequence
start
- the start index, inclusive.end
- the end index, exclusive.
IndexOutOfBoundsException
- if start or end are negative,
if end is greater than length(),
or if start is greater than endpublic String substring(int start, int end)
String
that contains a subsequence of
characters currently contained in this sequence. The
substring begins at the specified start
and
extends to the character at index end - 1
.
start
- The beginning index, inclusive.end
- The ending index, exclusive.
StringIndexOutOfBoundsException
- if start
or end
are negative or greater than
length()
, or start
is
greater than end
.
|
JavaTM 2 Platform Standard Ed. 5.0 |
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
Copyright © 2004, 2010 Oracle and/or its affiliates. All rights reserved. Use is subject to license terms. Also see the documentation redistribution policy.


High-volume, IoT sensor interface and actuator full-custom ASIC.
A family of high-performance projective capacitive touchscreen Agile ASICs™ for large screen applications.
Rapid prototyping – 60 days and cost-sensitive high-volume application – 50M units per year. Triad’s Hyper Agile ASIC™.


WebGL Globe
Created by the
Google Data Arts Team
Released under the
Apache License
The data on the globe shows world population in 2005 from
sedac
.


reldate [OPTIONS] [TIME_DESCRPTION]
reldate is a small command line utility which returns the relative date in YYYY-MM-DD format. This is helpful when scripting various time relationships. The difference in time returned are determined by the time increments provided.
Time increments are a positive or negative integer. Time unit can be either day(s), week(s), month(s), or year(s). Weekday names are case insentive (e.g. Monday and monday). They can be abbreviated to the first three letters of the name, e.g. Sunday can be Sun, Monday can be Mon, Tuesday can be Tue, Wednesday can be Wed, Thursday can be Thu, Friday can be Fri or Saturday can be Sat.
Below are a set of options available.
-e, -end-of-month Display the end of month day. E.g. 2012-02-29
-examples display example(s)
-f, -from Date the relative time is calculated from.
-generate-manpage generate man page
-generate-markdown generate markdown documentation
-h, -help display help
-l, -license display license
-nl, -newline if true add a trailing newline
-quiet suppress error messages
-v, -version display version
If today was 2014-08-03 and you wanted the date three days in the past try–
reldate 3 days
The output would be
2014-08-06
TIME UNITS
Supported time units are
Specifying a date to calucate from
reldate handles dates in the YYYY-MM-DD format (e.g. March 1, 2014 would be 2014-03-01). By default reldate uses today as the date to calculate relative time from. If you use the –from option you can it will calculate the relative date from that specific date.
reldate –from=2014-08-03 3 days
Will yield
2014-08-06
NEGATIVE INCREMENTS
Command line arguments traditionally start with a dash which we also use to denote a nagative number. To tell the command line process that to not treat negative numbers as an “option” precede your time increment and time unit with a double dash.
reldate --from=2014-08-03 -- -3 days
Will yield
2014-07-31
RELATIVE WEEK DAYS
You can calculate a date from a weekday name (e.g. Saturday, Monday, Tuesday) knowning a day (e.g. 2015-02-10 or the current date of the week) occurring in a week. A common case would be wanting to figure out the Monday date of a week containing 2015-02-10. The week is presumed to start on Sunday (i.e. 0) and finish with Saturday (e.g. 6).
reldate --from=2015-02-10 Monday
will yield
2015-02-09
As that is the Monday of the week containing 2015-02-10. Weekday names case insensitive and can be the first three letters of the English names or full English names (e.g. Monday, monday, Mon, mon).
reldate v0.0.25