{% load static %}
Katie is a free broadcast platform, that streams simulated road traffic data.
It means Katie shares with you, for free, data that represents simulated road traffic. You know, vehicles, streets, junctions, traffic lights. Data are generated by an external simulator and Katie makes it available for everyone, without any cost, without any information request. Not even your email is required.
Data is knowledge, power and ... fun! Here are some things you can do with our data:
Data are publicly available via websocket connections open to the world. Moreover, we have built clients for downloading and streaming in real time this data, so that you can download and run your favorite in a few click. Check out this GitHub project.
This is an experimental platform built for data scientists and researchers. We plan on releasing as many clients as we can, for the most common science-oriented languages (R, MatLab, etc.): at the moment only the Python client is available. We also plan on integrating much more complex simulators than the current one, potentially a microscopic simulator like SUMO.
It is possible! But please get in touch first, by opening a ticket.
True! We are still in beta, and we plan on integrating a large and realistic model as soon as possible, perhaps using SUMO.
Not yet :) But if you are interested and may be planning to contribute, definitely get in touch!


GOV.UK uses cookies to make the site simpler. Find out more about cookies
Search for a legal adviser or family mediator with a legal aid contract in England and Wales.
{{ filteredCount }} results in total. Showing 10 results near {{ latestSearchInput }}
Address: {{ provider.address }}
Helpline: {{ provider.tel }}


Editor Help
What is an Editor?It's a basic text editing text-editing program and it's most commonly used to view or edit text files.
The extension fo these files is .txt.
How do I open a file in the Editor?Click Open from the File menu or from the Menu Toolbar. If you are already working on a file, it will ask you to Save. If you choose Yes it will show the Save dialog and you can save the file. If you choose No, the file will not be saved and the Open dialog will appear from where you can select the file you wish to open.How do I save a file in the Editor?Click on Save from the File menu or from the Menu Toolbar. The Save dialog would appear. Enter the filename and click on Save.How do I edit a file in the editor?Open a file or start with a New file. Type in the required text. Do one of the following:
To cut text so you can move it to another location, select the text, click the Edit menu, and then click Cut.
To copy text so you can paste it in another location, select the text, click the Edit menu, and then click Copy.
To paste text you have cut or copied, click the location in the file where you want to paste the text, click the Edit menu, and then click Paste.
- To delete text, select it, click the Edit menu, and then click Delete.
You can also use these above options from the Menu Toolbar.
How do I print a text file?Click the File menu, and then click Print.
Or
Click Print button from the Menu Toolbar.


UNDERSTAND CLIENTS' NEEDS
We carefully study each customer case to understand the client’s
needs and objectives, and deliver a reliable and efficient solution.
We analyze all available options
and provide competent advice to guide clients to informed business decisions and aslo provide the solutions.
PARTNER WITH CLIENTS
We go an extra mile to become our
clients' long-term, trusted partner. Our priority is not only
providing professional services and solutions, but becoming a true technology partner,
dedicated to meeting client needs today and supporting clients'
growing business needs tomorrow.
DELIVER MAXIMUM VALUE
AT DreamTeam, we are committed to delivering maximum
value to our clients to help them succeed in a constantly changing and
challenging business world. Our fundamental corporate values stem from
understanding that our success is tied to the success of our clients.


Contact Details
Colm Byrne
Cave
Clarinbridhge
Co. Galway
Ireland
Whats your name, bud?
Email please
WHats your handle buddy


