You're receiving this email because [h Sender.DisplayName] uploaded your requested files via Transmit.
The file(s) you requested have now been shared to you by [h Sender.DisplayName]. [Package.Files]
“[h Mail.Message]”
Powered by Transmit


Name of the Open Bidder project.
Find on the
Google Developers Console.
Find on the
Google Developers Console.
OAuth 2.0 client ID for web applications registered for Open Bidder.
Find or create on the
Google Developers Console.
OAuth 2.0 client secret for web applications registered for Open Bidder.
Find or create on the
Google Developers Console.


Class: RSpec::Core::Runner
- Inherits:
-
Object
- Object
- RSpec::Core::Runner
- Defined in:
- lib/rspec/core/runner.rb
Overview
Provides the main entry point to run a suite of RSpec examples.
Class Method Summary (collapse)
-
+ (void) autorun
Register an
at_exit
hook that runs the suite when the process exits. -
+ (void) invoke
Runs the suite of specs and exits the process with an appropriate exit code.
-
+ (Fixnum) run(args, err = $stderr, out = $stdout)
Run a suite of RSpec examples.
Instance Method Summary (collapse)
-
- (Runner) initialize(options, configuration = RSpec.configuration, world = RSpec.world)
constructor
A new instance of Runner.
-
- (void) run(err, out)
Configures and runs a spec suite.
-
- (Fixnum) run_specs(example_groups)
Runs the provided example groups.
-
- (void) setup(err, out)
Wires together the various configuration objects and state holders.
Constructor Details
- (Runner) initialize(options, configuration = RSpec.configuration, world = RSpec.world)
Returns a new instance of Runner
73 74 75 76 77 |
# File 'lib/rspec/core/runner.rb', line 73 def initialize(, configuration=RSpec.configuration, world=RSpec.world) @options = @configuration = configuration @world = world end |
Class Method Details
+ (void) autorun
This is not generally needed. The rspec
command takes care
of running examples for you without involving an at_exit
hook. This is only needed if you are running specs using
the ruby
command, and even then, the normal way to invoke
this is by requiring rspec/autorun
.
Register an at_exit
hook that runs the suite when the process exits.
12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 |
# File 'lib/rspec/core/runner.rb', line 12 def self.autorun if autorun_disabled? RSpec.deprecate("Requiring `rspec/autorun` when running RSpec via the `rspec` command") return elsif installed_at_exit? || running_in_drb? return end at_exit do # Don't bother running any specs and just let the program terminate # if we got here due to an unrescued exception (anything other than # SystemExit, which is raised when somebody calls Kernel#exit). next unless $!.nil? || $!.is_a?(SystemExit) # We got here because either the end of the program was reached or # somebody called Kernel#exit. Run the specs and then override any # existing exit status with RSpec's exit status if any specs failed. invoke end @installed_at_exit = true end |
+ (void) invoke
Runs the suite of specs and exits the process with an appropriate exit code.
35 36 37 38 39 |
# File 'lib/rspec/core/runner.rb', line 35 def self.invoke disable_autorun! status = run(ARGV, $stderr, $stdout).to_i exit(status) if status != 0 end |
+ (Fixnum) run(args, err = $stderr, out = $stdout)
Run a suite of RSpec examples. Does not exit.
This is used internally by RSpec to run a suite, but is available for use by any other automation tool.
If you want to run this multiple times in the same process, and you
want files like spec_helper.rb
to be reloaded, be sure to load load
instead of require
.
56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 |
# File 'lib/rspec/core/runner.rb', line 56 def self.run(args, err=$stderr, out=$stdout) trap_interrupt = ConfigurationOptions.new(args) if .[:drb] require 'rspec/core/drb' begin DRbRunner.new().run(err, out) rescue DRb::DRbConnError err.puts "No DRb server is running. Running in local process instead ..." new().run(err, out) end else new().run(err, out) end end |
Instance Method Details
- (void) run(err, out)
Configures and runs a spec suite.
83 84 85 86 |
# File 'lib/rspec/core/runner.rb', line 83 def run(err, out) setup(err, out<EMAIL_ADDRESS>end |
- (Fixnum) run_specs(example_groups)
Runs the provided example groups.
106 107 108 109 110 111 112 113 114 115 116 |
# File 'lib/rspec/core/runner.rb', line 106 def run_specs(example_groups) @configuration.reporter.report(@world.example_count(example_groups)) do |reporter| begin hook_context = SuiteHookContext.new @configuration.hooks.run(:before, :suite, hook_context) example_groups.map { |g| g.run(reporter) }.all? ? 0 : @configuration.failure_exit_code ensure @configuration.hooks.run(:after, :suite, hook_context) end end end |
- (void) setup(err, out)
Wires together the various configuration objects and state holders.
92 93 94 95 96 97 98 |
# File 'lib/rspec/core/runner.rb', line 92 def setup(err, out) @configuration.error_stream = err @configuration.output_stream = out if @configuration.output_stream == $stdout @options.configure(@configuration) @configuration.load_spec_files @world.announce_filters end |


{{ choice.choice_text }} -- {{ choice.votes }} vote{{ choice.votes|pluralize }}
{% endfor %}Publication date: {{ pollset.pub_date }}
{% if request.user in pollset.user_performed.all %}You have voted this poll set
{% else %}You haven't voted yet
{% endif %} {% if pollset.user_performed.all %}Voted users:
{% for voted_user in pollset.user_performed.all %}{{ voted_user }} {% endfor %}
{% endif %}


Official visits Kazhuveli, water source for city
It was developed at a cost of ₹22 lakh
by Special CorrespondentManaging Director of Tamil Nadu Water Resources Conservation and Rivers Restoration Corporation K. Satyagopal on Sunday inspected a waterbody near Marakkanam, as the State government is planning to source water from there for drinking water needs in Chennai.
According to an official release, the plan is to treat the water from Kazhuveli waterbody in Villupuram district before supplying it to Chennai.
The waterbody has been developed under the Kudimaramathu Scheme, at a cost of ₹22 lakh.
Villupuram Collector L. Subramanian and senior officails from the Public Works Department were present.


Home
Sign In
Sign In
Home
Sign In
Sign In
Register
ass="input-areas" placeholder="Enter password">
Sign In


Hi, IT google AI is very good! for feature!
Hi, IT google AI is very good! for feature!
Hi, IT google AI is very good! for feature!


