Class
IndexIndices are data structures which contain preprocessing data of a fixed text (or set of texts). In combination
with a Finder or an VSTreeIterator it allows fast dictionary look-up and advanced computations.
| All Subcl's | FMIndex, IndexDfi, IndexEsa, IndexQGram, IndexSa, IndexWotd, OpenAddressingQGramIndex, PizzaChiliIndex |
|---|---|
| Defined in | <seqan/index.h> |
| Signature |
class Index<TText[, TSpec]>;
|
Interface Function Overview
-
void clear(index);
Resets all fibres of an index. -
TSize countSequences(index);
Return the number of sequences in an index' underlying text. -
TFibre getFibre(index, fibreTag);
Returns a specific fibre of a container. -
bool indexCreate(index, fibreTag[, algoTag]);
Creates a specific Fibre. -
TFibre indexRawText(position, index);
Shortcut for $getFibre(.., FibreRawText). -
bool indexRequire(index, fibreTag);
On-demand creation of a specific Fibre. -
bool indexSupplied(index, fibreTag);
Returns whether a specific Fibre is present. -
TFibre indexText(index);
Shortcut for getFibre(.., EsaText). -
TSize length(index);
Returns the number of characters in the underlying text of the index. -
bool open(index, fileName[, mode]);
This functions opens an index from disk. -
TValue rawtextAt(position, index);
Shortcut for value(indexRawText(..), ..). -
bool save(index, fileName[, mode]);
This functions saves an index to disk.
Interface Metafunction Overview
-
DefaultIndexCreator<TIndex, TFibre>::Type;
Default algorithm to create a demanded and not yet existing Fibre. -
DefaultIndexSpec<TText>::Type;
Default Index specialization type. -
DefaultIndexStringSpec<TIndex>::Type;
-
GetVSTreeIteratorTraits<TIterator>::Type
Default behaviour of goNext when no second parameter is given. -
Size<TIndex>::Type;
Returns the size type of an Index.
Detailed Description
An index contains various arrays or objects, also called fibres (see Fibre). These fibres are created on demand depending on the requirements of an algorithm. To force the fibre creation you can use the function indexCreate. The list of fibres is available in Fibre
Examples
The following code shows how to search for exact matches between the reference "tobeornottobe" and the pattern "to" with the means of a Finder.
#include <seqan/index.h> using namespace seqan; int main() { typedef Index<CharString> TIndex; TIndex index("tobeornottobe"); Finder<TIndex> finder(index); // The Finder object has a pointer to the first, current and last hit // Each consecutive call sets the current pointer to the appropriate hit while (find(finder, "to")) std::cout << "Hit at position: " << position(finder) << std::endl; return 0; }
The result is as follows
Hit at position: 9 Hit at position: 0
This code shows how an index can be used with iterators to achieve a pre-order tree like traversal in DFS of the text "tobeornottobe". In order to do so a Top-Down History iterator is used.
#include <seqan/index.h> using namespace seqan; int main() { typedef Index<CharString> TIndex; TIndex index("tobeornottobe"); Iterator<TIndex, TopDown<ParentLinks<> > >::Type it(index); do { // Print the letters from the root to the current node std::cout << representative(it) << std::endl; if (!goDown(it) && !goRight(it)) while (goUp(it) && !goRight(it)) ; } while (!isRoot(it)); return 0; }
The result is as follows
be beornottobe e eornottobe nottobe o obe obeornottobe ornottobe ottobe rnottobe t tobe tobeornottobe ttobe
Note that you can also use specialized iterators such as:
Iterator<TIndex, TopDown<ParentLinks<PreOrder> > >::Type
or
Iterator<TIndex, TopDown<ParentLinks<PostOrder> > >::Type
You can achieve a post-order traversal like this:
Iterator<TIndex, TopDown<ParentLinks<Postorder> > >::Type it(index); goBegin(it); while (!atEnd(it)) { std::cout << representative(it) << std::endl; ++it; }
The result is as follows
beornottobe be eornottobe e nottobe obeornottobe obe ornottobe ottobe o rnottobe tobeornottobe tobe ttobe t
Interface Functions Detail
void clear(index);
Parameters
index
|
The index to be cleared. |
|---|
Data Races
TSize countSequences(index);
Parameters
index
|
The index to return the number of sequences of. |
|---|
Returns
TSize |
The number of sequences in the index' underlying text with TSize being the result Size. |
|---|
Examples
The following example shows how to count characters of an index, determine the number of sequences involved and how to search for a pattern.
#include <seqan/index.h> using namespace seqan; int main() { typedef StringSet<String<char> > TText; typedef Index<TText> TIndex; TText text; appendValue(text, "MISSISSIPPI"); appendValue(text, "MYMISSISAHAPPY"); TIndex index(text); Finder<TIndex> finder(index); std::cout << "The text has " << length(index) << " characters and consists of " << countSequences(index) << " sequences." << std::endl; // The Finder object has a pointer to the first, current and last hit // Each consecutive call sets the current pointer to the appropriate hit while (find(finder, "MISS")) std::cout << "Hit at position: " << position(finder) << std::endl; return 0; }
The output is as follows:
The text has 25 characters and consists of 2 sequences. Hit at position: < 1 , 2 > Hit at position: < 0 , 0 >
Data Races
TFibre getFibre(index, fibreTag);
Parameters
index
|
The container holding the fibre. |
|---|---|
fibreTag
|
A tag that identifies the Fibre. Types: Index Esa Fibres, FM Index Fibres, Index Wotd Fibres, and Index QGram Fibres. |
Returns
TFibre |
A reference to the Fibre object. |
|---|
Examples
The following example shows how to search for a pattern in a string.
#include <seqan/index.h> using namespace seqan; int main() { typedef StringSet<String<char> > TText; typedef Index<TText> TIndex; typedef SAValue<TIndex>::Type TSAValue; TText text; appendValue(text, "MISSISSIPPI"); appendValue(text, "MYMISSISAHAPPY"); TIndex index(text); Iterator<TIndex, TopDown<> >::Type it(index); goDown(it, "SSI"); std::cout << "SSI occurs in " << getFrequency(it) << " sequences." << std::endl; // 1 alternative to print the location of hits String<TSAValue> saPositions = getOccurrences(it); for (unsigned i = 0; i < length(saPositions); ++i) std::cout << "Hit in sequence " << saPositions[i].i1 << " at position " << saPositions[i].i2 << std::endl; std::cout << "----------------------------" << std::endl; // 2 alternative to print the location of hits Pair<unsigned> hitInterval = range(it); for (; hitInterval.i1 < hitInterval.i2; ++hitInterval.i1) std::cout << "Hit in sequence " << getFibre(index, FibreSA())[hitInterval.i1].i1 << " at position " << getFibre(index, FibreSA())[hitInterval.i1].i2 << std::endl; return 0; }
The output is as follows:
SSI occurs in 2 sequences. Hit in sequence 0 at position 5 Hit in sequence 1 at position 4 Hit in sequence 0 at position 2 ---------------------------- Hit in sequence 0 at position 5 Hit in sequence 1 at position 4 Hit in sequence 0 at position 2
Data Races
See Also
bool indexCreate(index, fibreTag[, algoTag]);
Parameters
fibreTag
|
A tag that identifies the Fibre |
|---|---|
algoTag
|
A tag that identifies the algorithm which is used to create the fibre. Default: The result of DefaultIndexCreator. |
index
|
The Index object holding the fibre. |
Returns
bool |
true on a success and false otherwise |
|---|
indexCreate calls the fibre corresponding createXXX(..) function (e.g. createSuffixArray).
Data Races
TFibre indexRawText(position, index);
Parameters
position
|
A position in the array on which the value should be accessed. |
|---|---|
index
|
The Index object. |
Returns
TFibre |
A reference or proxy to the value. |
|---|
Data Races
bool indexRequire(index, fibreTag);
Parameters
index
|
The Index object holding the fibre. |
|---|---|
fibreTag
|
A tag that identifies the Fibre |
Returns
bool |
true on a successful creation. |
|---|
If the fibre already exists (indexSupplied is true) then indexRequire does nothing. If the fibre doesn't exist then indexCreate is called to create it.
Examples
The following code shows how the BWT of an text can be computed.
#include <seqan/index.h> using namespace seqan; int main() { Index<String<char> > index("MISSISSIPPI"); // Because indices are build on demand we force the index creation here. indexRequire(index, FibreSA()); std::cout << "BWT\tSuffices" << std::endl; for (unsigned i = 0; i < length(indexSA(index)); ++i) { unsigned textPos = (saAt(i, index) == 0) ? length(index) - 1 : saAt(i, index) - 1; std::cout << textAt(textPos, index) << "\t" << suffix(indexText(index), textPos) << std::endl; } return 0; }
The output is as follows:
BWT Suffices P PI S SIPPI S SISSIPPI M MISSISSIPPI I I P PPI I IPPI S SSIPPI S SSISSIPPI I ISSIPPI I ISSISSIPPI
Data Races
bool indexSupplied(index, fibreTag);
Parameters
index
|
The Index object holding the fibre. |
|---|---|
fibreTag
|
A tag that identifies the Fibre Index Fibres. |
Returns
bool |
true, iff the fibre is present. |
|---|
Data Races
TFibre indexText(index);
The result of this function when used on an Index<TText, FMIndex<TOccSpec, CompressText> > is not defined.
Parameters
index
|
The Index object holding the fibre. |
|---|
Returns
TFibre |
A reference to the text of the index. |
|---|
Examples
The following code shows how the BWT of a text can be computed.
#include <seqan/index.h> using namespace seqan; int main() { Index<String<char> > index("MISSISSIPPI"); // Because indices are build on demand we force the index creation here. indexRequire(index, FibreSA()); std::cout << "BWT\tSuffices" << std::endl; for (unsigned i = 0; i < length(indexSA(index)); ++i) { unsigned textPos = (saAt(i, index) == 0) ? length(index) - 1 : saAt(i, index) - 1; std::cout << textAt(textPos, index) << "\t" << suffix(indexText(index), textPos) << std::endl; } return 0; }
The output is as follows:
BWT Suffices P PI S SIPPI S SISSIPPI M MISSISSIPPI I I P PPI I IPPI S SSIPPI S SSISSIPPI I ISSIPPI I ISSISSIPPI
Data Races
TSize length(index);
Parameters
index
|
An index of a text. |
|---|
Returns
TSize |
Returns the number of characters in the raw underlying text of the index with TSize being the result of the Size meta-function of Index. |
|---|
Examples
The following example shows how to count characters of an index, determine the number of sequences involved and how to search for a pattern.
#include <seqan/index.h> using namespace seqan; int main() { typedef StringSet<String<char> > TText; typedef Index<TText> TIndex; TText text; appendValue(text, "MISSISSIPPI"); appendValue(text, "MYMISSISAHAPPY"); TIndex index(text); Finder<TIndex> finder(index); std::cout << "The text has " << length(index) << " characters and consists of " << countSequences(index) << " sequences." << std::endl; // The Finder object has a pointer to the first, current and last hit // Each consecutive call sets the current pointer to the appropriate hit while (find(finder, "MISS")) std::cout << "Hit at position: " << position(finder) << std::endl; return 0; }
The output is as follows:
The text has 25 characters and consists of 2 sequences. Hit at position: < 1 , 2 > Hit at position: < 0 , 0 >
Data Races
bool open(index, fileName[, mode]);
Parameters
index
|
The index to be opened. |
|---|---|
fileName
|
C-style character string containing the file name. |
mode
|
The combination of flags defining how the file should be opened.To open a file read-only, write-only or to read and write use OPEN_RDONLY, OPEN_WRONLY, or OPEN_RDWR.To create or overwrite a file add OPEN_CREATE.To append a file if existing add OPEN_APPEND.To circumvent problems, files are always opened in binary mode. Default: OPEN_RDWR | OPEN_CREATE | OPEN_APPEND. |
Returns
bool |
true on success and false otherwise. |
|---|
Examples
The following code shows how the function open is used with indices.
#include <seqan/index.h> using namespace seqan; int main() { typedef StringSet<String<char> > TText; typedef Index<TText> TIndex; TText text; appendValue(text, "MISSISSIPPI"); appendValue(text, "MYMISSISAHAPPY"); TIndex saveIndex(text); // Because indices are build on demand we fore the index creation here. indexCreate(saveIndex, FibreSA()); const char * tempFileName = SEQAN_TEMP_FILENAME(); std::cout << save(saveIndex, tempFileName) << std::endl; // In a different program TIndex openIndex; std::cout << open(openIndex, tempFileName) << std::endl; return 0; }
The output is as follows:
1 1
Data Races
TValue rawtextAt(position, index);
The result of this function when used on an Index<TText, FMIndex<TOccSpec, Compress> > is not defined.
Parameters
index
|
The Index object. Types: Index |
|---|---|
position
|
A position in the array on which the value should be accessed. |
Returns
TValue |
A reference or proxy to the value. The type is the result if the meta-function Reference. |
|---|
Data Races
bool save(index, fileName[, mode]);
Parameters
index
|
The index to be opened. |
|---|---|
fileName
|
C-style character string containing the file name. |
mode
|
The combination of flags defining how the file should be opened.To open a file read-only, write-only or to read and write use OPEN_RDONLY, OPEN_WRONLY, or OPEN_RDWR.To create or overwrite a file add OPEN_CREATE.To append a file if existing add OPEN_APPEND.To circumvent problems, files are always opened in binary mode. Default: OPEN_RDWR | OPEN_CREATE | OPEN_APPEND. |
Returns
bool |
true on success and false otherwise. |
|---|
Examples
The following code shows how the function save is used with indices.
#include <seqan/index.h> using namespace seqan; int main() { typedef StringSet<String<char> > TText; typedef Index<TText> TIndex; TText text; appendValue(text, "MISSISSIPPI"); appendValue(text, "MYMISSISAHAPPY"); TIndex saveIndex(text); // Because indices are build on demand we fore the index creation here. indexCreate(saveIndex, FibreSA()); const char * tempFileName = SEQAN_TEMP_FILENAME(); std::cout << save(saveIndex, tempFileName) << std::endl; // In a different program TIndex openIndex; std::cout << open(openIndex, tempFileName) << std::endl; return 0; }
The output is as follows:
1 1