assigned
by James R. Griffin III at 2021-10-21 14:07:34.labeled
by James R. Griffin III at 2021-10-21 14:07:38.labeled
by James R. Griffin III at 2021-10-21 14:07:46.milestoned
by James R. Griffin III at 2021-10-21 14:07:56.mentioned
by None at 2021-10-21 15:25:20.subscribed
by None at 2021-10-21 15:25:21.milestoned
by Christina Chortaria at 2021-10-21 15:25:39.milestoned
by Hector Correa at 2021-10-21 18:50:28.More sample records: * https://catalog.princeton.edu/catalog/9968003873506421 * https://catalog.princeton.edu/catalog/9970802153506421 (two links to same related MMS ID) * https://catalog.princeton.edu/catalog/9960995293506421 * https://catalog.princeton.edu/catalog/9954759103506421
closed
by Christina Chortaria at 2021-10-21 18:54:22.mentioned
by Kevin Reiss at 2021-10-21 20:02:50.subscribed
by Kevin Reiss at 2021-10-21 20:02:50.mentioned
by None at 2021-10-21 20:02:50.subscribed
by None at 2021-10-21 20:02:50.review_requested
by Christina Chortaria at 2021-10-21 20:18:22.referenced
by Christina Chortaria at 2021-10-21 20:27:12.merged
by Christina Chortaria at 2021-10-21 20:27:13.closed
by Christina Chortaria at 2021-10-21 20:27:13.head_ref_deleted
by Christina Chortaria at 2021-10-21 20:27:13.This a new work order that was put in place. The raw alma data for this type comes through the Alma API as
"value": "WORK_ORDER_DEPARTMENT",
"desc": "In Process"
},
"work_order_type": {
"value": "CollDev",
"desc": "Collection Development Office"
},
"work_order_at": {
"value": "CollDev",
"desc": "Collection Development Office"
},
milestoned
by Christina Chortaria at 2021-10-21 18:06:04.assigned
by Hector Correa at 2021-10-21 19:25:33.demilestoned
by Hector Correa at 2021-10-21 20:13:16.milestoned
by Hector Correa at 2021-10-21 20:13:16.closed
by Christina Chortaria at 2021-10-21 20:27:13.referenced
by None at 2021-10-21 20:39:38.merged
by None at 2021-10-21 20:39:38.closed
by None at 2021-10-21 20:39:39.head_ref_deleted
by None at 2021-10-21 20:39:39.referenced
by Trey Pendragon at 2021-10-21 20:34:52.closed
by None at 2021-10-21 20:39:39.While important, this does not block release. we should be ok with what we have for a while
@sdellis can you weigh in here? what do you think about the spacing and usability? the font size also looks larger in staging.
mentioned
by Shaun Ellis at 2021-10-21 07:16:57.subscribed
by Shaun Ellis at 2021-10-21 07:16:57.idea: other than 3 (soon to be 2) outliers, all of our exhibits have either one or two line titles. same with Stanfords site. two lines should be the max. in most (if we cant make all) cases. I like the smaller font size that @hackartisan is suggesting. can we fix the width to the 2 line title examples for the overlay?
mentioned
by None at 2021-10-21 08:52:00.subscribed
by None at 2021-10-21 08:52:00.labeled
by Kim Leaman at 2021-10-21 09:07:57.labeled
by Kim Leaman at 2021-10-21 09:07:57.labeled
by Kim Leaman at 2021-10-21 09:18:51.labeled
by Kim Leaman at 2021-10-21 09:18:51.labeled
by Kim Leaman at 2021-10-21 09:18:51.labeled
by Kim Leaman at 2021-10-21 08:43:19.labeled
by Kim Leaman at 2021-10-21 08:43:19.renamed
by Kim Leaman at 2021-10-21 09:30:48.@hackartisan are you wanting work cycle label here? I agree. They are too tall. "Save" and "Save Changes" buttons in "Customize appearance", "Order Collections", "Create a new collection" are all the same height.
"add new administrator" button in "Manage administrators" height looks good and is different from the ones mentioned above (different from prod but i like it).
save button for saving searches are also too tall. Same height as mentioned above.
I will add the label and we can discuss priority.
mentioned
by None at 2021-10-21 08:13:19.subscribed
by None at 2021-10-21 08:13:19.labeled
by None at 2021-10-21 13:41:52.labeled
by Trey Pendragon at 2021-10-20 23:03:24.referenced
by None at 2021-10-21 13:48:05.merged
by None at 2021-10-21 13:48:05.closed
by None at 2021-10-21 13:48:05.head_ref_deleted
by None at 2021-10-21 13:48:05.@hackartisan can you give me more information here or walk me through what you are describing?
haha, yes this makes absolutely no sense I'm sorry.
On a narrow-width screen (like a phone view) there's an "expand menu" button at the top right (this icon is known as the hamburger icon because it kind of looks like a hamburger I guess).
Then there's a second hamburger icon above the search results to expand the facet dropdowns. @sdellis's suggestion was to use the "funnel" icon for the facet dropdown use case, so we don't have two hamburgers, and because the facet area is not actually a menu (which is what hamburger icon usually denotes). The funnel is often used do denote narrowing a search.
A funnel icon would look something like https://www.flaticon.com/free-icon/filter_1159884?term=funnel&page=1&position=8&page=1&position=8&related_id=1159884&origin=tag (not sure exactly what icon font we use).
Screenshot:
mentioned
by None at 2021-10-21 08:02:43.subscribed
by None at 2021-10-21 08:02:43.mentioned
by Shaun Ellis at 2021-10-21 13:56:23.subscribed
by Shaun Ellis at 2021-10-21 13:56:23.I find that we are the only ones that do this, and perhaps Tom V. we should get to this, but i don't see it as something that has to be completed this work cycle. other tickets take priority over this one. thoughts?
That was our feeling, as well, unfortunately, although it's really nice to have.
I think I saw a note somewhere that said a language isn't available to become public until all the translations for it are done.
That makes sense. Ill confirm and then close ticket if that is the case
labeled
by Kim Leaman at 2021-10-21 09:24:10.labeled
by Kim Leaman at 2021-10-21 09:24:10.labeled
by Kim Leaman at 2021-10-21 10:22:04.renamed
by None at 2021-10-21 14:58:58.renamed
by None at 2021-10-21 14:59:05.Honeybadger error: https://app.honeybadger.io/projects/51733/faults/82135333
labeled
by Kim Leaman at 2021-10-21 08:34:18.labeled
by Kim Leaman at 2021-10-21 08:34:18.This looks fixed, @hackartisan (see below). No text overlap for me and item jumps down to new row. close ticket?
Full size, laptop:
Condensed 01:
condensed 02 (Item moves to new row to make room):
you're right it looks good. I think the problem was the ones I was looking at had underscores in their titles making individual "words" very long, which I expect will never happen.
mentioned
by None at 2021-10-21 07:26:05.subscribed
by None at 2021-10-21 07:26:05.closed
by None at 2021-10-21 17:24:46.assigned
by Trey Pendragon at 2021-10-20 22:38:49.referenced
by Trey Pendragon at 2021-10-20 23:02:29.closed
by Trey Pendragon at 2021-10-21 18:23:58.Looks good to me.
labeled
by Kim Leaman at 2021-10-21 09:50:18.labeled
by Kim Leaman at 2021-10-21 09:54:03.closed
by Trey Pendragon at 2021-10-21 18:26:07.labeled
by Kim Leaman at 2021-10-21 10:07:25.closed
by Trey Pendragon at 2021-10-21 18:27:24.Honeybadger error: https://app.honeybadger.io/projects/51733/faults/82136845
labeled
by Kim Leaman at 2021-10-21 10:17:50.labeled
by Kim Leaman at 2021-10-21 10:17:50.assigned
by Trey Pendragon at 2021-10-21 18:33:33.unassigned
by Trey Pendragon at 2021-10-21 18:33:47.assigned
by Eliot Jordan at 2021-10-21 19:15:20.confirmed: blocks releasse
The problem here is that there's a border that's above the facet that looks bad.
labeled
by Kim Leaman at 2021-10-21 07:10:30.renamed
by Kim Leaman at 2021-10-21 08:13:46.assigned
by Shaun Ellis at 2021-10-21 19:43:38.renamed
by Trey Pendragon at 2021-10-21 19:43:48.Take the green color off the header, but use prod green on text.
labeled
by Kim Leaman at 2021-10-21 08:28:25.labeled
by Kim Leaman at 2021-10-21 08:28:25.mentioned
by Shaun Ellis at 2021-10-21 08:28:26.subscribed
by Shaun Ellis at 2021-10-21 08:28:26.labeled
by Kim Leaman at 2021-10-21 19:55:42.labeled
by Kim Leaman at 2021-10-21 19:55:42.labeled
by Kim Leaman at 2021-10-21 19:55:42.I'm pretty confused about what got tested here. We should look at this together.
Split into two tickets. two separate issues.
labeled
by Kim Leaman at 2021-10-21 08:00:03.renamed
by Kim Leaman at 2021-10-21 08:00:25.renamed
by Kim Leaman at 2021-10-21 19:56:44.unlabeled
by Kim Leaman at 2021-10-21 20:01:35.I have issues with the masonry view and no one uses it (or likes i much, when we have talked about it). This is low priority
Closing because nobody wants the masonry view anyways
labeled
by Kim Leaman at 2021-10-21 07:41:38.closed
by Trey Pendragon at 2021-10-21 20:02:29.referenced
by Trey Pendragon at 2021-10-21 20:54:50.merged
by Trey Pendragon at 2021-10-21 20:54:50.closed
by Trey Pendragon at 2021-10-21 20:54:50.head_ref_deleted
by Trey Pendragon at 2021-10-21 20:54:51.deployed
by None at 2021-10-21 14:01:40.This is done but a PR is forthcoming to update the date handling of the prod-to-staging replication
referenced
by None at 2021-10-21 20:45:32.closed
by Trey Pendragon at 2021-10-21 20:54:58.closed
by James R. Griffin III at 2021-10-21 14:05:41.assigned
by Kate Lynch at 2021-10-21 15:22:35.milestoned
by Kate Lynch at 2021-10-21 15:22:37.Access was granted afternoon of 2021/10/20. I tested access this morning and was unable to log in using the method that has been successful for EUS. Followed up for support from Operations.
demilestoned
by Kate Lynch at 2021-10-21 15:19:11.milestoned
by Kate Lynch at 2021-10-21 15:19:11.This was just reported as having not been resolved by the reporting user.
Load the JRuby terminal: ``` $ source $HOME/.rvm/scripts/rvm $ cd ~/pulibrary-src/dspace-cli $ bin/dspace-irb $eperson Using /dspace Loading jars Loading /dspace/config/dspace.cfg INFO: Loading provided config file: /dspace/config/dspace.cfg INFO: Using dspace provided log configuration (log.init.config) INFO: Loading: /dspace/config/log4j.properties Starting new DSpaceKernel DB jdbc:postgresql://localhost:5432/dspacedb, UserName=dspacedb_user, PostgreSQL JDBC Driver jruby-<IP_ADDRESS> :001 >
In the JRuby terminal:
query = DSpace::CLI::Query.new
query.findbyhandle('88435/dsp010k225f00b') first_item = query.results.first
collectionhandle = '88435/dsp01c247ds15b' collection = DSpace::CLI::SeniorThesisCollection.findforhandle(collectionhandle) collection.removeItem(first_item) collection.index ```
Note: to ensure that changes take place across DataSpace, after updating the object's collection association, edit the item and update it using the web UI. If there is a certificate program affiliation using the pu.certificate
metadata field value, remove it in the web UI and update the item to avoid it getting updated and reindexed later on.
assigned
by Kate Lynch at 2021-10-21 18:02:20.As stated in the linked issue from 2020, the following action run on the server and then at the dspace CLI prompt resolves this issue:
Load the JRuby terminal: ``` $ source $HOME/.rvm/scripts/rvm $ cd ~/pulibrary-src/dspace-cli $ bin/dspace-irb $eperson Using /dspace Loading jars Loading /dspace/config/dspace.cfg INFO: Loading provided config file: /dspace/config/dspace.cfg INFO: Using dspace provided log configuration (log.init.config) INFO: Loading: /dspace/config/log4j.properties Starting new DSpaceKernel DB jdbc:postgresql://localhost:5432/dspacedb, UserName=dspacedb_user, PostgreSQL JDBC Driver jruby-<IP_ADDRESS> :001 >
In the JRuby terminal:
certhandle = '88435/dsp01c247ds15b' certcollection = DSpace::CLI::SeniorThesisCollection.findforhandle(certhandle) query = DSpace::CLI::SeniorThesisCommunity.findbyclassyear('2021')
certprogram = 'Theater Program' subquery = query.findbycertificateprogram(certprogram) collectionhandle = '88435/dsp01c247ds15b' items = [] subquery.results.each do |item| addtocollection = true item.collections.each do |ic| addtocollection = false if ic.handle == collectionhandle end items << item if addto_collection end
items.each do |i| certcollection.additem(i) cert_collection.update end
certcollection.index
``
Where
certhandleis the certificate program ark to be mapped (consult the table above), the matching
pu.certificatevalue from the item's metadata (for example
Theater Program,
Creative Writing Program),
collectionhandleis the handle for the DataSpace collection where the item should appear after this code is executed (see table in ticket description above), and the parameter in the call to
findbyclassyear` matching the current year.
I ran this code against the following item, after adjusting the class year to 2021, and adding a pu.certificate
field instance with the value Theater Program
:
https://dataspace-dev.princeton.edu/handle/99999/fk4321d72q
I also adjusted the following item on staging (imported in 2020) to be in the class year 2021, with the pu.certificate
value of Theater Program.
:
https://dataspace-staging.princeton.edu/handle/88435/dsp01xw42nb94p
We should be safe to run this on production ASAP.
~~There is a bug in the JRuby code above that will repeatedly add the certificate collection value to the collection field whenever it is executed. I am looking into fixing this bug now;~~
The above-mentioned bug has been resolved in the code sample above. It is verbose but explicit and does not add duplicate collection values.
In the future we should figure out the best way to remove an item from a collection, which is not possible in the web UI or CLI in this version of DSpace (see #505).
The script was run on three objects in staging and sent to Lynn, excerpt from communication below:
Global Health: https://dataspace-staging.princeton.edu/handle/88435/dsp011g05ff65d East Asian Studies Program: https://dataspace-staging.princeton.edu/handle/88435/dsp01tt44pq88k Theater: https://dataspace-staging.princeton.edu/handle/88435/dsp01xw42nb94p
please bear in mind I altered the class year value to be 2021 and added the certificate program values to map for staging to these, since there were not any 2021 theses already on staging that needed to have the certificate mapping script run; all three of these are from 2020, if you would like to compare them
This is being advanced with https://github.com/pulibrary/symplectic-elements-utils/tree/mssql-docker-migrate/docker, which now permits one to readily perform database backups for the MSSQL server.
referenced
by None at 2021-10-21 13:34:08.merged
by None at 2021-10-21 13:34:08.closed
by None at 2021-10-21 13:34:08.head_ref_deleted
by None at 2021-10-21 13:34:09.labeled
by Trey Pendragon at 2021-10-21 20:31:53.referenced
by Trey Pendragon at 2021-10-21 20:40:09.merged
by Trey Pendragon at 2021-10-21 20:40:09.closed
by Trey Pendragon at 2021-10-21 20:40:10.head_ref_deleted
by Trey Pendragon at 2021-10-21 20:40:10.labeled
by Trey Pendragon at 2021-10-21 18:11:47.renamed
by Trey Pendragon at 2021-10-21 18:11:52.referenced
by Trey Pendragon at 2021-10-21 20:18:42.labeled
by Trey Pendragon at 2021-10-21 20:36:20.closed
by Trey Pendragon at 2021-10-21 20:40:10.review_dismissed
by Christina Chortaria at 2021-10-21 21:20:58.head_ref_force_pushed
by Christina Chortaria at 2021-10-21 21:20:58.labeled
by Trey Pendragon at 2021-10-21 22:51:09.closed
by Trey Pendragon at 2021-10-22 00:28:37.referenced
by Trey Pendragon at 2021-10-22 00:28:37.merged
by Trey Pendragon at 2021-10-22 00:28:37.closed
by Trey Pendragon at 2021-10-22 00:28:37.head_ref_deleted
by Trey Pendragon at 2021-10-22 00:28:38.closed
by Trey Pendragon at 2021-10-22 00:31:59.referenced
by Trey Pendragon at 2021-10-22 00:31:59.merged
by Trey Pendragon at 2021-10-22 00:31:59.closed
by Trey Pendragon at 2021-10-22 00:31:59.head_ref_deleted
by Trey Pendragon at 2021-10-22 00:32:00.labeled
by Bess Sadler at 2021-10-21 13:44:52.unlabeled
by Bess Sadler at 2021-10-21 13:45:10.renamed
by Bess Sadler at 2021-10-21 14:42:09.labeled
by Bess Sadler at 2021-10-21 14:42:17.milestoned
by Bess Sadler at 2021-10-21 14:54:55.milestoned
by Bess Sadler at 2021-10-21 14:56:53.assigned
by Bess Sadler at 2021-10-21 14:44:59.milestoned
by Bess Sadler at 2021-10-21 14:46:04.referenced
by Bess Sadler at 2021-10-21 14:47:04.closed
by Bess Sadler at 2021-10-21 17:28:40.referenced
by Bess Sadler at 2021-10-21 17:28:41.I have tried several methods of doing this, and I don't think backing up from one version of OJS and restoring to a different version is going to work. I'm going to ask Yuan to re-create the content. In the future, when we do backup and restore, we'll need to ensure we're doing it within the same major version of the software.
assigned
by Bess Sadler at 2021-10-21 14:58:21.milestoned
by Bess Sadler at 2021-10-21 14:58:26.closed
by Bess Sadler at 2021-10-21 17:29:13.milestoned
by Bess Sadler at 2021-10-21 14:49:14.assigned
by Bess Sadler at 2021-10-21 14:50:06.closed
by Bess Sadler at 2021-10-21 21:16:59.assigned
by Bess Sadler at 2021-10-21 14:51:09.milestoned
by Bess Sadler at 2021-10-21 14:51:13.closed
by Bess Sadler at 2021-10-21 21:17:08.referenced
by Christina Chortaria at 2021-10-21 12:01:59.closed
by None at 2021-10-21 13:34:08.labeled
by Bess Sadler at 2021-10-21 13:43:40.labeled
by Christina Chortaria at 2021-10-21 15:33:14.Approved in Slack, afternoon of 2021/10/20
unlabeled
by Kate Lynch at 2021-10-21 15:38:58.Issue was fixed in Alma. Call number, availability and location for record https://catalog.princeton.edu/catalog/99105832303506421, display in the catalog.
closed
by Christina Chortaria at 2021-10-21 18:20:54.milestoned
by Hector Correa at 2021-10-21 18:52:50.renamed
by Hector Correa at 2021-10-21 18:53:43.Coverage decreased (-0.03%) to 96.785% when pulling 174b2f73920117fa4cbdfc688987d6aa9c4e3516 on issue_1659 into f3877565aa40cc3c744728b054531fd4c80a0723 on main.
convert_to_draft
by Hector Correa at 2021-10-21 13:36:17.ready_for_review
by Hector Correa at 2021-10-21 14:38:33.review_requested
by Christina Chortaria at 2021-10-21 14:52:58.head_ref_force_pushed
by Hector Correa at 2021-10-21 16:00:17.referenced
by Christina Chortaria at 2021-10-21 18:54:22.merged
by Christina Chortaria at 2021-10-21 18:54:22.closed
by Christina Chortaria at 2021-10-21 18:54:22.head_ref_deleted
by Christina Chortaria at 2021-10-21 18:54:23.Coverage increased (+0.06%) to 96.816% when pulling 81e182fba0285c1bd01e1f6fb8080115223a7e36 on requests-annex-holds into a2a0d04f2acf46419ef77075d8571fc494e8ff8d on main.
deployed
by None at 2021-10-21 14:35:34.head_ref_force_pushed
by None at 2021-10-21 18:58:08.ready_for_review
by None at 2021-10-21 18:58:38.deployed
by None at 2021-10-21 18:59:13.@kelynch @eliotjordan in this example:
https://catalog.princeton.edu/catalog/coin-645
current display: 'Accession': '59: Katharine S. Pearce'
With the change my understanding is that it will be:
'Accession': 'Accession Number: 59, Gift of: Katharine S. Pearce'
Is this correct?
This example has a date as well. https://catalog.princeton.edu/catalog/coin-7946
Based on the current instructions it will be:
Accession: Accession Number: 179, 1939-01-01, Gift of: Antioch Excavation
assigned
by Christina Chortaria at 2021-10-21 13:16:38.mentioned
by Eliot Jordan at 2021-10-21 20:15:14.subscribed
by Eliot Jordan at 2021-10-21 20:15:14.mentioned
by Kate Lynch at 2021-10-21 20:15:14.subscribed
by Kate Lynch at 2021-10-21 20:15:14.referenced
by Christina Chortaria at 2021-10-21 21:16:54.referenced
by Christina Chortaria at 2021-10-21 21:20:58.I can look to review the bugs which were found for this by @hectorcorrea.
mentioned
by Hector Correa at 2021-10-21 14:06:47.subscribed
by Hector Correa at 2021-10-21 14:06:47.referenced
by Alicia Cozine at 2021-10-20 22:42:37.merged
by Alicia Cozine at 2021-10-20 22:42:37.closed
by Alicia Cozine at 2021-10-20 22:42:37.head_ref_deleted
by Alicia Cozine at 2021-10-20 22:42:38.referenced
by None at 2021-10-21 12:19:58.merged
by None at 2021-10-21 12:19:58.closed
by None at 2021-10-21 12:19:58.head_ref_deleted
by None at 2021-10-21 12:19:58.referenced
by Bess Sadler at 2021-10-21 17:25:20.merged
by Bess Sadler at 2021-10-21 17:25:20.closed
by Bess Sadler at 2021-10-21 17:25:20.head_ref_deleted
by Bess Sadler at 2021-10-21 17:25:20.referenced
by Bess Sadler at 2021-10-21 17:28:40.merged
by Bess Sadler at 2021-10-21 17:28:40.closed
by Bess Sadler at 2021-10-21 17:28:40.head_ref_deleted
by Bess Sadler at 2021-10-21 17:28:41.referenced
by Bess Sadler at 2021-10-21 17:52:17.merged
by Bess Sadler at 2021-10-21 17:52:17.closed
by Bess Sadler at 2021-10-21 17:52:17.head_ref_deleted
by Bess Sadler at 2021-10-21 17:52:18.referenced
by Francis Kayiwa at 2021-10-21 18:27:37.merged
by Francis Kayiwa at 2021-10-21 18:27:37.closed
by Francis Kayiwa at 2021-10-21 18:27:37.head_ref_deleted
by Francis Kayiwa at 2021-10-21 18:27:37.referenced
by Francis Kayiwa at 2021-10-21 19:22:49.merged
by Francis Kayiwa at 2021-10-21 19:22:49.closed
by Francis Kayiwa at 2021-10-21 19:22:50.head_ref_deleted
by Francis Kayiwa at 2021-10-21 19:22:50.mentioned
by Francis Kayiwa at 2021-10-21 21:05:23.subscribed
by Francis Kayiwa at 2021-10-21 21:05:23.@tpendragon investigated, backups are failing on Solr 2/3 because the mounted drive for backups is not owned by the correct user.
All three Solr servers should be capable of running the backups as the leader of the cluster. Fix the current mounting system:
- [x] mount diglibdata1 only once, as /mnt/solr_backup
- [ ] use NFS instead of CIFS
- [x] ensure the owner of the /mnt/solr_backup
directory is the local deploy
user, which may have a different UID on each box
- [x] update /etc/fstab
so the new configuration will survive a reboot
I've got 3 of 4 tasks done. I'll wait until we've had a successful backup or two before I try to change the mount from CIFS to NFS. This way if we'll have an easier time determining the cause of any problems we see.
referenced
by Shaun Ellis at 2021-10-21 19:30:35.merged
by Shaun Ellis at 2021-10-21 19:30:35.closed
by Shaun Ellis at 2021-10-21 19:30:35.head_ref_deleted
by Shaun Ellis at 2021-10-21 19:30:36.labeled
by Trey Pendragon at 2021-10-21 20:37:30.unlabeled
by Trey Pendragon at 2021-10-21 20:37:33.closed
by Shaun Ellis at 2021-10-21 19:30:35.labeled
by Trey Pendragon at 2021-10-21 20:37:41.Looks like these have been fixed with the update to the data.
closed
by None at 2021-10-21 14:08:01.assigned
by None at 2021-10-21 14:04:28.closed
by Kevin Reiss at 2021-10-21 15:35:14.head_ref_force_pushed
by None at 2021-10-21 15:20:45.referenced
by Kevin Reiss at 2021-10-21 15:35:13.merged
by Kevin Reiss at 2021-10-21 15:35:13.closed
by Kevin Reiss at 2021-10-21 15:35:14.head_ref_deleted
by Kevin Reiss at 2021-10-21 15:35:15.referenced
by None at 2021-10-21 15:20:44.closed
by Kevin Reiss at 2021-10-21 15:35:16.referenced
by Bess Sadler at 2021-10-21 13:28:14.merged
by Bess Sadler at 2021-10-21 13:28:14.closed
by Bess Sadler at 2021-10-21 13:28:14.head_ref_deleted
by Bess Sadler at 2021-10-21 13:28:17.


The Tears of a Machine SC - Pilot Record
Identity
I am
, a
year old
pilot, good at
,
, and
.
Hope
matters to me, so I will
.
Links
is my
, because
.
is my
, because
.
is my
, because
.
Condition
Ego:
Angst:
Troubles:
Details
Saint
I pilot the Saint
, in
company.
I equip
for
,
for
, and
for
.
Id:
Damaged:
Design


World of Warcraft writers have received harassment and reported death threats in the wake of the game’s latest cinematic. A new Warbringers video finally shows the long-awaited Burning of Teldrassil, and some members of the community don’t like the direction the game seems to be taking. The video focuses on Sylvanas Windrunner, the current Warchief of the Horde. After a battle on the shores surrounding the enormous World Tree Teldrassil, home of the Night Elves, Sylvanas comes across a wounded soldier. A flashback follows their brief conversation, documenting Sylvanas’ death and subsequent transformation into a Banshee at the hands of Arthas.
Players’ anger at the reveal stems from many places, but a key aspect of it is reminiscent of what we saw during Mists of Pandaria. In that expansion, Horde players were very much the Bad Guys - the final boss was the Horde’s Warchief, and not everyone wanted to be told that their character was evil. Sylvanas’ outburst at Teldrassil seems to point Battle for Azeroth in a similar direction. Even if that turns out not to be the case, Horde players now officially have a genocide to their names. Other frustrations suggest Blizzard’s writing is lazy or predictable, as players have been wondering who would be responsible for the burning of the tree for months, and many were hoping for a more surprising revelation.
Some members of the community have reacted poorly, having attacked writer Christie Golden on Twitter. The Warbringer shorts had all been planned out before Golden came on board, but she happens to be the most public-facing member of the writing team. In response, multiple threads have appeared on the World of Warcraft subreddit, including one front page post asking players to stop harassing developers. The post names Golden in particular, and some comments allege that the writer has received death threats in response to the video.


This component defines the quadratic turbulent regime of wall friction: dp = k*m_flow*|m_flow|, where "k" depends on density and the roughness of the pipe and is no longer a function of the Reynolds number. This relationship is only valid for large Reynolds numbers. At Re=4000, a polynomial is constructed that approaches the constant λ (for large Reynolds-numbers) at Re=4000 smoothly and has a derivative at zero mass flow rate that is identical to laminar wall friction.
| Name | Description |
|---|---|
| massFlowRate_dp | Return mass flow rate m_flow as function of pressure loss dp, i.e., m_flow = f(dp), due to wall friction |
| pressureLoss_m_flow | Return pressure loss dp as function of mass flow rate m_flow, i.e., dp = f(m_flow), due to wall friction |
| massFlowRate_dp_staticHead | Return mass flow rate m_flow as function of pressure loss dp, i.e., m_flow = f(dp), due to wall friction and static head |
| pressureLoss_m_flow_staticHead | Return pressure loss dp as function of mass flow rate m_flow, i.e., dp = f(m_flow), due to wall friction and static head |
| Internal | Functions to calculate mass flow rate from friction pressure drop and vice versa |


Master Capoeira. Flexibly, privately, and as your hectic schedule allows.
Find Out MoreThe dictionary defines a yuppie as a well-paid young middle-class professional who works in a city job and has a luxurious lifestyle. If this defines you, and you have a strong desire to learn Capoeira, then Yuppie Capoeira is designed for you.
That’s because Yuppie Capoeira is the brainchild of Professor Zumbi, a graduate of the prestigious Wharton School of Business at the University of Pennsylvania and a yuppie that had a strong passion for Capoeira. After receiving his MBA from the renowned Ivy League School, Zumbi became increasingly committed to sharing his passion with likeminded professionals. Professor Zumbi started his Capoeira voyage while studying the management of computer information systems at the University of California at Berkeley. While there he studied under Mestre Caverinha, Contra Mestre Xango and Contra Mestre Berinjela, Later he became a student of Mestre Chicote, and occasionally had the privilege of taking workshops from the grand master Mestre Suassuna and a few other great masters. In 2015, the grand master Mestre Acordeon presented him with his “professor” cord at Mestre Chicote’s Pass a Frente Formatura in Paris.
Learn More!The mastery of Capoeira takes years and every Capoeira practitioner must trod a unique path to unleash their particular abilities artfully in a game of Capoeira. To get there you’ll need a coach. Professor Zumbi is an accredited Capoeira teacher with many years of teaching experience in the Americas, Europe, Africa, and Asia. Over the years, and because of teaching Capoeira to various societies and different cultures, Professor Zumbi has developed a specific training regimen to help you get fluent in the art and practice of Capoeira.
The course of study at Yuppie Capoeira is meant to integrate Capoeira into your existing lifestyle. For that reason, instruction will be provided in the facilities that you normally use for your daily workouts. Professor Zumbi will act like a personal trainer that not only helps you to attain your Capoeira aspirations, but also coach you through reaching your general health and fitness goals.
Practice Capoeira one-on-one with Professor Zumbi and progress gradually through five modules: Offence, Defence, Strength, Balance, and Music. For beginners, Zumbi recommends training one module for at least one hour each business day and using the weekends to recover and rest the body. This is ideal and beginners should maintain this schedule for the first two months of Capoeira lessons.
Try our service for a month and see if the practice of Capoeira is for you.
Ready to start mastering Capoeira with us? That's great! To sign up for a month of classes or to learn more about Yuppie Capoeira, please contact us today via email.


ESB and Greencoat in windfarm boost
Ireland’s renewable energy ambitions have been given a twin boost by the ESB forming a partnership with Norwegian energy company Equinor to develop offshore windfarms and Greencoat Renewables raising extra funds to build more onshore windfarms.
The Government is targeting 70% of the country’s electricity generation coming from renewable energy sources — such as wind farms — by 2030. As part of that plan, it wants at least 3.5 gigawatts of offshore wind generating power in place within the next 10 years.
The ESB and Equinor are looking to bring a number of large-scale wind projects to commercial operation by 2030 and will examine the potential for energy storage technology to complement these wind farms.
Earlier this year, the ESB said that it was working to develop a pipeline of projects that would enable it to generate at least 40% of its electricity from renewable, or zero-carbon sources by 2030.
It said at the time that storage, solar, onshore and offshore wind, waste energy, biomass and gas-fired plants were all included in its plans.
The ESB spent around €250m on renewable energy projects last year including starting development on two onshore windfarms here. In January, it said it would co-develop two planned offshore windfarms in the Irish Sea in conjunction with Belgian firm Parkwind.
Currently, the Arklow Bank windfarm, located off the Wicklow coast, is Ireland’s sole functioning offshore windfarm project. The ESB also remains in talks over a renewable energy joint-venture with State-owned forestry company Coillte.
Greencoat Renewables is to raise around €100m, in a share issuance, to facilitate the purchase of more onshore windfarms in Ireland and continental Europe. The funding will boost its spend capacity to around €560m.
Earlier this week, Greencoat bought the Killala Community windfarm in Mayo for more than €37m.
READ MORE
Manager at Cork bank begins action aimed at preventing termination of her employment


Steam Remote Play Together Sale Offers Big Discounts On Popular Games
by Shane McGlaunLate last month, we talked about the Steam Library update that had brought all the new features that were previously offered to beta users only to the masses. The update also brought with is the debut of Remote Play Together for everyone. That feature was very cool, and gamers who want to enjoy playing remotely with friends need a game of three that supports remote play.
Steam is having a Remote Play Together sale that it is billing as a new Multi-Player Feature and Sale Event. All of the games offered on discounts in the sale support remote play, and some are discounted heavily. Some of the coolest games in the sale are listed below:
4+ Player Games:
- Super Blood Hockey - 70% off at $4.49
- Goat Simulator - 75% off at $2.49
- Death Squared - 75% off at $3.74
- Moon Hunters - 80% off at $2.99
- Guilt Battle Arena - 80% off at $1.99
- Road Redemption - 60% off at $7.99
Puzzle Co-Op Games:
- Wilmot's Warehouse - 10% off at $13.49
- Chariot - 75% off at $3.74
- Degrees of Separation - 80% off at $3.99
Campaign Co-Op Games:
- Super Cane Magic Zero - 15% off at $16.99
- Guacamelee! Gold Edition - 80% off at $2.99
- Unruly Heroes - 35% off at $12.99
- Slaps & Beans - 50% off $9.99
Lego Games:
- Lego Batman 2 DC Super Heroes - 75% off at $4.99
- Lego Harry Potter - 75% off at $4.99
- Lego Avengers - 75% off at $4.99
There are lots more games included in the sale; the entire sale page can be seen here. Learn more about the Remote Play Together feature.


Component is a method of R.Component that allows creation of
HTMLElement Components. It is created from a string parameter called componentString, this is a
group of tagstrings with a tab indentation (as blockStrings); this is important. To create a
Component HTMLElement all Tag's basis are applicable, so, in a componentString it is possible to send
function callbacks, scope, rvars, props and Markdown contents. In a Component, just one main Element can
hold all child Elements, if a siblings Elements is sended, Component will wrap all into a div
Element by default. In Component, each Element can have child Elements. As in Tag, Component can be
initialized using two ways, the indirect case (assignin Component at any variable:
this.myComp =
this.Component()
), where Component will return an JS Object with a method called
createComponent. Or sending the componentString in the assignment in wich case Component
will return a new Component Object instance.
Example
// As in Tag, it is possible to declare a new variable assigning Component. (Note it is not important declare a new Component()).
class TestComponent extends R.Component {
constructor (props) {
super(props)
this.mycomp = this.Component() // Direct assignment. Now is possible create a new Component Object in any method of current class.
console.log(this.mycomp)
// Console will log:
{}
__proto__:
createComponent: ƒ (componentString, fn, scope, rvars, props)
__proto__: Object
}
}
// The direct way is sending componentString directly in assignment:
...
this.mycomp = this.Component(
`Hello
World!`) // See how componentString is indented with a tab space and it's tag name are ommited too.
consol.log(this.mycomp)
// Console will log the Component Object instance returned by this.Component:
Component {classlist: null, idDOM: null, idlist: null, component: div, events: null, …}
classlist: null
compchild: [{…}]
compmain: {classlist: null, idlist: null, idDOM: null, tagstrings: {…}, child: null}
component: div
compstrings: {blockstring: "div Hello↵ div World!", myblockString: "Hello↵ World!"}
events: null
idDOM: null
idlist: null
__proto__:
getChild: ƒ (index_or_id_child)
compstringChild: ƒ (index_or_id_child)
delComponent: ƒ ()
getComponent: ƒ ()
innerHTML: ƒ (htmltxt, index_or_id_child)
render: ƒ (where)
textContent: ƒ (txt, index_or_id_child)
__proto__: Object
Properties
component
component is the final Component HTMLElemnt.
Properties:
| Name | Type | Description |
|---|---|---|
component |
HTMLElement | The final Component HTMLElemnt. |
compmain
compmain is an JS Object with all Component main Element properties as it's own tagstring or
idlist, or classlist, or child Elements.
Properties:
| Name | Type | Description |
|---|---|---|
compmain |
Object | null | A list of all Component main properties. |
compstrings
compstrings is a JS Object with compstring and mycompString strings.
Properties:
| Name | Type | Description |
|---|---|---|
compstrings |
Object | null | A list of Component compstrings. |
events
events is an JS Object with all Component events list.
Properties:
| Name | Type | Description |
|---|---|---|
events |
Object | null | A list of all Component's events. |
classlist
classlist is an Array of strings, each string is a class used in whole Component final
HTMLElement (included Markdown contents). The purpose of this property is to facility all classes applied in
each Element of final HTMLElement. Rocforjs do not creates .html files to be used with some tool that selects
all don't used classes of some css framework, but, with this property it is possible to create a hidden HTML
tag that holds all those classlist allowing the possibility of exclude all don't used classes from css. It is
util (per example) when project is created under NPM ambient.
Properties:
| Name | Type | Description |
|---|---|---|
classlist |
Array | null | All classes used in each Component's HTMLElements. |
idDOM
idDOM returns an Array list with all id's that already exists in DOM, in this case, Component
will warn in console this situation; it is better to change the coincident id's or an error will be generated.
Properties:
| Name | Type | Description |
|---|---|---|
idDom |
Array | All DOM id's reppeated in Component. |
idlist
idlist returns an Array list with all Component id's or null if Component does not have id's.
Properties:
| Name | Type | Description |
|---|---|---|
idlist |
Array | All id's of all HTMLElements in Component. |
compchild
compchild is an Array of Objects with all Component child Elements.
Properties:
| Name | Type | Description |
|---|---|---|
compchild |
Object | null | A list of all Component child properties. |
Methods
compChild(index_or_id_childopt) → {HTMLElement|undefined|null}
compChild is a Component's method with wich can get all Component final HTMLElement children
or just one of it.
Parameters:
| Name | Type | Attributes | Description |
|---|---|---|---|
index_or_id_child |
String | Number |
<optional> |
The id or index of searched Element. |
Returns:
- An HTMLElement child or undefined if param is wrong or null if Component does not have any child Element.
- Type
- HTMLElement | undefined | null
Example
this.mycomp = this.Component(`
Hello
World!
#greet Hello Rocforjs!`)
// It works with the child index (first Component's child has index 0):
this.mycomp.compChild(0) //
World!

// It works with the child id (Component will search on all children Elements and it's child Elements too):
this.mycomp.compChild('greet') //
Hello Rocforjs!

// Or it will return an Array list with all child Component's HTMLElements:
this.mycomp.compChild() // [
World!
,
Hello Rocforjs!
]
compstringChild(index_or_id_childopt) → {String|undefined|null}
compstringChild is a Component's method with wich can get all Component child
tagstrings or just one of it.
Parameters:
| Name | Type | Attributes | Description |
|---|---|---|---|
index_or_id_child |
String | Number |
<optional> |
The id or index od child Element searched. |
Returns:
- A string or undefinded if param is wrong or null if Component does not have any child Element.
- Type
- String | undefined | null
Example
this.mycomp = this.Component(`
Hello
World!
#greet Hello Rocforjs!`)
// It works with the child index (first Component's child has index 0):
this.mycomp.compstringChild(0) // div World!
// It works with the child id (Component will search on all children Elements and it's child Elements too):
this.mycomp.compstringChild('greet') // div#greet Hello Rocforjs!
// Or it will return an Array list with all child Component's tagstrings:
this.mycomp.compstringChild() // [div World!, div#greet Hello Rocforjs!]
delComponent() → {Object}
delComponent is a Component's method with wich can delete Component's HTMLElement previously
rendered in DOM.
Returns:
- Component to chain pattern.
- Type
- Object
Example
// First component HTMLElement must been rendered in DOM, then is possible use this method.
this.mycomp = this.Component('Hello World!')
this.mycomp.setComponent() // mycomp HTMLElement is setted in body's HTMLElement.
this.mycomp.delComponent() // mycomp HTMLElement is deleted from body's HTMLElement.
getComponent() → {HTMLElement}
getComponent is a Component's method with wich can obtain Component's final HTMLElement.
Returns:
- Component's final HTMLElement.
- Type
- HTMLElement
Example
this.mycomp = this.Component('Hello World!')
this.mycomp.getComponent() //
Hello World!