@(user: models.users.User) @main("The Ripley", user){
Less than 5 minutes' walk from O'Connell Street, The Ripley Court Hotel is close to Temple Bar and Trinity College. This central Dublin hotel offers spacious, tastefully furnished rooms with flat-screen TVs, free WiFi and power showers.
Traditional, full Irish breakfasts, continental breakfasts are served daily in The Ripley Court's restaurant from 7:00 to 10:00, and carvery lunches are also available. Homemade soups, coffee and pastries are also available in the Ripley Court Deli Bar and The Ulysses Bar offers a selection of beers, wine, and cocktails.
The 747 Airlink airport shuttle which services Busaras bus station stops right outside the hotel on route from the Airport. Return shuttles to the airport depart from Busaras bus station which is just a minute walk away from the hotel.
The nearby O2 Arena can be reached by LUAS (light rail system) from the Hotel and Dublin's Convention Centre is just a 10 minute walk and can also be accessed by the LUAS tram system. Trinity College and Croke Park are within a 10-minute walk.
Rooms at Ripley Court hotel all include en suite bathrooms with baths and power showers. Rooms also feature a refreshment tray with tea and coffee-making facilities, cable TV and an in-room safe.
A 24-hour reception and luggage facilities are available to facilitate early arrivals and departures.
This is our guests' favourite part of Dublin, according to independent reviews.
Couples particularly like the location — they rated it 8 for a two-person trip.
We speak your language!


--- layout: post status: publish published: true title: Why is the concept of VMotion during the day is ok for the enterprise author: display_name: iguy login: iguy email<EMAIL_ADDRESS>url: '' author_login: iguy author_email<EMAIL_ADDRESS>wordpress_id: 31 wordpress_url: http://itsjustanotherlayer.com/?p=31 date: !binary |- MjAwOC0xMS0wNiAwNzo0Mzo1NiAtMDYwMA== date_gmt: !binary |- MjAwOC0xMS0wNiAwNzo0Mzo1NiAtMDYwMA== categories: - VMware tags: - Changes - LiveMigration - VMotion - VMware comments: - id: 14 author: ErvinTW author_email<EMAIL_ADDRESS>author_url: http://www.olympic-beijing.ru/ date: !binary |- MjAwOC0xMS0xMCAyMToxMDoyMiAtMDYwMA== date_gmt: !binary |- MjAwOC0xMS0xMCAyMToxMDoyMiAtMDYwMA== content: Thanks! Nice post. - id: 15 author: Stu Fox author_email<EMAIL_ADDRESS>author_url: http://blogs.technet.com/stufox date: !binary |- MjAwOC0xMS0xNyAwMDowMjoxOSAtMDYwMA== date_gmt: !binary |- MjAwOC0xMS0xNyAwMDowMjoxOSAtMDYwMA== content: ! 'I think you might be drawing a long bow to be assuming that my comment is representative of the overall opinion of Microsoft. My comment was entirely personal, and not on behalf of my employer. I put a disclaimer in so that everything is out in the open. Congratulations on getting Vmotion approved for change during the day - I''ve worked with many clients who didn''t bother with that and simply turned things like DRS on and somehow just ignored it in their change management process. And yes, many enterprises I''ve worked in do only make changes in defined change windows - including doing things like changing failed disks, removing servers from the data center etc. Don''t get me wrong, live Migration is a great technology and I can''t wait till we have it as well... You also didn''t address the other half - you''re working in an organisation that is mature enough to get Vmotion included in it''s change control process but you can''t automate a patch application? I''m pretty sure that you''ve probably got tools in there with that capability. Thanks for taking the time to respond. Cheers Stu (Won''t bother repeating the disclaimer)' - id: 16 author: View Yonder » vMotion and Change Management author_email: '' author_url: http://viewyonder.com/2009/05/12/vmotion-and-change-management/ date: !binary |- MjAwOS0wNS0xMiAwNjozNDoxOCAtMDUwMA== date_gmt: !binary |- MjAwOS0wNS0xMiAwNjozNDoxOCAtMDUwMA== content: ! '[...] another link from itsjustanotherlayer.com about making changes like vMotion without change control and in [...]' ---
As I stated in an earlier post that the
concept of VMotion/LiveMigration wasn’t that important since clients don’t change when they do work on hardware even with VMotion
The assumptions that Microsoft makes is that the only time you ever work on anything is during these distinct change windows. So you don't make any changes at all outside of these windows. You don't optimize performance. You don't replace failed hard drives in RAID array. You don't launch new web servers to enhance performance as load grows. You don't turn off servers that are no longer in use. You don't turn on new servers.
Now that's obviously significantly silly for any serious enterprise. Any company with more than say 20 servers is going to be doing things all the time. You are introducing an increasing risk to your company the longer you wait to do any of those activities. You'll follow ITIL with the change control rules. You'll try to optimize your teams efforts so you can do things spread out to maximize efforts with minimal or ideally no impact to the business (accidents happen). In doing this you'll likely follow the ITIL categorization of different activities. This is a key thought here.
ITIL has the concept of Routine Maintenance in Service Operations. Any type of IT Operational process which has been performed enough times with near zero impacts caused due to the activity can be considered viable to perform at most any time. Every change no matter how small has risk. The objective is to weigh what the risk is to what the impact is if you don't do this specific change. Your mileage will vary depending on your company and procedures and experiences obviously.
An example of a Process is the replacement of a failed hard drive in a RAID 5/6 Array. This has been done some 500 times by my team over the past year. We know the impact when we do this and if we don't do this. We have had one issue two years ago when we replaced the hard drive and the RAID rebuild started another drive failed at the same time. My company has ruled that this activity has a significantly low enough risk level that it can stay at Routine Maintenance and done at anytime we can do it (preferrably as soon after notification of issue as possible as not doing this replacement introduces a new increasing risk over time of complete system failure).
Often the only way to get a Process to Routine Maintenance is a promotion path:
In my environment VMotion has been performed over 50,000 times in the past year. It is considered Routine Maintenance and is used on a daily basis to provide better service to my clients. It took me close to a year to get VMotion to Routine Maintenance and was worth every single effort. Now VMware DRS that is now enabled since VMotion has such a fantastic history at my company I don't have to manage a cluster since DRS handles quite a bit of the performance issues for my team now.
So Yes, I do use VMotion daily at all hours. Yes, I would update my hypervisor layer with a critical patch like an equivalent MS08-67 starting immediately upon emergency Change Authorization. Finally, Yes it would be done faster than a product like QuickMigration since I can do it and not impact my companies services (No interruption to my network connections). This is my goal at the end of the day - maintain my companies uptime running Windows Server while provding the most risk free environment at the best cost possible.


Economy cars are extremely comfortable for urban and non-urban condition because of its sizes and maneuverability as well as the best rental prices. Top Rent A Car company offers huge choice of economy cars available for rent at affordable prices. If our offices are not convenient for you, we will deliver a car directly to you address. Economy cars for rent are from the leading world manufacturers as: Toyota, Renault, Ford, Nissan and others. If you need economy car for rent in Bulgaria, you will find the best offers below. Choose the best economy car hire for your holiday!


Upload or use the browse tab to select any file-based format to translate data immediately into the required format and coordinate system.
Drop your files here


Third largest of typefaces available.
See also Typefaces, Sizes Return to the LaTeX Table of Contents


Tcl variables can be accessed by means of the tclvar class. For example, if the programmer declares:
tclvar hello("hello"); float floatvar;
then the variable hello can be used just like a normal C variable in expression such as
floatvar=hello*3.4;
.
The class allows assignment to and from double
and char*
variables, incrementing and decrementing the variables, compound
assignment and accessing array Tcl variables by means of the C array
syntax. The is also a function that tests for the existence of a Tcl
variable.
The complete class definition is given by:
class tclvar { public: /* constructors */ tclvar(); tclvar(char *nm, char* val=NULL); tclvar(tclvar&); ~tclvar(); /* These four statements allow tclvars to be freely mixed with arithmetic expressions */ double operator=(double x); char* operator=(char* x); operator double (); operator char* (); double operator++(); double operator++(int); double operator--(); double operator--(int); double operator+=(double x); double operator-=(double x); double operator*=(double x); double operator/=(double x); tclvar operator=(tclvar x); /* arrays can be indexed either by integers, or by strings */ tclvar operator[](int index); tclvar operator[](char* index); friend int exists(tclvar x); };


Toggle navigation
Ushare Dashboard
Dashboard
Settings
Profile
Help
Overview
User Track
Data Flow
Weather Monitor
Version Control
Dashboard
Recent Transactions
start
stop
#
Recipient
Sharer
Request time
Status
Loading...
Loading...
Loading...
Loading...


{% load staticfiles %} {% load lametro_extras %}
{{ meeting.start_time | date:"D n/d/Y"}}
{{ meeting.start_time | date:"g:i a"}}
{{ meeting.location_name}}
No meetings are in session at this time. The links to watch a meeting live, in English or Spanish, will be posted here once the meeting begins.
{% if not meeting.documents.all %}Agenda will be posted no later than 72 hours prior to the start of the meeting, or 24 hours for Special Board meetings.
{% endif %}


nlped_docs = nlp.pipe(text_list, n_threads = self.n_threads)
pool = ThreadPool(self.n_threads)
processed = pool.map(self.geoparse, nlped_docs)
pool.close()
pool.join()
return processed
//processed = pool.map(self.geoparse, nlped_docs)
//pool.close()
//pool.join()
processed = [self.geoparse(i) for i in nlped_docs]
return processed


{{- define "main" }}
COVID-19 is shutting down schools all over the world. We've been sheltering in place since the middle of March. Our school district, San Jose Unified, has announced that school will not resume this year but learning will still take place online.
Most children didn't have the opportunity to take home school supplies on the last day of school. Some families aren't able to easily replace those supplies. This site will explain how we purchased supplies, packaged them and distributed them.
Each packet has the same set of items in it. We'll provide a template and you can feel free to add more or less depending on your circumstances.
Making the packets and filling them should be fun. We had a bunch of different designs on the front.
We created an insert for each kit that had more information from our school district.


| Month | Sales Vol. | TV | Radio | Newspaper |
|---|
| OLS Regression Result | |||
|---|---|---|---|
| Dep. Variable | R-Squared | ||
| Models | Adj. R-Squared | ||
| Method | PROB (F-Statics) | ||
| DATE | R-Squared | ||
| TIME | Log-Likelihood | ||
| No. Observations | AIC | ||
| DF. Residuals | BIC | ||
| DF. Model | |||
| Converiance Type | |||
| Inercept | ||||||
| TV | ||||||
| Radio | ||||||
| Newspaper |
| Omnibus | Durbin-Watson | ||
| Prob (Omnibus) | Jarque-Bera JB | ||
| Skew | Prob JB | ||
| Kurtosis | condno |


Geocode Locations from Table takes in a file or table of many addresses and returns back either a Feature Service or a file, with the coordinates of the addresses in the output file.
The addresses to convert. This must be a CSV or Microsoft Excel file in the user's My Content.
The table must be a table in the user's My Content.
The locator service must be a service configured for batch geocoding. For more information on configuring locator services for batch geocoding, see: Configuring batch geocoding.
This parameter only appears if the user is using the Esri World Geocoder to perform batch geocoding. If all of the addresses in the input table are from the same country, then the user should select a country to ensure the most accurate results.
Map as many fields in the input table to locator fields as possible to ensure the most accurate results. If the input table has all its data in one column, select "Single Field" on the data fields toggle and map "SingleLine" to the only data field in the input. Otherwise, select "Multiple Fields" and map the appropriate locator fields to the multiple field columns.
Select an output format type. Options are "Feature Service", "CSV" or "XLS" file. Results will appear in My Content when the analysis job is complete.
This is the name of the layer that will be created in My Content and added to the map. The default name is based on the tool name and the input layer name. If the layer already exists, you will be asked to provide another name.
Using the Save result in drop-down box, you can specify the name of a folder in My Content where the result will be saved.


{% extends "horizon/common/_modal.html" %} {% block modal_id %}two_factor_enable_modal{% endblock %} {% block modal-header %}Setting up Two-Factor Authentication{% endblock %} {% block modal-body %}
Configure a new account using any of the following:
Scan this QR code
{% if two_factor_qr_encoded %} {% endif %}Insert this key manually
{% if two_factor_key %}{{ two_factor_key }}
{% endif %}Whenever you want to access your account, you will be asked for a verification code, which you can get from the Authenticator App after you configure it.


2018-11-02 11:17:31
Adapted from (Davis, 1992)
Glucorticoid receptors in body
Brandão, M. L., Zanoveli, J. M., Ruiz-Martinez, R. C., Oliveira, L. C., & Landeira-Fernandez, J. (2008). Different patterns of freezing behavior organized in the periaqueductal gray of rats: Association with different types of anxiety. Behavioural Brain Research, 188(1), 1–13. https://doi.org/10.1016/j.bbr.2007.10.018
Clapp, P., Bhave, S. V., & Hoffman, P. L. (n.d.). How Adaptation of the Brain to Alcohol Leads to Dependence. Retrieved from http://pubs.niaaa.nih.gov/publications/arh314/310-339.htm
Cock, V. C. D., Vidailhet, M., & Arnulf, I. (2008). Sleep disturbances in patients with parkinsonism. Nature Clinical Practice Neurology, 4(5), 254–266. https://doi.org/10.1038/ncpneuro0775
Davis, M. (1992). The role of the amygdala in fear-potentiated startle: Implications for animal models of anxiety. Trends in Pharmacological Sciences, 13, 35–41. https://doi.org/10.1016/0165-6147(92)90014-W
Flores, Á., Maldonado, R., & Berrendero, F. (2013). Cannabinoid-hypocretin cross-talk in the central nervous system: What we know so far. Neuropharmacology, 7, 256. https://doi.org/10.3389/fnins.2013.00256
Heath, R. G. (1963). Electrical self-stimulation of the brain in man. American Journal of Psychiatry, 120(6), 571–577. https://doi.org/10.1176/ajp.120.6.571
Kadmiel, M., & Cidlowski, J. A. (2013). Glucocorticoid receptor signaling in health and disease. Trends in Pharmacological Sciences, 34(9), 518–530. https://doi.org/10.1016/j.tips.2013.07.003
Kringelbach, M. L., & Berridge, K. C. (2009). Towards a functional neuroanatomy of pleasure and happiness. Trends in Cognitive Sciences, 13(11), 479–487.
Medina, J. F., Repa, J. C., Mauk, M. D., & LeDoux, J. E. (2002). Parallels between cerebellum-and amygdala-dependent conditioning. Nature Reviews Neuroscience, 3(2), 122–131. https://doi.org/10.1038/nrn728
Milner, P. M. (1989). The discovery of self-stimulation and other stories. Neuroscience & Biobehavioral Reviews, 13(2–3), 61–67. https://doi.org/10.1016/S0149-7634(89)80013-2
Musazzi, L., Tornese, P., Sala, N., & Popoli, M. (2017). Acute or chronic? A stressful question. Trends in Neurosciences. https://doi.org/10.1016/j.tins.2017.07.002
Nestler, E. J., & Carlezon, W. A. (2006). The mesolimbic dopamine reward circuit in depression. Biological Psychiatry, 59(12), 1151–1159. https://doi.org/10.1016/j.biopsych.2005.09.018
Pellman, B. A., & Kim, J. J. (2016). What can ethobehavioral studies tell us about the brain’s fear system? Trends in Neurosciences, 39(6), 420–431. https://doi.org/10.1016/j.tins.2016.04.001


Tame Impala‘s new album The Slow Rush will be out on Valentine’s Day 2020 and the band have just announced their first North American shows in support of it. So far, only announced dates are on the West Coast with Clairo: San Diego’s Pechanga Arena on March 9, Los Angeles’ The Forum on March 10 and San Francisco’s Chase Center on March 13. They’ll also play Mexico City’s Foro Sol on March 19, which has MGMT on the bill, too. Tickets for the U.S. dates go on sale Saturday, November 9 at noon Pacific, and the Mexico City show is on sale Friday, Nov 8 at 11:00 AM local time. Tickets come with a digital or CD copy of The Slow Rush.
Dates are listed, along with a stream of Tame Impala’s new single “It Might Be Time,” below.
Tame Impala – 2019 Tour Dates 03-09 San Diego, CA – Pechanga Arena # 03-10 Los Angeles, CA – The Forum # 03-13 San Francisco, CA – Chase Center # 03-19 Mexico City, MX – Foro Sol # $


Basic Package
We work develop for you
a static website
which Includes:
- 3-4 Pages Website
- Static Website with No Database
- We develop for
NGO,Companies,Business
Website for our potential Clients
- No Hosting site (Mentorsh)
Premium Package
We work on
developing your
Website
this Includes:
- 4-7 Website Pages
- Dynamic Website containing
php,database & a frontend
- Full 100% Support
on hosting
PLantinum Package
We work develop for you
a web system/app
which Includes:
- 8-15 Pages Website
- Web System() with Database
- We develop for
NGO,Companies,Business
systems for potential Clients
- We can develop system
for every type of institution
eg:health system,
- Hosting & Domain Support
(Mentorship)


List of students
Add student
Search
#
Student Number
Name
CGPA
Enrollment Date
Edit
Delete
Confirm Delete
×
Are you sure you wish to delete this student data?
No students found


We are a trans-scale multi-modality imaging research group in the School of Electronic Engineering and School of Life Science and Technology at the Xidian University, Xi'an, China.
We develop and apply novel imaging techniques and image analysis methods to enable improved understanding of human diseases and human brain. With the integrated expertise in engineering, physics, chemistry, biology, medicine, and entrepreneurship, our research areas are devoted to the development of multi-scale imaging techniques, development of devices for early diagnosis and precise treatment, cognitive neuroscience and hybrid artificial intelligence.
Our paper on deep clustering was accepted by ECCV 2020. Congratulations to Chuang Niu. Read More
The website of our research group was moved to Github. Everything is under construction. We are still learning how to improve the webpages. Thanks for your attention. Read More


@* * Copyright 2021 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import iht.models._ @import iht.utils._ @import iht.config.AppConfig @import iht.models.RegistrationDetails @this( implicit val appConfig: AppConfig, form: FormWithCSRF, ihtMainTemplateApplication: iht_main_template_application, errorSummary: ihtHelpers.custom.error_summary, inputYesNoRadioGroup: ihtHelpers.standard.input_yes_no_radio_group, nameHelper: ihtHelpers.custom.name ) @(assetsLeftToQualifyingBodyQuestionForm: Form[iht.models.application.exemptions.BasicExemptionElement], registrationDetails:RegistrationDetails)(implicit request:Request[_], messages: Messages) @deceasedName() = @{DeceasedInfoHelper.getDeceasedNameOrDefaultString(registrationDetails, true)} @helpCopy() = @{
{Messages("page.iht.application.exemptions.assetsLeftToQualifyingBody.p1")}
{Messages("page.iht.application.exemptions.assetsLeftToQualifyingBody.p2")}
{Messages("iht.estateReport.exemptions.qualifyingBodies.assetsLeftToQualifyingBody.p3")}


Icons made by Eucalyp from Flaticon.
Better known as the Big Data Technology, it provides amazing and useful Insights about your customers and how to create better services & opportunities.
Newly improved, and full of utility, Artificial Intelligence is leading the way in how we should make the computer communicating with humans in autonomous ways!
This distributed Ledger Technology is changing the way individuals do business and share values and trust among each other, becoming a world-changing innovation.
Software Developer
CEO & IT Architect


FROM THE DESK OF: DR.LESTER WALLACE(PH.D) INTERCONTINENTAL BANK PLC, PLOT 23,AHMADU BELLO WAY LAGOS-NIGERIA. Greetings, I am a senior Accountant in my Bank also accounting officer to Mr Daniel , a national of your country, who worked with the Chevron Plc in Nigeria. On the 21st of April 2004, my customer, his wife and their two children were involved in auto-crash along the ever-busy Sagumu-Ibadan High Way. All occupants of the vehicle unfortunately lost their lives. Since then, the Board of Directors of my Bank have made several enquires to their embassy to locate any of my customer's extended relations but to no avail. Hence the needs to contact you is to present you as the next of kin at the bank and claim this fund, since you both share the same family name. I have contacted you to assist in repatriating the money and Property left behind by my client before they get Confiscated or declared unserviceable by the bank where this Huge deposits of US$20M was lodged. The Bank has published several Notices for the Next of Kin of the deceased to apply for collection of this Fund or have the account confiscated within a short Period of time. Since I have been unsuccessful in locating the relatives for over 3 years now I seek your consent to present you as the Next of kin of the deceased,hence two of you share the same family name, so that the proceeds of this Account valued at US$20 million dollars can be paid to you and Then you and me can share the money, 60% to me and 40% to you. I have all necessary legal documents that can be used to backup any claim we may make. All I require is your honest cooperation to enable this deal through. I guarantee that this will be executed under a legitimate Arrangement that will protect you from any breach of the Law. Please get in touch with my email<EMAIL_ADDRESS>Best regards, DR.LESTER WALLACE, SENIOR ACCOUNTANT INTERCONTINENTAL BANK PLC.


This is an initial draft based on a positive response to functionality and performance of the reference implementation. Colony has at this point been receiving community feedback for the past 1.5 years from Boost, SG14 and individual developers, and on the basis of support from SG14, I am seeking indication of levels of interest for inclusion in the standard. At this stage I would also like to ask for feedback on the existing design/interface, and suggestions prior to proceeding to wording.
Sometimes while programming we come across situations where order is unimportant, but where data is heavily interlinked, iterated over frequently, and changing often. An example would be a central 'entity' class in most video game engines. These are 'has a'-style objects rather than 'is a'-style objects, which reference other shared resources such as sprites, sound fx and so on. Those resources are typically located in separate containers. The 'entities' themselves are in turn referenced by other structures such as quadtrees/octrees (for collision detection), level structures, and the like. When iterating over entities, one has to take into account the fact that they may be removed from the game at any time (for example, a wall gets destroyed and therefore no longer requires processing) and new entities inserted (for example, if a new enemy arrives during a level). While this is happening, the inter-linkages between entities, resource collections and superstructures like levels and quadtrees, must stay valid. The order of the entities and resources themselves within the containers is, typically, unimportant.
There are obviously many different ways of allowing objects to reference each other under C++, but the fastest are pointers, closely followed by indexes (for contiguous containers). Unfortunately the container which has the best iteration performance in the standard library, vector[1], also loses pointer validity to elements within it upon insertion, and also pointer/index validity upon erasure. This leads to sophisticated and restrictive workarounds when developers attempt to utilize vector under the above circumstances.
Colony is a specifically unordered-but-sortable templated data container which allows for fast iteration and direct pointer linkage, without losing pointer/iterator validity to non-erased/non-end() elements when insertions or erasures occur. It is it's own abstract data type, but is most similar to a "bag", "bucket-array" or "multiset" ADT, the central difference being the absence of key values. On the basis of a fully-developed reference implementation the following performance characteristics have been established:
Specifically, a colony has better overall performance than any standard library container when:
While the benchmarks[1] referenced in the appendix are a better tool for understanding the performance characteristics, the comparative speed characteristics for most-commonly-used operations in the above scenario as described are:
As explored in the benchmarks[1] there are some vector/deque modifications/workarounds which can outperform colony for iteration while maintaining pointer validity, but which have slower insertion and erasure speeds, and also typically have a cost to usability or memory requirements. When the ratio of insertions/erasures to iterations is greater than 1% insertions/erasures per 3600 full iterations over data, colony will outperform these workarounds. Colony's other advantages are the freeing and recycling of unused memory on-the-fly, and the guaranteed validity of pointers/references to non-erased elements regardless of insertion and erasure (which makes programming with containers of inter-related data structures much simpler). Iterators which do not point to end() or erased elements are also guaranteed to remain valid.
While the conditions below are common across multiple domains, for the benefit of those unfamiliar with any specific scenarios, I will present the motivation with examples from game development. When working on game engines we are predominantly dealing with collections of data where:
std::vector, in it's default state, does not meet these requirements due to:
To meet these requirements, game developers tend to either (a) develop their own custom containers for given scenarios or (b) develop workarounds for the problems of vector. These workarounds are many and varied, but the most common are probably:
All three techniques have the disadvantage of slow singular insertions, and the first two will also continually expand memory usage when erasing and inserting over periods of time. The third deals better with this scenario as it swaps from the back rather than leaving gaps in the elements vector, however it will not free memory if the number of elements expands then contracts. It will also suffer in performance if elements within the container are heavily referred to by external objects/elements in performance-critical situations, or if the elements are large and/or swap/copy is non-trivial in other ways.
Colony is an attempt to bring a more generic solution to this situation. It has the advantage of good iteration speed, a similar erasure speed to the boolean technique described above, and a singular insertion speed which is much faster than a vector's, similar to a good deque implementation's. It never causes pointer invalidation to non-erased elements during erasure or insertion and the memory locations of erased elements are either reused by subsequent insertions or released on-the-fly when the encapsulating memory block becomes empty of elements.
This is a pure library addition, no changes are necessary to the standard
asides from the introduction of the colony container.
The reference implementation of colony is available here as plf::colony: http://www.plflib.org/colony.htm
The key technical features of a colony are as follows:
The full list of abstract requirements to support these features are as follows:
To summarise and simplify we can say there are three necessary aspects to colony to make it function as it does, and which define any implementation:
In the case of the reference implementation I utilized a chained-group allocation pattern (http://www.plflib.org/chained_group_allocation_pattern.htm) for the memory blocks; which is a doubly-linked intrusive list of nodes containing (a) memory blocks, (b) memory block metadata and (c) skipfields. The metadata in question includes information necessary for an iterator to iterate over colony elements, such as the last insertion point within the memory block, and other information useful to specific functions such as the total number of active elements in the node. This 'linked-list'-style pattern removes the possibility of non-O(1) operations when freeing empty memory blocks from the colony structure; as compared to a vector of pointers to memory blocks. A vector of pointers to memory blocks may however enable faster insertions while increasing implementation complexity. Comparitive benchmarks would be necessary to establish the overall optimal approach.
For the skipfield a boolean skipfield cannot be used:
Instead the reference implementation utilizes the jump-counting skipfield pattern (full reference paper available here: http://www.plflib.org/the_jump_counting_skipfield_pattern.pdf), a numeric pattern I developed which allows for O(1) time complexity iterator operations and performs better during iteration due to a lack of branching code. It accomplishes this by storing and modifying (during insertion and erasure) numbers corresponding to the number of elements in a run of erased elements, and simply adding them to the current iterator position during iteration instead of checking their state. This avoids the looping branching code necessary for iteration with, for example, a boolean skipfield.
For the erased location re-use mechanism, the reference implementation uses a stripped-down custom internal stack class based on plf::stack (http://www.plflib.org/stack.htm - outperforms all other std:: containers in a stack context and across compilers). plf::stack uses the same chained-group memory allocation pattern as plf::colony ie. it is made up of a linked chain of 'groups', structs containing a memory block and metadata, with a growth factor of 2 for the memory blocks. When capacity of the current memory block is reached, a new group is created and linked to the current memory block.
An alternative route of using a "free list" (explanation: http://bitsquid.blogspot.ca/2011/09/managing-decoupling-part-4-id-lookup.html) of erased elements for the re-use mechanism has been explored and the following issues identified:
Colony meets the requirements of the C++ Container, AllocatorAwareContainer, and ReversibleContainer concepts.
For the most part the syntax and semantics of colony functions are very similar to all std:: c++ libraries. Formal description is as follows:
template <class T, class Allocator = std::allocator<T>, typename
Skipfield_Type = unsigned short> class colony
T
- the element type. In general T must meet the
requirements of Erasable, CopyAssignable
and CopyConstructible.
However, if emplace is utilized to insert elements into the colony, and no
functions which involve copying or moving are utilized, T is only required to
meet the requirements of Erasable. If
move-insert is utilized instead of emplace, T must also meet the requirements
of MoveConstructible
.
Allocator
- an allocator that is used to acquire memory to
store the elements. The type must meet the requirements of Allocator. The
behavior is undefined if Allocator::value_type
is not the same as
T.
Skipfield_Type
- an unsigned integer type. This type is
used to create the skipfield and the maximum size of element memory blocks is
constrained by it's bit-depth due to the nature of a jump-counting skipfield.
For example, unsigned short
on most platforms is 16-bit and
therefore constrains the size of individual memory blocks to a maximum of 65535
elements. unsigned short
has been found to be the optimal type for
performance based on benchmarking. However there may be some memory-constrained
situations where element block allocations of more than 255 elements at a time
would not be desirable. In these situations, unsigned char
may be
used for the skipfield instead, resulting in some additional memory usage
saving for the skipfield itself. It is unlikely for there to be any
circumstances which benefit from a skipfield bit-depth greater than
unsigned short
. If Skipfield_Type
is not an unsigned
integer type, behaviour is undefined.
#include <iostream>
#include "plf_colony.h"
int main(int argc, char **argv)
{
plf::colony<int> i_colony;
// Insert 100 ints:
for (int i = 0; i != 100; ++i)
{
i_colony.insert(i);
}
// Erase half of them:
for (plf::colony<int>::iterator it = i_colony.begin(); it != i_colony.end(); ++it)
{
it = i_colony.erase(it);
}
// Total the remaining ints:
int total = 0;
for (plf::colony<int>::iterator it = i_colony.begin(); it != i_colony.end(); ++it)
{
total += *it;
}
std::cout << "Total: " << total << std::endl;
std::cin.get();
return 0;
}
#include <iostream>
#include "plf_colony.h"
int main(int argc, char **argv)
{
plf::colony<int> i_colony;
plf::colony<int>::iterator it;
plf::colony<int *> p_colony;
plf::colony<int *>::iterator p_it;
// Insert 100 ints to i_colony and pointers to those ints to p_colony:
for (int i = 0; i != 100; ++i)
{
it = i_colony.insert(i);
p_colony.insert(&(*it));
}
// Erase half of the ints:
for (it = i_colony.begin(); it != i_colony.end(); ++it)
{
it = i_colony.erase(it);
}
// Erase half of the int pointers:
for (p_it = p_colony.begin(); p_it != p_colony.end(); ++p_it)
{
p_it = p_colony.erase(p_it);
}
// Total the remaining ints via the pointer colony (pointers will still be valid even after insertions and erasures):
int total = 0;
for (p_it = p_colony.begin(); p_it != p_colony.end(); ++p_it)
{
total += *(*p_it);
}
std::cout << "Total: " << total << std::endl;
if (total == 2500)
{
std::cout << "Pointers still valid!" << std::endl;
}
std::cin.get();
return 0;
}
| All read-only operations, swap, std::swap | Never |
| clear, reinitialize, operator = | Always |
| reserve, shrink_to_fit | Only if capacity is changed |
| change_group_sizes, change_minimum_group_size, change_maximum_group_size | Only if supplied minimum group size is larger than smallest group in colony, or supplied maximum group size is smaller than largest group in colony. |
| erase | Only for the erased element |
| insert, emplace | If an iterator is == end() it may be invalidated by a subsequent insert/emplace in some cases. Otherwise no. |
| Member type | Definition |
value_type |
T |
allocator_type |
Allocator |
size_type |
Allocator::size_type (pre-c++11) |
difference_type |
Allocator::difference_type (pre-c++11) |
reference |
Allocator::reference (pre-c++11) |
const_reference |
Allocator::const_reference (pre-c++11) |
pointer |
Allocator::pointer (pre-c++11) |
const_pointer |
Allocator::const_pointer (pre-c++11) |
iterator |
BidirectionalIterator |
const_iterator |
Constant BidirectionalIterator |
reverse_iterator |
BidirectionalIterator |
const_reverse_iterator |
Constant BidirectionalIterator |
Iterators for a colony cannot be random access because any +, -, += and -= operators would be non-O(1), due to the need to iterate over a skipfield. However member overloads for the standard library functions advance(), next(), prev() and distance() are available in the reference implementation. These are significantly faster than O(n) in most cases.
| default | explicit colony(const allocator_type &alloc =
allocator_type()) |
| fill | explicit colony(const size_type n, const unsigned short
min_group_size = 8, const unsigned short max_group_size =
std::numeric_limits<Skipfield_type>::max(), const allocator_type
&alloc = allocator_type()) |
| range | template<typename InputIterator> colony(const
InputIterator &first, const InputIterator &last, const unsigned
short min_group_size = 8, const unsigned short max_group_size =
std::numeric_limits<Skipfield_type>::max(), const allocator_type
&alloc = allocator_type()) |
| copy | colony(const colony &source) |
| move | colony(colony &&source) noexcept (C++11
and upwards) |
| initializer list | colony(const std::initializer_list<value_type>
&element_list, const unsigned short min_group_size = 8, const
unsigned short max_group_size =
std::numeric_limits<Skipfield_type>::max(), const allocator_type
&alloc = allocator_type()) |
| single element | iterator insert (const value_type &val) |
| fill | iterator insert (const size_type n, const value_type
&val) |
| range | template <class InputIterator> iterator insert (const
InputIterator &first, const InputIterator &last) |
| move | iterator insert (value_type&& val) (C++11 and upwards) |
| initializer list | iterator insert (const std::initializer_list<value_type>
&il) |
iterator insert(const value_type &element)
Inserts the element supplied to the colony, using the object's copy-constructor. Will insert the element into a previously erased element slot if one exists, otherwise will insert to back of colony. Returns iterator to location of inserted element. Example:
plf::colony<unsigned int> i_colony;
i_colony.insert(23);
iterator insert (const size_type n, const value_type
&val)
Inserts n
copies of val
into the colony. Will
insert the element into a previously erased element slot if one exists,
otherwise will insert to back of colony. Returns iterator to location of
first inserted element. Example:
plf::colony<unsigned int> i_colony;
i_colony.insert(10, 3);
template <class InputIterator> iterator insert (const
InputIterator &first, const InputIterator &last)
Inserts a series of value_type
elements from an external
source into a colony holding the same value_type
(eg. int,
float, a particular class, etcetera). Stops inserting once it reaches
last
. Example:
// Insert all contents of colony2 into
colony1:
colony1.insert(colony2.begin(), colony2.end());
iterator insert(value_type &&element) C++11 and
upwards
Moves the element supplied to the colony, using the object's move-constructor. Will insert the element in a previously erased element slot if one exists, otherwise will insert to back of colony. Returns iterator to location of inserted element. Example:
std::string string1 = "Some text";
plf::colony<std::string> data_colony;
data_colony.insert(std::move(string1));
iterator insert (const std::initializer_list<value_type>
&il)
Moves the element supplied to the colony, using the object's move-constructor. Will insert the element in a previously erased element slot if one exists, otherwise will insert to back of colony. Returns iterator to location of inserted element. Example:
std::initializer_list<int> some_ints =
{4, 3, 2, 5};
plf::colony<int> i_colony;
i_colony.insert(some_ints);
| single element | iterator erase(const iterator &it) |
| range | void erase(const iterator &first, const iterator
&last) |
iterator erase(const iterator &it)
Removes the element pointed to by the supplied iterator, from the colony. Returns an iterator pointing to the next non-erased element in the colony (or to end() if no more elements are available). This must return an iterator because if a colony group becomes entirely empty, it will be removed from the colony, invalidating the existing iterator. Attempting to erase a previously-erased element results in undefined behaviour (this is checked for via an assert in debug mode). Example:
plf::colony<unsigned int>
data_colony(50);
plf::colony<unsigned int>::iterator an_iterator;
an_iterator = data_colony.insert(23);
an_iterator = data_colony.erase(an_iterator);
void erase(const iterator &first, const iterator
&last)
Erases all contents of a given colony from first
to the
element before the last
iterator. Example:
plf::colony<int> iterator1 =
colony1.begin();
colony1.advance(iterator1, 10);
plf::colony<int> iterator2 = colony1.begin();
colony1.advance(iterator2, 20);
colony1.erase(iterator1, iterator2);
iterator emplace(Arguments ...parameters) C++11 and
upwards
Constructs new element directly within colony. Will insert the element in a previously erased element slot if one exists, otherwise will insert to back of colony. Returns iterator to location of inserted element. "...parameters" are whatever parameters are required by the object's constructor. Example:
class simple_class
{
private:
int number;
public:
simple_class(int a_number): number (a_number) {};
};
plf::colony<simple_class> simple_classes;
simple_classes.emplace(45);
bool empty()
Returns a boolean indicating whether the colony is currently empty of
elements.
Example: if (object_colony.empty())
return;
size_type size()
Returns total number of elements currently stored in container.
Example: std::cout << i_colony.size()
<< std::endl;
size_type max_size()
Returns the maximum number of elements that the allocator can store in
the container. This is an approximation as it does attempt to measure the
memory overhead of the container's internal memory structures. It is not
possible to measure the latter because a copy operation may change the
number of groups utilized for the same amount of elements, if the maximum
or minimum group sizes are different in the source container.
Example: std::cout << i_colony.max_size()
<< std::endl;
size_type capacity()
Returns total number of elements currently able to be stored in
container without expansion.
Example: std::cout << i_colony.capacity()
<< std::endl;
void shrink_to_fit()
Reduces container capacity to the amount necessary to store all
currently stored elements. If the total number of elements is larger than
the maximum group size, the resultant capacity will be equal to
((total_elements / max_group_size) + 1) * max_group_size
(rounding down at division). Invalidates all pointers, iterators and
references to elements within the container.
Example: i_colony.shrink_to_fit();
void reserve(unsigned short reserve_amount)
Preallocates memory space sufficient to store the number of elements
indicated by reserve_amount
. The maximum size for this number
is limited to the maximum group size of the colony and will be truncated if
necessary. The default maximum group size is 65535 on the majority of
platforms.
Example: i_colony.reserve(15);
void clear()
Empties the colony and removes all elements and groups.
Example: object_colony.clear();
void change_group_sizes(const unsigned short min_group_size, const
unsigned short max_group_size)
Changes the minimum and maximum internal group sizes, in terms of number
of elements stored per group. If the colony is not empty and either
min_group_size is larger than the smallest group in the colony, or
max_group_size is smaller than the largest group in the colony, the colony
will be internally copy-constructed into a new colony which uses the new
group sizes, invalidating all pointers/iterators/references.
Example: object_colony.change_group_sizes(1000,
10000);
void change_minimum_group_size(const unsigned short
min_group_size)
Changes the minimum internal group size only, in terms of minimum number
of elements stored per group. If the colony is not empty and min_group_size
is larger than the smallest group in the colony, the colony will be
internally copy-constructed into a new colony which uses the new minimum
group size, invalidating all pointers/iterators/references.
Example: object_colony.change_minimum_group_size(100);
void change_maximum_group_size(const unsigned short
min_group_size)
Changes the maximum internal group size only, in terms of maximum number
of elements stored per group. If the colony is not empty and either
max_group_size is smaller than the largest group in the colony, the colony
will be internally copy-constructed into a new colony which uses the new
maximum group size, invalidating all pointers/iterators/references.
Example: object_colony.change_maximum_group_size(1000);
void reinitialize(const unsigned short min_group_size, const
unsigned short max_group_size)
Semantics of function are the same as "clear();
change_group_sizes(min_group_size, max_group_size);", but without the
copy-construction code of the change_group_sizes() function - this means it
can be used with element types which are non-copy-constructible, unlike
change_group_sizes().
Example: object_colony.reinitialize(1000,
10000);
void swap(colony &source)
Swaps the colony's contents with that of source
.
Example: object_colony.swap(other_colony);
friend void swap(colony &A, source &B)
External friend function, swaps the colony A's contents with that of
colony B (assumes both stacks have same element type).
Example: swap(object_colony,
other_colony);
colony & operator = (const colony &source)
Copy the elements from another colony to this colony, clearing this
colony of existing elements first.
Example: // Manually swap data_colony1 and
data_colony2 in C++03
data_colony3 = data_colony1;
data_colony1 = data_colony2;
data_colony2 = data_colony3;
colony & operator = (const colony &&source) C++11
only
Move the elements from another colony to this colony, clearing this
colony of existing elements first. Source colony becomes invalid but can be
safely destructed without undefined behaviour.
Example: // Manually swap data_colony1 and
data_colony2 in C++11
data_colony3 = std::move(data_colony1);
data_colony1 = std::move(data_colony2);
data_colony2 = std::move(data_colony3);
bool operator == (const colony &source)
Compare contents of another colony to this colony. Returns a boolean as
to whether they are equal.
Example: if (object_colony == object_colony2)
return;
bool operator != (const colony &source)
Compare contents of another colony to this colony. Returns a boolean as
to whether they are not equal.
Example: if (object_colony != object_colony2)
return;
iterator begin(), iterator end(), const_iterator cbegin(),
const_iterator cend()
Return iterators pointing to, respectively, the first element of the colony and the element one-past the end of the colony (as per standard STL guidelines).
reverse_iterator rbegin(), reverse_iterator rend(),
const_reverse_iterator cbegin(), const_reverse_iterator cend()
Return reverse iterators pointing to, respectively, the last element of the colony and the element one-before the first element of the colony (as per standard STL guidelines).
iterator get_iterator_from_pointer(const element_pointer_type
the_pointer) (slow)
Getting a pointer from an iterator is simple - simply dereference it
then grab the address ie. "&(*the_iterator);"
. Getting an
iterator from a pointer is typically not so simple. This function enables
the user to do exactly that. This is expected to be useful in the use-case
where external containers are storing pointers to colony elements instead
of iterators (as iterators have 3 times the size of an element pointer) and
the program wants to erase the element being pointed to or possibly change
the element being pointed to. Converting a pointer to an iterator using
this method and then erasing, is about 20% slower on average than erasing
when you already have the iterator. This is less dramatic than it sounds,
as it is still faster than all std:: container erasure times except
std::list, which it is roughly equal to. However this is generally a
slower, lookup-based operation. If the lookup doesn't find a non-erased
element based on that pointer, it returns end()
. Otherwise it
returns an iterator pointing to the element in question. Example:
plf::colony<a_struct> data_colony;
plf::colony<a_struct>::iterator an_iterator;
a_struct struct_instance;
an_iterator = data_colony.insert(struct_instance);
a_struct *struct_pointer = &(*an_iterator);
iterator another_iterator =
data_colony.get_iterator_from_pointer(struct_pointer);
if (an_iterator == another_iterator) std::cout << "Iterator is
correct" << std::endl;
size_type get_index_from_iterator(const iterator/const_iterator
&the_iterator) (slow)
While colony is a container with unordered insertion (and is therefore unordered), it still has a (transitory) order which changes frequently upon erasure and insertion. Temporary index numbers are therefore obtainable. These can be useful, for example, when creating a save file in a computer game, where certain elements in a container may need to be re-linked to other elements in other container upon reloading the save file. Example:
plf::colony<a_struct> data_colony;
plf::colony<a_struct>::iterator an_iterator;
a_struct struct_instance;
data_colony.insert(struct_instance);
data_colony.insert(struct_instance);
an_iterator = data_colony.insert(struct_instance);
unsigned int index = data_colony.get_index_from_iterator(an_iterator);
if (index == 2) std::cout << "Index is correct" <<
std::endl;
size_type get_index_from_reverse_iterator(const
reverse_iterator/const_reverse_iterator &the_iterator)
(slow)
The same as get_index_from_iterator, but for reverse_iterators and const_reverse_iterators. Index is from front of colony (same as iterator), not back of colony. Example:
plf::colony<a_struct> data_colony;
plf::colony<a_struct>::reverse_iterator r_iterator;
a_struct struct_instance;
data_colony.insert(struct_instance);
data_colony.insert(struct_instance);
r_iterator = data_colony.rend();
unsigned int index =
data_colony.get_index_from_reverse_iterator(r_iterator);
if (index == 1) std::cout << "Index is correct" <<
std::endl;
iterator get_iterator_from_index(const size_type index)
(slow)
As described above, there may be situations where obtaining iterators to
specific elements based on an index can be useful, for example, when
reloading save files. This function is basically a shorthand to avoid
typing "iterator it = colony.begin(); colony.advance(it,
50);"
. Example:
plf::colony<a_struct> data_colony;
plf::colony<a_struct>::iterator an_iterator;
a_struct struct_instance;
data_colony.insert(struct_instance);
data_colony.insert(struct_instance);
iterator an_iterator = data_colony.insert(struct_instance);
iterator another_iterator = data_colony.get_iterator_from_index(2);
if (an_iterator == another_iterator) std::cout << "Iterator is
correct" << std::endl;
template <iterator_type> void advance(iterator_type iterator,
distance_type distance)
Increments/decrements the iterator supplied by the positive or negative
amount indicated by distance. Speed of incrementation will almost
always be faster than using the ++ operator on the iterator for increments
greater than 1. In some cases it may approximate O(1). The iterator_type
can be an iterator, const_iterator, reverse_iterator or
const_reverse_iterator.
Example: colony<int>::iterator it =
i_colony.begin();
i_colony.advance(it, 20);
template <iterator_type> iterator_type next(const
iterator_type &iterator, distance_type distance)
Creates a copy of the iterator supplied, then increments/decrements this
iterator by the positive or negative amount indicated by
distance.
Example: colony<int>::iterator it =
i_colony.next(i_colony.begin(), 20);
template <iterator_type> iterator_type prev(const
iterator_type &iterator, distance_type distance)
Creates a copy of the iterator supplied, then decrements/increments this
iterator by the positive or negative amount indicated by
distance.
Example: colony<int>::iterator it2 =
i_colony.prev(i_colony.end(), 20);
template <iterator_type> difference_type distance(const
iterator_type &first, const iterator_type &last)
Measures the distance between two iterators, returning the result, which
will be negative if the second iterator supplied is before the first
iterator supplied in terms of it's location in the colony.
Example: colony<int>::iterator it =
i_colony.next(i_colony.begin(), 20);
colony<int>::iterator it2 = i_colony.prev(i_colony.end(), 20);
std::cout "Distance: " i_colony.distance(it, it2) std::endl;
The full implementation details for the main three aspects of the reference
implementation are too large to be included in this document, but are available
externally below:
Details on the chained-group allocation pattern are here: http://www.plflib.org/chained_group_allocation_pattern.htm.
The 8900-word paper on the jump-counting skipfield pattern is available here:
http://www.plflib.org/the_jump_counting_skipfield_pattern.pdf,
and benchmarks versus boolean skipfields are presented here: http://www.plflib.org/skipfield_comparison.htm.
Lastly, plf::stack (on which the reference implementation's internal reduced
stack implementation is based) is explained in detail here: http://www.plflib.org/stack.htm.
Further details on colony's reference implementation can be found here: http://www.plflib.org/colony.htm,
including a FAQ.
The reference implementation of colony is available to download here: http://www.plflib.org/colony.htm#download
or via the github repository: https://github.com/mattreecebentley/plf_colony.
Thanks to Glen Fernandes and Ion Gaztanaga for restructuring advice, Robert Ramey for documentation advice, various Boost and SG14 members for support, suggestions and bug reports including Sean Middleditch, Patrice Roy and Guy Davidson.  Lastly, thanks to Jon Blow for initial advice and Mike Acton for some positive influence.
As the benchmarks currently need to be updated prior to Issaquah to
reflect the performance updates to the reference implementation over the
past six months, only links can be provided at this stage:
Benchmarks for GCC can be found here: http://www.plflib.org/colony.htm#benchmarks,
while benchmarks for MSVC can be found here: http://www.plflib.org/colony_benchmark_msvc_results.htm
An explanatory talk about Colony and the various approaches
involved was given at Cppcon 2016 in Bellevue, Seattle:
Note that the benchmarks presented in this lecture do not reflect current colony performance, which has improved considerably since.
The slides for the talk are available here.


Gerald's Big, Bad, and Ugly Hotlist
Current |
HTML docs |
HTML style |
Web docs |
Web scripts |
Searching |
Jobs |
Perl |
Literature |
Information |
Documentation |
Gateways |
Cool sites |
Travel |
Ideas/images to steal |
Site lists |
Commercial |
HURL-related |
Other |
Misc.
More than half of this tome is in the "Unclassified" section now... ugh. One day
I'll get around to reorganizing it; in the meantime I find stuff
I want using the search form...
World Wide Web stuff:
Search Engines:
Jobs:
Perl:
Online literature:
Online information / statistics:
Online documentation:
Gateways:
Cool sites:
Travel information:
Ideas/images to steal:
Good site lists:
Commercial sites (and other organizations):
HURL-Related Things:
- Similar projects, software I can use, interface ideas, etc.:
- News archives:
Sites whose existence on the net surprises me,
if that makes any sense:
Things that are probably only of interest to me:
Miscellaneous:
Unclassified:
- Computer Graphics
- Flash Information (latest issue)
- Ta poll mor im'cheann
- Mosaic Rulesz
- Internet Direct Usage Info
- Brian Pollacks Home Page
- Prepare yourself
- Four11 Directory Services (SLED)
- An Index to Stuff at the GALCIT WebHome
- Fuz's Home Page
- Michael Toy's Web Page
- The World Wide Web Unleashed Support Web
- Great Moments in Advertizing: Symantec
- E-Resume
- Rocket Science Home Page
- Geodetic Survey of Canada - World Wide
- MHonArc Home Page
- Monster Board!
- Bradford Robotic Telescope Operations Menu
- _Other U.S. Government Gopher Servers
- Farside directory (alphabetically)
- News Page
- You have found us
- Remote file ftp.switch.ch/news-archive/sources/unix/volume28/krusty-0.79
- Remote file ftp.switch.ch/
- Netsurfer Digest Home Page
- Legal Care for Your Software Home Page
- talk.bizarre message<EMAIL_ADDRESS>- CGI Script output
- Browser Statistics for the Random Yahoo Link
- Web66 Statistical Ramble
- Slipknot -- INFO
- Untitled, URL http://www.artnet.org/iamfree
- Course Catalog - Computer Science (C S)
- GNN Best of the Net Honorees
- Untitled, URL http://www.primus.com/staff/paulp/one-book.txt
- Scott Pakin's automatic complaint-letter generator
- Physical
- TNS Technology Demonstrations
- The Web Experts
- The STC Bunch
- Departmental Affairs>
- Untitled, URL http://turnbull.sk.tsukuba.ac.jp/saraki-list.html
- Info-Mac Mirror Sites
- BookLink Technologies Home Page
- Untitled, URL http://www.hip.com/franklin/online-dir/internet/mail/mailing-list.html
- Steve Franklin - The Newbie's Guide to the Net
- WAIS databases served by SunSITE.unc.edu
- Authorization Required
- hype! Toronto - Media, Arts, Entertainment & Useful Information
- MindSource Opportunities
- CUSI
- MOTORCYCLE ONLINE
- The Bible of Usenet Home
- A pointer page about Z39.50 Resources
- Untitled, URL http://www.dra.com/
- Index of /packages/dbperl
- Index of /usenet/
- The Bible of Usenet 2nd Home Page Future
- The Bible of Usenet 2nd Home
- ungeek
- ungeek
- WAIS, Inc. - Forbes Article
- Index of /wais-dbs/
- WAIS Network Publishing using Z3950
- Introduction -- Style
- OneWorld/SingNet WWW & HTML Developer's JumpStation - ver 2.0 (21 Oct 1994)
- The HPA Price Guide
- FESTIVALSKE NAGRADE / FESTIVAL AWARDS
- The Oxford English Dictionary
- What is SGML (Burnard)
- Untitled, URL http://www.cimtegration.com/ent/music/hip/hip.htm
- Perl Program for Retrieving Web Documents
- Text to HTML converter
- HTML Converters
- Untitled, URL http://www11.w3.org/hypertext/WWW/MarkUp/html3-dtd.txt
- Index of /hypertext/WWW/Archive/www-html
- Keirsey Temperament Sorter- Meyers-Briggs Personality
- Jobs
- The Web Academy
- Z39.50: Table of Contents
- URI Mail Archives
- Danny Yee's USENET Information Page
- HipLinc - the archive
- MHonArc Home Page
- wuftpd mail list archive
- List of NNTP Servers
- Untitled, URL http://www10.w3.org/hypertext/WWW/MarkUp/Elements/LINK.html
- Untitled, URL http://www.blarg.com/webweavers
- The Clearinghouse for Subject-Oriented Internet Resource Guides
- Shakespeare Homepage
- PCL Map Collection
- News Rack
- Sanjay's Internet Resources/Sites
- HTML Documentation Table of Contents
- The Web Experts
- National Atlas Information Service
- NAISMap Home Page
- Maps
- Map-Related Web Sites
- ClariNet Home
- Welcome to WordPerfect
- The Consummate Winsock Apps List
- Compact Disc Music Clubs (BMG & Columbia House)
- htmltoc Home Page
- Where in the World is Talk.Bizarre?!
- Virtual Reality Modeling Language (VRML) Forum
- Remote file mail.boku.ac.at/www/news/read.me
- Open Government - Gouvernement Ouvert
- SGML and Information Retrieval on the Internet
- htmlchek HTML syntax and cross-reference checker version 4.0, January 17 1995
- Perl Meta-FAQ
- URI Mail Archives
- BABEL: A Glossary of Computer Related Abbreviations and Acronyms
- The Netizens and the Wonderful World of the Net Book and other References
- Welcome to the Sports Illustrated Swimsuit Issue
- BCARS HOME PAGE
- Usenet Group Archives
- System P Table of Contents
- The World Wide Web- tools for aspiring web weavers
- HTML DTD Reference
- Remote file ftp.nl.net/pub/comp/programming/languages/perl
- SIMBA Media Daily: INTERNET
- The WWW Virtual Keyboard
- The InfoPad WWW Server Statistics Plots Page
- The Tragically Hip - Merchandise
- Cyber-Sex-Toys
- Remote file ciac.llnl.gov/pub/ciac/ciacdocs/ciac2308.txt
- UNIXhelp for users
- rfc1738
- Untitled, URL http://www.penthousemag.com/
- The World Wide Weed
- Freeway Speeds
- Style Tips
- Home Pages
- Untitled, URL http://www.media.mit.edu/people/rnewman/Good_Netkeeping_Seal
- Remote file ftp.primus.com/pub/sun386/mailing-list-archives
- USENET Cabal
- A CGI Programmer's Reference
- Virtual Reality Modeling Language (VRML) Forum
- Carlos' Coloring Book Home
- The Scott List
- Remote file ftp.sterling.com/rkive/
- See if we give a shit
- Leonardo da Vinci
- Yale C/AIM WWW Style Manual
- Christine Quinn's quotes
- Guides to Writing HTML Documents
- Cyberview 3D Document Generator
- The WebOOGL Home Page
- JCPenney Home Page
- UofA WWW User Group
- Virtual Frog Dissection Kit Info Page
- talk.bizarre message<EMAIL_ADDRESS>- Sun Glossary
- Wetware Web Gang
- Sound Bytes: WWW Sound Theme Home Page : By Patrick G. Kenny
- The Hermes Project
- Stupid Netscape Tricks
- What's New from comp.info.systems.www.announce
- InfoSeek Query
- The Creative Internet: Script Demos
- Untitled, URL http://ume.med.ucalgary.ca/~watanabe/
- Remote file ftp.best.com/pub/craig/games
- Untitled, URL http://meer.net/~mtoy/baby.html
- Resources for WWW Page Publishing
- talk.bizarre message<EMAIL_ADDRESS>- The Webhound WWW Interface
- The MIT Home Page
- Automatic News HREFs
- SIPB Documents
- Untitled, URL http://www.netgen.com/cgi/comprehensive
- W3 Search Engines
- Index of Perl/HTML archives
- Welcome to the CityInteractive Homepage
- talk.bizarre message<EMAIL_ADDRESS>- Interesting WWW Links
- SGML Open Home Page
- FEDEX HOME PAGE
- SGML Goodies on the Web
- SGML Open Home Page
- Rec.Juggling Archive, by Date
- Internet Domain Survey
- Art on the Net
- Remote file ftp.w3.org/mnt/afs/w3.org/ftp/pub/www/arena
- ECHO - EURODICAUTOM
- Remote file ftp.best.com/pub/craig/winsock_apps/00index.txt
- Netscape Animation Contest
- FinanceNet WWW Home Page
- Remote file journal.biology.carleton.ca/pub/ht_lit/list-archive
- ht_lit
- Hyperlatex Manual
- Kool-Aid FAQ List
- The Saturn Site
- Untitled, URL http://indigo.eosc.osshe.edu/physics/Sci_Physics_FAQ/Sci_Physics_FAQ_4.text
- W.E.D.J.E.E. equipment list
- The Jihad To Destroy Barney on the Worldwide Web 2.0
- love rage fire oceans suspenders and a bra
- Welcome to the World of Classical Music
- PhoNETic
- ABELL: Home Page
- Results - Jeffrey's J/E Dictionary
- The HTML Authoring Mailing List
- Welcome to Northumberland County
- Keyword index for Comp.Sys.Amiga.Reviews
- Keyword index for Comp.Sys.Amiga.Reviews
- Search 5 Days Usenet News
- HTML 3.0 Test Pages
- IETF - HyperText Markup Language (HTML) Working Group
- The Enhanced for Netscape Hall of Shame
- Web Development Tools
- Netscape Client APIs (NCAPIs)
- Demonstrations of New Netscape 1.1 Features
- Froggy Page
- Remote file ftp.canberra.edu.au/pub/motif/comp.windows.x.motif
- IETF - HyperText Markup Language (HTML) Working Group
- Proposed alt.current-events.net-abuse FAQ
- HOTT.BOB
- Untitled, URL http://indigo.eosc.osshe.edu/physics/Sci_Physics_FAQ/Sci_Physics_FAQ_4.text
- W.E.D.J.E.E. equipment list
- The Jihad To Destroy Barney on the Worldwide Web 2.0
- love rage fire oceans suspenders and a bra
- Welcome to the World of Classical Music
- WebCrawler Searching
- PhoNETic
- ABELL: Home Page
- Results - Jeffrey's J/E Dictionary
- The HTML Authoring Mailing List
- Why Are There So Few Female Computer Scientists
- Subway system of Edmonton (Canada)
- Ergonomics
- RLIN Z39.50 Test Server
- City.Net Browser Checkup
- Script Demo: WWW Poll Version 1.0
- 1000 by 2000
- WWW NewsLink - (c) 1995 by NewsLink Associates
- Form to Figure out a Domain Name
- Remote file ftp.isi.edu/in-notes/iana/assignments
- Pantless Productions Web Services...center of the known Universe
- Cocaine Anonymous Home Page
- Taos Mountain Software
- talk.bizarre message<EMAIL_ADDRESS>- WWW Authoring Information
- html-wg-95q1: Re: Pythia: Really bad ideas
- HTML Validation Service
- WebTechs and HTML
- HTML: Table Deployment Strategy
- Table of Contents: Plexus HTTP
- IETF - HyperText Markup Language (HTML) Working Group
- IETF Home Page
- IETF - Hypertext Transfer Protocol (HTTP) Working Group
- Penises of the Animal Kingdom
- Ragú Presents -- Mama's Cucina
- Technology Review Home Page
- Remote file umcc.umich.edu/pub/users/seraphim/doc/nethist8.txt
- News Index Gateway at MIT LCS
- Fourth International World Wide Web Conference
- Multithreaded query page
- The Noam Chomsky Archive
- RISKS-LIST: RISKS-FORUM Digest
- A malt whisky tour
- A malt whisky tour
- Public Windows Interface
- Tables
- WebRunner Home Page
- Remote file bond.edu.au/pub/Minerva/msql
- Home Page of www-cal
- Department of Biology - WWW Calendar
- GNA Course: Introduction to Object Oriented Programming Using C++
- Untitled, URL http://www.hpl.hp.co.uk/people/dsr/html/html3.dtd
- Stoli Cipher
- Remote file ftp.zoo.toronto.edu/pub/news.txt.Z
- HEROES Homepage
- Introducing CXX2HTML
- Idea Futures
- Untitled, URL http://bongo.cc.utexas.edu/~neuroses/cwsa.html
- Forte Agent Home Page
- mailing list archive request form
- LIBIDO
- Welcome to UMI!!
- SUL Z3950 search for ERIC Page
- HTML: Hypertext Mark-up Language
- Remote file src.doc.ic.ac.uk/usenet
- Beta Test Registration
- Welcome to WebLib!
- Chinook
- Use of Netscape tags in HTML
- NCSA Mosaic X Resources
- All elements in HTML 2.0 DTD
- HyperText Mark-up Language Quick Reference, December 1994
- Perl Resources
- Books On-line, Listed by Author
- The Comic Strip
- What the World Wants ...and how to pay for it...
- NECTEC USENET Archives
- HENSA Unix Parallel Archive: /parallel/internet/usenet/
- HTML Developer's Info
- Jihad Codes[tm] v1.0.3
- Welcome to PBS
- Raves R Us
- Ambient Music mailing list archives (text)
- Movie Review Query Engine
- SWISH Documentation
- Remote file ftp.mantis.co.uk/pub/doom/rec-articles/art-418
- talk.bizarre message<EMAIL_ADDRESS>- The Great Renaming FAQ
- Untitled, URL http://www.access.digex.net/~werbach/barebone.txt
- UseNet Group Mentors
- English-to-Spanish Dictionary
- Untitled, URL http://www.primus.com/staff/paulp/one-book.txt
- THE LOVEGRID!
- Guides to Writing HTML Documents
- NCSA httpd Release 1.4 BETA2 Source and Binaries
- Gopher server at gopher.enews.com
- TicketMaster Home Page
- NCSA httpd Overview
- The World Wide Web Dating Game
- Congratulations: You found the Important Stuff!
- XBoing Home Page
- INFACT's Tobacco Industry Campaign
- ITRE Home Page
- Beta Test Bug Reports & Updates
- San Jose Sharks Media Guide
- Complete List of Dog-Related Email Lists
- The Harvest httpd accelerator
- talk.bizarre message<EMAIL_ADDRESS>- The Culture of the Internet and Usenet
- All About Bob!
- Untitled, URL http://www.seas.upenn.edu/~mengwong/humour/macsvsunix.html
- Yes !
- The OCLC Fred Home Page
- OneWorld/SingNet WWW & HTML Developer's JumpStation - ver 2.0 (21 Oct 1994)
- The World Wide Web- tools for aspiring web weavers
- The Web Developer's Virtual Library
- Images of the Internet
- Numeric Character References in HTML
- The HTML Writers Guild Homepage
- GNN's: Measuring the Net
- Mox.Perl.COM Home Page
- Perl Resources
- Far More That Everything You've Always Wanted to Know About Sorting
- Index to the HTML 2.0 Specification
- HyperText Markup Language (HTML)
- alt.folklore.computers FAQ
- NAFTAnet Home Page
- Guide to the 1996 Olympic Games
- VRML*Tech - The Virtual Reality Modeling Language Technical Forum
- Lines - Graphic Element Samples
- Open Text Corporation
- The Open Text Web Index
- W3 Search Engines
- usenet-addresses index
- Interesting WWW Links
- Acronym list
- World Wide Web FAQ
- What's New Too!
- The Great Renaming FAQ
- Gopher server
- Beamish Genuine Irish Stout
- HTML-Bibliography
- CGI Form Handling in Perl
- The ITV i-Way
- The Internet Sleuth
- The Common Gateway Interface
- The Galaxy of Coca-Cola - The Coca-Cola Company
- mw3s: Multi Webserver Statistics Tool (v1.1)
- HTML Reference
- The WWW Bible Gateway
- Reverend Fun
- RFC 1341 Table of Contents
- CGI Tutorial: Start
- Perl tutorial: Start
- Apache HTTP Server Project
- Unified Field Theory of Design
- Girvies Davis' Clemency Home Page
- Remote file src.doc.ic.ac.uk/packages/www/asWedit/
- Toronto Blue Jays
- NCSA httpd tutorials
- Mapedit
- The wadtoiv home page
- DoomGate
- Amsterdam Sex Shop
- BlooperWorld
- Into the Wardrobe: The C. S. Lewis WWW Page
- Web Tools
- Performance of Several HTTP Demons on an HP 735 Workstation
- Country maps from W3 servers
- Pittsburgh Map Database from the Scandal Project
- Spain Internet Resources Map
- Technical Web links
- Chuck Farnham's Weird World
- Submit It!
- Unix WWW Development Resources
- WWW Developer - Documentation
- This week's TIME Magazine
- Farside directory (alphabetically)
- Gifs directory (alphabetically)
- COMP.SYS.IBM.PC.RT: - Hardware - Frequently Asked Questions
- Untitled, URL http://www.eece.ksu.edu/IGR/
- The great GIF Licensing Controversy
- RFC Index Search Form
- The Human-Languages Page
- OneWorld/SingNet WWW & HTML Developer's JumpStation - Page 1
- Virtual Library/CyberWeb: Images_and_Icons
- HTML Documentation Table of Contents
- Extending WebSTAR
- Web 66: Cookbook
- Mapedit
- Graham Toal's Homepage
- How To Create an Alt Newsgroup
- WebSter's Dictionary
- HTML reference sources
- Solaris 2 Frequently Asked Questions
- Remote file perl.com/pub/csh/atrocities/csh.whynot.gz
- Remote file perl.com/pub/Toms_Exrc
- Remote file perl.com/pub/quotes
- WWW Servers Comparison Chart
- Design Center
- UNIX Reference Desk
- Emily Postnews Answers Your Questions on Netiquette
- Inert Net Grave Near Mars
- World Wide Web FAQ
- Introduction to HTML documentation
- Introduction to HTML documentation
- Internet Conference Calendar
- The 216 colors of Netscape
- Nick's Bandwidth Killer on the InfoSchlong!
- The Lycos Home Page: Hunting WWW Information
- Bare Bones Guide to HTML
- ColorEditor for HTML
- Remote file ftp.ncsa.uiuc.edu/Web/httpd/Unix/ncsa_httpd/cgi/
- NetNews Overview Index
- The Legal Domain Network
- CGI.pm - a Perl5 CGI Library
- export-a-crypto-system sig
- Why Validate Your HTML
- The Scout Report
- Harvard Espresso Company Homepage
- Extending WebSTAR
- UN-L R.S.I. Page
- SGML on the Web
- Concordance... it's fast!
- Really Quick Guide to Good HTML
- Test HTML Document
- HTML Reference
- Bare Bones Guide to HTML
- Scandals of the Clinton Administration
- St. Louis SPJ Online Resources for Journalists
- The Crossroads Homepage
- Columbia University: Project Bartleby
- Realm Directory
- HOWTO: Finger Tracing - III
- A CGI Programmer's Reference
- Oh No! The Lemmings Games Web Page
- UNICEF
- The World Bank Home Page
- IFRC Home Page
- World Health Organization WWW Home Page
- Hotlist from Kristin Buxton
- "Saturday Night" Archives
- PhoNETic
- Free-Art
- talk.bizarre message<EMAIL_ADDRESS>- The qform and qscore programs
- Le Monde du Tarantino - TarantinoWorld, You Crazy Kids!
- (Bob Allison's Home Page) Tips For Web Spinners
- Untitled, URL http://knight3.cit.ics.saitama-u.ac.jp/faq/inline-image.faq
- HTML Writers Guild message "Inline Image FAQ (was Backgrounds lose bit depth?)" by Gene Gotimer at PortInfo
- Growth
- 3Wiz - World Wide Web Consultancy
- Transparent Background Images
- Jon's WWW Development Page
- Transparent/Interlaced GIF Resources
- Mailing List WWW Gateway
- ANVIL GRAPHICS SPECIAL HOTT.BOB SHIRTS
- HTML Reference Manual
- Weblint Home Page
- Weblint
- The Bitch and Moan Page
- CRAYON
- Interesting Sites
- Welcome to Netscape
- Picons Archive
- KRAPI Electronics Ltd.
- David Elliott's Land of the Squishy
- Link Finder
- Level 0 HTML Tag Summary
- WebAnts Home Page
- SGML Open Home Page
- HTML 3.0 Test Pages
- HTML 3.0 and Netscape 1.1N
- Manufacturer Directory
- Teach Yourself Web Publishing with HTML in a Week: Chapter Three
- The Bandwidth Conservation Society
- pgperl Home Page
- Abigail's WWW dream
- Spacing in HTML
- HTML 3.0 Scratchpad
- Wanderer - Web Writing
- Making Software More Accessible for People with Disabilities
- Usenet-Web 1.0.1
- Testing some tables
- Martin Ramsch - iso8859-1 table
- CGI.pm - a Perl5 CGI Library
- collection: The Web Society
- Carl Davis--HTML Editor Reviews
- Some thoughts on proprietary markup
- mfx's Page On HTML, SGML, And All That Stuff
- Hustler Online
- The Sober Witness has been
- Composing Good HTML
- WebMuseum: Technical: Setting Properly your Web reader
- Bad words en Español
- Totally Not Free Shopping Area
- WARNING! Abandon hope, all ye who enter here.
- Notes on Information Retrieval
- GD.pm
- Inria Sophia Antipolis Research Unit
- Heeeeere's Johnny!
- Remote file ds.internic.net/rfc/rfc1808.txt
- A List of HTML Tags.
- Search News Database
- Help on using Perl regular expression when searching
- Sleuth Search Results
- Beavis' Home Page
- Butthead's Home Page
- Earth Viewer
- Good Quotes
- Funky Site of the Day
- Fun and Informative Resources
- The Similarities Engine
- MIT DCNS CGI programs
- WordNet Home Page
- Remote file crl.nmsu.edu/CLR/catalog
- Vi Editor Faq
- IETF - HyperText Markup Language (HTML) Working Group
- Usenet Newsgroup Creation Trend
- HTML3 -> HTML2 Conversion Page
- Untitled, URL http://www.crl.com/~jenglish/html-spec.txt
- Why We Don't Use Netscape Tags
- Majordomo Frequently Asked Questions (FAQ)
- Platform Independent Virtual Reality
- SunSITE Stats Search Results
- SunSITE Stats Search Results
- SunSITE Stats Search Results
- The myth of Netscape and HTML 3.0
- Another Roadside Attraction - Home Page
- Declaration of War
- Untitled, URL http://www.mn.interact.net/users/eileen/misc_stuff/ungeek2
- HomePage
- Welcome To The Gallup Organization
- The OCLC Fred Home Page
- List-Managers
- College of Computing HTML Validation Service
- UdiWWW Test Verzeichnis
- Walgreens Home Page
- SGML PRIMER: Introduction
- What is HTML? An Opinion
- Crash course on writing documents for the Web
- Crash course on writing documents for the Web
- HTML Demo Page
- The CGI Frequently Asked Questions (FAQ) List
- Untangling the World-Wide Web
- Untitled, URL http://www.c3.lanl.gov/~cim/webgreat/first.html
- FLY WITH US!
- BLIND RELATED LINKS
- Examples of common HTML bugs
- =Cowles/SIMBA Media Daily: Internet Information=
- SIMBA Media Daily: INTERNET
- =Cowles/SIMBA Media Daily: Internet Information=
- =Cowles/SIMBA Media Daily: Internet Information=
- How far is it?
- Foyer Page - The CyberChâteau
- World of Weasels
- PCWEEK Mar 7, 1994
- ESPNET SportsZone
- WIK - Annotated Table of Characters
- HEAD Request Form
- Happy Puppy Software Games Onramp Home Page
- DIGZONE
- Untitled, URL http://www.cis.ohio-state.edu/hypertext/faq/usenet/jpeg-faq/top.html
- Topic: pubs/news/
- Advanced HTML: Tables
- Untitled, URL http://www.13engines.com/13engines
- Image Links
- Yikes!
- Untitled, URL http://www.wg.omron.co.jp/~jfriedl/perl/webget
- Remote file ds.internic.net/internet-drafts/draft-ietf-html-tables-00.txt
- Comparison of Web Browsers
- NewsPage Home Page
- Remote file ds.internic.net/rfc/rfc1437.txt
- Remote file ds.internic.net/rfc/rfc1438.txt
- Arena: Inspiration
- World Wide Web FAQs and Guides
- Converting BOOKIE to HTML
- WWW-Talk and WWW-HTML Mail Archives
- WWW HTML Jul 95 - Present: Re: color: NCSA Mosaic, Netscape, and HTML3
- DPIBrowse
- Nelson H. F. Beebe's Home Page
- PNG (Portable Network Graphics) Home Page
- ELM - Using PGP
- Perl CGI Exmaples
- WebCopy Documentation
- Remote file bond.edu.au/pub/Minerva/msql
- The Whirlwind Guide to SGML Tools
- Index of /public/perl/contrib/lib/CGI
- HTML LEARNING NEXUS
- WebMaster Magazine
- Remote file snorri.chem.washington.edu/hypertex/hypertex-faq
- ISO8859-1/HTML stuff
- wwwgrab
- VIA Rail Canada Inc.
- Onset Online 2.1 TOC
- TMS Experimental Browser
- Gopher server at gopher.mic.ucla.edu
- Gopher server at gopher.mic.ucla.edu
- Netscape - Unsafe at Any Speed
- ARTFL Project: King James Bible Search Form
- The Netscape-B-Gon(R) page
- Welcome to Molson On-Line!
- talk.bizarre message<EMAIL_ADDRESS>- Stroud's CWSApps List - Main Menu
- Global Encyclopedia
- Accel Partners Home Page
- talk.bizarre message<EMAIL_ADDRESS>- HTML-WG Mail Archives
- Space Moose's home page
- WWW Test Pattern
- Frito-Lay Main Menu
- sgmlspl: a simple post-processor for SGMLS and NSGMLS
- The DBPerl Specification - Version 0.5
- The PERL programming language
- DATE and TIME conversion/manipulation
- Ford Worldwide Connection Home Page
- The Web100
- The Economist
- Remote file ftp.techno.com/pub/HyTime
- Desktop Publishing
Contents Page
- MapMaker
- wwwgrab
- CME's Cryptography Timeline
- InterQuote Home Page
- Lombard Home Page
- Stock Picks - Canada
- HTML 3 Reference Table of Conetents
- PNG, Portable Network Graphics
- Lynx2-4-FM sources
- The URI::URL Perl 5 Module
- WWW VL: Human-Computer Interaction
- Singular "their" in Jane Austen and elsewhere: Anti-pedantry page
- Useful Information on Hypertext and Multimedia Systems
- hyptxt & lit theory
- Hypertext Theory As If the WWWeb Matters
- The Geek Zone
- v5n8 Nov/Dec 1994 Entry Level
- Computer Information from Around the World
- Information Systems Page
- Resource Discovery and Reliable Links (Web Research)
- HTML 2.0 Public Text
- Networks behind the User Interface
- Arena: Inspiration
- Rick's Webtools page
- Characterizing Browsing Strategies in the World-Wide Web
- pgperl FORMS demo
- Report
- Remote file franz.ww.tu-berlin.de/pub/perl
- HyperNews: NCSA HTTPd 1.5 Beta Reports
- Yet another Tragically Hip Web Page
- Remote file ftp.vis.colostate.edu/pub/nate/htget/htget.gz
- Hope Enterprises
- Netbook: The Netizens and the Wonderful World of the Net
- News Article Format and Transmission
- Comp.Software.Testing Archive: Main Index
- mailing list archive request form
- CITRI's MG Pages
- Features Missing in Current Web Browsers
- Quotes from Usenet
- CyberWire Dispatch, by Brock N. Meeks
- DPIBrowse
- Untitled, URL http://vivarin.pc.cc.cmu.edu/cgi-bin/lyr.groups?tragically.hip
- Member bodies
- Quantum Corporation WWW Server
- Publicly Accessible Mailing Lists
- WWW Seminar: Essential Concepts
- Geek Site of the Day
- Gareth's style guide
- Tree fiction on the World Wide Web
- Book Stacks - The Book Cafe
- ESYS
- talk.bizarre message<EMAIL_ADDRESS>- Legal Information Links
- Well-done Corporate Sites
- Quote.Com Chart for Netscape
- BLOCKBUSTER Home Page
- Untitled, URL http://theory.physics.missouri.edu/~georges/Josh/squat/
- HTML Comment Parser Test
- Cascading Style Sheets: a draft specification
- The Rift (main page)
- HOTT.BOB BOB-cam!
- Fortune 500
- Untitled, URL http://www.hal.com/services/juggle/news/majordomo/ORA
- Majordomo Configuration
- Rocky Mountain Nat'l Park
- Majordomo mail list and archive site
- HTML Writers Guild message "Re: imagemap programs for jpeg's" by Dave Andersen
- Regex Manual
- talk.bizarre message<EMAIL_ADDRESS>- Remote file cert.org/pub/papers
- Untitled, URL http://www.stuff.com/~bcutter/home/programs/w3new/w3new.html
- WWW-Talk and WWW-HTML Mail Archives
- Linux Installation and Getting Started
- Siva
- WWW Viewer Test Page
- GIFMOM
- UR* and The Names and Addresses of WWW objects
- WIRED 3.06: "The Curse of Xanadu" by Gary Wolf
- Welcome to Worlds Inc.
- Welcome To HotWired!
- From Webspace to Cyberspace
- Welcome to Fox!
- Hierarchy of Content Models in the HTML 2.0 DTD
- U.S. Department of Education
- BME: Piercing
- Lonely Planet online
- Joe Boxer MegaCorp
- Volvo - Home Page
- SAGE Job Descriptions
- USENET News
- Remote file ftp.uu.net/usenet/news.answers/mail/list-admin/software-faq
- VISA Home Page
- MasterCard International Pointers
- The Virtual Community by Howard Rheingold: Table of Contents
- Rubbermaid Online!
- HTML & CGI Unleashed
- CNN Interactive
- NBC HTTV
- Give me a title
- MONEY QUICK QUOTES
- About NA2WWW
- About USA TODAY(September 9, 1995 12:33 AM)
- rec.games.pinball Database
- Untitled, URL http://www.cs.duke.edu/~dsb/httpfetch
- The Unofficial HALSoft Validator FAQ
- Icons and Images for Use in HTML Documents
- Welcome to InfoWorld
- Mosaic User Authentication Tutorial
- Lynx-Dev Mailing List Archives
- Portraits in Cyberspace
- Paul's web Page
- Submit It!
- Bill Gates: The Myth, The Man, The Lovin' Machine:
- MircoSoft Hate Page
- 15 questions to ask Microsoft about Windows 95
- The official Anti-Microsoft homepage
- Career Resources
- New Civilization Network
- Computer History and Folklore
- Toward a Formalism for Communication On the Web
- Toward Closure on HTML
- David LaMacchia Defense Fund
- Mathematics For Computer Generated Spoken Documents
- WHAT'S ON TONITE!
- Rodney Dangerfield
- Ski America Home Page
- HTML3 Tables
- RFC 1123 -- see sec 1.2.2 for the Internet Robustness Principle
- Crystal Palace Networking Registration Services
- Internet Info (Domain Name Analyses)
- Stroud's CWSApps List - Main Menu
- Writing HTML, SGML, TEI, etc.
- Salvador Dali Virtual Museum
- Hypertext links in HTML
- Ben & Jerry's Homemade Inc.
- Ye Home Page of ye Inner Circle [alt.fan.warlord]
- Central Source Yellow Pages
- TSN Online
- Schedules for Route 9
- Schedules for Route 37
- Search for Mailing Lists
- UCS Knowledge Base
- A taxonomy of SGML entities
- Eric Miller's Home Page [HTML, Web links]
- A Lexical Analyzer for HTML and Basic SGML
- The Weather Page
- Canadian Constitutional Documents and Proposals
- INDEX.HTM
- UdiWWW - HTML3 Browser
- Welcome to Arena
- Counter -- counters -- counters
- Web Server Resource Guide
- Roberts Rules
- Welcome to the NHL OPEN NET
- The 9 Types of Web Page Creators
- The 9 Types of Web Page Creators
- Mag's SGML Resources
- Marc Andreessen's Interoperability quote (was WWW Talk Oct 94-present: Re: Netscape v NCSA, Progress?)
- The original DIV proposal (was: WWW Talk Oct 94-present: CENTER element [Was: Netscape & New HTML])
- WWW-Courseware by thread
- Centre D'affaires Bonjour-Quebec
- Edupage Digest
- Levi Strauss & Co. - Welcome!
- M&M's Chocolate Mini Baking Bits
- Untitled, URL http://www.joltcola.com/
- Volkswagen
- Rock & Roll Hall of Fame + Museum
- Unsolved Mysteries - Television Show
- ISBN searching (was: Amazon.com Search Language)
- bobaworld, shmobaworld
- Welcome to Toys"R"Us
- L'eggs Online Store
- The MGD Tap Room
- wacky wacky wacky wacky
- SpinnWebe
- Engineering Positions Available at EIT
- The Canadian Information Processing Society
- Canadian Information Processing Society (Edmonton Section)
- Welcome to The Computer Paper
- Angst Game
- AFS distributed filesystem FAQ
- The Princess Bride
- Anchor Checker
- Half-QWERTY: Typing With One Hand Using Your Two-handed Skills
- Karen's Organized Hotlist
- The Unofficial HALSoft Validator FAQ
- Filtering the Web using WebFilter
- W3 Access for Blind People
- infoMarket Search Welcome home page
- As We May Think
- Majordomo List Owner's Guide
- Novell Publications Server [neato on-the-fly DocBook SGML conversion]
- The Condition of Education 1995 - Title Page
- Home Automation stuff
- DocBook DTD
- Query Interface to the comp.infosystems.harvest Broker
- Plan 9 Index
- Plan 9 from Bell Labs
- Plan 9 from AT&T Bell Laboratories FAQ
- Social Implications of Information Technologies
- HOTT.BOB pictures pages
- WWLib - Searchable Classified Catalogue of UK Web sites [Dewey Decimal based Web classification system]
- The Artistic License
- MOMspider -- Distribution Information
- libwww-perl: Distribution Information
- SGML Declarations
- James Clark SGML Parser (SP)
- SGMLS.pm: a perl5 class library for handling output from the SGMLS and NSGMLS parsers
- Linuxdoc-SGML User's Guide
- Digital Libraries '95 On-Line Proceedings
- SIGLINK: Web on Hypertext
- SIGLINK Home Page
- Hoffman and Novak (1995), Marketing in a Hypermedia CME: Conceptual Foundations
- A Talk.Bizarre Sampler
- U.S. Department of Education
- The Weather Channel ® Home Page
- Hypertext Publishing and the Evolution of Knowledge
- Welcome to CareerPath.com
- Rock & Roll Hall of Fame + Museum
- W3 Access for Blind People
- Leonardo da Vinci Museum
- The Grail Browser Home Page
- MMM [Web browser] Home Page
- The Greater Edmonton Visitor Guide
- World Wide Web of Sports
- CMP Publications (InformationWeek, InteractiveAge, NetGuide, CommunicationsWeek, ... )
- Quotes
- RFC 1602 -- the Internet Standards Process
- A complicated .elm/filter-rules file (Sven Guckes')
- RFC 1855: Netiquette Guidelines
- The Netrek-Java Project
- Trail Map: The Java Programmer's Guide
- Brewing Java: A Tutorial
- Speaking words of wisdom...
- Graph of Netscape Communications Corporation (NSCP)
- Typing Injury FAQ Home Page
- Repetitive Strain Injuries - The Hidden Cost of Computing
- Welcome to Hugo Boss Word Slam
- Unix Tutorial - Introduction
- AFS Beginners Guide - Table of Contents
- The Similarities Engine
- Baywatch!
- Fortune 500
- Discography: Tragically Hip
- The Better Business Bureau Web Server: Home Page
- Current Internet-Drafts
- The Internet Standards Process -- Revision 3
- STUN GUNS
- Hollywood's Coming: Waterworld
- What Sn00z? Page
- Page francaise des simpsons : France
- The Simpsons Archive
- Dark Side of the HTML
- gf
- As We May Think
- The Computers of Tomorrow
- PC PowerGlove Page
- The American Dental Association
- Welcome to Statistics Canada
- {PowerGlove FAQ}
- IHTFP Hack Gallery: Gallery Menu
- Wal-Mart Stores, Inc.
- SNL INDEX
- World Wide Waltons
- The Java Cup International
- The Java Language Specification
- Trail Map: The Java Programmer's Guide
- The Web Wanderer's List of Linux Applications
- Welcome to X Industries
- HTTP-WG Mailing List Archive for Q4, 1995: Keep-Alive Notes
- GNU Make - Table of Contents
- Gnuplot
- NCSA HTTPd Library
- BrowserCaps
- Reference Information
- Welcome to U.S.News Online
- 555-1212.com
- Internet Address Finder
- AT&T Bell Laboratories Voices © 1995 AT&T
- On-Line Query System (OLQS)
- RTF-Tools -- RTF software and documentation
- RTF 1.0 Specification
- RTF viewer
- CGI specification
- HTML Validation Tools
- HyperText Design Issues: Navigational techniques
- HTML to the Max
- ARPA Knowledge Sharing Effort public library
- The Sociable Web
- Visual Who
- Collaboration, Knowledge Representation and Automatability
- WWW Collaboration Projects
- The Global Positioning System (GPS)
- Navigational System for the Visually Impaired
- The Talk.Bizarre 'Web Page Thing
- MAP07: NETIQUETTE
- Butterball
- Civil Liberties in Cyberspace
- John's Simpsons Sounds & Links
- Internet Info / NetWatch Internet Millionaires Page
- [ nonprofit organizations ] NPO-FAQ List of Sections
- ELETTRA Synchrotron Radiation Facility
- nonprofit.net
- Java Über Alles?
- Untitled, URL http://www.metronet.com/1h/perlinfo/perl5/berkeley.db.interface
- Remote file ftp.cis.ufl.edu/pub/perl/CPAN/modules/by-authors/id/MUIR/modules/Time/README
- Remote file ftp.cis.ufl.edu/pub/perl/CPAN/
- Ferrari Official Web Site
- Panorama Resort, BC - Canada (Welcome)
- SGMLUG SGML History
- Weather-Edmonton, Alberta
- UIUC Programs of Study: Table of Contents
- Extropians and other Transhumans
- Frequently Answered Questions about Extropians (release 0.092)
- Edmonton Space & Science Centre
- West Edmonton Mall Home Page
- Discover Edmonton, Alberta - Designed for the Traveller visiting Alberta
- Downhill Riders Ski & Travel Co. Ltd.
- Online Job Searching
- Albums by Tragically Hip, The
- Campbell Soup Company
- Discuss->WWW gateway home page
- Inktomi Web Services
- IGA Home Page
- "Welcome to the Riviera"
- Welcome to Duracell USA
- Budweiser On-Line
- All About Trademarks -- Welcome to the GGMARK Home Page!
- NBA.com
- Directory Tree of doomgate.cs.buffalo.edu/
- INTELLiCast: Edmonton Weather
- TEI Guidelines for Electronic Text Encoding and Interchange
- Introduction to the Hacker's Dictionary
- Gone Web Hacking [lots of good advice on work habits]
- Web Technology and Beyond
- The GIMP: an overview
- WorldWideWeb: Proposal for a HyperText Project
- Webhackers - Webhackers Home Page
- Content Models in the HTML 2.0 and HTML 3.0 DTDs
- ASWedit and asWedit HTML editors
- A Modular DTD for HTML
- Welcome to The Metropolitan Museum of Art
- Index of /pub/WWW/MarkUp/html-pubtext/
- Alta Vista: Main Page
- Watchmen Home Page
- _My_ AntiNetscape Page
- HTTP Server Statistic Pages
- HyperGrammar
- Inter-Language Unification -- ILU
- KGV: HTML Validation Results for http://www.ics.uci.edu/pub/ietf/html/
- Web Review: Comment -- A Tribute To Yuri Rubinsky
- talk.bizarre message "Re: Forwarded mail... (fwd)(fwd)(fwd)" by The Boundary Condition
- talk.bizarre message "kitty kitty kitty kitty" by Dan Quayle
- Superconducting Maglev Project
- Punch Rush Limbaugh Home Page
- Majordomo mail list and archive site
- Welcome to Symposia Home Page ["WYSIWYG" Authoring Tool for the World Wide Web]
- SGML: A Basic Introduction
- SoftQuad: SGML: Your Multi-Platform Publishing and
Information Management Solution
- Untitled, URL http://www.imc.org/usenet-writing
- Collaborative Hypermedia: http://sensemedia.net/papers
- WWW-Talk 1992: Virtual newsgroups and creating the memory of Usenet via www and wais
- WWW-Talk 1992: rethinking the HTML DTD.
- WWW-Talk 1992: Re: rethinking the HTML DTD.
- WWW-Talk 1992: Lets keep the web together
- Al's Picks
- GNU OpenStep Homepage
- LinuxNET: Mailing List Archives
- Designing an Accessible Web
- MKStats - WWW Log Analaysis Program
This is an attempt at sorting the massive hotlist that I've accumulated.
Please note that this is the only hotlist in the world that does not
contain a link to the Doctor
Fun page.
I'm not quite happy with this breakdown, but it's better than nothing.
If you can think of a better way to organize it,
please send me e-mail.
You can also see my current (Mosaic) hotlist
(which is a list of stuff that hasn't been added to this list yet), or my
small, practical hotlist.
Gerald Oskoboiny
(gerald@amisk.cs.ualberta.ca)


{% load static %} {% static "images" as baseUrl %}
Cost of three 1000/- approx. Cuisine: North Indian, South Indian


Testing PI:importodf
Testing import of material from Open Office textdocuments,
OpenOffice.org.
This is in an experimental stage and some work remains to be done.
The rawmaterial for this site is a Open Office file: doc1.odt
A section
Purpose
The idea is to give authors not familiar to XML and HTML a way of producing material for a website, or importing material from reports written in Open Office, or even material written in Microsoft Office, and converted to Open Office.
An other section
Limitations
This mechanism is not complete and free from faults. We can only deal with text, tables, images, lists and to some extent formulas.
Formulas are at the present represented by MathML, which not all browsers are too happy with.
The concept of «dpath» for selecting material from a flat documentstructure is not waterproof, but it works on simple constructs.
WXT also assume that headings are style as Heading1, Heading2 etc
Images
Selecting only images
A section with list and image
Selecting list and image
-
Barcelona – Real Madrid
-
Camp Nou
-
29.11.2010
-
5 -0
A section with table and image and text
Selecting a section, no style for table
Portraits
It also contain some portraits of the author
samples
Content file for this page
<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<title>welcome</title>

Testing PI:importodf

Testing import of material from Open Office textdocuments,
OpenOffice.org.
This is in an experimental stage and some work remains to be done.
The rawmaterial for this site is a Open Office file: doc1.odt

A section

<?_wxt importodf location="doc1.odt" dpath="/*/Purpose"?>

An other section

<?_wxt importodf location="doc1.odt" dpath="/*/Limitations"?>

Images

Selecting only images

<?_wxt importodf location="doc1.odt" dpath="/*/Illustrations[img]"?>

A section with list and image

Selecting list and image

<?_wxt importodf location="doc1.odt" dpath="/*/El Classico[ul,img]"?>

A section with table and image and text

Selecting a section, no style for table

<?_wxt importodf location="doc1.odt" dpath="/*/Portraits"?>

Content file for this page

<?_wxt expandable location="welcome.xml"
lang="lang-xml"?>