The Lost World (1997) * * A movie review by Serdar Yegulalp Copyright 1997 by Serdar Yegulalp
CAPSULE: Money talks, but do dinosaurs run the marathon?
The worst part about THE LOST WORLD, like its prequel JURASSIC PARK, is the humans.    It's just so very, very tired that I'm amazed they didn't just stick a sequel number on it and dispense with the subtitle.
The plot (what there is of it) focuses on the dinosaurs who have more or less colonized the island that the original Jurassic Park was constructed on. It also brings back Ian Malcom (Jeff Goldblum), the doom-saying mathematician of the first movie, although his presence here isn't cemented: he's here because his wife is here, not because of plot demands. That sounds odd, coming from someone who preaches constantly about movies which have too much plot and too little character, but the characterization in this movie is thin enough that I was willing to reverse my rules for the time being. For enemies, we get a gang of hunters who want to bring back a T.Rex. What're they going to do, mount the head on the wall?
The story is handled in a manner I could call "Spielberg lite": the strained relationships between the generations, the urgent quasi-liberal flavor to the movie's "themes", the moments of breakneck action. In this movie they add up to virtually nothing, because it's not happening to anyone who merits our attention. Malcom we know about, but what's so important about him (or his wife or kid, for that matter) that we need to spend two hours with them? Aside from the way they nursemaid a baby dinosaur (and get the tar mauled out of them for doing so, in a scene of exponentially-exploding preposterousness), nothing. They're only smart enough to get them out of whatever the plot hands them. There's no sense that they're actually INVOLVED in any of this.
There are so many little betrayals that contribute to the big betrayals as well. For instance. Pete Postlewaite's character, allegedly a big game hunter, apparently doesn't even know how to hold his rifle to prevent it from filling up with rainwater. The incidental roles, like the sleazy corporate people (who get eaten and stepped on like jelly beans), aren't filled out with any details that would make them more interesting as anything except set-pieces.
There is a magnificent book out there called DINOTOPIA. It is a work of real vision, a story about a world where the dinosaurs did not die out and were in fact domesticated by man. Buy it and read it with your children, and spare them the tiresomeness of this movie -- and the one that preceded it, and the one(s) that will almost certainly follow it.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Before Change
ts = [0, 5, 10, 100, 90, 2, 1, 99, 23]
config = dict(initial_p=2.0, decay_rate=0.99, schedule_timesteps=100)
for fw in ["tf", "torch", None]:
config["framework"] = fw
exponential = from_config(ExponentialSchedule, config)
for t in ts:
out = exponential(t)
check(out, 2.0 * 0.99**(t / 100), decimals=4)
// Test eager as well.
with eager_mode():
config["framework"] = "tf"
exponential = from_config(ExponentialSchedule, config)
for t in ts:
out = exponential(t)
check(out, 2.0 * 0.99**(t / 100), decimals=4)
def test_piecewise_schedule(self):
ts = [0, 5, 10, 100, 90, 2, 1, 99, 27]
expected = [50.0, 60.0, 70.0, 14.5, 14.5, 54.0, 52.0, 14.5, 140.0]
config = dict(
After Change
ts = [0, 5, 10, 100, 90, 2, 1, 99, 23]
config = dict(initial_p=2.0, decay_rate=0.99, schedule_timesteps=100)
for fw in framework_iterator(
frameworks=["tf", "eager", "torch", None]):
fw_ = fw if fw != "eager" else "tf"
exponential = from_config(
ExponentialSchedule, config, framework=fw_)
for t in ts:
out = exponential(t)


Congratulations, you're close to running your own pagerbot on heroku!
Before we're done however, we need to set up a few things:
- Connect to pagerduty.
- Set up how pagerbot connects to your channels.
- (Optional) Select which commands (plugins) pagerbot should answer to.
- Set up short aliases for coworkers and schedules to refer them by.
Navigating through the following pages and setting everything up should take around 8 minutes.


Provides various view functions that might be useful in the Admin section of the site.
Methods
Instance Public methods
admin_t(object, action, subs = {})
Link
A quick and dirty function that produces localised content based on either a class definition or instance of an ActiveRecord object.
The only reason this exists is so I can abstract everything into the ContentController
Source: show
# File app/helpers/admin_helper.rb, line 25 def admin_t(object, action, subs = {}) klass = object.is_a?(Class) ? object.to_s.underscore : object.class.name.underscore model = t("admin.model.#{klass}", :default => klass) subs[:model] = model subs[:model_p] = model.pluralize subs[:id] = object.is_a?(Class) ? nil : object.id # return t "admin.prompt.#{action}", subs end
sortable( column, title = nil )
Link
Creates a header for a table that allows interactive sorting.
Parameters
- column
-
the name of the column in the database to sort by
- title
-
the human-readable title of this column (optional, inherits from @column@)
Source: show
# File app/helpers/admin_helper.rb, line 11 def sortable( column, title = nil ) title ||= column.titleize css_class = (column == sort_column) ? "current #{sort_direction}" : nil direction = ((column == sort_column) and (sort_direction == "d")) ? 'u' : 'd' page = params.key?('page') ? params[:page] : nil link_to title, { :sb => column, :sd => direction, :page => page }, :class => css_class end


Andrew Fong
home
projects
posts
Unreleased
Project unreleased.
This project is yet to be published. Check back later!
© 2021, Andrew Fong


Before Change
rag = self.Rag.value
logger.info("Converting edge probabilities to dict...")
edge_ids = rag.edge_ids
result[0] = dict(izip(imap(tuple, edge_ids), edge_probabilities))
logger.info("...done")
def propagateDirty(self, slot, subindex, roi):
After Change
if edge_probabilities is None:
// Edge probabilities are "None" if they haven"t been loaded into the cache yet.
// Just return 0.0 for all probabilities
result[0] = { tuple(edge_id) : 0.0 for edge_id in rag.edge_ids }
else:
result[0] = dict(izip(imap(tuple, rag.edge_ids), edge_probabilities))


Privacy policy
- Overview
- Appeal a benefit decision service
- Apply for divorce service
- Apply for probate service
- Money claims service
{% elif data['type'] == "service_specific"%}
Overview
{% endif %}This privacy policy explains why we collect your personal data and what we do with it. It also explains your rights and how to enforce them.
Who manages this service
This service is managed by Her Majesty’s Courts and Tribunals Service (HMCTS), which is an executive agency of the Ministry of Justice (MoJ).
The MoJ is known as the data controller for data protection purposes. The MoJ personal information charter explains how the MoJ processes personal data.
As part of the MoJ, HMCTS is responsible for deciding how your personal data is used and for protecting the personal data you provide.
More information about using this service is in the terms and conditions.
Why we collect your personal data
We collect your personal data to:
- process your claim or application
- meet legal requirements
- Make improvements to this service
Our staff use your personal data to process your claim or application. They work in the UK and your data is stored in the UK.
Types of personal data we collect
The personal data we collect includes:
- your name, address and contact details
- your email and password (if you create an account)
- other personal information you provide in your claim or application
Some services collect more personal data. Find out more about the personal data that is collected by the service you are using .
{% endif %}Using your data
As part of your claim you’ll be asked to use your email address to set up an account. You will be able to use this email and password to sign into other HMCTS services.
We may ask for your permission to use your email address to send you emails using GOV.UK Notify. This system processes emails only within the European Economic Area until the point where emails are handed over to the email provider you use.
We use cookies to collect data that tells us about how you’re using this service, including:
- if you open an email from us or click on a link in an email
- your computer, phone or tablet’s IP address
- the region or town where you are using your computer, phone or tablet
- the web browser you use
Storing your data
When you make your claim or application we store the data you have provided. The amount of time that your data is kept for depends on the service that you are using.
Find out more about how long your personal data is stored by the service you are using.
{% if data['type'] == "generic" %}Some services collect more personal data. Find out more about the personal data that is collected by the service you are using .
{% endif %}Sharing your data
While processing your claim or application, another government department, agency or organisation might be involved and we may share your data with them.
If you contact us and ask for help with the service you are using, your personal data may be shared with the Good Things Foundation. This is a company who we have partnered with to offer face to face support.
In some circumstances we may share your data, for example to prevent or detect crime or to produce anonymised statistics.
We use Google Analytics to collect data about how a website is used. This anonymous data is shared with Google. Find out about this in our terms and conditions.
Storing and sharing your data internationally
Sometimes we need to send your personal information outside of the UK. When we do this we comply with data protection law.
Your rights
You can ask:
- to see the personal data that we hold on you
- to have the personal data corrected
- to have the personal data removed or deleted (this will depend on the circumstances, for example if you decide not to continue your claim or application)
- that access to the personal data is restricted (for example, you can ask to have your data stored for longer and not automatically deleted)
If you want to see the personal data that we hold on you, you can:
- complete a form to make a subject access request. Your request goes to the MoJ as data controller.
- write to us: Disclosure Team, Post point 10.38, 102 Petty France, London, SW1H 9AJ
You can ask for more information about:
- agreements we have on sharing information with other organisations
- when we are allowed to pass on personal information without telling you
- our instructions to staff on how to collect, use or delete your personal information
- how we check that the information we hold is accurate and up to date
You can contact the MoJ data protection officer by:
How to complain
See our complaints procedure if you want to complain about how we've handled your personal data.
Write to: Post point 10.38, 102 Petty France, London, SW1H 9AJ
Email<EMAIL_ADDRESS>You can also complain to the Information Commissioner’s Office if you’re not satisfied with our response or believe we are not processing your personal data lawfully.
{% if data['type'] == "generic" %}The service you are using
The types of personal data collected, how long it is stored for, and who it is shared with depends on the service you are using. Find out more by following the links below:
- Using the appeal a benefit decision service
- Using the apply for a divorce service
- Using the apply for probate service
- Using the money claims service
Using the money claims service
The personal data we need
If you are using the money claims service we may ask you for:
- your name
- your business or organisation if you are acting on their behalf
- your date of birth
- your email or mobile phone number
- your address
- the name of the person, business or organisation you are claiming against
- their email address
- their address
- the reasons you are making the claim
- the timeline of events leading to the dispute
- a list of any evidence you have to support your claim
If you are responding to a money claim we ask you to check the personal information about you that was provided by the claimant which includes your name, your address and contact details.
We may ask you to provide:
- your date of birth
- your business or organisation if you are acting on their behalf
- your response to the claim made against you
- the timeline of events leading to the dispute
- a list of any evidence you have to support your claim
Storing your data
When you use this service you’ll be asked to use your email address to set up an account. You can use this email and password to sign into other HMCTS services.
Before you submit your information
The information you enter in the money claims service is saved until you decide to submit it. This allows you to save what you are doing and continue later. Saved information that you do not submit will be deleted after 90 days.
After you submit your information
The information you submit for a money claim will be deleted 2 years after the court makes a decision on the outcome of your claim (this is called a judgment).
If the court doesn’t make a decision about your claim (for example, you settle the claim out of court and a judgment is no longer required) then the information you provide will be deleted 3 years after the last update made to the claim.
Sharing your data
The information you submit will be shared with everyone who is named on the claim. This excludes any payment details that you use to pay court fees.
If a judgment is made on a case some information is shared with Registry Trust Limited who provide financial information about court judgments to banks and credit agencies.
{% endif %}Using the apply for a divorce service
The personal data we need
When you use the apply for divorce service we need the following personal data:
- your current name
- your name on the marriage certificate
- a copy of your marriage certificate
- date of your marriage
- country in which you got married
- information about where you have lived
- your habitual residence (whether your life is mainly based in England or Wales)
- your domicile (usually the place in which you were born, regard as your permanent home and to which you have the closest ties)
- your email or mobile phone number
- your address
- reasons for your divorce
- to know if you have been involved in other court cases
- your husband or wife’s current name
- their name on the marriage certificate
- the name and address of the person who committed adultery with your husband or wife (this is optional and only asked if adultery is your reason for divorce) your solicitors name and address (if you have one)
Receiving notifications
You need to sign up to receive notifications to use the apply for divorce service. This is a legal requirement so that the divorce application can proceed.
Storing your data
When you use this service you’ll be asked to use your email address to set up an account. You will be able to use this email and password to sign into other HMCTS services.
While you are filling out or responding to a divorce application we will hold your data for up to 6 months. If you don’t complete the application during this time you’ll have to start again.
When a divorce is finalised the case is stored for 18 years. After this time, some data (from the decree nisi and the decree absolute) is deleted.
The remainder of the case information is stored for an additional 82 years. After a total of 100 years this data will be deleted.
Using the money claims service
The personal data we need
If you are using the money claims service we will ask you for:
- your name
- your business or organisation if you are acting on their behalf
- your date of birth
- your email or mobile phone number
- your address
- the name of the person, business or organisation you are claiming against
- their email address
- their address
- the reasons you are making the claim
- the timeline of events leading to the dispute
- a list of any evidence you have to support your claim
If you are responding to a money claim we ask you to check the personal information about you that was provided by the claimant which includes your name, your address and contact details.
We may ask you to provide:
- your date of birth
- your business or organisation if you are acting on their behalf
- your response to the claim made against you
- the timeline of events leading to the dispute
- a list of any evidence you have to support your claim
Storing your data
When you use this service you’ll be asked to use your email address to set up an account. You can use this email and password to sign into other HMCTS services.
Before you submit your information
The information you enter in the money claims service is saved until you decide to submit it. This allows you to save what you are doing and continue later. Saved information that you do not submit will be deleted after 90 days.
After you submit your information
The information you submit for a money claim will be deleted 2 years after the court makes a decision on the outcome of your claim (this is called a judgment).
If the court doesn’t make a decision about your claim (for example, you settle the claim out of court and a judgment is no longer required) then the information you provide will be deleted 3 years after the last update made to the claim.
Sharing your data
The information you submit will be shared with everyone who is named on the claim. This excludes any payment details that you use to pay court fees.
If a judgment is made on a case some information is shared with Registry Trust Limited who provide financial information about court judgments to banks and credit agencies.
Using the appeal a benefit decision service
The personal data we need
When you use the appeal a benefit decision service we ask for:
- your name
- your date of birth
- your email or mobile phone number
- your National Insurance Number
- information from the Mandatory Reconsideration Notice
- information on any support you need for a hearing, if you attend one
- information on your availability for a hearing, if you attend one
If you have a representative, we will ask for:
- their name
- their contact details
If you are appointee, you will need to provide information about the person who you are appealing on behalf of, including:
- their name
- their National Insurance number
Receiving notifications
As part of your appeal we’ll ask if you want to receive text message and email notifications to keep you updated with your appeal.
You can cancel text messages by following the steps mentioned in the text message, and you can cancel emails by following the steps mentioned in the emails.
If you have asked for your named representative to receive updates on your appeal, then we will share your data with them. If you want your representative to stop receiving notifications then you need to Contact us. [link to contact us page].
Storing and sharing your data
Your data will be shared with the government department that made the decision you are appealing against. For example, the Department for Work and Pensions or HM Revenue and Customs. This is so that department can respond to your appeal.
After you complete your application it will be stored for 2 years. It will be deleted after that.
Using the apply for probate service
The personal data we need
When you use the apply for probate service we ask for:
- your name, any other names you are known as
- your email or mobile phone number
- your address
- the names any executors of the will
- contact details for all of the executors who are applying for probate
Storing your data
When you use this service you’ll be asked to use your email address to set up an account. You can use this email and password to sign into other HMCTS services.
Before you submit your information
Information you enter in the apply for probate service is saved until you decide to submit it. This allows you to save what you are doing and continue later. Saved information that you do not submit will be deleted after 90 days.
After you submit your information
Grants of probate are stored as public records. However, your email address and telephone number won’t be publicly available.
{% endif %}


Grand Master Vitus:
Why have you come to see me? Please move on if you do not need my assistance. I am very busy right now! (This quest is only available for Kamael.)


Hi there, I see you found my site!
This is the website I made for my Prog 109 class.
Who am I?
My name is Mahmmoud Alnouri.
I am a full time student at Bellevue College. As of right now, I am taking this Prog 109 course as a prerequisite for admission into Bachelors of Applied Science degree program, with a concentration in Application Development.
I took up programming around my senior year of high school. Most of it I learned by looking up online tutorials and working on personal projects. These projects were a lot of fun to focus on and it gave me an enjoyable way to learn and improve.
Hobbies
My hobbies are usually consisting of being outdoors. Hiking is one of my favorites, I always love to find new trails to tackle. I also enjoy running and jogging. I am working to train so I can compete and complete in races like 5k and 10k runs.
Languages
- Java: This is where most of my programming experience is focused on. It was the first object-oriented programming language I learned and is easily my go-to language.
- Python: I am very familiar with this language, as I have recently been exploring topics and problems that focus on using Python and its libraries. I enjoy exploring the data science and maachine learning, but I don't think I'm anywhere close to making a career out of it...yet.
I also speak French and Arabic. Unfortunately, I haven't heard of any coding interviews that use those languages, so maybe I should skip those on my Resume.


Members
(inner, constant) CONSTRAINT_DAY_OF_MONTH
Constraint on TimeRule. Day of the month when the rule applies is specified
by the day argument. The day must be an integer between 1-31.
Date-spans will be created on the same day of every month.
- Source:
(inner, constant) CONSTRAINT_DAY_OF_WEEK
Constraint on TimeRule. Day of the week when the rule applies is specified
by the day argument. Date-spans will be created on the same day of every
week. The day must be in the range 0-6 (Sunday-Saturday).
- Source:
(inner, constant) CONSTRAINT_FIFTH_OF_MONTH
Constraint on TimeRule. Day of the week when the rule applies is specified
by the day argument. Date-spans will be created on the fifth occurance
of the day each month. The day must be in the range 0-6 (Sunday-Saturday).
- Source:
(inner, constant) CONSTRAINT_FIRST_OF_MONTH
Constraint on TimeRule. Day of the week when the rule applies is specified
by the day argument. Date-spans will be created on the first occurance
of the day each month. The day must be in the range 0-6 (Sunday-Saturday).
- Source:
(inner, constant) CONSTRAINT_FOURTH_OF_MONTH
Constraint on TimeRule. Day of the week when the rule applies is specified
by the day argument. Date-spans will be created on the fourth occurance
of the day each month. The day must be in the range 0-6 (Sunday-Saturday).
- Source:
(inner, constant) CONSTRAINT_LAST_OF_MONTH
Constraint on TimeRule. Day of the week when the rule applies is specified
by the day argument. Date-spans will be created on the last occurance
of the day each month. The day must be in the range 0-6 (Sunday-Saturday).
- Source:
(inner, constant) CONSTRAINT_SECOND_OF_MONTH
Constraint on TimeRule. Day of the week when the rule applies is specified
by the day argument. Date-spans will be created on the second occurance
of the day each month. The day must be in the range 0-6 (Sunday-Saturday).
- Source:
(inner, constant) CONSTRAINT_THIRD_OF_MONTH
Constraint on TimeRule. Day of the week when the rule applies is specified
by the day argument. Date-spans will be created on the third occurance
of the day each month. The day must be in the range 0-6 (Sunday-Saturday).
- Source:
(inner, constant) FRIDAY
Day of the week - Sunday. Same as defined by Date.
- Source:
(inner, constant) MAX_MINS_PER_DAY
maximum duration of a date-span in [minutes]
- Source:
(inner, constant) MONDAY
Day of the week - Sunday. Same as defined by Date.
- Source:
(inner, constant) SATURDAY
Day of the week - Sunday. Same as defined by Date.
- Source:
(inner, constant) SUNDAY
Day of the week - Sunday. Same as defined by Date.
- Source:
(inner, constant) THURSDAY
Day of the week - Sunday. Same as defined by Date.
- Source:
(inner, constant) TUESDAY
Day of the week - Sunday. Same as defined by Date.
- Source:
(inner, constant) WEDNESDAY
Day of the week - Sunday. Same as defined by Date.
- Source:
Methods
(inner) timeRule(InTimeSpan, inConstraint, inDay, inTZ, inBeginopt, inDateopt) → {Object}
Functional constructor. Creates an instance of a TimeRule.
Each TimeRule object is immutable.
Parameters:
| Name | Type | Attributes | Description |
|---|---|---|---|
InTimeSpan |
Object | A TimeSpan object which represents the begin time and duration of a span of time during which the rule applies. An error is thrown if this argument is not specified or it is not a valid object. | |
inConstraint |
number | Integer. Identifies which type of Constraint is applied by the time rule. Valid values are: CONSTRAINT_DAY_OF_WEEK, CONSTRAINT_DAY_OF_MONTH, CONSTRAINT_FIRST_OF_MONTH, CONSTRAINT_SECOND_OF_MONTH, CONSTRAINT_THIRD_OF_MONTH, CONSTRAINT_FOURTH_OF_MONTH, CONSTRAINT_FIFTH_OF_MONTH and CONSTRAINT_LAST_OF_MONTH. | |
inDay |
number | Integer. Represents the day of the week or month when this rule applies. Values representing the days of the week are the same as those of the Date.getDay() method and values for the day of the month must be in the range 1-31. Whether the day of the week or month is specified depends on the value passed to inConstraint. An error is thrown if no value is specified or it is outside the valid range. | |
inTZ |
string | Timezone identifier as defined by the tz database - sometimes called the TZ environment variable value. See https://www.iana.org/time-zones for more details. | |
inBegin |
Date | null |
<optional> |
Date and time from which the rule is applied. If no begin time is specified then the rule begins at the earliest possible time. |
inDate |
Date | null |
<optional> |
Date and time up until which the rule is applied. If no begin time is specified then the rule ends at the latest possible time. |
- Source:
Returns:
A new instance of a TimeRule object.
- Type
- Object


Penetration - An exploit usually relates to the existence of some flaw or vulnerability in an application or operating system that if used could lead to privilege escalation or denial of service against the computer system that is being attacked. Exploits can be compiled and used manually or various engines exist that are essentially at the lowest level pre-compiled point and shoot tools. These engines do also have a number of other extra underlying features for more advanced users.
Sections: Password, exploit, tools
- Password Attacks
- Known Accounts
- Identified Passwords
- Unidentified Hashes
- Default Accounts
- Identified Passwords
- Unidentified Hashes
- Exploits
- Successful Exploits
- Accounts
- Passwords
-
- Groups
- Other Details
- Services
- Backdoor
- Connectivity
- Unsuccessful Exploits
- Resources
-
- Tools
-


A {@link org.netbeans.api.project.Project} is a representation of a folder which may contain various kinds of development artifacts and/or metadata. Projects can be loaded, saved, etc. using {@link org.netbeans.api.project.ProjectManager}.
{@link org.netbeans.api.project.FileOwnerQuery} is a simple way to associate a file or folder with a project. Typically, all files beneath a project's folder are considered "owned" by that project. A given file can be owned by at most one project.


--- layout: post date: 2011-10-19 time: "09:00:00" authors: ["Greg Wilson"] title: American Scientist Article on Empirical Studies of Software Engineering tags: ["Noticed"] ---
An article that Jorge Aranda and I wrote for American Scientist about empirical studies of software engineering is now up on the web. We hope it's a good introduction to the area, and we look forward to your feedback. If you'd like to know more about the area, please check out our joint "neat results" blog at http://www.neverworkintheory.org/.


[ aws . elasticache ]
Reboots some, or all, of the cache nodes within a provisioned cache cluster. This operation applies any modified cache parameter groups to the cache cluster. The reboot operation takes place as soon as possible, and results in a momentary outage to the cache cluster. During the reboot, the cache cluster status is set to REBOOTING.
The reboot causes the contents of the cache (for each cache node being rebooted) to be lost.
When the reboot is complete, a cache cluster event is created.
See also: AWS API Documentation
reboot-cache-cluster
--cache-cluster-id <value>
--cache-node-ids-to-reboot <value>
[--cli-input-json <value>]
[--generate-cli-skeleton <value>]
The cache cluster identifier. This parameter is stored as a lowercase string.
--cache-node-ids-to-reboot (list)
A list of cache node IDs to reboot. A node ID is a numeric identifier (0001, 0002, etc.). To reboot an entire cache cluster, specify all of the cache node IDs.
Syntax:
"string" "string" ...
--cli-input-json (string) Performs service operation based on the JSON string provided. The JSON string follows the format provided by --generate-cli-skeleton. If other arguments are provided on the command line, the CLI values will override the JSON-provided values.
--generate-cli-skeleton (string) Prints a JSON skeleton to standard output without sending an API request. If provided with no value or the value input, prints a sample input JSON that can be used as an argument for --cli-input-json. If provided with the value output, it validates the command inputs and returns a sample output JSON for that command.
CacheCluster -> (structure)
Contains all of the attributes of a specific cache cluster.
CacheClusterId -> (string)
The user-supplied identifier of the cache cluster. This identifier is a unique key that identifies a cache cluster.ConfigurationEndpoint -> (structure)
Represents the information required for client programs to connect to a cache node.
Address -> (string)
The DNS hostname of the cache node.Port -> (integer)
The port number that the cache engine is listening on.ClientDownloadLandingPage -> (string)
The URL of the web page where you can download the latest ElastiCache client library.CacheNodeType -> (string)
The name of the compute and memory capacity node type for the cache cluster.
Valid node types are as follows:
- General purpose:
- Current generation: cache.t2.micro , cache.t2.small , cache.t2.medium , cache.m3.medium , cache.m3.large , cache.m3.xlarge , cache.m3.2xlarge , cache.m4.large , cache.m4.xlarge , cache.m4.2xlarge , cache.m4.4xlarge , cache.m4.10xlarge
- Previous generation: cache.t1.micro , cache.m1.small , cache.m1.medium , cache.m1.large , cache.m1.xlarge
- Compute optimized: cache.c1.xlarge
- Memory optimized:
- Current generation: cache.r3.large , cache.r3.xlarge , cache.r3.2xlarge , cache.r3.4xlarge , cache.r3.8xlarge
- Previous generation: cache.m2.xlarge , cache.m2.2xlarge , cache.m2.4xlarge
Notes:
- All T2 instances are created in an Amazon Virtual Private Cloud (Amazon VPC).
- Redis backup/restore is not supported for Redis (cluster mode disabled) T1 and T2 instances. Backup/restore is supported on Redis (cluster mode enabled) T2 instances.
- Redis Append-only files (AOF) functionality is not supported for T1 or T2 instances.
For a complete listing of node types and specifications, see Amazon ElastiCache Product Features and Details and either Cache Node Type-Specific Parameters for Memcached or Cache Node Type-Specific Parameters for Redis .
Engine -> (string)
The name of the cache engine (memcached or redis ) to be used for this cache cluster.EngineVersion -> (string)
The version of the cache engine that is used in this cache cluster.CacheClusterStatus -> (string)
The current state of this cache cluster, one of the following values: available , creating , deleted , deleting , incompatible-network , modifying , rebooting cache cluster nodes , restore-failed , or snapshotting .NumCacheNodes -> (integer)
The number of cache nodes in the cache cluster.
For clusters running Redis, this value must be 1. For clusters running Memcached, this value must be between 1 and 20.
PreferredAvailabilityZone -> (string)
The name of the Availability Zone in which the cache cluster is located or "Multiple" if the cache nodes are located in different Availability Zones.CacheClusterCreateTime -> (timestamp)
The date and time when the cache cluster was created.PreferredMaintenanceWindow -> (string)
Specifies the weekly time range during which maintenance on the cluster is performed. It is specified as a range in the format ddd:hh24:mi-ddd:hh24:mi (24H Clock UTC). The minimum maintenance window is a 60 minute period.
Valid values for ddd are:
- sun
- mon
- tue
- wed
- thu
- fri
- sat
Example: sun:23:00-mon:01:30
PendingModifiedValues -> (structure)
A group of settings that are applied to the cache cluster in the future, or that are currently being applied.
NumCacheNodes -> (integer)
The new number of cache nodes for the cache cluster.
For clusters running Redis, this value must be 1. For clusters running Memcached, this value must be between 1 and 20.
CacheNodeIdsToRemove -> (list)
A list of cache node IDs that are being removed (or will be removed) from the cache cluster. A node ID is a numeric identifier (0001, 0002, etc.).
(string)
EngineVersion -> (string)
The new cache engine version that the cache cluster runs.CacheNodeType -> (string)
The cache node type that this cache cluster or replication group is scaled to.NotificationConfiguration -> (structure)
Describes a notification topic and its status. Notification topics are used for publishing ElastiCache events to subscribers using Amazon Simple Notification Service (SNS).
TopicArn -> (string)
The Amazon Resource Name (ARN) that identifies the topic.TopicStatus -> (string)
The current state of the topic.CacheSecurityGroups -> (list)
A list of cache security group elements, composed of name and status sub-elements.
(structure)
Represents a cache cluster's status within a particular cache security group.
CacheSecurityGroupName -> (string)
The name of the cache security group.Status -> (string)
The membership status in the cache security group. The status changes when a cache security group is modified, or when the cache security groups assigned to a cache cluster are modified.CacheParameterGroup -> (structure)
Status of the cache parameter group.
CacheParameterGroupName -> (string)
The name of the cache parameter group.ParameterApplyStatus -> (string)
The status of parameter updates.CacheNodeIdsToReboot -> (list)
A list of the cache node IDs which need to be rebooted for parameter changes to be applied. A node ID is a numeric identifier (0001, 0002, etc.).
(string)
CacheSubnetGroupName -> (string)
The name of the cache subnet group associated with the cache cluster.CacheNodes -> (list)
A list of cache nodes that are members of the cache cluster.
(structure)
Represents an individual cache node within a cache cluster. Each cache node runs its own instance of the cluster's protocol-compliant caching software - either Memcached or Redis.
Valid node types are as follows:
- General purpose:
- Current generation: cache.t2.micro , cache.t2.small , cache.t2.medium , cache.m3.medium , cache.m3.large , cache.m3.xlarge , cache.m3.2xlarge , cache.m4.large , cache.m4.xlarge , cache.m4.2xlarge , cache.m4.4xlarge , cache.m4.10xlarge
- Previous generation: cache.t1.micro , cache.m1.small , cache.m1.medium , cache.m1.large , cache.m1.xlarge
- Compute optimized: cache.c1.xlarge
- Memory optimized:
- Current generation: cache.r3.large , cache.r3.xlarge , cache.r3.2xlarge , cache.r3.4xlarge , cache.r3.8xlarge
- Previous generation: cache.m2.xlarge , cache.m2.2xlarge , cache.m2.4xlarge
Notes:
- All T2 instances are created in an Amazon Virtual Private Cloud (Amazon VPC).
- Redis backup/restore is not supported for Redis (cluster mode disabled) T1 and T2 instances. Backup/restore is supported on Redis (cluster mode enabled) T2 instances.
- Redis Append-only files (AOF) functionality is not supported for T1 or T2 instances.
For a complete listing of node types and specifications, see Amazon ElastiCache Product Features and Details and either Cache Node Type-Specific Parameters for Memcached or Cache Node Type-Specific Parameters for Redis .
CacheNodeId -> (string)
The cache node identifier. A node ID is a numeric identifier (0001, 0002, etc.). The combination of cluster ID and node ID uniquely identifies every cache node used in a customer's AWS account.CacheNodeStatus -> (string)
The current state of this cache node.CacheNodeCreateTime -> (timestamp)
The date and time when the cache node was created.Endpoint -> (structure)
The hostname for connecting to this cache node.
Address -> (string)
The DNS hostname of the cache node.Port -> (integer)
The port number that the cache engine is listening on.ParameterGroupStatus -> (string)
The status of the parameter group applied to this cache node.SourceCacheNodeId -> (string)
The ID of the primary node to which this read replica node is synchronized. If this field is empty, this node is not associated with a primary cache cluster.CustomerAvailabilityZone -> (string)
The Availability Zone where this node was created and now resides.AutoMinorVersionUpgrade -> (boolean)
This parameter is currently disabled.SecurityGroups -> (list)
A list of VPC Security Groups associated with the cache cluster.
(structure)
Represents a single cache security group and its status.
SecurityGroupId -> (string)
The identifier of the cache security group.Status -> (string)
The status of the cache security group membership. The status changes whenever a cache security group is modified, or when the cache security groups assigned to a cache cluster are modified.ReplicationGroupId -> (string)
The replication group to which this cache cluster belongs. If this field is empty, the cache cluster is not associated with any replication group.SnapshotRetentionLimit -> (integer)
The number of days for which ElastiCache retains automatic cache cluster snapshots before deleting them. For example, if you set SnapshotRetentionLimit to 5, a snapshot that was taken today is retained for 5 days before being deleted.
Warning
If the value of SnapshotRetentionLimit is set to zero (0), backups are turned off.
SnapshotWindow -> (string)
The daily time range (in UTC) during which ElastiCache begins taking a daily snapshot of your cache cluster.
Example: 05:00-09:00


Four dead, six wounded in California garden party shooting
All the victims were Asian men ranging from 25 to 35 years old.
Four people have been killed and six more wounded after “unknown suspects” sneaked into a garden party in California and fired into a crowd.
The shooting took place about 6pm local time as people were gathered to watch a football game, Fresno Police Lieutenant Bill Dooley said.
Deputy Chief Michael Reid told the Fresno Bee and local TV stations that a total of 10 people were shot, with three found dead in the backyard. A fourth person died in hospital. Six others are expected to survive and are recovering at the hospital.
Mr Dooley said: “What we do know is that this was a gathering, a family and friend gathering in the backyard. Everyone was watching football this evening when unknown suspects approached the residence, snuck into the backyard and opened fire.”
The victims were taken to Community Regional Medical Centre in critical condition, and some are now stable, the TV stations reported.
About 35 people were at the party when the shooting began.
No one is in custody in connection with the shooting. Police said there was no immediate indication that the victims knew the perpetrators.
Agents from the US Bureau of Alcohol, Tobacco, Firearms and Explosives field office in San Francisco were responding to the shooting, the Bee reported.
It was at least the second fatal gun attack on Sunday in southeast Fresno, the Bee reported. A man in his 20s was shot to death at a home in another part of the city. Police have not said whether the incidents could be connected.
Sunday’s shootings in Fresno also come on the heels of at least two mass shootings in California. On Thursday, a 16-year-old student at a Southern California high school shot and killed two classmates and wounded three other teenagers before shooting himself in the head. He died the next day.
 A fourth son wounded in the shooting was on life support on Sunday, family members said.


Gateway
BOT
03-Feb-19 07:40 AM
[telegram] <Atlas> good review )
[telegram] <Atlas> but not undestand at now how tx/sec have KMD ?
[telegram] <Atlas> like visa ? 22k ?
[telegram] <Kliop41> KMD tx is technically infinite but blocktime is around 1 min. (re @Atlas: like visa ? 22k ?)
[telegram] <Atlas> ok block time 1 min ) how tx include max in 1 block now
[telegram] <Atlas> answer get ~ tx
[telegram] <Atlas> i see on 2018 kmd tested 20 and 40k tx in sec
[telegram] <Atlas> but its test not now how i think
[telegram] <Atlas> so if kmd apply in real live its make big pump
[telegram] <Atlas> 20 - 50 usd for kmd
[telegram] <polycryptoblog> It is because we use multiple chains (re @Atlas: ok block time 1 min ) how tx include max in 1 block now)
[telegram] <Atlas> a when u send kmd from desktop wallet to desktop wallet how long waite what coin is resive ?
[telegram] <Atlas> on some other coins its time 5-10 sec
[telegram] <Atlas> and after confirmaition 5 - 30 min
[telegram] <barbierir> in future yes, the sapling upgrade is a first step in that direction but then further changes are necessary (re @kapscedric: hello do you know if in the future z transaction are able to works in lite mode or in electrum wallet with no need of download all blockchain)
[telegram] <barbierir> seeing the tx is in seconds like any other coin, confirmation is ~1 minute and dpow definitive confirmations ~10 minutes (re @Atlas: a when u send kmd from desktop wallet to desktop wallet how long waite what coin is resive ?)
[telegram] <Atlas> no no not confirmaition time ok 1 min its wery fast
[telegram] <Atlas> but info what you have in coins before confirmaition
[telegram] <Atlas> i send you now kmd /// u resive message instantly ?
[telegram] <Atlas> what coins starts confirmaition ///
[telegram] <barbierir> you see the tx in your wallet almost instantly, but without confirmations. This is true for any coin, even Bitcoin
[telegram] <Atlas> ok .... sorry not know that ) (re @barbierir: you see the tx in your wallet almost instantly, but without confirmations. This is true for any coin, even Bitcoin)
[telegram] <Kliop41> No, you first need 1 confirmation. So it will take around 1 minute. Unless you trust the network and consider a tx valid as soon it is in the mempool (but this is dangerous). (re @Atlas: i send you now kmd /// u resive message instantly ?)
(edited)
[telegram] <Atlas> hm ) so who rigth )
(edited)
[telegram] <Kliop41> We are saying both the same thing. (re @Atlas: hm ) so who rigth ))
[telegram] <Atlas> no no 1 min and instantly its not to same )
[telegram] <barbierir> Komodo has a channel CC in development, that once fully implemented will allow tx that are instantly confirmed via prepaid channels
[telegram] <Atlas> i think i need install wallet and test it ))
[telegram] <Kliop41> .... There is a lot of ressource about how blockchain work on Binance YouTube channel. You should take a look. (re @Atlas: no no 1 min and instantly its not to same ))
[telegram] <barbierir> try Bitcoin QT first, if you never tried a cryptocurrency before. Start from the basic
[telegram] <Atlas> i know i tested that in KRB coin
[telegram] <Atlas> its work instantly on KRB
(edited)
[telegram] <Atlas> Bitcoin QT so big )
[telegram] <barbierir> yes but worth the lesson
[telegram] <barbierir> and understand the utxo and change-address stuff if you use full mode
[telegram] <Kliop41> I doubt it, KRB blocktime is around 240s.
There is a big difference between instant non confirmed transactions and transaction with at least 1 confirmation. (re @Atlas: its work instantly on KRB)
[telegram] <Atlas> for users wery important see what coins is income
[telegram] <Atlas> its not matter confirmed or not
[telegram] <Kliop41> It is, to prevent double spend. (re @Atlas: its not matter confirmed or not)
[telegram] <Atlas> yes its important problem
[telegram] <Atlas> but i need only recive message for income tx
[telegram] <Atlas> before 1 confirm in all blockchaines you cant spend coins
[telegram] <Kliop41> Then consider that literally all blockchain project transactions are instant
[telegram] <Atlas> or i somsing not understand )