render(whereopt) → {Object}
render is a Component's method with wich can render and set Component's final HTMLElement in
DOM.
Parameters:
| Name | Type | Attributes | Default | Description |
|---|---|---|---|---|
where |
String | Object |
<optional> |
body|props[before|container|after] | The id of DOM's HTMLElement container of the same DOM's HTMLElement container. |
Returns:
- Component Object to chain pattern.
- Type
- Object
Example
this.mycomp = this.Component('Hello World!')
this.mycomp.render() //
Hello World!
 now is setted in body's HTMLElement.
innerHTML(htmltxt, index_or_id_childopt) → {Object}
innerHTML is a special Component's method with wich can set HTML content to main Component's
Element or to the selected child Element.
Parameters:
| Name | Type | Attributes | Default | Description |
|---|---|---|---|---|
htmltxt |
String | Any string. | ||
index_or_id_child |
String |
<optional> |
component | Id or index of child Element searched. |
Returns:
Component - To chain pattern.
- Type
- Object
Example
this.mycomp = this.Component(`
Hello
World!
#greet Hello Rocforjs!`)
// It works with the child index (first Component's child has index 0):
this.mycomp.innerHTML('Roccou!', 0) // Now the content of child with index 0 changes to:
Roccou!

// It works with the child id (Component will search on all children Elements and it's child Elements too):
// The content of child with id 'greet' will change to:
Hello Roccou!