Get(LayoutName)Returns the name of the layout currently displayed.If there are multiple windows open in the current database file, each window can have its own layout name value, but results are returned for only the foreground window.
• You can use the Get(LayoutNumber) function as an alternative to Get(LayoutName) if there are multiple layouts with the same name.
• Returns Product List when the Product List layout is displayed.Returns Customer Invoice when the Customer Invoice layout is displayed.


Coffee
Enjoy life
Meetup
Inspire people
CodePen
Make cool stuff
StackOverflow
Ask for help
freeCodeCamp
Learn to code
GitHub
Share your code


This is just some speech from an old play to fill the page up.
The target link is at the bottom of the page so that is where you should end up
To be, or not to be--that is the question:
Whether 'tis nobler in the mind to suffer
The slings and arrows of outrageous fortune
Or to take arms against a sea of troubles
And by opposing end them. To die, to sleep--
No more--and by a sleep to say we end
The heartache, and the thousand natural shocks
That flesh is heir to. 'Tis a consummation
Devoutly to be wished. To die, to sleep--
To sleep--perchance to dream: ay, there's the rub,
For in that sleep of death what dreams may come
When we have shuffled off this mortal coil,
Must give us pause. There's the respect
That makes calamity of so long life.
For who would bear the whips and scorns of time,
Th' oppressor's wrong, the proud man's contumely
The pangs of despised love, the law's delay,
The insolence of office, and the spurns
That patient merit of th' unworthy takes,
When he himself might his quietus make
With a bare bodkin? Who would fardels bear,
To grunt and sweat under a weary life,
But that the dread of something after death,
The undiscovered country, from whose bourn
No traveller returns, puzzles the will,
And makes us rather bear those ills we have
Than fly to others that we know not of?
Thus conscience does make cowards of us all,
And thus the native hue of resolution
Is sicklied o'er with the pale cast of thought,
And enterprise of great pitch and moment
With this regard their currents turn awry
And lose the name of action. -- Soft you now,
The fair Ophelia! -- Nymph, in thy orisons
Be all my sins remembered.
If the publication navigated to where the check is visible, the test passes.


Leasing and renting in Eight Mile Plains
Retail and office leasing
For retail and office space availability and rental rates in Eight Mile Plains, please contact the Centre Office on (07) 3219 9499 or send an email to<EMAIL_ADDRESS>Casual leasing
We regretfully inform that Eight Mile Plains Shopping Centre does not have any accommodations for casual leasing.


Before Change
for p in processes:
p.join()
print("Starting to build an ensemble!")
automl = AutoSklearnClassifier(
time_left_for_this_task=30,
per_run_time_limit=15,
ml_memory_limit=1024,
After Change
// now we start the two workers, one from within Python, the other
// via the command line.
process_python_worker = multiprocessing.Process(
target=start_python_worker,
args=(cluster.scheduler_address,),
)
process_python_worker.start()
process_cli_worker = multiprocessing.Process(
target=start_cli_worker,
args=(cluster.scheduler_address,),


labeled
by Kevin Reiss at 2023-06-28 22:59:38.head_ref_deleted
by Christina Chortaria at 2023-06-28 15:27:55.head_ref_deleted
by Christina Chortaria at 2023-06-28 15:27:58.head_ref_deleted
by Christina Chortaria at 2023-06-28 15:28:02.head_ref_deleted
by Christina Chortaria at 2023-06-28 15:28:06.head_ref_deleted
by Christina Chortaria at 2023-06-28 15:28:12.head_ref_deleted
by Christina Chortaria at 2023-06-28 15:28:14.head_ref_deleted
by Christina Chortaria at 2023-06-28 15:28:16.deployed
by None at 2023-06-28 19:47:57.convert_to_draft
by Jane Sandberg at 2023-06-28 19:57:47.ready_for_review
by Jane Sandberg at 2023-06-28 21:30:50.deployed
by None at 2023-06-28 21:38:48.Jennifer reported back that she looked for email or notes on why she requested this and couldn't find anything. So I'm going to close this issue and we can revisit if she remembers where this request came from or someone else asks about it.
closed
by esmé cowles at 2023-06-28 12:29:41.Given the trajectory for DataSpace, I think we can safely close this at this time. If users go to the wrong collection by mistake in the meantime, they can be directed appropriately by a staff member.
closed
by Kate Lynch at 2023-06-28 13:16:52.assigned
by Bess Sadler at 2023-06-28 15:32:10.Leave message for all users (logged in and external) on the homepage.
Also add to the submit page for logged in users (https://dataspace-dev.princeton.edu/submit)
Additional CSS changes:
.alert {
background-color: #F4EA48;
font-weight: bold;
border: 2px #E6C700 solid;
}
@hhkitsune please see the new code deployed at https://dataspace-dev.princeton.edu/ with requested changes to the homepage and the submit page: https://dataspace-dev.princeton.edu/submit
Screenshots:
mentioned
by Hannah H at 2023-06-28 20:23:25.subscribed
by Hannah H at 2023-06-28 20:23:26.referenced
by James R. Griffin III at 2023-06-28 19:49:57.merged
by James R. Griffin III at 2023-06-28 19:49:57.closed
by James R. Griffin III at 2023-06-28 19:49:57.head_ref_deleted
by James R. Griffin III at 2023-06-28 19:49:58.closed
by Bess Sadler at 2023-06-28 19:44:57.head_ref_deleted
by Bess Sadler at 2023-06-28 19:45:01.head_ref_restored
by Bess Sadler at 2023-06-28 19:45:45.head_ref_deleted
by James R. Griffin III at 2023-06-28 19:49:59.These are done. I ended up doing it with a script because I think the proper feature here is something @hackartisan has been talking about, which is allowing bulk edit via CSV upload, and I didn't want to start that in a vacuum.
require 'csv'
csp = ChangeSetPersister.default
rows = CSV.read(Rails.root.join("tmp", "DerridaUnsuppressedCID+MMSID+ARK.csv"), headers: true)
rows.each do |row|
row = row.to_h
next unless row[row.keys.first] && row["MMS ID"]
resources = csp.query_service.custom_queries.find_by_property(property: :source_metadata_identifier, value: row[row.keys.first])
resources.each do |resource|
change_set = ChangeSet.for(resource)
change_set.validate(source_metadata_identifier: row["MMS ID"])
puts "Changing #{row[row.keys.first]} to #{row["MMS ID"]}"
csp.save(change_set: change_set)
end
end
assigned
by Trey Pendragon at 2023-06-27 23:43:09.closed
by Trey Pendragon at 2023-06-28 00:02:56.mentioned
by None at 2023-06-28 00:02:56.subscribed
by None at 2023-06-28 00:02:56.I kicked these off:
query_service = ChangeSetPersister.default.query_service
parent_resources = query_service.custom_queries.find_by_property(property: :member_ids, value: [{}], lazy: true)
parent_resources = parent_resources.select do |resource|
# Nothing that has a parent
!Wayfinder.for(resource).try(:parent)
end
parent_resources.each do |resource|
health_report = HealthReport::CloudFixityCheck.for(resource)
PreserveResourceJob.set(queue: :super_low).perform_later(id: resource.id.to_s) if health_report.valid? && health_report.status == :in_progress
end
labeled
by Kim Leaman at 2023-06-28 17:52:31.labeled
by Kim Leaman at 2023-06-28 17:52:31.labeled
by Kim Leaman at 2023-06-28 17:52:31.head_ref_force_pushed
by Trey Pendragon at 2023-06-28 19:21:35.referenced
by Jane Sandberg at 2023-06-27 22:35:53.merged
by Jane Sandberg at 2023-06-27 22:35:53.closed
by Jane Sandberg at 2023-06-27 22:35:53.head_ref_deleted
by Jane Sandberg at 2023-06-27 22:35:54.closed
by Jane Sandberg at 2023-06-27 22:35:55.review_requested
by Liz Garcia at 2023-06-28 14:41:53.referenced
by Christina Chortaria at 2023-06-28 15:14:11.merged
by Christina Chortaria at 2023-06-28 15:14:11.closed
by Christina Chortaria at 2023-06-28 15:14:11.head_ref_deleted
by Christina Chortaria at 2023-06-28 15:14:12.labeled
by Christina Chortaria at 2023-06-28 10:50:18.assigned
by Liz Garcia at 2023-06-28 10:50:26.closed
by Christina Chortaria at 2023-06-28 15:15:30.convert_to_draft
by Christina Chortaria at 2023-06-28 19:17:29.renamed
by Christina Chortaria at 2023-06-28 19:20:32.renamed
by Christina Chortaria at 2023-06-28 19:21:43.referenced
by Jane Sandberg at 2023-06-28 20:34:23.merged
by Jane Sandberg at 2023-06-28 20:34:23.closed
by Jane Sandberg at 2023-06-28 20:34:23.head_ref_deleted
by Jane Sandberg at 2023-06-28 20:34:24.head_ref_force_pushed
by None at 2023-06-28 20:58:21.deployed
by None at 2023-06-28 22:08:58.head_ref_force_pushed
by Jane Sandberg at 2023-06-28 22:17:51.deployed
by None at 2023-06-28 22:29:12.referenced
by Christina Chortaria at 2023-06-28 23:18:31.merged
by Christina Chortaria at 2023-06-28 23:18:31.closed
by Christina Chortaria at 2023-06-28 23:18:32.head_ref_deleted
by Christina Chortaria at 2023-06-28 23:18:32.labeled
by Christina Chortaria at 2023-06-28 20:36:57.closed
by Christina Chortaria at 2023-06-28 23:18:33.@minjiec based on the OCLC number google books return this cover page https://books.google.com/books?vid=OCLC1745235.
I think you could use this form to request a correction on the cover https://support.google.com/websearch/troubleshooter/6113172?hl=en&url=https://books.google.com/books?vid=OCLC1745235&hl=en&v=G1F5CQAAQBAJ&is=atb&visit_id=638235480505539176-3125556337&rd=2#ts=6113305
mentioned
by M Chen at 2023-06-28 11:34:40.subscribed
by M Chen at 2023-06-28 11:34:40.coverage: 95.403% (+0.03%) from 95.369% when pulling f5816d95a9eb343ad8ffa43e6e6c58026c4428c5 on fixrenderingbug into b7e5f3898aa19296b93d3a895719026911501bae on main.
referenced
by Max Kadel at 2023-06-28 17:14:16.merged
by Max Kadel at 2023-06-28 17:14:16.closed
by Max Kadel at 2023-06-28 17:14:16.head_ref_deleted
by Max Kadel at 2023-06-28 17:14:16.Check whether issue might be in app/helpers/holdings_helper.rb
and the use of .html_safe
labeled
by Kevin Reiss at 2023-06-28 22:58:11.referenced
by James R. Griffin III at 2023-06-28 03:43:41.merged
by James R. Griffin III at 2023-06-28 03:43:41.closed
by James R. Griffin III at 2023-06-28 03:43:42.head_ref_deleted
by James R. Griffin III at 2023-06-28 03:43:42.closed
by James R. Griffin III at 2023-06-28 03:43:43.Before addressing this issue let's confirm that it still happens after the changes that Carolyn and James did to remove ActiveStorage from the system (PRs https://github.com/pulibrary/pdc_describe/pull/1279 and https://github.com/pulibrary/pdc_describe/pull/1229)
labeled
by Hannah H at 2023-06-28 13:58:15.labeled
by Kate Lynch at 2023-06-28 14:04:26.Believed to be completed.
labeled
by Kate Lynch at 2023-06-28 14:08:56.unlabeled
by Bess Sadler at 2023-06-28 15:17:21.assigned
by Bess Sadler at 2023-06-28 15:21:46.labeled
by Bess Sadler at 2023-06-28 15:29:25.Referenced in https://github.com/pulibrary/pdc_describe/issues/1138
unlabeled
by Kate Lynch at 2023-06-28 15:24:27.labeled
by Kate Lynch at 2023-06-28 15:24:27.unlabeled
by Bess Sadler at 2023-06-28 15:31:23.labeled
by Bess Sadler at 2023-06-28 15:31:23.convert_to_draft
by James R. Griffin III at 2023-06-28 15:04:56.head_ref_force_pushed
by James R. Griffin III at 2023-06-28 15:09:34.ready_for_review
by James R. Griffin III at 2023-06-28 15:54:19.convert_to_draft
by James R. Griffin III at 2023-06-28 15:56:51.referenced
by James R. Griffin III at 2023-06-28 20:08:08.merged
by James R. Griffin III at 2023-06-28 20:08:08.closed
by James R. Griffin III at 2023-06-28 20:08:08.head_ref_deleted
by James R. Griffin III at 2023-06-28 20:08:09.closed
by James R. Griffin III at 2023-06-28 20:08:10.Verify whether this has been addressed already.
assigned
by Hector Correa at 2023-06-28 20:09:37.assigned
by Hannah H at 2023-06-28 18:27:10.transferred
by Kate Lynch at 2023-06-28 18:27:27.labeled
by Kate Lynch at 2023-06-28 18:28:21.Postpone until this data is available from PDC Describe.
@ishasinha1 and I looked at this briefly today. I submitted an lsupport ticket to take library-staging off of the lib-ponyexpr allowlist. We also looked at configuring the sendmail path in php.ini to catchmail
, but it was unsuccessful, since the library website uses this module that bypasses that setting.
mentioned
by None at 2023-06-27 22:43:07.subscribed
by None at 2023-06-27 22:43:07.review_requested
by Robert-Anthony Lee-Faison at 2023-06-28 18:31:03.review_requested
by Robert-Anthony Lee-Faison at 2023-06-28 18:31:03.review_requested
by Robert-Anthony Lee-Faison at 2023-06-28 18:44:56.review_requested
by Robert-Anthony Lee-Faison at 2023-06-28 18:44:56.head_ref_force_pushed
by Francis Kayiwa at 2023-06-28 12:26:19.head_ref_force_pushed
by Francis Kayiwa at 2023-06-28 14:42:07.head_ref_force_pushed
by Francis Kayiwa at 2023-06-28 16:54:20.head_ref_force_pushed
by Francis Kayiwa at 2023-06-28 19:00:26.head_ref_force_pushed
by Francis Kayiwa at 2023-06-28 23:38:46.Removing the estimate from this issue, as it is tracking ongoing work outside of ticketing and is throwing off pointing.
I double-checked and Christa is indeed a member of the SrTheses_Approvers
group on dataspace-staging:
None of the first three are critical to the operation of the site.
labeled
by Kevin Reiss at 2023-06-28 22:57:39.referenced
by Jane Sandberg at 2023-06-28 21:08:11.merged
by Jane Sandberg at 2023-06-28 21:08:11.closed
by Jane Sandberg at 2023-06-28 21:08:11.head_ref_deleted
by Jane Sandberg at 2023-06-28 21:09:27.base_ref_changed
by Jane Sandberg at 2023-06-28 21:09:14.deployed
by None at 2023-06-28 15:26:39.referenced
by Max Kadel at 2023-06-28 15:34:37.merged
by Max Kadel at 2023-06-28 15:34:37.closed
by Max Kadel at 2023-06-28 15:34:37.head_ref_deleted
by Max Kadel at 2023-06-28 15:34:38.labeled
by Kevin Reiss at 2023-06-28 23:02:31.


If everything worked OK, there should be a rotating 3D model above.
HTML model element: "Hello world". Please see github for more information.


Check your phone, we just sent you a verification number.
Sign-up
Authorize yourself through one the following services.
or you can input your information manually
What's your email?
This is private information and will not be visible to other users.
Enter a password
You will use this to login in the future.
Enter a display name
This is public and will be shown with your submitted content.
Turn on location services to find Universities
Celebre needs your location initially in order to match you only with universities that are near you. This is to prevent others from joining universities they are not enrolled in.
Select a University
Cant find your university? You may not be close enough to the university or we may not yet support your university
We only support a small list of schools currently, and are working to expand as fast as possible.


About
Learn programming
Home
BMSS Programming club
Tuesday at lunch Room 319
No programming experience required
Some languages we know
Join and we'll make this list bigger
Java
HTML/CSS
Swift
Python
Want to learn programming?
The programming club leaders will be teaching programming
The following list shows when we'll begin teaching:
Git
Every Tuesday at Lunch
HTML
Every Tuesday at Lunch
Unity/C#
Every Tuesday at Lunch


“The reviewer gets carried away with his own sensational tale of ‘Medea Blenkinsop, or the Octogamist’:
‘But think of the shifts and perplexities of a wife with eight husbands, being not only mysteriously married like Aurora Floyd to her noble husband's horse-trainer, but… also to the Emperor of China, who writes compromising letters by each mail, the more compromising as she is also secretly married to the postman, who is of a suspicious temper…; also, under peculiar circumstances, to the giant of a show that is coming to be set up at a fair in the neighbourhood; also to a maniac whom she keeps in the cellar.'”
Cited in The Maniac In The Cellar : Sensation Novels Of The 1860s by Winifred Hughes (Princeton University Press, 1980)


Installs Microsoft's Message Queueing system/feature.
Install-Msmq [-HttpSupport] [-ActiveDirectoryIntegration] [-Dtc] [-WhatIf] [-Confirm] [<CommonParameters>]
Microsoft's MSMQ is not installed by default. It has to be turned on manually. This function will enable the MSMQ feature. There are two sub-features: Active Directory integration and HTTP support. These can also be enabled by setting the ActiveDirectoryIntegration
and HttpSupport
switches, respectively. If MSMQ will be working with queues on other machines, you'll need to enable DTC (the Distributed Transaction Coordinator) by passing the DTC
switch.
This function uses Microsoft's feature management command line utilities: ocsetup.exe
or servermanagercmd.exe
. A word of warning, however. In our experience, these tools do not seem to work as advertised. They are very slow, and, at least with MSMQ, we have intermittent errors installing it on our developer's Windows 7 computers. We strongly recommend you install MSMQ manually on a base VM or computer image so that it's a standard part of your installation. If that isn't possible in your environment, good luck! let us know how it goes.
If you know better ways of installing MSMQ or other Windows features, or can help us figure out why Microsoft's command line installation tools don't work consistently, we would appreciate it.
| Name | Type | Description | Required? | Pipeline Input | Default Value |
|---|---|---|---|---|---|
| HttpSupport | SwitchParameter | Enable HTTP Support |
false | false | False |
| ActiveDirectoryIntegration | SwitchParameter | Enable Active Directory Integrations |
false | false | False |
| Dtc | SwitchParameter | Will MSMQ be participating in external, distributed transactions? I.e. will it be sending messages to queues on other machines? |
false | false | False |
| WhatIf | SwitchParameter | false | false | ||
| Confirm | SwitchParameter | false | false | ||
| CommonParameters | This cmdlet supports common parameters. For more information type Get-Help about_CommonParameters . |
Install-Msmq
Installs MSMQ on this meachine. In our experience, this may or may not work. You'll want to check that the MSMQ service exists and is running after this. Please help us make this better!
Install-Msmq -HttpSupport -ActiveDirectoryIntegration -Dtc
Installs MSMQ with the HTTP support and Active Directory sub-features. Enables and starts the Distributed Transaction Coordinator.


|
|
|
Name |
{{element.name}}
|
Created | {{element.created_at | date:'short'}} | Updated | {{element.updated_at | date:'short'}} | Edit | Use | Visibility | Delete |
You have selected {{selection.selected.length}} items
|
|---|


clientTutorialCPP is a tutorial for using pvaClientCPP
NOTE: This document is mainly for people who want to create client code for communicating with servers that can be accessed via the EPICS 7 channel providers pva or ca.
The reader should be familiar with developerGuide
In particular the reader should be familiar with pvDataCPP, normativeTypesCPP, and pvaClientCPP
The tutorial examples uses pvaClientCPP rather than pvAccessCPP. pvaClient is a wrapper on top of pvAccess. pvAccess provides a callback based API, which can be complicated to use. pvaClient provides a synchronous interface as well as a symplified callback interface.
Suggestions for a first time reader:
cd modules git clone https://github.com/epics-base/exampleCPP.git cd exampleCPP make
cd modules git clone https://github.com/mrkraimer/pvaClientTutorialCPP.git cd pvaClientTutorialCPP make
In order to run the examples, exampleCPP/database must be built and then the IOC database started:
mrk> pwd /home/epicsv4/master/exampleCPP/database/iocBoot/exampleDatabase mrk> ../../bin/linux-x86_64/exampleDatabase st.cmd
These are examples that block while waiting for a channel to connect. They are good examples for creating command line or scripting tools.
Each example provides help. For example:
mrk> bin/linux-x86_64/numericScalar -help -h -p providerName channelNames default -p pva PVRdouble
pvaClient provides convenience methods for a value field that is a numeric scalar. The convenience methods are getDouble and putDouble. This methods work on any top level value field that is a numeric scalar.
Look at numericScalar.cpp while executing the following:
mrk> pwd /home/epicsv4/masterCPP/pvaClientTutorialCPP mrk> bin/linux-x86_64/numericScalar channelName PVRdouble providerName pva get double with defaults 1 get double without defaults 1 get double long way 2 mrk> bin/linux-x86_64/numericScalar PVRint channelName PVRint providerName pva get double with defaults 1 get double without defaults 1 get double long way 2 mrk> bin/linux-x86_64/numericScalar DBRint00 channelName DBRint00 providerName pva get double with defaults 1 get double without defaults 1 get double long way 2 mrk> bin/linux-x86_64/numericScalar -p ca DBRint00 channelName DBRint00 providerName ca get double with defaults 1 get double without defaults 1 get double long way 2 mrk> bin/linux-x86_64/numericScalar PVRstring channelName PVRstring providerName pva exception PVRstring value is not a compatible scalar
The following connects to more than one channel:
mrk> bin/linux-x86_64/numericScalar PVRdouble PVRlong channelName PVRdouble providerName pva get double with defaults 1 get double without defaults 1 get double long way 2 channelName PVRlong providerName pva get double with defaults 1 get double without defaults 1 get double long way 2
pvaClient provides convenience methods for a value field that is a scalar. The convenience methods are getString and putString. This methods work on any top level value field that is a scalar.
Look at stringScalar.cpp while executing the following:
mrk> bin/linux-x86_64/stringScalar -h -h -p providerName -v value channelNames default -p pva -v 10.1 PVRdouble mrk> bin/linux-x86_64/stringScalar channelName PVRdouble providerName pva get string with defaults 10.1 get string without defaults 10.1 get string long way 10.1 mrk> bin/linux-x86_64/stringScalar -v test DBRstring00 channelName DBRstring00 providerName pva get string with defaults test get string without defaults test get string long way test mrk> bin/linux-x86_64/stringScalar -p ca -v test DBRstring00 channelName DBRstring00 providerName ca get string with defaults test get string without defaults test get string long way test mrk> bin/linux-x86_64/stringScalar -v true PVRboolean channelName PVRboolean providerName pva get string with defaults true get string without defaults true get string long way true mrk> bin/linux-x86_64/stringScalar PVRboolean channelName PVRboolean providerName pva exception parseToPOD: string no match true/false
This example shows how to connect to a value field that has type pvInt, i. e. a field that is a 32 bit integer.
Look at intScalar.cpp while executing the following:
mrk > bin/linux-x86_64/intScalar channelName PVRint providerName pva get int with defaults 1 get int without defaults 1 get int long way 2 mrk> bin/linux-x86_64/intScalar DBRint00 channelName DBRint00 providerName pva get int with defaults 1 get int without defaults 1 get int long way 2 mrk> bin/linux-x86_64/intScalar -p ca DBRint00 channelName DBRint00 providerName ca get int with defaults 1 get int without defaults 1 get int long way 2 mrk> bin/linux-x86_64/intScalar PVRdouble channelName PVRdouble providerName pva no pvInt value field mrk> bin/linux-x86_64/intScalar PVRhelloPutGet channelName PVRhelloPutGet providerName pva exception channel PVRhelloPutGet PvaClientPut::connect PvaClientPut::channelPutConnect) pvRequest structure structure field structure value error invalid pvRequest
Like intScalar this example shows how to connect to a field that has type pvInt, i. e. a field that is a 32 bit integer. But unlike intScalar The field does not have to be a top level field named value.
Look at intScalarNonValue.cpp while executing the following:
mrk> pvinfo PVRint PVRint Server: <IP_ADDRESS>:5075 Type: epics:nt/NTScalar:1.0 int value alarm_t alarm int severity int status string message time_t timeStamp long secondsPastEpoch int nanoseconds int userTag mrk> bin/linux-x86_64/intScalarNonValue channelName PVRint providerName pva request value get int 1 get int again 2 mrk> pvget -r "timeStamp.userTag" PVRint PVRint structure structure timeStamp int userTag 0 mrk> bin/linux-x86_64/intScalarNonValue -r "timeStamp.userTag" PVRint channelName PVRint providerName pva request timeStamp.userTag get int 1 get int again 2 mrk> pvget -r "timeStamp.userTag" PVRint PVRint structure structure timeStamp int userTag 2
One of the properties defined in pvData is timeStamp. This example shows how to use TimeStamp and PVAlarm
Look at timeStamp.cpp while executing the following:
mrk> bin/linux-x86_64/timeStamp channelName PVRdouble providerName pva time 2017.11.08 14:28:29.805478760 userTag 0
Another property defined in pvData is alarm. This example shows how to use Alarm and PVAlarm
Look at alarm.cpp while executing the following:
mrk> bin/linux-x86_64/alarm channelName PVRdouble providerName pva alarm message "" severity NONE status NONE mrk> bin/linux-x86_64/alarm channelName PVRdouble providerName pva alarm message "" severity NONE status NONE mrk> pvput -r "alarm.message" PVRdouble '{"alarm.message":"a message"}' ... mrk> bin/linux-x86_64/alarm channelName PVRdouble providerName pva alarm message "a message" severity NONE status NONE
Another property defined in pvData is enumerated. This example shows how to use PVEnumerated
Look at enum.cpp while executing the following:
mrk> bin/linux-x86_64/enum channelName PVRenum providerName pva get choice with defaults index 0 choice zero get choice long way index 1 choice one
These are examples that never block while waiting for a channel to connect. They are good examples for use by display manager tools.
Each has an internal class that could be used as a starting point for use by a client. Each virtual method is a callback. Non virtual methods are example specific and called by the main part of the example.
This is an example of a non-blocking monitor. It has the options:
mrk> bin/linux-x86_64/monitor -h -h -p provider -r request channelNames default -p pva -r value,alarm,timeStamp PVRdouble mrk>An example is:
mrk> bin/linux-x86_64/monitor PVRdouble PVRdoubleArray PVRstring PVRstringArray channelStateChange PVRdouble isConnected false channelStateChange PVRdoubleArray isConnected false channelStateChange PVRstring isConnected false channelStateChange PVRstringArray isConnected false channelStateChange PVRdouble isConnected true monitorConnect PVRdouble status Status [type=OK] monitor changed = structure double value 0 alarm_t alarm int severity 0 int status 0 string message a message time_t timeStamp long secondsPastEpoch<PHONE_NUMBER> int nanoseconds 805478760 int userTag 0 overrun channelStateChange PVRdoubleArray isConnected true channelStateChange PVRstring isConnected true channelStateChange PVRstringArray isConnected true monitorConnect PVRdoubleArray status Status [type=OK] monitorConnect PVRstring status Status [type=OK] monitorConnect PVRstringArray status Status [type=OK] monitor changed = structure double[] value [] alarm_t alarm int severity 0 int status 0 string message time_t timeStamp long secondsPastEpoch 0 int nanoseconds 0 int userTag 0 overrun monitor changed = structure string value alarm_t alarm int severity 0 int status 0 string message time_t timeStamp long secondsPastEpoch 0 int nanoseconds 0 int userTag 0 overrun monitor changed = structure string[] value [] alarm_t alarm int severity 0 int status 0 string message time_t timeStamp long secondsPastEpoch 0 int nanoseconds 0 int userTag 0 overrun ...Leave this running and in another window issue the following:
mrk> pvput -r value PVRdouble 15.0 Old : 0 New : 15 mrk> pvput -r value PVRdoubleArray [1,2,3,4,5] Old : [] New : [1,2,3,4,5] mrk> pvput -r value PVRstring "a message" Old : New : "a message" mrk> pvput -r value PVRstringArray [one,two,three,four,five] Old : [] New : [one, two, three, four, five]
This is an example of a non-blocking channelPut. It has the options:
mrk> bin/linux-x86_64/putNoBlock -help -h -p provider -r request channelNames default -p pva -r value PVRdouble
This example works on any chaannel that has a top level field with the name value and has type scalar or scalar array. After the example is started then You can enter exit or valid value for the type associated with the field value.
In order to see the results of the following examples first start:
mrk> pvget -m -r "value,timeStamp" PVRdouble PVRdoubleArray PVRstring PVRstringArray PVRboolean PVRbooleanArray
The first example is a numeric scalar:
mrk> bin/linux-x86_64/putNoBlock channelName PVRdouble providerName pva channelPutConnect PVRdouble status Status [type=OK] 1.2 putDone PVRdouble status Status [type=OK] 10.0 putDone PVRdouble status Status [type=OK] exit
The next example is a scalar string:
mrk> bin/linux-x86_64/putNoBlock PVRstring channelName PVRstring providerName pva channelPutConnect PVRstring status Status [type=OK] test putDone PVRstring status Status [type=OK] new value putDone PVRstring status Status [type=OK] exit
The next example is a numeric scalar array:
mrk> bin/linux-x86_64/putNoBlock PVRdoubleArray channelName PVRdoubleArray providerName pva channelPutConnect PVRdoubleArray status Status [type=OK] 1 2 3 4 5 putDone PVRdoubleArray status Status [type=OK] 10.1 10.2 10.3 10.4 10.5 putDone PVRdoubleArray status Status [type=OK] exit mrk>
The next example is a string scalar array:
mrk> bin/linux-x86_64/putNoBlock PVRstringArray channelName PVRstringArray providerName pva channelPutConnect PVRstringArray status Status [type=OK] a b c d e f putDone PVRstringArray status Status [type=OK] one two three four five six putDone PVRstringArray status Status [type=OK] exit
The next example is a boolean scalar:
mrk> bin/linux-x86_64/putNoBlock PVRboolean channelName PVRboolean providerName pva channelPutConnect PVRboolean status Status [type=OK] true putDone PVRboolean status Status [type=OK] false putDone PVRboolean status Status [type=OK] exit
The last example is a boolean scalar array:
mrk> bin/linux-x86_64/putNoBlock PVRbooleanArray channelName PVRbooleanArray providerName pva channelPutConnect PVRbooleanArray status Status [type=OK] false true false true true putDone PVRbooleanArray status Status [type=OK] exit
This is an example of a non-blocking channelGet. It has the options:
mrk> bin/linux-x86_64/getNoBlock -help -h -p provider -r request channelNames default -p pva -r value,alarm,timeStamp PVRdouble
This example gets the defaults:
mrk> bin/linux-x86_64/getNoBlock channelName PVRdouble providerName pva channelGetConnect PVRdouble status Status [type=OK] channelGetDone PVRdouble status Status [type=OK] changed PVRdouble = structure double value 1 alarm_t alarm int severity 0 int status 0 string message time_t timeStamp long secondsPastEpoch<PHONE_NUMBER> int nanoseconds 262291917 int userTag 1 bitSet {0} channelGetDone PVRdouble status Status [type=OK] changed PVRdouble value = 2 timeStamp.secondsPastEpoch =<PHONE_NUMBER> timeStamp.nanoseconds = 5572772 bitSet {1, 7, 8} exit
The next example gets the value for two channels:
mrk> bin/linux-x86_64/getNoBlock PVRdouble PVRdoubleArray channelName PVRdouble providerName pva channelName PVRdoubleArray providerName pva channelGetConnect PVRdouble status Status [type=OK] channelGetConnect PVRdoubleArray status Status [type=OK] channelGetDone PVRdouble status Status [type=OK] changed PVRdouble = structure double value 2 alarm_t alarm int severity 0 int status 0 string message time_t timeStamp long secondsPastEpoch<PHONE_NUMBER> int nanoseconds 5572772 int userTag 1 bitSet {0} channelGetDone PVRdoubleArray status Status [type=OK] changed PVRdoubleArray = structure double[] value [] alarm_t alarm int severity 0 int status 0 string message time_t timeStamp long secondsPastEpoch 0 int nanoseconds 0 int userTag 0 bitSet {0} channelGetDone PVRdouble status Status [type=OK] channelGetDone PVRdoubleArray status Status [type=OK] exit


jQuery UI Plugin which leverages the jquery ui menu control, styled with your existing jquery ui theme, features hover highlighting, click and double click. This plugin will not be officially released until jQuery UI version 1.9 is released (which includes the menu as an officially supported widget).


Class Consts
Inheritance
System.Object
Consts
Assembly: Polkadot.dll
Syntax
public static class Consts : object
Fields
|
Improve this Doc
View Source
ADDRESS_LENGTH
Declaration
public const int ADDRESS_LENGTH = null
Field Value
| Type |
Description |
| System.Int32 |
|
|
Improve this Doc
View Source
ADDRESS_SEPARATOR
Declaration
public const byte ADDRESS_SEPARATOR = null
Field Value
| Type |
Description |
| System.Byte |
|
|
Improve this Doc
View Source
BLOCK_HASH_SIZE
Declaration
public const long BLOCK_HASH_SIZE = null
Field Value
| Type |
Description |
| System.Int64 |
|
|
Improve this Doc
View Source
CertFileName
Declaration
public const string CertFileName = null
Field Value
| Type |
Description |
| System.String |
|
|
Improve this Doc
View Source
DEFAULT_FIXED_EXSTRINSIC_SIZE
Declaration
public static int DEFAULT_FIXED_EXSTRINSIC_SIZE
Field Value
| Type |
Description |
| System.Int32 |
|
|
Improve this Doc
View Source
LAST_LENGTH_CHANGE_SUBSCRIPTION
Declaration
public const string LAST_LENGTH_CHANGE_SUBSCRIPTION = null
Field Value
| Type |
Description |
| System.String |
|
|
Improve this Doc
View Source
MAX_METHOD_BYTES_SZ
Declaration
public const int MAX_METHOD_BYTES_SZ = null
Field Value
| Type |
Description |
| System.Int32 |
|
|
Improve this Doc
View Source
PAPI_OK
Declaration
public const int PAPI_OK = null
Field Value
| Type |
Description |
| System.Int32 |
|
|
Improve this Doc
View Source
PUBLIC_KEY_LENGTH
Declaration
public const int PUBLIC_KEY_LENGTH = null
Field Value
| Type |
Description |
| System.Int32 |
|
|
Improve this Doc
View Source
RESPONSE_TIMEOUT_S
Declaration
public const int RESPONSE_TIMEOUT_S = null
Field Value
| Type |
Description |
| System.Int32 |
|
|
Improve this Doc
View Source
SESSION_LENGTH_SUBSCRIPTION
Declaration
public const string SESSION_LENGTH_SUBSCRIPTION = null
Field Value
| Type |
Description |
| System.String |
|
|
Improve this Doc
View Source
SIGNATURE_VERSION
Declaration
public const byte SIGNATURE_VERSION = null
Field Value
| Type |
Description |
| System.Byte |
|
|
Improve this Doc
View Source
SR25519_PUBLIC_SIZE
Declaration
public const int SR25519_PUBLIC_SIZE = null
Field Value
| Type |
Description |
| System.Int32 |
|
|
Improve this Doc
View Source
SR25519_SIGNATURE_SIZE
Declaration
public const int SR25519_SIGNATURE_SIZE = null
Field Value
| Type |
Description |
| System.Int32 |
|
|
Improve this Doc
View Source
STORAGE_KEY_BYTELENGTH
Declaration
public const int STORAGE_KEY_BYTELENGTH = null
Field Value
| Type |
Description |
| System.Int32 |
|
|
Improve this Doc
View Source
STORAGE_TYPE_ACCOUNT_INDEX
Declaration
public const string STORAGE_TYPE_ACCOUNT_INDEX = null
Field Value
| Type |
Description |
| System.String |
|
|
Improve this Doc
View Source
STORAGE_TYPE_ADDRESS
Declaration
public const string STORAGE_TYPE_ADDRESS = null
Field Value
| Type |
Description |
| System.String |
|
|
Improve this Doc
View Source
STORAGE_TYPE_BLOCK_NUMBER
Declaration
public const string STORAGE_TYPE_BLOCK_NUMBER = null
Field Value
| Type |
Description |
| System.String |
|
|
Improve this Doc
View Source
STORAGE_TYPE_HASH
Declaration
public const string STORAGE_TYPE_HASH = null
Field Value
| Type |
Description |
| System.String |
|
|
Improve this Doc
View Source
STORAGE_TYPE_PARACHAIN_ID
Declaration
public const string STORAGE_TYPE_PARACHAIN_ID = null
Field Value
| Type |
Description |
| System.String |
|
|
Improve this Doc
View Source
STORAGE_TYPE_PROPOSAL_INDEX
Declaration
public const string STORAGE_TYPE_PROPOSAL_INDEX = null
Field Value
| Type |
Description |
| System.String |
|
|
Improve this Doc
View Source
STORAGE_TYPE_REFERENDUM_INDEX
Declaration
public const string STORAGE_TYPE_REFERENDUM_INDEX = null
Field Value
| Type |
Description |
| System.String |
|
|
Improve this Doc
View Source
STORAGE_TYPE_U32
Declaration
public const string STORAGE_TYPE_U32 = null
Field Value
| Type |
Description |
| System.String |
|
|
Improve this Doc
View Source
WsConnectionString
Declaration
public const string WsConnectionString = null
Field Value
| Type |
Description |
| System.String |
|
|
Improve this Doc
View Source
WssConnectionString
Declaration
public const string WssConnectionString = null
Field Value
| Type |
Description |
| System.String |
|


Invitation Details
Author
(NO DATA)
Subject
(NO DATA)
Description
(NO DATA)
Deadline
(NO DATA)
(NO DATA)
(NO DATA)
Number of attend
(NO DATA)
Number of pass
(NO DATA)
(NO DATA)
Name
Answer
Message
(NO DATA)
YES
NO
(NO DATA)


Chatbots are the next wave of marketing tools being adopted by companies and brands of all sizes to streamline their services - from bots answering frequently asked questions (saving you and your business time and money!) to disseminating fresh content in a fun and timely manner to simply creating a more constant connection with your clients/customers/fans.
You've probably encountered a few already without even knowing it...
I build chatbots with personality and a user-first mentality using Chatfuel and its many integrations to connect you with your audience, helping you understand and serve their needs better.
BlueBot was created as a test to see how a quiz on a website might translate to a messenger format. Following the Coffee Match Quiz on Blue Bottle Coffee's website, I tried to capture the vibe of the brand and give the user something more interactive and fun than the traditional, flat quiz experience.
This bot includes the coffee match quiz, a subscription/unsubscription sequence, an automated follow-up sequence when the user does not complete the quiz, and an automated follow-up sequence once the quiz has been completed prompting them for feedback on the coffee they were matched with and providing them a link to where they can purchase it if they haven't already.
Daddy was created for the romance novelist Kira Blakely as a means of interacting with her fans and giving them more input in the novels she releases. She had been communicating with them through her expansive email list, but a majority of the emails sent went unread. This bot was designed as a more playful means of connecting with fans than the traditional email system she was using. Connected to her facebook page and in conjunction with facebook ads, this bot gathered user feedback on book covers and titles through a series of fun quizzes they they were encouraged to complete in exchange for access to exclusive content.
Daddy performed extremely well in increasing customer engagement, with the open rates from messages sent via Daddy vs the traditional email blasts Kira was using increasing exponentially.
This bot includes multiple quizzes that gather user feedback and compile them in a google sheet, a subscription/unsubscription sequence, and a fun sidetrack for users filled with saucy gifs, as per her brand. Daddy was also used to announce book releases via broadcast messages sent to all users who had subscribed to its messages. A small amount of AI helps to maintain the flow of the bot's sequences.
BotFluevog was created to test how an online store might be converted to a messenger format, in which users can browse and buy items directly from messenger. I took inspiration from the website to create the personality and flow of the bot to add a bit more to the user's shopping experience.
This bot includes a small directory of items, a subscribe/unsubscribe sequence, and a 'personal stylist' - a quiz matching the user with items they might enjoy based on questions about their taste/style.