this.mycomp.innerHTML('Hello Roccou!', 'greet')
// Or it will change all HTML content of main Component Element:
this.mycomp.innerHTML('Hello Roccou!')
// Now the content of main Component changes to:
Hello Roccou!

textContent(txt, index_or_id_childopt) → {Object}
textContent is a special Component's method with wich can set plain text content to main
Component's Element or to the selected child Element.
Parameters:
| Name | Type | Attributes | Default | Description |
|---|---|---|---|---|
txt |
String | Any string. | ||
index_or_id_child |
String |
<optional> |
component | Id or index of child Element searched. |
Returns:
Component - To chain pattern.
- Type
- Object
Example
this.mycomp = this.Component(`
Hello
World!
#greet Hello Rocforjs!`)
// It works with the child index (first Component's child has index 0):
this.mycomp.textContent('Roccou!', 0) // Now the content of child with index 0 changes to:
Roccou!

// It works with the child id (Component will search on all children Elements and it's child Elements too):
// The content of child with id 'greet' will change to:
Hello Roccou!

this.mycomp.textContent('Hello Roccou!', 'greet')
// Or it will change all HTML content of main Component Element:
this.mycomp.textContent('Hello Roccou!')
// Now the content of main Component changes to:
Hello Roccou!


Please complete the following fields to register for an account. Required fields are noted by bold text and an asterisk (*).


!Queen of Hearts:
Meow~ meow~
The goddess of love Aphrodite gave me a special mission.
She told me to help lovers stay in love forever, to deliver comaraderie to friends who are always by your side, and to give something to those who are precious to you.
I want to give all of you a special gift today. Lalala~ Lala~
[npc_%objectId%_Chat 1|See detailed event explanation.]%%
[npc_%objectId%_Chat 2|I'm curious about the event rewards.]


|
|
PWG Vancouver, B.C. May 24-27 |
|
Monday – WIMS (was WBMM)
Tuesday – Plenary (Morning) and PWG Process (Afternoon)
Wednesday – Semantic Model (Morning) and Standard Imaging Systems Eventing (Afternoon)
Thursday – Consumer BOF (Morning) and Transform Services Interface BOF (Afternoon)
|
Meeting Location: Delta Vancouver Suites 550 West Hastings Street, Vancouver BC Canada V6B 5K3 Phone:<PHONE_NUMBER> Fax:<PHONE_NUMBER> http://www.deltahotels.com/hotels/hotels.do?hotelId=21
|
|
The hotel rate is CDN $155.00 per night (plus tax)
Please make your reservations by calling 1-800-268-1133
Ask for the Printer
Working Group rate.
Deadline for reservations is May 17, 2004
All attendees are responsible
for making their own hotel reservations.
There will be a meeting charge of US $55 per day; participants are responsible for their own lunch.
Participants must pre-register at
https://www.ieee-isto.org/pwg/registration.asp
Please contact Ami Patel, IEEE-ISTO PWG Program Lead at +1-732-465-6477, or
Allison Leisz, IEEE-ISTO PWG Program Assistant at +1-732-465-5855 if you have any questions.


/** * The DelayedTask class provides a convenient way to "buffer" the execution of a method, * performing `setTimeout` where a new timeout cancels the old timeout. When called, the * task will wait the specified time period before executing. If during that time period, * the task is called again, the original call will be canceled. This continues so that * the function is only called a single time for each iteration. * * This method is especially useful for things like detecting whether a user has finished * typing in a text field. An example would be performing validation on a keypress. You can * use this class to buffer the keypress events for a certain number of milliseconds, and * perform only if they stop for that amount of time. * * Using {@link Ext.util.DelayedTask} is very simple: * * //create the delayed task instance with our callback * var task = Ext.create('Ext.util.DelayedTask', { * fn: function() { * console.log('callback!'); * } * }); * * task.delay(1500); //the callback function will now be called after 1500ms * * task.cancel(); //the callback function will never be called now, unless we call delay() again * * ## Example * * @example * //create a textfield where we can listen to text * var field = Ext.create('Ext.field.Text', { * xtype: 'textfield', * label: 'Length: 0' * }); * * //add the textfield into a fieldset * Ext.Viewport.add({ * xtype: 'formpanel', * items: [{ * xtype: 'fieldset', * items: [field], * instructions: 'Type into the field and watch the count go up after 500ms.' * }] * }); * * //create our delayed task with a function that returns the fields length as the fields label * var task = Ext.create('Ext.util.DelayedTask', function() { * field.setLabel('Length: ' + field.getValue().length); * }); * * // Wait 500ms before calling our function. If the user presses another key * // during that 500ms, it will be canceled and we'll wait another 500ms. * field.on('keyup', function() { * task.delay(500); * }); * * @constructor * The parameters to this constructor serve as defaults and are not required. * @param {Function} fn The default function to call. * @param {Object} scope The default scope (The `this` reference) in which the function is called. If * not specified, `this` will refer to the browser window. * @param {Array} args The default Array of arguments. */ Ext.define('Ext.util.DelayedTask', { config: { interval: null, delay: null, fn: null, scope: null, args: null }, constructor: function(fn, scope, args) { var config = { fn: fn, scope: scope, args: args }; this.initConfig(config); }, /** * Cancels any pending timeout and queues a new one. * @param {Number} delay The milliseconds to delay * @param {Function} newFn Overrides the original function passed when instantiated. * @param {Object} newScope Overrides the original `scope` passed when instantiated. Remember that if no scope * is specified, `this` will refer to the browser window. * @param {Array} newArgs Overrides the original `args` passed when instantiated. */ delay: function(delay, newFn, newScope, newArgs) { var me = this; //cancel any existing queued functions me.cancel(); //set all the new configurations if (Ext.isNumber(delay)) { me.setDelay(delay); } if (Ext.isFunction(newFn)) { me.setFn(newFn); } if (newScope) { me.setScope(newScope); } if (newScope) { me.setArgs(newArgs); } //create the callback method for this delayed task var call = function() { me.getFn().apply(me.getScope(), me.getArgs() || []); me.cancel(); }; me.setInterval(setInterval(call, me.getDelay())); }, /** * Cancel the last queued timeout */ cancel: function() { this.setInterval(null); }, /** * @private * Clears the old interval */ updateInterval: function(newInterval, oldInterval) { if (oldInterval) { clearInterval(oldInterval); } }, /** * @private * Changes the value into an array if it isn't one. */ applyArgs: function(config) { if (!Ext.isArray(config)) { config = [config]; } return config; } });


import com.sleepycat.db.*;public String file(DbLsn lsn) throws DbException;
The DbLog.file method maps DbLsn objects to file names, returning the name of the file containing the record named by lsn.
This mapping of DbLsn objects to files is needed for database administration. For example, a transaction manager typically records the earliest DbLsn needed for restart, and the database administrator may want to archive log files to tape when they contain only DbLsn entries before the earliest one needed for restart.
The DbLog.file method throws an exception that encapsulates an errno on failure.
The DbLog.file method may fail and throw an exception for any of the errors specified for the following Berkeley DB and C library functions: abort(3), close(3), fcntl(3), fflush(3), fprintf(3), free(3), getenv(3), getpid(3), getuid(3), isdigit(3), malloc(3), memcpy(3), memset(3), open(3), sigfillset(3), sigprocmask(3), snprintf(3), stat(3), strcpy(3), strerror(3), strlen(3), unlink(3), vfprintf(3), and vsnprintf(3).
In addition, the DbLog.file method may fail and throw an exception encapsulating errno for the following conditions:


Adding p-datatable-gridlines displays borders between cells. Note: Some themes may always display gridlines by design.


This is a benchmark application aimed to assess the performance of NUBOMEDIA or Kurento. Depending of the configuration, the media logic has different topologies (one-to-one or one-to-many) and different media processing (none, filtering, encoding, etc).


We rewrite of RAMpath software developed by John McArdle and Steven Boker as an R package. In addition to performing regular SEM analysis through the R package lavaan, RAMpath has unique features. First, it can generate path diagrams according to a given model. Second, it can display path tracing rules through path diagrams and decompose total effects into their respective direct and indirect effects as well as decompose variance and covariance into individual bridges. Furthermore, RAMpath can fit dynamic system models automatically based on latent change scores and generate vector field plots based upon results obtained from a bivariate dynamic system. Starting version 0.4, RAMpath can conduct power analysis for both univariate and bivariate latent change score models.
| Version: | 0.4 |
| Depends: | R (≥ 2.0), lavaan, ellipse, MASS |
| Published: | 2016-10-05 |
| Author: | Zhiyong Zhang, Jack McArdle, Aki Hamagami, & Kevin Grimm |
| Maintainer: | Zhiyong Zhang <zzhang4 at nd.edu> |
| License: | GPL-2 |
| URL: | http://nd.psychstat.org |
| NeedsCompilation: | no |
| CRAN checks: | RAMpath results |
| Reference manual: | RAMpath.pdf |
| Package source: | RAMpath_0.4.tar.gz |
| Windows binaries: | r-devel: RAMpath_0.4.zip, r-release: RAMpath_0.4.zip, r-oldrel: RAMpath_0.4.zip |
| OS X binaries: | r-release: RAMpath_0.4.tgz, r-oldrel: RAMpath_0.4.tgz |
| Old sources: | RAMpath archive |
Please use the canonical form https://CRAN.R-project.org/package=RAMpath to link to this page.


WITNESS LIST Ways & Means Committee May 1, 2006-2:30P HB 60 For: Conner, Allan (Self) Cory, Art (Texas Association of Appraisal Districts/ Chevy Chase) On: Wooten, Tim (Comptroller) HB 65 For: Clutterbuck, Anne (Self) McCracken, Brewster (City of Austin) Against: Allison, Jim (County Judges & Commissioners Assn. of Texas) Beneski, Amy (Texas Association of School Administrators & Texas Association of School Boards) Casey, Daniel (Self and Fast Growth School Coalition) Day, Aaron (City of Fort Worth) Fainter, Jr., John W. (Association of Electric Companies of Texas, Inc) Gonzalez, Daniel (Texas Association of Realtors) Hamlin, Marc (Pres. Texas Association of Counties/Brazos County District Clerk) Kennedy, John (Texas Taxpayers and Research Association) Lavine, Dick (Center for Public Policy Priorities) Lee, Donald (Texas Conference of Urban Counties) Melina Raab, Ted (Texas Federation of Teachers) Nolen, Ken (Dallas Central Appraisal District) Pardue, Craig (Dallas County) Powell, Leilah (Bexar County Commissioners Court) HB 65 - Committee Substitute (Woolley) Mintz, David (Texas Apartment Association) HJR 24 Against: Allison, Jim (County Judges & Commissioners Assn. of Texas) Beneski, Amy (Texas Association of School Administrators & Texas Association of School Boards) Casey, Daniel (Self and Fast Growth School Coalition) Day, Aaron (City of Fort Worth) Fainter, Jr., John W. (Association of Electric Companies of Texas, Inc) Gonzalez, Daniel (Texas Association of Realtors) Hamlin, Marc (Brazos County District Clerk/ Pres. Texas Association of Counties) Kennedy, John (Texas Taxpayers and Research Association) Lavine, Dick (Center for Public Policy Priorities) Lee, Donald (Texas Conference of Urban Counties) Melina Raab, Ted (Texas Federation of Teachers) Nolen, Ken (Dallas Central Appraisal District) Pardue, Craig (Dallas County) HJR 24 - Committee Substitute (Woolley) Mintz, David (Texas Apartment Association) HJR 26 On: Casey, Daniel (Self) Wilson, Dan (Comptroller)


ink-router-cli runs with ink and is avaiable as a NPM package.
npm install --save ink-router-cli
ink-router-cli was heavily influenced by react-router, so most of the concepts are similiar with react-route
.
import {Router, Switch, Command} from 'ink-router-cli';
import {render, Text} from 'ink';
const App = () => {
return <Router argv={process.argv}>
<Switch>
<Command name="create" component={<Text>Create Command</Text>} />
</Switch>
</Router>
}
render(<App />)
Generated using TypeDoc


Input first segment start and end coordinates separated by spaces and press Enter:
Input second segment start and end coordinates separated by spaces and press Enter:
Input third segment start and end coordinates separated by spaces and press Enter:


Bomberman
1.0
Re-make of Bomberman game
inc
LogicCore
SquareInstance.h
Go to the documentation of this file.
1
2
#ifndef BOMBERMAN_IINSTANCE_H
3
#define BOMBERMAN_IINSTANCE_H
4
5
#include "
Entity/Entity.h
"
6
7
enum class
SquareType
: uint_fast8_t
8
{
9
EmptySquare
= 0,
10
Wall
= 1,
11
Brick
= 2,
12
Bomb
= 3,
13
Powerup_Bombs
= 4,
14
Powerup_Flames
= 5,
15
Powerup_Wallpass
= 6,
16
Powerup_Bombpass
= 7,
17
Powerup_Flamepass
= 8,
18
Exit
= 9
19
};
20
21
#endif
Bomb
The class representing bomb.
Definition:
Bomb.h:18
SquareType::EmptySquare
SquareType::Powerup_Flamepass
SquareType
SquareType
Definition:
SquareInstance.h:7
Entity.h
SquareType::Exit
SquareType::Powerup_Bombs
SquareType::Powerup_Bombpass
Brick
Definition:
ParticleSystem.hpp:41
SquareType::Powerup_Wallpass
SquareType::Wall
SquareType::Powerup_Flames
Generated by
1.8.16


Pluto is named after the Greek god of the underworld.
This is a later name for the more well known Hades and was proposed by Venetia Burney an eleven year old schoolgirl from Oxford, England.
Pluto was reclassified from a planet to a dwarf planet in 2006.
This is when the IAU formalised the definition of a planet as “A planet is a celestial body that (a) is in orbit around the Sun, (b) has sufficient mass for its self-gravity to overcome rigid body forces so that it assumes a hydrostatic equilibrium (nearly round) shape, and (c) has cleared the neighbourhood around its orbit.”
Pluto was discovered on February 18th, 1930 by the Lowell Observatory.
For the 76 years between Pluto being discovered and the time it was reclassified as a dwarf planet it completed under a third of its orbit around the Sun.
Pluto has five known moons.
The moons are Charon (discovered in 1978,), Hydra and Nix (both discovered in 2005), Kerberos originally P4 (discovered 2011) and Styx originally P5 (discovered 2012) official designations S/2011 (134340) 1 and S/2012 (134340) 1.
Pluto is the largest dwarf planet.
At one point it was thought this could be Eris. Currently the most accurate measurements give Eris an average diameter of 2,326km with a margin of error of 12km, while Pluto’s diameter is 2,372km with a 2km margin of error.
Pluto is one third water.
This is in the form of water ice which is more than 3 times as much water as in all the Earth’s oceans, the remaining two thirds are rock. Pluto’s surface is covered with ices, and has several mountain ranges, light and dark regions, and a scattering of craters.
Pluto is smaller than a number of moons.
These are Ganymede, Titan, Callisto, Io, Europa, Triton, and the Earth’s moon. Pluto has 66% of the diameter of the Earth’s moon and 18% of its mass. While it is now confirmed that Pluto is the largest dwarf planet for around 10 years it was thought that this was Eris.
Pluto has a eccentric and inclined orbit.
This takes it between 4.4 and 7.3 billion km from the Sun meaning Pluto is periodically closer to the Sun than Neptune.
Pluto has been visited by one spacecraft.
The New Horizons spacecraft, which was launched in 2006, flew by Pluto on the 14th of July 2015 and took a series of images and other measurements. New Horizons is now on its way to the Kuiper Belt to explore even more distant objects.
Pluto’s location was predicted by Percival Lowell in 1915.
The prediction came from deviations he initially observed in 1905 in the orbits of Uranus and Neptune.
Pluto sometimes has an atmosphere.
When Pluto elliptical orbit takes it closer to the Sun, its surface ice thaws and forms a thin atmosphere primarily of nitrogen which slowly escapes the planet. It also has a methane haze that overs about 161 kilometres above the surface. The methane is dissociated by sunlight into hydrocarbons that fall to the surface and coat the ice with a dark covering. When Pluto travels away from the Sun the atmosphere then freezes back to its solid state.


Hello there, it’s been a while since my previous Real time Object Recognition project. I currently have some cool stuff ongoing and I’ll share it to you when it’s ready (it won’t be long).
At the moment, I’m struggling with a frustrating performing problem. As I told you before in the previous Project, the training process requires a powerful desktop which you have to spend a lot of money on, and may take a lot of time and resources. But this headache can be solved with a pre-trained model, like the one I used. And luckily, because using that model for recognizing object is not a big deal (as it took approximately 1.5 ~ 2 seconds per image on my PC), I still somehow felt satisfied.
But life is not that easy. Things get tougher as you keep moving on. Now instead of 2 seconds, I have to wait for minutes for each image to be 100% processed, which is simply unacceptable!  Yeah, I wish I had that money, dude!
No way am I stopping. There must be some way out, I supposed. And I finally found it, Amazon Web Service (AWS).
You can simply think of AWS as a place which offers desktop for rent. Of course, it costs! But it won’t cost you as much as buying a powerful giant desktop. You know, you are free to have our own choices. But I choose AWS, for now.
And this post is for ones who consider to use AWS for running their own Machine Learning projects, just like me. Setting things up in AWS won’t be hard, but takes some time.
Firstly, you have to register for AWS. You can do it by access to AWS Home Page, then choose “Sign In to the Console”, you will be redirected to the page like this:
After the registration completes, go back to AWS Home Page and sign in with your registered account. Here’s what you will see:
On the top right, make sure you’re choosing N. California region. If it is somewhere else, change it to N. California.
We will use EC2 instance, so choose EC2 (the first one in Compute category). You will see the following page showing up:
Click “Launch Instance”. Here’s where we will create our new instance, or you can also choose to use pre-configured one. You may wonder why. A new created instance is just like a new computer, with just OS installed. If you want to work with Python, you have to install Python, if you want to work with Caffe, you have to install and configure Caffe. Sounds challenging, right? In my case, although I got a few experiences working with environment configuration on my own PC, I don’t feel like doing it all over again, especially on a computer belonging to someone else. So I choose to use the pre-configured one! And I recommend you to do so.
On the next page after clicking “Launch Instance”, choose “Community Instance” on the left, and type “cs231n” to the search bar. That’s the instance configured by Stanford University, which have Caffe, Torch, Theano, Keras, Lasagne installed, which means it’s already up and ready.
Click “Select”, on the next screen, scroll down to “g2.2xlarge” type. Select it and click “Review and Launch”. We are working on Machine Learning projects, which requires a great deal of parallel computing. And a GPU Instance’s type will be the best fit for that.
Simply click “Launch” on the next screen. At this step, AWS will require a key-pair authentication. Because this is the first time you launch, just select “Create a new key pair”, and type whatever you want to name that key. And click “Launch Instances”.
You should then receive a .pem file which holds your key-pair information. Keep it safe because there’s no way to get it back once you lose it!
At this point, you may receive an error, telling you that your account in under verification.
Just give it about 2 hours and try to launch again. Here’s what you will see after your account is verified:
After launching into the instance, it will take a while to initialize, so you have to wait until the status changes to “2/2 checks passed”:
Then take note the instance’s public IP address, open your local machine’s terminal, type:
You will probably get an error like this:
That’s because your PEM file is accessible by all users. You must change the file’s permissions by typing:
Note that you must be in the folder where you placed you PEM_FILE.
After that, you will now be able to log in and use the GPU instance everytime you want. Just don’t forget to Stop it when you finished your work, or your credit card bill payments will shock you till death. And note that there’s two different options: Stop and Terminate.  You can read more here if you want to change the initiated Shutdown behavior, or here to disable the Terminate option.
If you encounter any error during working with your instance, try to Terminate and start it all over again. Then everything should work just fine.
That’s it. Simple enough, right? Hope you find this post helpful. And I’ll be back soon to reveal the cool stuff I’ve been doing to you.


The issue The advent of the Digital Economy, ushered in by the nexus of forces that is, Cloud, Big Data, Mobility and Social Business has bought a plethora of new business opportunities but in the midst of this transformation, organizations are facing a huge talent gap. This gap is a result of education programs being insufficient in keeping up with the rapidly changing tech industry.
The solution Edward is the profession planner. Institutional education is no longer sufficient for a professional, to keep up with the changing trends they must constantly under go micro-learning programs. These programs are numerous and one may not know which of them are relevant for their careers. So Edward steps in and plans a learning map as well as a cost structure for these programs.
| Firstname | Lastname | Status | |
|---|---|---|---|
| Default | Defaultson |<EMAIL_ADDRESS>| cofirmed |
| Success | Doe |<EMAIL_ADDRESS>| pending... |
| Danger | Moe |<EMAIL_ADDRESS>| pending... |
| Info | Dooley |<EMAIL_ADDRESS>| confirmed |
| Warning | Refs |<EMAIL_ADDRESS>| confirmed |
| Active | Activeson |<EMAIL_ADDRESS>| pending... |


Fall Film Reviews Film reviews by Michael John Legeros Copyright 1994 Michael John Legeros
Contents -------- i. EAT DRINK MAN WOMAN ii. MY LIFE'S IN TURNAROUND iii. PRISCILLA, QUEEN OF THE DESERT iv. SPANKING THE MONKEY v. THE RIVER WILD vi. THE SCOUT
EAT DRINK MAN WOMAN -------------------
Delightful culinary comedy from Taiwanese filmmaker Ang Lee (THE WEDDING BANQUET) about a master chef and his three grown daughters and their difficulties in communicating at any other time than during Sunday dinner. Real characters and real situations are just two of the reasons to see this handsome (and often hilarious) film. Easily one of the best films of the year.
Don't forget your bib.
Grade: A
MY LIFE'S IN TURNAROUND -----------------------
Super-cute, ultra-low budget comedy about two losers-who-know-it who want to make a movie just because. One drives a cab, the other tends bar, and neither knows the first thing about filmmaking. The joke, of course, is that these two New York slackers (Eric Shaeffer and Donal Lardner Ward) really *did* make a movie, this movie, without even knowing what it would be about.
Watch for a handful of cameos, including Phoebe Cates who had the fortune/misfortune of hailing Shaeffer's cab. In real life and in the movie.
Hilarious.
Grade: B+
PRISCILLA, QUEEN OF THE DESERT ------------------------------
Mildly diverting road-comedy stars Terence Stamp (BILLY BUDD, SUPERMAN II) as one of three drag queens traveling across the outback in a bus named Priscilla. Aussie filmmaker Stephan Elliott doesn't pace his film fast enough to keep your seat from squirming--that is, unless you find the idea of men dressed as women dressed as Abba hilarious.
Lip-synching aside, the scenery is good and Terence Stamp is always worth watching. Especially when delivering droll lines like "what is this, outback with Benny Hill?" Stay through the closing credits.
Grade: B-
SPANKING THE MONKEY -------------------
Holy Oedipus Rex! This hilarious dark dark dark dark comedy won the Audience Award at this year's Sundance Film Festival and with good reason. No summer has ever been tougher (or funnier) than what 20-year-old Ray (Jeremy Davies) goes through while taking care of Mom (Alberta Watson) while home from college.
Low-budget to be sure, be redeemed fourfold by a super script and sharp performances by Davies, Watson, and Benjamin Hendrickson (as the father). Title refers to masturbation, one of the many taboos blithely broken by first-time writer/director David O. Russell.
Move over, Mrs. Robinson!
Grade: B+
THE RIVER WILD --------------
So what if Meryl Streep wants to play Linda Hamilton? THE RIVER WILD is one of those pulse-pounding, preposterous thrillers that works best with your brain almost entirely on hold. That way you can sit back and smile and think of all the ways that you'd do things differently if *you* were the person on the raft with your family and a killer and not a banjo in sight.
The photography of the trip is quite good and the river certainly looks wild. Too bad bad guy Kevin Bacon never really gets into the act. He can be creepy when he wants to be. Streep and (David) Strathairn are both fine. From the director of BAD INFLUENCE and THE HAND THAT ROCKS THE CRADLE.
What you get is what you expect.
Grade: B
THE SCOUT ---------
KING KONG remade as a baseball comedy!? Feel-good film stars Albert Brooks as a veteran scout (for the Yankees) who discovers "the greatest player he's ever seen" pitching 100mph fastballs in Mexico. Too bad the talent (AIRHEADS survivor Brendan Fraiser) needs to play with a shrink before he can play ball.
Though the tone veers a little too close to drama at times, the jokes are strong and the leads are good. Fraiser's a charm, while Brooks overacts to the max. And who'd he steal that straw fedora from? Darren McGavin? Walter Matthau?
Cameos include Bob Costas, Tony Bennett, and George Steinbrenner.
Grade: B
.
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


@Marsmensch @L_Ron_Fuddard @SatoshisVision @WhalePanda @anambroid Since you know who I like, I’m curious how holding 1M KMD to get a node that currently will yield you about 1% interest on, not including the daily hours and commitment needed to run the node, is worth the...


| Home | Libraries | People | FAQ | More |
boost::unordered_multimap — An unordered associative container that associates keys with another value. The same key can be stored multiple times.
// In header: <boost/unordered_map.hpp> template<typename Key, typename Mapped, typename Hash = boost::hash<Key>, typename Pred = std::equal_to<Key>, typename Alloc = std::allocator<std::pair<Key const, Mapped>> > class unordered_multimap { public: // types typedef Key key_type; typedef std::pair<Key const, Mapped> value_type; typedef Mapped mapped_type; typedef Hash hasher; typedef Pred key_equal; typedef Alloc allocator_type; typedef typename allocator_type::pointer pointer; typedef typename allocator_type::const_pointer const_pointer; typedef value_type& reference; // lvalue of value_type. typedef value_type const& const_reference; // const lvalue of value_type. typedef implementation-defined size_type; typedef implementation-defined difference_type; typedef implementation-defined iterator; typedef implementation-defined const_iterator; typedef implementation-defined local_iterator; typedef implementation-defined const_local_iterator; // construct/copy/destruct unordered_multimap(); explicit unordered_multimap(size_type, hasher const& = hasher(), key_equal const& = key_equal(), allocator_type const& = allocator_type()); template<typename InputIterator> unordered_multimap(InputIterator, InputIterator, size_type = implementation-defined, hasher const& = hasher(), key_equal const& = key_equal(), allocator_type const& = allocator_type()); unordered_multimap(unordered_multimap const&); unordered_multimap(unordered_multimap &&); explicit unordered_multimap(Allocator const&); unordered_multimap(unordered_multimap const&, Allocator const&); unordered_multimap(unordered_multimap &&, Allocator const&); unordered_multimap(initializer_list<value_type>, size_type = implementation-defined, hasher const& = hasher(), key_equal const& = key_equal(), allocator_type const& = allocator_type()); unordered_multimap(size_type, allocator_type const&); unordered_multimap(size_type, hasher const&, allocator_type const&); template<typename InputIterator> unordered_multimap(InputIterator, InputIterator, size_type, allocator_type const&); template<typename InputIterator> unordered_multimap(InputIterator, InputIterator, size_type, hasher const&, allocator_type const&); ~unordered_multimap(); unordered_multimap& operator=(unordered_multimap const&); unordered_multimap& operator=(unordered_multimap &&); unordered_multimap& operator=(initializer_list<value_type>); allocator_type get_allocator() const; // size and capacity bool empty() const; size_type size() const; size_type max_size() const; // iterators iterator begin(); const_iterator begin() const; iterator end(); const_iterator end() const; const_iterator cbegin() const; const_iterator cend() const; // modifiers template<typename... Args> iterator emplace(Args&&...); template<typename... Args> iterator emplace_hint(const_iterator, Args&&...); iterator insert(value_type const&); iterator insert(value_type&&); iterator insert(const_iterator, value_type const&); iterator insert(const_iterator, value_type&&); template<typename InputIterator> void insert(InputIterator, InputIterator); void insert(initializer_list<value_type>); iterator erase(const_iterator); size_type erase(key_type const&); iterator erase(const_iterator, const_iterator); void quick_erase(const_iterator); void erase_return_void(const_iterator); void clear(); void swap(unordered_multimap&); // observers hasher hash_function() const; key_equal key_eq() const; // lookup iterator find(key_type const&); const_iterator find(key_type const&) const; template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> iterator find(CompatibleKey const&, CompatibleHash const&, CompatiblePredicate const&); template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> const_iterator find(CompatibleKey const&, CompatibleHash const&, CompatiblePredicate const&) const; size_type count(key_type const&) const; std::pair<iterator, iterator> equal_range(key_type const&); std::pair<const_iterator, const_iterator> equal_range(key_type const&) const; // bucket interface size_type bucket_count() const; size_type max_bucket_count() const; size_type bucket_size(size_type) const; size_type bucket(key_type const&) const; local_iterator begin(size_type); const_local_iterator begin(size_type) const; local_iterator end(size_type); const_local_iterator end(size_type) const; const_local_iterator cbegin(size_type) const; const_local_iterator cend(size_type); // hash policy float load_factor() const; float max_load_factor() const; void max_load_factor(float); void rehash(size_type); void reserve(size_type); }; // Equality Comparisons template<typename Key, typename Mapped, typename Hash, typename Pred, typename Alloc> bool operator==(unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const&, unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const&); template<typename Key, typename Mapped, typename Hash, typename Pred, typename Alloc> bool operator!=(unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const&, unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const&); // swap template<typename Key, typename Mapped, typename Hash, typename Pred, typename Alloc> void swap(unordered_multimap<Key, Mapped, Hash, Pred, Alloc>&, unordered_multimap<Key, Mapped, Hash, Pred, Alloc>&);
Template Parameters
| Key |
Key must be Erasable from the container
(i.e. allocator_traits can destroy it).
|
| Mapped |
Mapped must be Erasable from the container
(i.e. allocator_traits can destroy it).
|
| Hash | A unary function object type that acts a hash function for a Key . It takes a single argument of type Key and returns a value of type std::size_t. |
| Pred | A binary function object that implements an equivalence relation on values of type Key .
A binary function object that induces an equivalence relation on values of type Key .
It takes two arguments of type Key and returns a value of type bool. |
| Alloc | An allocator whose value type is the same as the container's value type. |
The elements are organized into buckets. Keys with the same hash code are stored in the same bucket and elements with equivalent keys are stored next to each other.
The number of buckets can be automatically increased by a call to insert, or as the result of calling rehash.
unordered_multimap
public
typestypedef typename allocator_type::pointer pointer;
value_type*
if
allocator_type::pointer
is not defined.
typedef typename allocator_type::const_pointer const_pointer;
boost::pointer_to_other<pointer, value_type>::type
if allocator_type::const_pointer
is not defined.
typedef implementation-defined size_type;
An unsigned integral type.
size_type can represent any non-negative value of difference_type.
typedef implementation-defined difference_type;
A signed integral type.
Is identical to the difference type of iterator and const_iterator.
typedef implementation-defined iterator;
An iterator whose value type is value_type.
The iterator category is at least a forward iterator.
Convertible to const_iterator.
typedef implementation-defined const_iterator;
A constant iterator whose value type is value_type.
The iterator category is at least a forward iterator.
typedef implementation-defined local_iterator;
An iterator with the same value type, difference type and pointer and reference type as iterator.
A local_iterator object can be used to iterate through a single bucket.
typedef implementation-defined const_local_iterator;
A constant iterator with the same value type, difference type and pointer and reference type as const_iterator.
A const_local_iterator object can be used to iterate through a single bucket.
unordered_multimap
public
construct/copy/destructunordered_multimap();
Constructs an empty container using hasher() as the hash function, key_equal() as the key equality predicate, allocator_type() as the allocator and a maximum load factor of 1.0.
Postconditions: |
size() == 0 |
Requires: |
If the defaults are used, |
explicit unordered_multimap(size_type n, hasher const& hf = hasher(), key_equal const& eq = key_equal(), allocator_type const& a = allocator_type());
Constructs an empty container with at least n buckets, using hf as the hash function, eq as the key equality predicate, a as the allocator and a maximum load factor of 1.0.
Postconditions: |
size() == 0 |
Requires: |
If the defaults are used, |
template<typename InputIterator> unordered_multimap(InputIterator f, InputIterator l, size_type n = implementation-defined, hasher const& hf = hasher(), key_equal const& eq = key_equal(), allocator_type const& a = allocator_type());
Constructs an empty container with at least n
buckets,
using hf
as the hash function,
eq
as the key equality predicate,
a
as the allocator and a maximum load factor of 1.0
and inserts the elements from [f, l) into it.
Requires: |
If the defaults are used, |
unordered_multimap(unordered_multimap const&);
The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.
If Allocator::select_on_container_copy_construction
exists and has the right signature, the allocator will be
constructed from its result.
Requires: |
|
unordered_multimap(unordered_multimap &&);
The move constructor.
Notes: |
This is implemented using Boost.Move. |
Requires: |
On compilers without rvalue reference support the
emulation does not support moving without calling
|
explicit unordered_multimap(Allocator const& a);
Constructs an empty container, using allocator a
.
unordered_multimap(unordered_multimap const& x, Allocator const& a);
Constructs an container, copying x
's contained elements, hash function, predicate, maximum load factor, but using allocator a
.
unordered_multimap(unordered_multimap && x, Allocator const& a);
Construct a container moving x
's contained elements, and having the hash function, predicate and maximum load factor, but using allocate a
.
Notes: |
This is implemented using Boost.Move. |
Requires: |
|
unordered_multimap(initializer_list<value_type> il, size_type n = implementation-defined, hasher const& hf = hasher(), key_equal const& eq = key_equal(), allocator_type const& a = allocator_type());
Constructs an empty container with at least n
buckets,
using hf
as the hash function,
eq
as the key equality predicate,
a
as the allocator and a maximum load factor of 1.0
and inserts the elements from il
into it.
Requires: |
If the defaults are used, |
unordered_multimap(size_type n, allocator_type const& a);
Constructs an empty container with at least n
buckets,
using hf
as the hash function,
the default hash function and key equality predicate,
a
as the allocator and a maximum load factor of 1.0.
Postconditions: |
size() == 0 |
Requires: |
|
unordered_multimap(size_type n, hasher const& hf, allocator_type const& a);
Constructs an empty container with at least n
buckets,
using hf
as the hash function,
the default key equality predicate,
a
as the allocator and a maximum load factor of 1.0.
Postconditions: |
size() == 0 |
Requires: |
|
template<typename InputIterator> unordered_multimap(InputIterator f, InputIterator l, size_type n, allocator_type const& a);
Constructs an empty container with at least n
buckets,
using a
as the allocator, with the
default hash function and key equality predicate
and a maximum load factor of 1.0
and inserts the elements from [f, l) into it.
Requires: |
|
template<typename InputIterator> unordered_multimap(InputIterator f, InputIterator l, size_type n, hasher const& hf, allocator_type const& a);
Constructs an empty container with at least n
buckets,
using hf
as the hash function,
a
as the allocator, with the
default key equality predicate
and a maximum load factor of 1.0
and inserts the elements from [f, l) into it.
Requires: |
|
~unordered_multimap();
Notes: |
The destructor is applied to every element, and all memory is deallocated |
unordered_multimap& operator=(unordered_multimap const&);
The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator.
If Alloc::propagate_on_container_copy_assignment
exists and Alloc::propagate_on_container_copy_assignment::value
is true, the allocator is overwritten, if not the
copied elements are created using the existing
allocator.
Requires: |
|
unordered_multimap& operator=(unordered_multimap &&);
The move assignment operator.
If Alloc::propagate_on_container_move_assignment
exists and Alloc::propagate_on_container_move_assignment::value
is true, the allocator is overwritten, if not the
moved elements are created using the existing
allocator.
Notes: |
On compilers without rvalue references, this is emulated using Boost.Move. Note that on some compilers the copy assignment operator may be used in some circumstances. |
Requires: |
|
unordered_multimap& operator=(initializer_list<value_type>);
Assign from values in initializer list. All existing elements are either overwritten by the new elements or destroyed.
Requires: |
|
allocator_type get_allocator() const;
unordered_multimap
iteratorsiterator begin(); const_iterator begin() const;
Returns: |
An iterator referring to the first element of the container, or if the container is empty the past-the-end value for the container. |
iterator end(); const_iterator end() const;
Returns: |
An iterator which refers to the past-the-end value for the container. |
const_iterator cbegin() const;
Returns: |
A constant iterator referring to the first element of the container, or if the container is empty the past-the-end value for the container. |
const_iterator cend() const;
Returns: |
A constant iterator which refers to the past-the-end value for the container. |
unordered_multimap
modifierstemplate<typename... Args> iterator emplace(Args&&... args);
Inserts an object, constructed with the arguments args
, in the container.
Requires: |
|
Returns: |
An iterator pointing to the inserted element. |
Throws: |
If an exception is thrown by an operation other than a call to |
Notes: |
Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. Pointers and references to elements are never invalidated. If the compiler doesn't support variadic template arguments or rvalue references, this is emulated for up to 10 arguments, with no support for rvalue references or move semantics. Since existing |
template<typename... Args> iterator emplace_hint(const_iterator hint, Args&&... args);
Inserts an object, constructed with the arguments args
, in the container.
hint
is a suggestion to where the element should be inserted.
Requires: |
|
Returns: |
An iterator pointing to the inserted element. |
Throws: |
If an exception is thrown by an operation other than a call to |
Notes: |
The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same key. Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. Pointers and references to elements are never invalidated. If the compiler doesn't support variadic template arguments or rvalue references, this is emulated for up to 10 arguments, with no support for rvalue references or move semantics. Since existing |
iterator insert(value_type const& obj);
Inserts obj
in the container.
Requires: |
|
Returns: |
An iterator pointing to the inserted element. |
Throws: |
If an exception is thrown by an operation other than a call to |
Notes: |
Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. Pointers and references to elements are never invalidated. |
iterator insert(value_type&& obj);
Inserts obj
in the container.
Requires: |
|
Returns: |
An iterator pointing to the inserted element. |
Throws: |
If an exception is thrown by an operation other than a call to |
Notes: |
Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. Pointers and references to elements are never invalidated. |
iterator insert(const_iterator hint, value_type const& obj);
Inserts obj
in the container.
hint is a suggestion to where the element should be inserted.
Requires: |
|
Returns: |
An iterator pointing to the inserted element. |
Throws: |
If an exception is thrown by an operation other than a call to |
Notes: |
The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same key. Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. Pointers and references to elements are never invalidated. |
iterator insert(const_iterator hint, value_type&& obj);
Inserts obj
in the container.
hint is a suggestion to where the element should be inserted.
Requires: |
|
Returns: |
An iterator pointing to the inserted element. |
Throws: |
If an exception is thrown by an operation other than a call to |
Notes: |
The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same key. Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. Pointers and references to elements are never invalidated. |
template<typename InputIterator> void insert(InputIterator first, InputIterator last);
Inserts a range of elements into the container.
Requires: |
|
Throws: |
When inserting a single element, if an exception is thrown by an operation other than a call to |
Notes: |
Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. Pointers and references to elements are never invalidated. |
void insert(initializer_list<value_type> il);
Inserts a range of elements into the container.
Requires: |
|
Throws: |
When inserting a single element, if an exception is thrown by an operation other than a call to |
Notes: |
Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. Pointers and references to elements are never invalidated. |
iterator erase(const_iterator position);
Erase the element pointed to by position
.
Returns: |
The iterator following |
Throws: |
Only throws an exception if it is thrown by |
Notes: |
In older versions this could be inefficient because it had to search through several buckets to find the position of the returned iterator. The data structure has been changed so that this is no longer the case, and the alternative erase methods have been deprecated. |
size_type erase(key_type const& k);
Erase all elements with key equivalent to k
.
Returns: |
The number of elements erased. |
Throws: |
Only throws an exception if it is thrown by |
iterator erase(const_iterator first, const_iterator last);
Erases the elements in the range from first
to last
.
Returns: |
The iterator following the erased elements - i.e. |
Throws: |
Only throws an exception if it is thrown by In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations. |
void quick_erase(const_iterator position);
Erase the element pointed to by position
.
Throws: |
Only throws an exception if it is thrown by In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations. |
Notes: |
This method was implemented because returning an iterator to
the next element from |
void erase_return_void(const_iterator position);
Erase the element pointed to by position
.
Throws: |
Only throws an exception if it is thrown by In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations. |
Notes: |
This method was implemented because returning an iterator to
the next element from |
void clear();
Erases all elements in the container.
Postconditions: |
|
Throws: |
Never throws an exception. |
void swap(unordered_multimap&);
Swaps the contents of the container with the parameter.
If Allocator::propagate_on_container_swap
is declared and
Allocator::propagate_on_container_swap::value
is true then the
containers' allocators are swapped. Otherwise, swapping with unequal allocators
results in undefined behavior.
Throws: |
Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of |
Notes: |
The exception specifications aren't quite the same as the C++11 standard, as the equality predieate and hash function are swapped using their copy constructors. |
unordered_multimap
lookupiterator find(key_type const& k); const_iterator find(key_type const& k) const; template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> iterator find(CompatibleKey const& k, CompatibleHash const& hash, CompatiblePredicate const& eq); template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> const_iterator find(CompatibleKey const& k, CompatibleHash const& hash, CompatiblePredicate const& eq) const;
Returns: |
An iterator pointing to an element with key equivalent to |
Notes: |
The templated overloads are a non-standard extensions which allows you to use a compatible hash function and equality predicate for a key of a different type in order to avoid an expensive type cast. In general, its use is not encouraged. |
size_type count(key_type const& k) const;
Returns: |
The number of elements with key equivalent to |
std::pair<iterator, iterator> equal_range(key_type const& k); std::pair<const_iterator, const_iterator> equal_range(key_type const& k) const;
Returns: |
A range containing all elements with key equivalent to |
unordered_multimap
bucket interfacesize_type bucket_count() const;
Returns: |
The number of buckets. |
size_type max_bucket_count() const;
Returns: |
An upper bound on the number of buckets. |
size_type bucket_size(size_type n) const;
Requires: |
|
Returns: |
The number of elements in bucket |
size_type bucket(key_type const& k) const;
Returns: |
The index of the bucket which would contain an element with key |
Postconditions: |
The return value is less than |
local_iterator begin(size_type n); const_local_iterator begin(size_type n) const;
Requires: |
|
Returns: |
A local iterator pointing the first element in the bucket with index |
local_iterator end(size_type n); const_local_iterator end(size_type n) const;
Requires: |
|
Returns: |
A local iterator pointing the 'one past the end' element in the bucket with index |
const_local_iterator cbegin(size_type n) const;
Requires: |
|
Returns: |
A constant local iterator pointing the first element in the bucket with index |
const_local_iterator cend(size_type n);
Requires: |
|
Returns: |
A constant local iterator pointing the 'one past the end' element in the bucket with index |
unordered_multimap
hash policyfloat load_factor() const;
Returns: |
The average number of elements per bucket. |
float max_load_factor() const;
Returns: |
Returns the current maximum load factor. |
void max_load_factor(float z);
Effects: |
Changes the container's maximum load factor, using |
void rehash(size_type n);
Changes the number of buckets so that there at least n
buckets, and so that the load factor is less than the maximum load factor.
Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.
Throws: |
The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function. |
void reserve(size_type n);
Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.
Throws: |
The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function. |
unordered_multimap
Equality Comparisonstemplate<typename Key, typename Mapped, typename Hash, typename Pred, typename Alloc> bool operator==(unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const& x, unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const& y);
Return true
if x.size() ==
y.size
and for every equivalent key group in
x
, there is a group in y
for the same key, which is a permutation (using
operator==
to compare the value types).
Notes: |
The behavior of this function was changed to match the C++11 standard in Boost 1.48. Behavior is undefined if the two containers don't have equivalent equality predicates. |
template<typename Key, typename Mapped, typename Hash, typename Pred, typename Alloc> bool operator!=(unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const& x, unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const& y);
Return false
if x.size() ==
y.size
and for every equivalent key group in
x
, there is a group in y
for the same key, which is a permutation (using
operator==
to compare the value types).
Notes: |
The behavior of this function was changed to match the C++11 standard in Boost 1.48. Behavior is undefined if the two containers don't have equivalent equality predicates. |
unordered_multimap
swaptemplate<typename Key, typename Mapped, typename Hash, typename Pred, typename Alloc> void swap(unordered_multimap<Key, Mapped, Hash, Pred, Alloc>& x, unordered_multimap<Key, Mapped, Hash, Pred, Alloc>& y);
Swaps the contents of x
and y
.
If Allocator::propagate_on_container_swap
is declared and
Allocator::propagate_on_container_swap::value
is true then the
containers' allocators are swapped. Otherwise, swapping with unequal allocators
results in undefined behavior.
Effects: |
|
Throws: |
Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of |
Notes: |
The exception specifications aren't quite the same as the C++11 standard, as the equality predieate and hash function are swapped using their copy constructors. |


Led web
Main
Led strip
Led ring
Led strip config
Single color
Color
Blink
Only odd
Blink speed
Send
Double color gradient
Colors
Cicle
Only odd
Cicle speed
Send
Triple color gradient
Colors
Cicle
Only odd
Cicle speed
Send
Rainbow gradient
Rainbow size
Cicle
Only odd
Cicle speed
Send
Black and white gradient
Black and whitew size
Cicle
Only odd
Cicle speed
Send
Main
Led strip
Led ring