Hollywood Undead is an American rap rock band from Los Angeles, California, formed in 2005. They released their debut album, Swan Songs, on September 2, 2008, and their live CD/DVD Desperate Measures, on November 10, 2009. Their second studio album, American Tragedy, was released April 5, 2011. All of the band members use pseudonyms and wear their own unique mask, most of which are based on the common hockey goaltender design. The band members currently consist of Charlie Scene, Danny, Funny Man, J-Dog, and Johnny 3 Tears. Their third studio album, titled Notes from the Underground, was released on January 8, 2013. Their fourth studio album, Day of the Dead, was released on March 31, 2015. Hollywood Undead's fifth record is titled Five (or V), and was released on October 27, 2017. The first single from the album, called "California Dreaming", was made available July 24, 2017.


Class: Sunspot::DSL::Scope
- Inherits:
-
Object
- Object
- Sunspot::DSL::Scope
- Defined in:
- sunspot/lib/sunspot/dsl/scope.rb
Overview
This DSL presents methods for constructing restrictions and other query elements that are specific to fields. As well as being a superclass of Sunspot::DSL::StandardQuery, which presents the main query block, this DSL class is also used directly inside the #dynamic() block, which only allows operations on specific fields.
Direct Known Subclasses
Constant Summary
- NONE =
Object.new
Instance Method Summary (collapse)
-
- (Object) all_of(&block)
Create a conjunction, scoping the results to documents that match all of the enclosed restrictions.
-
- (Object) any_of(&block)
Create a disjunction, scoping the results to documents that match any of the enclosed restrictions.
-
- (Object) dynamic(base_name, &block)
Apply restrictions, facets, and ordering to dynamic field instances.
-
- (Scope) initialize(scope, setup)
constructor
:nodoc:.
-
- (Object) text_fields(&block)
Apply scope-type restrictions on fulltext fields.
-
- (Object) with(*args)
Build a positive restriction.
-
- (Object) without(*args)
Build a negative restriction (exclusion).
Constructor Details
- (Scope) initialize(scope, setup)
:nodoc:
13 14 15 |
# File 'sunspot/lib/sunspot/dsl/scope.rb', line 13 def initialize(scope, setup) #:nodoc: @scope, @setup = scope, setup end |
Instance Method Details
- (Object) all_of(&block)
Create a conjunction, scoping the results to documents that match all of the enclosed restrictions. When called from the top level of a search block, this has no effect, but can be useful for grouping a conjunction inside a disjunction.
Example
Sunspot.search(Post) do any_of do with(:blog_id, 1) all_of do with(:blog_id, 2) with(:category_ids, 3) end end end
132 133 134 135 136 |
# File 'sunspot/lib/sunspot/dsl/scope.rb', line 132 def all_of(&block) conjunction = @scope.add_conjunction Util.instance_eval_or_call(Scope.new(conjunction, @setup), &block) conjunction end |
- (Object) any_of(&block)
Create a disjunction, scoping the results to documents that match any of the enclosed restrictions.
Example
Sunspot.search(Post) do any_of do with(:expired_at).greater_than Time.now with :expired_at, nil end end
This will return all documents who either have an expiration time in the future, or who do not have any expiration time at all.
108 109 110 111 112 |
# File 'sunspot/lib/sunspot/dsl/scope.rb', line 108 def any_of(&block) disjunction = @scope.add_disjunction Util.instance_eval_or_call(Scope.new(disjunction, @setup), &block) disjunction end |
- (Object) dynamic(base_name, &block)
Apply restrictions, facets, and ordering to dynamic field instances. The block API is implemented by Sunspot::DSL::FieldQuery, which is a superclass of the Query DSL (thus providing a subset of the API, in particular only methods that refer to particular fields).
Parameters
| base_name | The base name for the dynamic field definition |
Example
Sunspot.search Post do dynamic :custom do with :cuisine, 'Pizza' facet :atmosphere order_by :chef_name end end
158 159 160 161 162 163 |
# File 'sunspot/lib/sunspot/dsl/scope.rb', line 158 def dynamic(base_name, &block) Sunspot::Util.instance_eval_or_call( Scope.new(@scope, @setup.dynamic_field_factory(base_name)), &block ) end |
- (Object) text_fields(&block)
Apply scope-type restrictions on fulltext fields. In certain situations, it may be desirable to place logical restrictions on text fields. Remember that text fields are tokenized; your mileage may very.
The block works exactly like a normal scope, except that the field names refer to text fields instead of attribute fields.
Example
Sunspot.search(Post) do text_fields do with :body, nil end end
This will return all documents that do not have a body.
183 184 185 186 187 188 |
# File 'sunspot/lib/sunspot/dsl/scope.rb', line 183 def text_fields(&block) Sunspot::Util.instance_eval_or_call( Scope.new(@scope, TextFieldSetup.new(@setup)), &block ) end |
- (Object) with(*args)
Build a positive restriction. This method can take three forms: equality restriction, restriction by another restriction, or identity restriction. In the first two forms, the first argument is a field name. If only a field name is specified, this method returns another DSL object which presents methods for attaching various restriction types. With two arguments, this creates a shorthand restriction: if the second argument is a scalar, an equality restriction is created; if it is a Range, a between restriction will be created; and if it is an Array, an any_of restriction will be created. The third from restricts the search results to a specific instance.
Parameters (restriction by field value)
| field_name | Name of the field on which to place the restriction |
| value | If passed, creates an equality, range, or any-of restriction based on the type of value passed. |
Parameters (restriction by identity)
| args | One or more instances that should be included in the results |
Returns
| Sunspot::DSL::Restriction | Restriction DSL object (if only one argument is passed which is a field name) |
Examples
An equality restriction:
Sunspot.search do with(:blog_id, 1) end
Restrict by range:
Sunspot.search do with(:average_rating, 3.0..5.0) end
Restrict by a set of allowed values:
Sunspot.search do with(:category_ids, [1, 5, 9]) end
Other restriction types:
Sunspot.search(Post) do with(:average_rating).greater_than(3.0) end
Restriction by identity:
Sunspot.search(Post) do with(some_post_instance) end
80 81 82 |
# File 'sunspot/lib/sunspot/dsl/scope.rb', line 80 def with(*args) add_restriction(false, *args) end |
- (Object) without(*args)
Build a negative restriction (exclusion). This method works the same way asthe #with method.
88 89 90 |
# File 'sunspot/lib/sunspot/dsl/scope.rb', line 88 def without(*args) add_restriction(true, *args) end |


GHG emission per economic sector
International bunkers
Waste
Industry
Agriculture
Residential and commercial
Transport
Forestry
Land use sources
Energy
Other
GHG emission per economic sector
Introduction
This page aims to visualise the world's greenhouse gas (GHG) emissions
from 1970 to 2012 and how these emissions relate to a country's GDP.
Emissions world map
The world map shows the GHG emissions of countries.
Hover over a country to see its GHG emission in kt CO2
equivalent.
Click on a country to add the country to the scatter plot and the
bar chart.
GHG emissions and GDP
The scatter plot shows the GHG emissions and GDP of the countries
selected in the world map.
Hover over a dot to see the exact GHG emission and GDP.
Tick the checkbox to change the y-axis from GHG emission to
GHG emission per GDP.
GHG emission per economic sector
The grouped bar chart shows the GHG emissions per economic sector
of the countries selected in the world map.
NOTE: the GHG emission for the forestry sector should be read as a
negative number, as greenhouse gases are removed from the atmosphere
by forestry.
Hover over a bar to see the exact GHG emission of a sector.
Chart options
Click on the dropdown button to reveal a menu to remove countries
from the scatter plot and the bar chart. Click on the buttons with a
country name to remove that country from the scatter plot and the bar
chart.
Tick the checkbox next to "Show GHG emission per GDP" to change
the y axis of the scatter plot to GHG emissions per GDP in Kg CO2
equivalent per USD.
Tick the checkboxes of the economic sectors to select which
economic sectors will be shown in the bar chart.
Author: Xander Locsin
StudentID: 10722432
Minor programmeren
Programmeerproject


elevator v0.1.0 StateMachine
Module for the state of an individual elevator, for controlling the execution of orders, ensures own backup and makes sure lights are correct
State:
- A struct consisting of a floor (the last floor), a direction (:up, :down, :stop) and a list of active orders it has accepted
Tasks:
- Controlling the elevator
- Executing orders
Communication:
- Sends to: DriverInterface, WatchDog
- Receives from: OrderHandler, Poller
Link to this section Summary
Functions
Returns a specification to start this module under a supervisor
function for controlling elevator direction
When on a floor, execute the order if the elevator should stop
A new order is accepted, the light is set and in case this is the first order, is executed directly
drive downwards to closest floor and initialize the state
Logic for deciding whether the elevator should stop at that specific floor
Link to this section Functions
backup_state(state)
child_spec(init_arg)
Returns a specification to start this module under a supervisor.
See Supervisor
.
delete_active_order(order)
direction_to_int(elevator_state)
execute_order(state)
function for controlling elevator direction
execute_order_on_floor(state)
When on a floor, execute the order if the elevator should stop
handle_cast(msg, state)
A new order is accepted, the light is set and in case this is the first order, is executed directly
init(direction)
drive downwards to closest floor and initialize the state
initialize_to_floor()
open_doors()
order_type_to_int(elevator_order)
reset_motor_timer()
should_stop?(state)
Logic for deciding whether the elevator should stop at that specific floor


species macropomum fish climate native South change distribution non-native basins America areas invasive Colossoma potential Fig natural {border-style Atlantic freshwater invasion region px;} range suitability #ffffff;} Amazon conservation farming future present occurrence Climate occupied effects modeling occurrences suitable different river used American Fish Freshwater Sciences Thus, basins, considering environmental refugia TML data impacts invaded results Atlantic, Brazil PCA cells climatic especially farms models niche regions time CONS Ecol Table Universidade change. environment face model water Agostinho Biol. East Orinoco Paraná basins. biological climatically contraction expected geographical global high main management px; regions. species. time, using {font-family (see BAA ENMs However, NCLS Paraná-Paraguay Pelicice Southeast ]), change, consensus ecological explanation fauna font-size large major original predictions showed temperature variation (%) (cells) BCGG Ecological Federal Northeast Range River, [], addition, biodiversity distance double; geographic human invasions outside pressure region, regions, species, upper ./journal.pone. America, America. Diniz-Filho Ecology Future Gomes Natural North River activity analysis approximately areas. bioclimatic border-color border-width cause conditions corresponding ecosystems environments estimated expansion experience generated highly introduced introduction low maps negative portion predicted prediction propagule region. representing responses scenario socio-economic solid; stocking study temperatures tends time. variables {font-style {font-weight (B) ./j.-...x Amazon, Amazonian Aquatic Australia Biol Biology Brazilian Conserv ENFA Effects Environmental JAF Life Mar Maringá, Neotropical Núcleo One. PCLS Rangel Science São TFR Total actions based basin bold changes colonization concentrations consider considered constant correspond courier; decrease derived direction effective em; ensemble farm fishery fishes forecasting general, government habitat identified increasing levels locations macropomum. measures month northern number obtain outputs precipitation process provided pt;} ranges represented shifts strategies studies total


ymincookie Reduce Cookie Size cookie
HTTP cookies are used for a variety of reasons such as authentication and personalization. Information about cookies is exchanged in the HTTP headers between web servers and browsers. It’s important to keep the size of cookies as low as possible to minimize the impact on the user’s response time.
For more information check “When the Cookie Crumbles” by Tenni Theurer and Patty Chi. The take-home of this research:


--- layout: default title: Blog category: Blog tags: [Thomas Ascioglu, Adventures, AI, Augmented Reality, AR, Automation, Bicycle Touring, Computer Vision, DIY, Future, Innovation, Machine Learning, Maker, Mixed Reality, MR, Programming, Robotics, Techno, Technology, Traveling, Virtual Reality, VR, XR] --- {% include breadcrumbs.html path=page.path title=page.title %}
| {{ category[0] | camelcase }} ({{ category[1].size }}) | {% endif %} {% endfor %}


--- layout: landingpage title: The Data Journalism Helpline subtitle: This site is a repository of select resources and current information on data journalism, which has become an integral part of mainstream media over the years. header_type: hero header_img: docs/assets/img/site/transparent3.png ---
Hello! I am Ramachandran, a journalist and I curate the resources on this site.
The broad content areas will eventually incude:
I hope those who are aiming to make a career of data journalism, or thinking of taking up data journalism or diversifying their skill sets, will find the site handy.
Focus on resources for in-depth learning, now that the basics have been covered. Also look at the skill sets most in demand these days. Pages will be updated as frequently.
And, of course, modify content based on any feedback that I receive. Feedback is welcome!
Please feel free to get in touch - refer the contact page for details. This section also contains some information about my experience and background.
My current interests are centered around geojournalism, or journalism that involves the use of GIS and geographical data, including satellite imagery.


BBC
With Mark Simpkins at Central Saint Martins
RSA / Civic Media Centre
NESTA
Bill Phillips' Hydraulic Computer (1949)
Hide & Seek Canto
Dan Hill / ARUP / Barangaroo
Division Bell (19th c.)


The Following parameters are needed (either GET or POST):
-
path:
The Path to the file to be served with minified URL.
-
clicks: The number of clicks that will expire the URL. If blank the URL will not expire.
-
alias: The alias to be used. If blank a random string will be used.
-
filename: The filename that will be served from the minified URL. If blank a default filename will be used.
-
unchecked: If "True" the "path" is not checked for existence. This can lead to 404 errors of the minified URL. Defaults to "False".


3D FloorPlan
This was a project I did in 12th grade and continued into my first year of
college. The reason I'm putting it here is this was my favorite class in HS.
The class was Computer Aided Design and Drafting. Below is a carousel of some
renderings of the finished product. (There is a mix of before and after designs here).
Drag with your mouse, finger or press the small circles to go through.
The Project
If you haven't read about this class on my blog, long story short
I was Mr.Harris's top student. I excelled 1000% percent in his class
compared to other students, and so we discussed me taking one of
his old 2D floorplan project's I did the previous semesters,
creating 3D models for everything, applying textures and creating
HD-renders. Mr. Harris let me go at it.
How I started
So first we choose which floorplan to do. I really don't remember
how we choose one, but we did choose one. Now keep in mind,
I did this all in AutoCAD. AutoDesk 3DS Max is really more suitable
for 3D models, but AutoCAD can do it if you know how to do it.
 But other models require
much more work.
I started with the Kitchen, since I figured it has lot's of things
going on. You have a sink, fridge, oven, island, cabinets, etc.
All things to model!. After that I went onto the bathroom, and soon other
places in the house. Note I came up with some newer designs after HS, so you
can see a difference in the different renderings.


|
utf8rewind
1.4.1
System library for processing UTF-8 encoded text
|
Public interface for UTF-8 functions. More...
Go to the source code of this file.
Macros | |
Version information | |
Macros used to identify the version of the library. | |
| #define | UTF8_VERSION_MAKE(_major, _minor, _bugfix) ((_major) * 10000) + ((_minor) * 100) + (_bugfix) |
| Macro for creating a version number from a major, minor and bugfix number. More... | |
| #define | UTF8_VERSION_MAJOR 1 |
| The major version number of this release. More... | |
| #define | UTF8_VERSION_MINOR 4 |
| The minor version number of this release. More... | |
| #define | UTF8_VERSION_BUGFIX 1 |
| The bugfix version number of this release. More... | |
| #define | UTF8_VERSION UTF8_VERSION_MAKE(UTF8_VERSION_MAJOR, UTF8_VERSION_MINOR, UTF8_VERSION_BUGFIX) |
| The version number as an integer. More... | |
| #define | UTF8_VERSION_STRING "1.4.1" |
| The verion number as a string. More... | |
| #define | UTF8_VERSION_GUARD(_major, _minor, _bugfix) (UTF8_VERSION >= UTF8_VERSION_MAKE(_major, _minor, _bugfix)) |
| Check if feature is supported by the current release. More... | |
Error codes | |
Values returned by functions on error. | |
| #define | UTF8_ERR_NONE (0) |
| No errors. More... | |
| #define | UTF8_ERR_INVALID_DATA (-1) |
| Input data is invalid. More... | |
| #define | UTF8_ERR_INVALID_FLAG (-2) |
| Input flag is invalid. More... | |
| #define | UTF8_ERR_NOT_ENOUGH_SPACE (-3) |
| Not enough space in buffer to store result. More... | |
| #define | UTF8_ERR_OVERLAPPING_PARAMETERS (-4) |
| Input and output buffers overlap in memory. More... | |
Global configuration | |
Defines used for determining the global configuration of the system and your application. | |
| #define | UTF8_WCHAR_SIZE (2) |
Specifies the size of the wchar_t type. On Windows this is 2, on POSIX systems it is 4. If not specified on the command line, the compiler tries to automatically determine the size of the wchar_t type based on the environment. More... | |
| #define | UTF8_WCHAR_UTF16 (1) |
The wchar_t type is treated as UTF-16 (2 bytes). More... | |
| #define | UTF8_API |
| Calling convention for public functions. More... | |
Normalization flags | |
Flags used as input for utf8normalize and the result of utf8isnormalized. | |
| #define | UTF8_NORMALIZE_COMPOSE 0x00000001 |
| Normalize input to Normalization Form C (NFC). More... | |
| #define | UTF8_NORMALIZE_DECOMPOSE 0x00000002 |
| Normalize input to Normalization Form D (NFD). More... | |
| #define | UTF8_NORMALIZE_COMPATIBILITY 0x00000004 |
| Change Normalization Form from NFC to NFKC or from NFD to NFKD. More... | |
| #define | UTF8_NORMALIZATION_RESULT_YES (0) |
| Text is stable and does not have to be normalized. More... | |
| #define | UTF8_NORMALIZATION_RESULT_MAYBE (1) |
| Text is unstable, but normalization may be skipped. More... | |
| #define | UTF8_NORMALIZATION_RESULT_NO (2) |
| Text is unstable and must be normalized. More... | |
Category flags | |
Flags to be used with utf8iscategory, to check whether code points in a string are part of that category. | |
| #define | UTF8_CATEGORY_LETTER_UPPERCASE 0x00000001 |
| Uppercase letter code points, Lu in the Unicode database. More... | |
| #define | UTF8_CATEGORY_LETTER_LOWERCASE 0x00000002 |
| Lowercase letter code points, Ll in the Unicode database. More... | |
| #define | UTF8_CATEGORY_LETTER_TITLECASE 0x00000004 |
| Titlecase letter code points, Lt in the Unicode database. More... | |
| #define | UTF8_CATEGORY_LETTER_MODIFIER 0x00000008 |
| Modifier letter code points, Lm in the Unicode database. More... | |
| #define | UTF8_CATEGORY_LETTER_OTHER 0x00000010 |
| Other letter code points, Lo in the Unicode database. More... | |
| #define | UTF8_CATEGORY_LETTER |
| Combined flag for all letter categories. More... | |
| #define | UTF8_CATEGORY_CASE_MAPPED |
| Combined flag for all letter categories with case mapping. More... | |
| #define | UTF8_CATEGORY_MARK_NON_SPACING 0x00000020 |
| Non-spacing mark code points, Mn in the Unicode database. More... | |
| #define | UTF8_CATEGORY_MARK_SPACING 0x00000040 |
| Spacing mark code points, Mc in the Unicode database. More... | |
| #define | UTF8_CATEGORY_MARK_ENCLOSING 0x00000080 |
| Enclosing mark code points, Me in the Unicode database. More... | |
| #define | UTF8_CATEGORY_MARK |
| Combined flag for all mark categories. More... | |
| #define | UTF8_CATEGORY_NUMBER_DECIMAL 0x00000100 |
| Decimal number code points, Nd in the Unicode database. More... | |
| #define | UTF8_CATEGORY_NUMBER_LETTER 0x00000200 |
| Letter number code points, Nl in the Unicode database. More... | |
| #define | UTF8_CATEGORY_NUMBER_OTHER 0x00000400 |
| Other number code points, No in the Unicode database. More... | |
| #define | UTF8_CATEGORY_NUMBER |
| Combined flag for all number categories. More... | |
| #define | UTF8_CATEGORY_PUNCTUATION_CONNECTOR 0x00000800 |
| Connector punctuation category, Pc in the Unicode database. More... | |
| #define | UTF8_CATEGORY_PUNCTUATION_DASH 0x00001000 |
| Dash punctuation category, Pd in the Unicode database. More... | |
| #define | UTF8_CATEGORY_PUNCTUATION_OPEN 0x00002000 |
| Open punctuation category, Ps in the Unicode database. More... | |
| #define | UTF8_CATEGORY_PUNCTUATION_CLOSE 0x00004000 |
| Close punctuation category, Pe in the Unicode database. More... | |
| #define | UTF8_CATEGORY_PUNCTUATION_INITIAL 0x00008000 |
| Initial punctuation category, Pi in the Unicode database. More... | |
| #define | UTF8_CATEGORY_PUNCTUATION_FINAL 0x00010000 |
| Final punctuation category, Pf in the Unicode database. More... | |
| #define | UTF8_CATEGORY_PUNCTUATION_OTHER 0x00020000 |
| Other punctuation category, Po in the Unicode database. More... | |
| #define | UTF8_CATEGORY_PUNCTUATION |
| Combined flag for all punctuation categories. More... | |
| #define | UTF8_CATEGORY_SYMBOL_MATH 0x00040000 |
| Math symbol category, Sm in the Unicode database. More... | |
| #define | UTF8_CATEGORY_SYMBOL_CURRENCY 0x00080000 |
| Currency symbol category, Sc in the Unicode database. More... | |
| #define | UTF8_CATEGORY_SYMBOL_MODIFIER 0x00100000 |
| Modifier symbol category, Sk in the Unicode database. More... | |
| #define | UTF8_CATEGORY_SYMBOL_OTHER 0x00200000 |
| Other symbol category, So in the Unicode database. More... | |
| #define | UTF8_CATEGORY_SYMBOL |
| Combined flag for all symbol categories. More... | |
| #define | UTF8_CATEGORY_SEPARATOR_SPACE 0x00400000 |
| Space separator category, Zs in the Unicode database. More... | |
| #define | UTF8_CATEGORY_SEPARATOR_LINE 0x00800000 |
| Line separator category, Zl in the Unicode database. More... | |
| #define | UTF8_CATEGORY_SEPARATOR_PARAGRAPH 0x01000000 |
| Paragraph separator category, Zp in the Unicode database. More... | |
| #define | UTF8_CATEGORY_SEPARATOR |
| Combined flag for all separator categories. More... | |
| #define | UTF8_CATEGORY_CONTROL 0x02000000 |
| Control category, Cc in the Unicode database. More... | |
| #define | UTF8_CATEGORY_FORMAT 0x04000000 |
| Format category, Cf in the Unicode database. More... | |
| #define | UTF8_CATEGORY_SURROGATE 0x08000000 |
| Surrogate category, Cs in the Unicode database. More... | |
| #define | UTF8_CATEGORY_PRIVATE_USE 0x10000000 |
| Private use category, Co in the Unicode database. More... | |
| #define | UTF8_CATEGORY_UNASSIGNED 0x20000000 |
| Unassigned category, Cn in the Unicode database. More... | |
| #define | UTF8_CATEGORY_COMPATIBILITY 0x40000000 |
| Flag used for maintaining backwards compatibility with POSIX functions, not found in the Unicode database. More... | |
| #define | UTF8_CATEGORY_IGNORE_GRAPHEME_CLUSTER 0x80000000 |
| Flag used for checking only the general category of code points at the start of a grapheme cluster. More... | |
| #define | UTF8_CATEGORY_ISCNTRL |
Flag used for maintaining backwards compatibility with POSIX iscntrl function. More... | |
| #define | UTF8_CATEGORY_ISPRINT |
Flag used for maintaining backwards compatibility with POSIX isprint function. More... | |
| #define | UTF8_CATEGORY_ISSPACE |
Flag used for maintaining backwards compatibility with POSIX isspace function. More... | |
| #define | UTF8_CATEGORY_ISBLANK |
Flag used for maintaining backwards compatibility with POSIX isblank function. More... | |
| #define | UTF8_CATEGORY_ISGRAPH |
Flag used for maintaining backwards compatibility with POSIX isgraph function. More... | |
| #define | UTF8_CATEGORY_ISPUNCT |
Flag used for maintaining backwards compatibility with POSIX ispunct function. More... | |
| #define | UTF8_CATEGORY_ISALNUM |
Flag used for maintaining backwards compatibility with POSIX isalnum function. More... | |
| #define | UTF8_CATEGORY_ISALPHA |
Flag used for maintaining backwards compatibility with POSIX isalpha function. More... | |
| #define | UTF8_CATEGORY_ISUPPER |
Flag used for maintaining backwards compatibility with POSIX isupper function. More... | |
| #define | UTF8_CATEGORY_ISLOWER |
Flag used for maintaining backwards compatibility with POSIX islower function. More... | |
| #define | UTF8_CATEGORY_ISDIGIT |
Flag used for maintaining backwards compatibility with POSIX isdigit function. More... | |
| #define | UTF8_CATEGORY_ISXDIGIT |
Flag used for maintaining backwards compatibility with POSIX isxdigit function. More... | |
Typedefs | |
| typedef uint16_t | utf16_t |
| UTF-16 encoded code point. More... | |
| typedef uint32_t | unicode_t |
| UTF-32 encoded code point. More... | |
Functions | |
| UTF8_API size_t | utf8len (const char *text) |
| Get the length in code points of a UTF-8 encoded string. More... | |
| UTF8_API size_t | utf16toutf8 (const utf16_t *input, size_t inputSize, char *target, size_t targetSize, int32_t *errors) |
| Convert a UTF-16 encoded string to a UTF-8 encoded string. More... | |
| UTF8_API size_t | utf32toutf8 (const unicode_t *input, size_t inputSize, char *target, size_t targetSize, int32_t *errors) |
| Convert a UTF-32 encoded string to a UTF-8 encoded string. More... | |
| UTF8_API size_t | widetoutf8 (const wchar_t *input, size_t inputSize, char *target, size_t targetSize, int32_t *errors) |
| Convert a wide string to a UTF-8 encoded string. More... | |
| UTF8_API size_t | utf8toutf16 (const char *input, size_t inputSize, utf16_t *target, size_t targetSize, int32_t *errors) |
| Convert a UTF-8 encoded string to a UTF-16 encoded string. More... | |
| UTF8_API size_t | utf8toutf32 (const char *input, size_t inputSize, unicode_t *target, size_t targetSize, int32_t *errors) |
| Convert a UTF-8 encoded string to a UTF-32 encoded string. More... | |
| UTF8_API size_t | utf8towide (const char *input, size_t inputSize, wchar_t *target, size_t targetSize, int32_t *errors) |
| Convert a UTF-8 encoded string to a wide string. More... | |
| UTF8_API const char * | utf8seek (const char *text, size_t textSize, const char *textStart, off_t offset, int direction) |
| Seek into a UTF-8 encoded string. More... | |
| UTF8_API size_t | utf8toupper (const char *input, size_t inputSize, char *target, size_t targetSize, int32_t *errors) |
| Convert UTF-8 encoded text to uppercase. More... | |
| UTF8_API size_t | utf8tolower (const char *input, size_t inputSize, char *target, size_t targetSize, int32_t *errors) |
| Convert UTF-8 encoded text to lowercase. More... | |
| UTF8_API size_t | utf8totitle (const char *input, size_t inputSize, char *target, size_t targetSize, int32_t *errors) |
| Convert UTF-8 encoded text to titlecase. More... | |
| UTF8_API size_t | utf8casefold (const char *input, size_t inputSize, char *target, size_t targetSize, int32_t *errors) |
| Remove case distinction from UTF-8 encoded text. More... | |
| UTF8_API uint8_t | utf8isnormalized (const char *input, size_t inputSize, size_t flags, size_t *offset) |
| Check if a string is stable in the specified Unicode Normalization Form. More... | |
| UTF8_API size_t | utf8normalize (const char *input, size_t inputSize, char *target, size_t targetSize, size_t flags, int32_t *errors) |
| Normalize a string to the specified Unicode Normalization Form. More... | |
| UTF8_API size_t | utf8iscategory (const char *input, size_t inputSize, size_t flags) |
| Check if the input string conforms to the category specified by the flags. More... | |
Public interface for UTF-8 functions.
| #define UTF8_VERSION_MAKE | ( | _major, | |
| _minor, | |||
| _bugfix | |||
| ) | ((_major) * 10000) + ((_minor) * 100) + (_bugfix) |
Macro for creating a version number from a major, minor and bugfix number.
| #define UTF8_VERSION_MAJOR 1 |
The major version number of this release.
| #define UTF8_VERSION_MINOR 4 |
The minor version number of this release.
| #define UTF8_VERSION_BUGFIX 1 |
The bugfix version number of this release.
| #define UTF8_VERSION UTF8_VERSION_MAKE(UTF8_VERSION_MAJOR, UTF8_VERSION_MINOR, UTF8_VERSION_BUGFIX) |
The version number as an integer.
| #define UTF8_VERSION_STRING "1.4.1" |
The verion number as a string.
| #define UTF8_VERSION_GUARD | ( | _major, | |
| _minor, | |||
| _bugfix | |||
| ) | (UTF8_VERSION >= UTF8_VERSION_MAKE(_major, _minor, _bugfix)) |
Check if feature is supported by the current release.
| #define UTF8_ERR_NONE (0) |
No errors.
| #define UTF8_ERR_INVALID_DATA (-1) |
Input data is invalid.
| #define UTF8_ERR_INVALID_FLAG (-2) |
Input flag is invalid.
| #define UTF8_ERR_NOT_ENOUGH_SPACE (-3) |
Not enough space in buffer to store result.
| #define UTF8_ERR_OVERLAPPING_PARAMETERS (-4) |
Input and output buffers overlap in memory.
| #define UTF8_WCHAR_SIZE (2) |
Specifies the size of the wchar_t
type. On Windows this is 2, on POSIX systems it is 4. If not specified on the command line, the compiler tries to automatically determine the size of the wchar_t
type based on the environment.
| #define UTF8_WCHAR_UTF16 (1) |
The wchar_t
type is treated as UTF-16 (2 bytes).
| #define UTF8_API |
Calling convention for public functions.
| #define UTF8_NORMALIZE_COMPOSE 0x00000001 |
Normalize input to Normalization Form C (NFC).
| #define UTF8_NORMALIZE_DECOMPOSE 0x00000002 |
Normalize input to Normalization Form D (NFD).
| #define UTF8_NORMALIZE_COMPATIBILITY 0x00000004 |
Change Normalization Form from NFC to NFKC or from NFD to NFKD.
| #define UTF8_NORMALIZATION_RESULT_YES (0) |
Text is stable and does not have to be normalized.
| #define UTF8_NORMALIZATION_RESULT_MAYBE (1) |
Text is unstable, but normalization may be skipped.
| #define UTF8_NORMALIZATION_RESULT_NO (2) |
Text is unstable and must be normalized.
| #define UTF8_CATEGORY_LETTER_UPPERCASE 0x00000001 |
Uppercase letter code points, Lu in the Unicode database.
| #define UTF8_CATEGORY_LETTER_LOWERCASE 0x00000002 |
Lowercase letter code points, Ll in the Unicode database.
| #define UTF8_CATEGORY_LETTER_TITLECASE 0x00000004 |
Titlecase letter code points, Lt in the Unicode database.
| #define UTF8_CATEGORY_LETTER_MODIFIER 0x00000008 |
Modifier letter code points, Lm in the Unicode database.
| #define UTF8_CATEGORY_LETTER_OTHER 0x00000010 |
Other letter code points, Lo in the Unicode database.
| #define UTF8_CATEGORY_LETTER |
Combined flag for all letter categories.
| #define UTF8_CATEGORY_CASE_MAPPED |
Combined flag for all letter categories with case mapping.
| #define UTF8_CATEGORY_MARK_NON_SPACING 0x00000020 |
Non-spacing mark code points, Mn in the Unicode database.
| #define UTF8_CATEGORY_MARK_SPACING 0x00000040 |
Spacing mark code points, Mc in the Unicode database.
| #define UTF8_CATEGORY_MARK_ENCLOSING 0x00000080 |
Enclosing mark code points, Me in the Unicode database.
| #define UTF8_CATEGORY_MARK |
Combined flag for all mark categories.
| #define UTF8_CATEGORY_NUMBER_DECIMAL 0x00000100 |
Decimal number code points, Nd in the Unicode database.
| #define UTF8_CATEGORY_NUMBER_LETTER 0x00000200 |
Letter number code points, Nl in the Unicode database.
| #define UTF8_CATEGORY_NUMBER_OTHER 0x00000400 |
Other number code points, No in the Unicode database.
| #define UTF8_CATEGORY_NUMBER |
Combined flag for all number categories.
| #define UTF8_CATEGORY_PUNCTUATION_CONNECTOR 0x00000800 |
Connector punctuation category, Pc in the Unicode database.
| #define UTF8_CATEGORY_PUNCTUATION_DASH 0x00001000 |
Dash punctuation category, Pd in the Unicode database.
| #define UTF8_CATEGORY_PUNCTUATION_OPEN 0x00002000 |
Open punctuation category, Ps in the Unicode database.
| #define UTF8_CATEGORY_PUNCTUATION_CLOSE 0x00004000 |
Close punctuation category, Pe in the Unicode database.
| #define UTF8_CATEGORY_PUNCTUATION_INITIAL 0x00008000 |
Initial punctuation category, Pi in the Unicode database.
| #define UTF8_CATEGORY_PUNCTUATION_FINAL 0x00010000 |
Final punctuation category, Pf in the Unicode database.
| #define UTF8_CATEGORY_PUNCTUATION_OTHER 0x00020000 |
Other punctuation category, Po in the Unicode database.
| #define UTF8_CATEGORY_PUNCTUATION |
Combined flag for all punctuation categories.
| #define UTF8_CATEGORY_SYMBOL_MATH 0x00040000 |
Math symbol category, Sm in the Unicode database.
| #define UTF8_CATEGORY_SYMBOL_CURRENCY 0x00080000 |
Currency symbol category, Sc in the Unicode database.
| #define UTF8_CATEGORY_SYMBOL_MODIFIER 0x00100000 |
Modifier symbol category, Sk in the Unicode database.
| #define UTF8_CATEGORY_SYMBOL_OTHER 0x00200000 |
Other symbol category, So in the Unicode database.
| #define UTF8_CATEGORY_SYMBOL |
Combined flag for all symbol categories.
| #define UTF8_CATEGORY_SEPARATOR_SPACE 0x00400000 |
Space separator category, Zs in the Unicode database.
| #define UTF8_CATEGORY_SEPARATOR_LINE 0x00800000 |
Line separator category, Zl in the Unicode database.
| #define UTF8_CATEGORY_SEPARATOR_PARAGRAPH 0x01000000 |
Paragraph separator category, Zp in the Unicode database.
| #define UTF8_CATEGORY_SEPARATOR |
Combined flag for all separator categories.
| #define UTF8_CATEGORY_CONTROL 0x02000000 |
Control category, Cc in the Unicode database.
| #define UTF8_CATEGORY_FORMAT 0x04000000 |
Format category, Cf in the Unicode database.
| #define UTF8_CATEGORY_SURROGATE 0x08000000 |
Surrogate category, Cs in the Unicode database.
| #define UTF8_CATEGORY_PRIVATE_USE 0x10000000 |
Private use category, Co in the Unicode database.
| #define UTF8_CATEGORY_UNASSIGNED 0x20000000 |
Unassigned category, Cn in the Unicode database.
| #define UTF8_CATEGORY_COMPATIBILITY 0x40000000 |
Flag used for maintaining backwards compatibility with POSIX functions, not found in the Unicode database.
| #define UTF8_CATEGORY_IGNORE_GRAPHEME_CLUSTER 0x80000000 |
Flag used for checking only the general category of code points at the start of a grapheme cluster.
| #define UTF8_CATEGORY_ISCNTRL |
Flag used for maintaining backwards compatibility with POSIX iscntrl
function.
| #define UTF8_CATEGORY_ISPRINT |
Flag used for maintaining backwards compatibility with POSIX isprint
function.
| #define UTF8_CATEGORY_ISSPACE |
Flag used for maintaining backwards compatibility with POSIX isspace
function.
| #define UTF8_CATEGORY_ISBLANK |
Flag used for maintaining backwards compatibility with POSIX isblank
function.
| #define UTF8_CATEGORY_ISGRAPH |
Flag used for maintaining backwards compatibility with POSIX isgraph
function.
| #define UTF8_CATEGORY_ISPUNCT |
Flag used for maintaining backwards compatibility with POSIX ispunct
function.
| #define UTF8_CATEGORY_ISALNUM |
Flag used for maintaining backwards compatibility with POSIX isalnum
function.
| #define UTF8_CATEGORY_ISALPHA |
Flag used for maintaining backwards compatibility with POSIX isalpha
function.
| #define UTF8_CATEGORY_ISUPPER |
Flag used for maintaining backwards compatibility with POSIX isupper
function.
| #define UTF8_CATEGORY_ISLOWER |
Flag used for maintaining backwards compatibility with POSIX islower
function.
| #define UTF8_CATEGORY_ISDIGIT |
Flag used for maintaining backwards compatibility with POSIX isdigit
function.
| #define UTF8_CATEGORY_ISXDIGIT |
Flag used for maintaining backwards compatibility with POSIX isxdigit
function.
UTF-16 encoded code point.
UTF-32 encoded code point.
| UTF8_API size_t utf8len | ( | const char * | text | ) |
| UTF8_API size_t utf16toutf8 | ( | const utf16_t * | input, |
| size_t | inputSize, | ||
| char * | target, | ||
| size_t | targetSize, | ||
| int32_t * | errors | ||
| ) |
Convert a UTF-16 encoded string to a UTF-8 encoded string.
Example:
| [in] | input | UTF-16 encoded string. |
| [in] | inputSize | Size of the input in bytes. |
| [out] | target | Output buffer for the result, can be NULL. |
| [in] | targetSize | Size of the output buffer in bytes. |
| [out] | errors | Output for errors. |
| UTF8_ERR_NONE | No errors. |
| UTF8_ERR_INVALID_DATA | Failed to decode data. |
| UTF8_ERR_OVERLAPPING_PARAMETERS | Input and output buffers overlap in memory. |
| UTF8_ERR_NOT_ENOUGH_SPACE | Target buffer size is insufficient for result. |
| UTF8_API size_t utf32toutf8 | ( | const unicode_t * | input, |
| size_t | inputSize, | ||
| char * | target, | ||
| size_t | targetSize, | ||
| int32_t * | errors | ||
| ) |
Convert a UTF-32 encoded string to a UTF-8 encoded string.
Example:
| [in] | input | UTF-32 encoded string. |
| [in] | inputSize | Size of the input in bytes. |
| [out] | target | Output buffer for the result, can be NULL. |
| [in] | targetSize | Size of the output buffer in bytes. |
| [out] | errors | Output for errors. |
| UTF8_ERR_NONE | No errors. |
| UTF8_ERR_INVALID_DATA | Failed to decode data. |
| UTF8_ERR_OVERLAPPING_PARAMETERS | Input and output buffers overlap in memory. |
| UTF8_ERR_NOT_ENOUGH_SPACE | Target buffer size is insufficient for result. |
| UTF8_API size_t widetoutf8 | ( | const wchar_t * | input, |
| size_t | inputSize, | ||
| char * | target, | ||
| size_t | targetSize, | ||
| int32_t * | errors | ||
| ) |
Convert a wide string to a UTF-8 encoded string.
Depending on the platform, wide strings are either UTF-16 or UTF-32 encoded. This function takes a wide string as input and automatically calls the correct conversion function.
This allows for a cross-platform treatment of wide text and is preferable to using the UTF-16 or UTF-32 versions directly.
Example:
| [in] | input | Wide-encoded string. |
| [in] | inputSize | Size of the input in bytes. |
| [out] | target | Output buffer for the result, can be NULL. |
| [in] | targetSize | Size of the output buffer in bytes. |
| [out] | errors | Output for errors. |
| UTF8_ERR_NONE | No errors. |
| UTF8_ERR_INVALID_DATA | Failed to decode data. |
| UTF8_ERR_OVERLAPPING_PARAMETERS | Input and output buffers overlap in memory. |
| UTF8_ERR_NOT_ENOUGH_SPACE | Target buffer size is insufficient for result. |
| UTF8_API size_t utf8toutf16 | ( | const char * | input, |
| size_t | inputSize, | ||
| utf16_t * | target, | ||
| size_t | targetSize, | ||
| int32_t * | errors | ||
| ) |
Convert a UTF-8 encoded string to a UTF-16 encoded string.
Erroneous byte sequences such as missing or illegal bytes or overlong encoding of code points (e.g. using five bytes to encode a sequence that can be represented by two bytes) are converted to the replacement character U+FFFD.
Example:
| [in] | input | UTF-8 encoded string. |
| [in] | inputSize | Size of the input in bytes. |
| [out] | target | Output buffer for the result, can be NULL. |
| [in] | targetSize | Size of the output buffer in bytes. |
| [out] | errors | Output for errors. |
| UTF8_ERR_NONE | No errors. |
| UTF8_ERR_INVALID_DATA | Failed to decode data. |
| UTF8_ERR_OVERLAPPING_PARAMETERS | Input and output buffers overlap in memory. |
| UTF8_ERR_NOT_ENOUGH_SPACE | Target buffer size is insufficient for result. |
| UTF8_API size_t utf8toutf32 | ( | const char * | input, |
| size_t | inputSize, | ||
| unicode_t * | target, | ||
| size_t | targetSize, | ||
| int32_t * | errors | ||
| ) |
Convert a UTF-8 encoded string to a UTF-32 encoded string.
Erroneous byte sequences such as missing or illegal bytes or overlong encoding of code points (e.g. using five bytes to encode a sequence that can be represented by two bytes) are converted to the replacement character U+FFFD.
Example:
| [in] | input | UTF-8 encoded string. |
| [in] | inputSize | Size of the input in bytes. |
| [out] | target | Output buffer for the result, can be NULL. |
| [in] | targetSize | Size of the output buffer in bytes. |
| [out] | errors | Output for errors. |
| UTF8_ERR_NONE | No errors. |
| UTF8_ERR_INVALID_DATA | Failed to decode data. |
| UTF8_ERR_OVERLAPPING_PARAMETERS | Input and output buffers overlap in memory. |
| UTF8_ERR_NOT_ENOUGH_SPACE | Target buffer size is insufficient for result. |
| UTF8_API size_t utf8towide | ( | const char * | input, |
| size_t | inputSize, | ||
| wchar_t * | target, | ||
| size_t | targetSize, | ||
| int32_t * | errors | ||
| ) |
Convert a UTF-8 encoded string to a wide string.
Depending on the platform, wide strings are either UTF-16 or UTF-32 encoded. This function takes a UTF-8 encoded string as input and automatically calls the correct conversion function.
This allows for a cross-platform treatment of wide text and is preferable to using the UTF-16 or UTF-32 versions directly.
Erroneous byte sequences such as missing or illegal bytes or overlong encoding of code points (e.g. using five bytes to encode a sequence that can be represented by two bytes) are converted to the replacement character U+FFFD.
Example:
| [in] | input | UTF-8 encoded string. |
| [in] | inputSize | Size of the input in bytes. |
| [out] | target | Output buffer for the result, can be NULL. |
| [in] | targetSize | Size of the output buffer in bytes. |
| [out] | errors | Output for errors. |
| UTF8_ERR_NONE | No errors. |
| UTF8_ERR_INVALID_DATA | Failed to decode data. |
| UTF8_ERR_OVERLAPPING_PARAMETERS | Input and output buffers overlap in memory. |
| UTF8_ERR_NOT_ENOUGH_SPACE | Target buffer size is insufficient for result. |
| UTF8_API const char* utf8seek | ( | const char * | text, |
| size_t | textSize, | ||
| const char * | textStart, | ||
| off_t | offset, | ||
| int | direction | ||
| ) |
Seek into a UTF-8 encoded string.
Working with UTF-8 encoded strings can be tricky due to the nature of the variable-length encoding. Because one character no longer equals one byte, it can be difficult to skip around in a UTF-8 encoded string without decoding the code points.
This function provides an interface similar to fseek
in order to enable skipping to another part of the string.
textStart
must come before text
in memory when seeking from the current or end position.Example:
| [in] | text | Input string. |
| [in] | textSize | Size of input string in bytes. |
| [in] | textStart | Start of input string. |
| [in] | offset | Requested offset in code points. |
| [in] | direction | Direction to seek in.
|
| UTF8_API size_t utf8toupper | ( | const char * | input, |
| size_t | inputSize, | ||
| char * | target, | ||
| size_t | targetSize, | ||
| int32_t * | errors | ||
| ) |
Convert UTF-8 encoded text to uppercase.
This function allows conversion of UTF-8 encoded strings to uppercase without first changing the encoding to UTF-32. Conversion is fully compliant with the Unicode 7.0 standard.
Although most code points can be converted in-place, there are notable exceptions. For example, U+00DF (LATIN SMALL LETTER SHARP S) maps to "U+0053 U+0053" (LATIN CAPITAL LETTER S and LATIN CAPITAL LETTER S) when converted to uppercase. Therefor, it is advised to first determine the size in bytes of the output by calling the function with a NULL output buffer.
Only a handful of scripts make a distinction between upper and lowercase. In addition to modern scripts, such as Latin, Greek, Armenian and Cyrillic, a few historic or archaic scripts have case. The vast majority of scripts do not have case distinctions.
toUpper(toLower(x)) != toLower(toUpper(x))
.Example:
| [in] | input | UTF-8 encoded string. |
| [in] | inputSize | Size of the input in bytes. |
| [out] | target | Output buffer for the result, can be NULL. |
| [in] | targetSize | Size of the output buffer in bytes. |
| [out] | errors | Output for errors. |
| UTF8_ERR_NONE | No errors. |
| UTF8_ERR_INVALID_DATA | Failed to decode data. |
| UTF8_ERR_OVERLAPPING_PARAMETERS | Input and output buffers overlap in memory. |
| UTF8_ERR_NOT_ENOUGH_SPACE | Target buffer size is insufficient for result. |
| UTF8_API size_t utf8tolower | ( | const char * | input, |
| size_t | inputSize, | ||
| char * | target, | ||
| size_t | targetSize, | ||
| int32_t * | errors | ||
| ) |
Convert UTF-8 encoded text to lowercase.
This function allows conversion of UTF-8 encoded strings to lowercase without first changing the encoding to UTF-32. Conversion is fully compliant with the Unicode 7.0 standard.
Although most code points can be converted to lowercase in-place, there are notable exceptions. For example, U+0130 (LATIN CAPITAL LETTER I WITH DOT ABOVE) maps to "U+0069 U+0307" (LATIN SMALL LETTER I and COMBINING DOT ABOVE) when converted to lowercase. Therefor, it is advised to first determine the size in bytes of the output by calling the function with a NULL output buffer.
Only a handful of scripts make a distinction between upper- and lowercase. In addition to modern scripts, such as Latin, Greek, Armenian and Cyrillic, a few historic or archaic scripts have case. The vast majority of scripts do not have case distinctions.
toUpper(toLower(x)) != toLower(toUpper(x))
.Example:
| [in] | input | UTF-8 encoded string. |
| [in] | inputSize | Size of the input in bytes. |
| [out] | target | Output buffer for the result, can be NULL. |
| [in] | targetSize | Size of the output buffer in bytes. |
| [out] | errors | Output for errors. |
| UTF8_ERR_NONE | No errors. |
| UTF8_ERR_INVALID_DATA | Failed to decode data. |
| UTF8_ERR_OVERLAPPING_PARAMETERS | Input and output buffers overlap in memory. |
| UTF8_ERR_NOT_ENOUGH_SPACE | Target buffer size is insufficient for result. |
| UTF8_API size_t utf8totitle | ( | const char * | input, |
| size_t | inputSize, | ||
| char * | target, | ||
| size_t | targetSize, | ||
| int32_t * | errors | ||
| ) |
Convert UTF-8 encoded text to titlecase.
This function allows conversion of UTF-8 encoded strings to titlecase without first changing the encoding to UTF-32. Conversion is fully compliant with the Unicode 7.0 standard.
Titlecase requires a bit more explanation than uppercase and lowercase, because it is not a common text transformation. Titlecase uses uppercase for the first letter of each word and lowercase for the rest. Words are defined as "collections of code points with general category Lu, Ll, Lt, Lm or Lo according to the Unicode database".
Effectively, any type of punctuation can break up a word, even if this is not grammatically valid. This happens because the titlecasing algorithm does not and cannot take grammar rules into account.
| Text | Titlecase |
|---|---|
| The running man | The Running Man |
| NATO Alliance | Nato Alliance |
| You're amazing at building libraries | You'Re Amazing At Building Libraries |
Although most code points can be converted to titlecase in-place, there are notable exceptions. For example, U+00DF (LATIN SMALL LETTER SHARP S) maps to "U+0053 U+0073" (LATIN CAPITAL LETTER S and LATIN SMALL LETTER S) when converted to titlecase. Therefor, it is advised to first determine the size in bytes of the output by calling the function with a NULL output buffer.
Only a handful of scripts make a distinction between upper- and lowercase. In addition to modern scripts, such as Latin, Greek, Armenian and Cyrillic, a few historic or archaic scripts have case. The vast majority of scripts do not have case distinctions.
toUpper(toLower(x)) != toLower(toUpper(x))
.Example:
| [in] | input | UTF-8 encoded string. |
| [in] | inputSize | Size of the input in bytes. |
| [out] | target | Output buffer for the result, can be NULL. |
| [in] | targetSize | Size of the output buffer in bytes. |
| [out] | errors | Output for errors. |
| UTF8_ERR_NONE | No errors. |
| UTF8_ERR_INVALID_DATA | Failed to decode data. |
| UTF8_ERR_OVERLAPPING_PARAMETERS | Input and output buffers overlap in memory. |
| UTF8_ERR_NOT_ENOUGH_SPACE | Target buffer size is insufficient for result. |
| UTF8_API size_t utf8casefold | ( | const char * | input, |
| size_t | inputSize, | ||
| char * | target, | ||
| size_t | targetSize, | ||
| int32_t * | errors | ||
| ) |
Remove case distinction from UTF-8 encoded text.
Case folding is the process of eliminating differences between code points concerning case mapping. It is most commonly used for comparing strings in a case-insensitive manner. Conversion is fully compliant with the Unicode 7.0 standard.
Although similar to lowercasing text, there are significant differences. For one, case folding does not take locale into account when converting. In some cases, case folding can be up to 20% faster than lowercasing the same text, but the result cannot be treated as correct lowercased text.
Only two locale-specific exception are made when case folding text. In Turkish, U+0049 LATIN CAPITAL LETTER I maps to U+0131 LATIN SMALL LETTER DOTLESS I and U+0130 LATIN CAPITAL LETTER I WITH DOT ABOVE maps to U+0069 LATIN SMALL LETTER I.
Although most code points can be case folded in-place, there are notable exceptions. For example, U+0130 (LATIN CAPITAL LETTER I WITH DOT ABOVE) maps to "U+0069 U+0307" (LATIN SMALL LETTER I and COMBINING DOT ABOVE) when converted to lowercase. Therefor, it is advised to first determine the size in bytes of the output by calling the function with a NULL output buffer.
Only a handful of scripts make a distinction between upper- and lowercase. In addition to modern scripts, such as Latin, Greek, Armenian and Cyrillic, a few historic or archaic scripts have case. The vast majority of scripts do not have case distinctions.
Example:
| [in] | input | UTF-8 encoded string. |
| [in] | inputSize | Size of the input in bytes. |
| [out] | target | Output buffer for the result, can be NULL. |
| [in] | targetSize | Size of the output buffer in bytes. |
| [out] | errors | Output for errors. |
| UTF8_ERR_NONE | No errors. |
| UTF8_ERR_INVALID_DATA | Failed to decode data. |
| UTF8_ERR_OVERLAPPING_PARAMETERS | Input and output buffers overlap in memory. |
| UTF8_ERR_NOT_ENOUGH_SPACE | Target buffer size is insufficient for result. |
| UTF8_API uint8_t utf8isnormalized | ( | const char * | input, |
| size_t | inputSize, | ||
| size_t | flags, | ||
| size_t * | offset | ||
| ) |
Check if a string is stable in the specified Unicode Normalization Form.
This function can be used as a preprocessing step, before attempting to normalize a string. Normalization is a very expensive process, it is often cheaper to first determine if the string is unstable in the requested normalization form.
The result of the check will be YES if the string is stable and MAYBE or NO if it is unstable. If the result is MAYBE, the string does not necessarily have to be normalized.
If the result is unstable, the offset parameter is set to the offset for the first unstable code point. If the string is stable, the offset is equivalent to the length of the string in bytes.
You must specify the desired Unicode Normalization Form by using a combination of flags:
| Unicode | Flags |
|---|---|
| Normalization Form C (NFC) | UTF8_NORMALIZE_COMPOSE |
| Normalization Form KC (NFKC) | UTF8_NORMALIZE_COMPOSE + UTF8_NORMALIZE_COMPATIBILITY |
| Normalization Form D (NFD) | UTF8_NORMALIZE_DECOMPOSE |
| Normalization Form KD (NFKD) | UTF8_NORMALIZE_DECOMPOSE + UTF8_NORMALIZE_COMPATIBILITY |
For more information, please review Unicode Standard Annex #15 - Unicode Normalization Forms.
Example:
| [in] | input | UTF-8 encoded string. |
| [in] | inputSize | Size of the input in bytes. |
| [in] | flags | Desired normalization form. Must be a combination of UTF8_NORMALIZE_COMPOSE, UTF8_NORMALIZE_DECOMPOSE and UTF8_NORMALIZE_COMPATIBILITY. |
| [out] | offset | Offset to first unstable code point or length of input in bytes if stable. |
| UTF8_NORMALIZATION_RESULT_YES | Input is stable and does not have to be normalized. |
| UTF8_NORMALIZATION_RESULT_MAYBE | Input is unstable, but normalization may be skipped. |
| UTF8_NORMALIZATION_RESULT_NO | Input is unstable and must be normalized. |
| UTF8_API size_t utf8normalize | ( | const char * | input, |
| size_t | inputSize, | ||
| char * | target, | ||
| size_t | targetSize, | ||
| size_t | flags, | ||
| int32_t * | errors | ||
| ) |
Normalize a string to the specified Unicode Normalization Form.
The Unicode standard defines two standards for equivalence between characters: canonical and compatibility equivalence. Canonically equivalent characters and sequence represent the same abstract character and must be rendered with the same appearance and behavior. Compatibility equivalent characters have a weaker equivalence and may be rendered differently.
Unicode Normalization Forms are formally defined standards that can be used to test whether any two strings of characters are equivalent to each other. This equivalence may be canonical or compatibility.
The algorithm puts all combining marks into a specified order and uses the rules for decomposition and composition to transform the string into one of four Unicode Normalization Forms. A binary comparison can then be used to determine equivalence.
These are the Unicode Normalization Forms:
| Form | Description |
|---|---|
| Normalization Form D (NFD) | Canonical decomposition |
| Normalization Form C (NFC) | Canonical decomposition, followed by canonical composition |
| Normalization Form KD (NFKD) | Compatibility decomposition |
| Normalization Form KC (NFKC) | Compatibility decomposition, followed by canonical composition |
utf8normalize
can be used to transform text into one of these forms. You must specify the desired Unicode Normalization Form by using a combination of flags:
| Form | Flags |
|---|---|
| Normalization Form D (NFD) | UTF8_NORMALIZE_DECOMPOSE |
| Normalization Form C (NFC) | UTF8_NORMALIZE_COMPOSE |
| Normalization Form KD (NFKD) | UTF8_NORMALIZE_DECOMPOSE + UTF8_NORMALIZE_COMPATIBILITY |
| Normalization Form KC (NFKC) | UTF8_NORMALIZE_COMPOSE + UTF8_NORMALIZE_COMPATIBILITY |
For more information, please review Unicode Standard Annex #15 - Unicode Normalization Forms.
Example:
| [in] | input | UTF-8 encoded string. |
| [in] | inputSize | Size of the input in bytes. |
| [out] | target | Output buffer for the result, can be NULL. |
| [in] | targetSize | Size of the output buffer in bytes. |
| [in] | flags | Desired normalization form. Must be a combination of UTF8_NORMALIZE_COMPOSE, UTF8_NORMALIZE_DECOMPOSE and UTF8_NORMALIZE_COMPATIBILITY. |
| [out] | errors | Output for errors. |
| UTF8_ERR_NONE | No errors. |
| UTF8_ERR_INVALID_FLAG | Invalid combination of flags was specified. |
| UTF8_ERR_INVALID_DATA | Failed to decode data. |
| UTF8_ERR_OVERLAPPING_PARAMETERS | Input and output buffers overlap in memory. |
| UTF8_ERR_NOT_ENOUGH_SPACE | Target buffer size is insufficient for result. |
| UTF8_API size_t utf8iscategory | ( | const char * | input, |
| size_t | inputSize, | ||
| size_t | flags | ||
| ) |
Check if the input string conforms to the category specified by the flags.
This function can be used to check if the code points in a string are part of a category. Valid flags are part of the UTF8_CATEGORY_* list of defines. The category for a code point is defined as part of the entry in UnicodeData.txt, the data file for the Unicode code point database.
utf8seek
to seek in the input first before matching it with the category flags.By default, the function will treat grapheme clusters as a single code point. This means that a string like:
| Code point | Canonical combining class | General category | Name |
|---|---|---|---|
| U+0045 | 0 | Lu (Uppercase letter) | LATIN CAPITAL LETTER E |
| U+0300 | 230 | Mn (Non-spacing mark) | COMBINING GRAVE ACCENT |
Will match with UTF8_CATEGORY_LETTER_UPPERCASE
fully, because the COMBINING GRAVE ACCENT is treated as part of the grapheme cluster. This is useful when e.g. creating a text parser, because you do not have to normalize the text first.
If this is undesired behavior, specify the UTF8_CATEGORY_IGNORE_GRAPHEME_CLUSTER
flag.
In order to main backwards compatibility with POSIX functions like isdigit
and isspace
, compatibility flags have been provided. Note, however, that the result is only guaranteed to be correct for code points in the Basic Latin range, between U+0000 and 0+007F. Combining a compatibility flag with a regular category flag will result in undefined behavior.
Example:
| [in] | input | UTF-8 encoded string. |
| [in] | inputSize | Size of the input in bytes. |
| [in] | flags | Requested category. Must be a combination of UTF8_CATEGORY_* flags or a single UTF8_CATEGORY_IS* flag. |


Reference: {{ offer.reference }}
Description: {{ offer.description }}
Creation date: {{ offer.creationDate }}
Expire date: {{ offer.expiryDate }}
Discount: {{ offer.discount }}%


--- layout: post date: 2012-10-02 21:19:08 +0200 title: "Hello Planet Debian" categories: Artikel tags: - debian ---
Hello Planet Debian. This post serves as a confirmation that my feed/blog setup is working.
I am a DD since a few months and will blog occasionally about my Debian activities.


AOA’s Hyejeong Posts A Spoiler For The Group’s Comeback “In The Moonlight”
by vichiHyejeong is the next member to release a spoiler for AOA's comeback. The group had been using “#AOA_In_The_Moonlight” on Instagram to hype up fans since October.
FNC Entertainment has confirmed a comeback for the Fall season. Therefore, fans are expecting a November comeback very soon.
Hyejeong has become one of Mnet Queendom’s break-out stars after her appearance on the show. K-pop fans have been falling in love with her charming personality and sweet vocals. Stay tuned for more updates!


We are building a p2p data mesh framework for particpant-curated attention-flow computing-- our solution to the hard problem of machine-followable information content required for advanced augmented sensemaking.
We are pioneering attention-flow computing, a new
approach to computing that leverages theoretical
psychology in the design of a protocol for
machine-followable collaborative scaffolding of joint
attention.
Built on secure p2p data mesh infrastructure, senters
will generate a growing repository of private and
openly shared documents sourcing a wealth of
machine-followable topologies of motivated
attention-flow supporting an unlimited range of
possible situations and practices.
Centers of attention are natural, casually shaped,
attention-flow scaffolding of human practices. As humans
we already know centers well since our very first
experiences with joint attention in infancy-- and using
a small vocabulary of signals we can make them explicit
enough to teach machines how to grasp them.
In order for centers to be useful, they have to be
grounded in tracking concrete signs and steps taken
related to them. Instrumenting is how attention-flow
is constituted as a mode of involvement with software,
machines, and environments.
Attendants are the "machine" in machine-followable,
artificial agents that we teach to follow attention-flow
topologies, making them capable of supporting and
augmenting personal agency.
A key motivation of the senters project is the
contention that human-style joint attention is what
uniquely solves the hard problem of content in nature,
and likewise is the royal road to machines that can
augment, extend, and boost human agency.


| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final boolean |
DEBUG |
true |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
OBTAIN_PIC_REQUEST_CODE |
117 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
activity_horizontal_margin |
2130968576 |
public static final int |
activity_vertical_margin |
2130968577 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
camera |
2130837504 |
public static final int |
ic_launcher |
2130837505 |
public static final int |
no_img |
2130837506 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
action_settings |
2131230731 |
public static final int |
add_layout |
2131230723 |
public static final int |
add_pic_button |
2131230726 |
public static final int |
add_pic_edit_text |
2131230725 |
public static final int |
add_pic_image_view |
2131230724 |
public static final int |
options_layout |
2131230720 |
public static final int |
pic_image_view |
2131230728 |
public static final int |
pic_post_list |
2131230727 |
public static final int |
pic_text |
2131230729 |
public static final int |
pic_timestamp |
2131230730 |
public static final int |
search_button |
2131230722 |
public static final int |
search_posts_edit_text |
2131230721 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
main_layout |
2130903040 |
public static final int |
pic_post |
2130903041 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
pic_poster |
2131165184 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
action_settings |
2131034113 |
public static final int |
add_pic_button_text |
2131034119 |
public static final int |
add_pic_edit_text_hint |
2131034118 |
public static final int |
add_pic_image_description |
2131034117 |
public static final int |
app_name |
2131034112 |
public static final int |
no_pic_text |
2131034114 |
public static final int |
pic_image_description |
2131034120 |
public static final int |
search_button_text |
2131034116 |
public static final int |
search_posts_edit_text_hint |
2131034115 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
AppBaseTheme |
2131099648 |
public static final int |
AppTheme |
2131099649 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
MAX_BITMAP_DIMENSIONS |
50 |
public static final int |
MAX_TEXT_LENGTH |
100 |


Natura Design System for iOS
What for
Library with iOS components defined by Natura Group Design System Team.
Tech Stack
- Swift 5
- Supports iOS 10 to 14
- CocoaPods
- Swift Package Manager
- Fastlane
- Bitrise
- Swiftlint
- Jazzy
NOTE: For versions 6.2.0
and previous, Git-LFS
is also a dependency.
How to Install
CocoaPods
CocoaPods is a dependency manager for Swift and Objective-C Cocoa projects. You can install it with the following command:
gem install cocoapods
You can also check Cocoapods’ installation guide for other options.
To integrate NatDS into your Xcode project using CocoaPods, specify it in your Podfile
:
target '<Your Target Name>' do
pod 'NatDS'
end
Then, run the following command:
pod install
Swift Package Manager
To use NatDS in your project with Swift Package Manager, you need to add it from the Xcode menu.
Follow the path File > Swift Packages > Add Package Dependency
and then provide it the git url for this repository: https://github.com/natura-cosmeticos/natds-ios.git
. Xcode will manage the imports.
How to configure
The library provide the components according to the Design System brand themes, which must be chosen before using the components (usually, at your app’s launch). All themes available are options in the AvailableTheme
enum.
To choose a theme, configure the library with the following code:
DesignSystem().configure(with: AvailableTheme)
Reminder: This step is mandatory. If the Design System is not configured with a brand theme, a
fatalError
will be raised.
How to add icons
This library does not have the Design System icons. Since version 3.0.0
, they’re stored in the icon library NatDSIcons, which can also be used with Cocoapods.
To use the icons, specify their pod in your Podfile
:
target '<Your Target Name>' do
pod 'NatDSIcons'
end
If you’re using a NatDS version older than
3.0.0
there are available icons in the library. Nonetheless, some newer icons won’t be available.NatDSIcons versions
To check all available versions for NatDS Icons, you can check the changelog, or run a pod command from your terminal:
pod search NatDSIcons --simple
Check the documentation on how to use icons in your code.
Sample App
The Sample App has visual and code implementation examples for the Design System’s components and tokens. To run it, download this repository, install its dependencies following the project setup, then build and run.
Check how to use the Sample App.


Born Sinner
Forest Hills Drive 2014
KOD
J Cole
Album
Albums
arrow_drop_down
Album
menu
Cole World
Breakdown the Fayetteville legend


| 004:019 Khan | : |
O you who believe! You are forbidden to inherit women against their will, and you should not treat them with harshness, that you may take away part of the Mahr you have given them, unless they commit open illegal sexual intercourse. And live with them honourably. If you dislike them, it may be that you dislike a thing and Allah brings through it a great deal of good. |
| 004:019 Maulana | : |
O you who believe, it is not lawful for you to take women as heritage against (their) will. Nor should you straiten them by taking part of what you have given them, unless they are guilty of manifest indecency. And treat them kindly. Then if you hate them, it may be that you dislike a thing while Allah has placed abundant good in it. |
| 004:019 Pickthal | : |
O ye who believe! It is not lawful for you forcibly to inherit the women (of your deceased kinsmen), nor (that) ye should put constraint upon them that ye may take away a part of that which ye have given them, unless they be guilty of flagrant lewdness. But consort with them in kindness, for if ye hate them it may happen that ye hate a thing wherein Allah hath placed much good. |
| 004:019 Rashad | : |
O you who believe, it is not lawful for you to inherit what the women leave behind, against their will.  You shall treat them nicely. If you dislike them, you may dislike something wherein GOD has placed a lot of good. |
| 004:019 Sarwar | : |
Believers, it is not lawful for you to inherit women against their will as part of the legacy. Do not create difficulties for your wives in order to force them to give-up part of what you had given to them to set themselves free from the bond of marriage, unless they have clearly committed adultery. Always treat them reasonably. If you dislike them, you could be disliking that which God has filled with abundant good. |
| 004:019 Shakir | : |
O you who believe! it is not lawful for you that you should take women as heritage against (their) will, and do not straiten them m order that you may take part of what you have given them, unless they are guilty of manifest indecency, and treat them kindly; then if you hate them, it may be that you dislike a thing while Allah has placed abundant good in it. |
| 004:019 Sherali | : |
O ye who believe, it is not lawful for you to inherit women against their will, nor should you detain them wrongfully that you may take away part of that which you have given them, except that they be guilty of a flagrant impropriety, and consort with them in kindness, and if you dislike them, it may be that you dislike a thing wherein ALLAH has placed much good. |
| 004:019 Yusufali | : |
O ye who believe! Ye are forbidden to inherit women against their will. Nor should ye treat them with harshness, that ye may Take away part of the dower ye have given them,-except where they have been guilty of open lewdness; on the contrary live with them on a footing of kindness and equity. If ye take a dislike to them it may be that ye dislike a thing, and Allah brings about through it a great deal of good. |
Concepts/Themes Covered: العمل > العمل الطالح > الفاحشة والزنى > الفحشاء Action(Work)> Bad Deeds> Adultry and Atrocity>Atrocity الإنسان والعلاقات الاجتماعية > الأسرة > عضل المرأة Man and The Social Relations>The Family>Treating Women in Harshness that One may Take away part of the Bridal Money تنظيم العلاقات المالية > أموال النساء Organizing Financial Relationships>Women's Property تنظيم العلاقات المالية > الميراث Organizing Financial Relationships>Inheritance
This tool uses eight English parallel translations for the Holy Quran imported from Mr. Clay Smith. You can also visit Qurany Concepts for browsing the Quran themes or topics. If you want to search the Holy Quran for keywords, please visit Qurany Keywords.


Snookes1516.github.io
Nationwide network of resume writers provide resume writing services. Resume writing for all career fields. Interviews guaranteed - ResumeWriters.com. Company Profile Writing Services Company Profile Writer. The Original Resume Writing, Resume Marketing, Recruiting.
Download a Free Company Profile Template - FormFactory.
Company Profile Writing and Designing Services in Delhi, India. Updated world stock indexes. Get an overview of major world indexes, current values and stock market. Company Profile Ref: RPCompanyProfile RPM 20080708 V.2-0.doc Page 3 of 8 Clients Red Pony has provided technical communications services to government departments. Create LinkedIn Company Page Writing Service - Business.
Home page - Ghost Writing Company. We write and install LinkedIn company page with our top rated writing service. Increase B2B sales, marketing, brand via a LinkedIn business.
Best write my essay service that guarantees timely delivery. Order online academic paper help for students. Professionally researched quality custom written. Getting the Best Cheap Fast Resumes.
Buy essay online at professional essay writing service. Order custom research academic papers from the best trusted company. Just find a great help for students
Professional Executive Resume Writing Service. COMPANY PROFILE - Red Pony Communications. When looking for a job, you need to prepare a well-written resume. This best affordable resume writing service will help you craft an outstanding resume. 10 Examples of Company Profile Pages You Can Learn. CV writing service, best CV writers for hire online.  Complete confidentiality. Zero plagiarism. Affordable pricing. Turnaround from 3 hours. KVN Promo - SEO Company Digital Marketing Service. Find company profile writing service now. We have 24 ads under services for company profile writing service, from 2 sites. Want a professional company profile from the best in Nigeria? Short Bios Writing Services - ShortBios.
Company Profile Writing Services - SunTec India. Art2Write is a leading CV,resume writing and distribution company offering professional services in UAE, Dubai, Abu Dhabi, Sharjah, Qatar, Kuwait and Saudi Arabia.
Upwork - Hire Freelancers Get Freelance Jobs Online. 10 Examples of Company Profile Pages You Can Learn From services, and current status While this wasn t a great discovery for me while I was writing. Resume writing company that helps to get a new professional position in any career field. Successful clients worldwide are the best proof of our guarantees. Studybay is an academic writing service for students: essays, term papers, dissertations and much more! We're trusted and chosen by many students all over the world. Content Writing Service: Expert Writers’ Company - CorpWriting. Download a Free Company Profile Template What is a company profile? A company profile (also called a corporate- or business profile) is a professional introduction. We Provide Company profile writing services and Company profile Designing services in Delhi, India. We have Best Company profile Writers and Designers in house.
Editing and Custom Writing Service - Studybay.com.
What next? Let us know about your project, and one of our team will email you prices and timescales. + from short.
Executive Resume Writing Service Best Resume Writer. Professional company profile writing service Polly. CorpWriting is a phenomenal writing service for unique website content. Let your requirement tackled by our creative content writers. Klaxos LinkedIn Profile Resume Writing Services Find the level of service that works for you. Each option includes access to Upwork’s large pool of top-quality freelancers. Choose the level of service Business profile writing service OHMYHOME. Essay Tigers - Online Essay Writing Service. Company Profile Example - Quest Career. Resume Writers com Resume Writing Service - ResumeWriters.com.
CV writing service: enhancing your CV writing for maximizing good opportunities How to get ideal professional CV writing service. Corporate Profile Writing - Company Profile Writers at SunTec offer Business Profile Writing, About Us Page Writing, Company Profile Copywriting Services. Outsource. Ecyrano Online dating profile writing and consulting are offered by e-Cyrano. Write my Essay - Pay Get High Quality Paper Writing Services. Business profile writing service - Change the way you do your assignment with our professional service Benefit from our inexpensive custom essay writing service.
Resume Writing Lab: Resume Professional Writers Service. At our essay writing service we guarantee high quality, on-time delivery and your full satisfaction. Get an awesome DISCOUNT for the first order
We Specialize in Writing Short Biographies - Prompt, Professional, and Inexpensive - for any occupation or purpose. As quickly as you need it, we can write your short. Have no time nor desire to write your college papers? Apply for essay help at our legit, professional writing service. Have your paper written by the best expert.
Art2write - CV Writing Services Dubai, Profesional Resume.
Executive resume writing services by award-winning executive resume writer Laura Smith-Proulx. Former recruiter. LinkedIn profile services by Klaxos. Certified, professional resume and Linkedin optimization. Increase job recruiter views. Yelp 5 stars. 100+ testimonials. Boost. Company profile writing service - The Star Classifieds. Get best SEO Service from Top SEO Company Chennai at affordable budget. KVN Promo is reputed SEO agency brand promotions expert in internet digital marketing. Company profile how to example showing the format and content of a company summary or sample company profile. RighteousRésumés.com Delivers Real Results!
Company Profile Writing Service - kikiotolu.com. Resume writing by credentialed, professionally trained Executive Recruiters since 1988, State of Massachusetts experienced Job Coach, and the published Author Essay Writer - Custom Writing Help with all Papers.
Yes, Executive Résumé Writing is our specialty and we deliver Real Results. Superior Résumé Writing Services in N. Dallas Texas for professionals, managers. I can write a company profile that highlights your achievements, informs your prospects and promotes your service. Hire a company profile writer. Essay Writing Service From Vetted Writers - GradeMiners. Explore all the benefits of using our experienced company profile writing services and be sure of receiving the high-quality results for your business company🌟. Company profile writing service. With extensive experience with Fortune 500 companies, I have been providing professional resumes. Visit us today for Professional Executive Resume Writing Services.


Result
In this ___ patient with LVMI of ___ g/m2 and coronary stenosis of ___ % measured by ___, when systolic blood pressure is being lowered, concurrent reduction of DBP from ___ mmHg to ___ mmHg would result in an estimated drop of ___% in CBF.
Legend
LVMI = Left Ventricular Mass Indexed
DBP = Diastolic Blood Pressure
CATH = Coronary Angiogram
CCTA = Coronary Computed Tomography Angiography
CBF = Coronary Blood Flow


| stringExpn + stringExpn |
var lastName, wholeName : string
lastName := "Austere"
wholeName := "Nancy" + " " + lastName
% The three strings Nancy, a blank and Austere
% catenated together to make the string
% "Nancy Austere". This string becomes the
% value of wholeName
Catenation is sometimes called concatenation.
Catenation can also be applied to char and char(n) values. See char and char(n). If either operand, s or t in s + t, is a string or a dynamic char(n) (length not known at compile time), the result type is string. Otherwise (when both s and t are char or non-dynamic char(n)) the result type is char(n).
The result of catenation is considered to be a compile time value if both operands are compile time values.
If both operands have the type char or char(n) neither of which is a dynamic char(n), the result is of type char(n), which is also of a non dynamic type. This allows the creation of very long char(n) values that can effectively span line boundaries using catenation to join lines. If either operand is a dynamic type or a string type, the catenation produces a string, whose length is limited to 255 characters.
See also string, char, char(n), explicitStringConstant, explicitCharConstant, substring and length.


The exits tab allows you to set the exits and enters of you room as well as assign doors to those exits. The enters list is enterly comprised of items from the static item list on the content tab of the room editor. The exits list contains everything the enterables list has plus several default values for common exits such as north, south, east, west, and so on. Just like inventories on the content page,, the doors list is propgated from the imported door objects in the workspace. You cannot assign a door until after an exit has been established. Take note that exits created in the map view domain show up in the exist list here. As well, you can manually edit the list here and the changes will be reflected in the map view. When you add a door to an exit, the map view will display a little yellow box around the exit node.
SetEnters(mapping)
A collection of static 'objects' that the player can enter using the enter command. The left box contains all the elements created in the static items menu of the content tab. The right box is all of the rooms imported into the workspace.
SetExits(mapping)
The directions the player can exit. Consists of the static items from the content tab plus the default values north, south, east, west, northeast, northwest, souteast, southwest, up, down, and out. Assigning an exit to another room does not assign any exit from that desination back to the current room. Exits are effectively one-way unless you set them as otherwise.
SetDoors(mapping) Notice! This is not a part of default Dead Souls and must be inserted into the mud lib. Read more here.
The door attached to the exits or entrances of this room. Assigning a door to an exit does not cause that door to be assigned to any exit in the attached room.


{% extends "base.html" %} {% block content %}
{% for agent in agents %} {% if agent.can_generate_events %}
Successfully created agent "{{ agent.name }}".
Go back or add another one.


Sell Your Tickets
Supplier's Demand
Designer's Demand
Request
create your own website
Global FW Register
Top fashion designers, fabrics' suppliers and events.
Previous
Next
×
Close
text 2
text 2
text 2
text 2
text 2


Thanks for visiting. As this index page isn't directly linked, it is very brief and simple. You are probably looking for some of my javascript apps:
Or perhaps some data-mining and documentation:
I also make mods for Stardew Valley. They are released on Nexus and source files are on my Github repo. Occasionally I have made very simple mods for forum/reddit requests that are not formally published. Those are linked below:


Meet the Team behind Healthify
TDDC88 Project Page
Management Team
Simon Larsson
Project
Manager
Email
David Nyberg
R&D Manager
Email
Victor Samuelsson
P&S
Manager
Email
Jesper Jissbacke
Process
Manager
Email
Inès Dizengremel
Line
Manager
Email
Development Team
Ludvig Öberg
Lead
Developer
Email
David Forslöf
Architect
Email
Jesper Carlsson
Technical Writer
Email
Martin Dagermo
Developer
Email
Magnus Trouvé Raa
Developer
Email
Sebastian Retzius
Developer
Email
Martin Andersson
Developer
Email
Rabi Chabo
Quality
Coordinator
Email
Erik Voigt
Integrator
Email
Daniel Bissessar
Tester
Email
Analytics Team
Christoffer Johansson
Lead
Analyst
Email
Filip Frenning
Analyst
Email
Mathias Meunier
Analyst
Email
Cecilia Persson
Analyst
Email
UX Designers
Hanna Olofsson
Designer
Email
Edvin Alstéus
Designer
Email
Test Team
Emeli Anjel Lachas
Test Leader
Email
Johan Sundqvist
Tester
Email
Sara Söderberg
Tester
Email


My 20 Highest-Rated Dividend Stocks, No. 16 Through No. 13
by Chuck WalstonSummary
- Readers requested I provide the top stocks in my rating system.
- The companies represent an eclectic mix of dividend bearing firms.
- An outline of the rating system is provided at the end of the article.
Corning Inc.: #16
Corning (NYSE:GLW) possesses a very formidable moat consisting of an R&D budget that dwarfs competitors. Additionally, while the company boasts superior products, the manufacturing process results in lower costs thereby providing better margins. Due to the fragility of glass, transportation of the products is problematic. Consequently, many of Corning's manufacturing facilities are adjacent to those of clients. This results in significant switching costs for customers.
The move to 5G should offer long-term tailwinds for GLW. For my recent article on GLW see here: "Corning: Safe And Steady Wins The Race."
Headwinds
Corning products have high exposure to consumer discretionary spending. Consequently, an economic downturn would have a significant negative impact on the shares. Television sales are slowing resulting in lower demand for some product lines.
Valuation
As I write these lines, GLW shares trade for $28.61.
I rate GLW 29/53. (My rating system is outlined below.) Morningstar provides a fair value of $31. CFRA estimates FV at $24.97, Argus has a target price of $42.
Carnival Corporation: #15
Carnival (NYSE:CCL) has a narrow moat predicated on the sheer size of the company's fleet (over 100 ships) and the cost barrier for entry into the space ($500 million to $1 billion for new ships). As the largest company in the cruise industry, Carnival is also able to attract a variety of clients through the firm's nine global brands.
Carnival is beginning to bring new ships into the fleet fueled by liquefied natural gas. This bodes well for future costs.
The demographic surge represented by retiring baby boomers as well as the growing demand for the Asia-Pacific market will provide long term tailwinds.
Headwinds
Fuel costs are expected to increase in 2020 by a low double-digit percentage. Continued economic uncertainty in Europe presents headwinds.
Valuation
As I write these lines, CCL shares trade for $43.67.
I rate CCL 30/57. (My rating system is outlined below.) Morningstar provides a fair value of $58, CFRA estimates FV at $51.81, Argus rates CCL as a Hold.
Bristol-Myers Squibb Company: #14
Bristol-Myers Squibb (NYSE:BMY) possesses a wide moat in part due to a broad array of patent protected drugs. Unlike some competitors that have a limited product line, BMY can suffer the loss of a drug without as large of an impact on the company's bottom line. Bristol also sells a number of biologics which are difficult for competitors to readily replicate. Add BMY's strong distribution channel and entrenched sales force and you are faced with a formidable competitor in this space.
BMY's recent acquisition of Celgene (NASDAQ:CELG) is expected to be immediately accretive and the added product line provides additional insulation from the loss of patents. Celgene has a focus on cancer drugs which have a strong drug pricing power.
Headwinds
The greatest risk factor is competition to the company's pipeline of immunotherapy drugs.
Valuation
As I compose this article, BMY shares sell for $55.74.
I rate BMY 27/54. (My rating system is outlined below.) Morningstar has a FV of $65, CFRA of $63.83, Argus rates BMY a Hold.
Prudential Financial Inc.: #13
Prudential Financial (NYSE:PRU) is expanding the firm's investment management operations. Prudential's funds have performed well, and this could attract additional business to that segment. This represents a potential area of growth and offers significantly higher returns than the core business.
Prudential returned $1.4 billion to shareholders in the most recent quarter. The lion's share of that sum stemmed from stock buybacks. It is my opinion that the buybacks occurred while the shares traded below fair value, a wise use of the company's resources.
Prudential offers a yield above 4% and boasts 3, 5 and 10 year double-digit dividend growth.
Headwinds
Prudentials' operations in the U.S. and Japan (90% of the firms' overseas operations are in that country) represent mature markets with limited growth prospects. Declining interest rates in the U.S. and negative interest rates in Japan provide significant headwinds.
Valuation
As I compose these lines, PRU shares sell for $93.00.
I rate PRU 30/44. (My rating system is outlined below.) Morningstar has a FV of $110, CFRA of $100.26, Argus has a target price of $102 and credit Suisse of $90.
My Perspective
I have a small position in Prudential and Carnival initiated following my recent investigation into the companies.
I sold a put for GLW with a strike price of $28. If the strike is exercised, it will constitute a small position in that firm.
I will add that I am more sanguine concerning the current direction of the market. This results from my monthly reevaluation of the 180 stocks I monitor. While the number of stocks comprising a five-star rating was reduced to 4 (half the number of last month) the number of companies with scores of 25/41, the minimum score I generally use to conduct due diligence, increased in number by 50%.
I will provide in articles of most (perhaps all) of my top twenty stocks in the coming weeks. Articles listing companies rated 15 through 12 should appear on SA shortly.
Understanding the Rating System
I follow approximately 180 dividend bearing companies. The middle of each month, I review each company and provide an updated score.
For example: BMY is rated 27/54.
The first number represents the Fair Value of the company and measures six valuation metrics. The highest FV score possible is 30. A company is considered significantly undervalued with a so
The second number represents the overall score of the company. This takes into account the moat, management, past and projected growth rates, financial strength, historic ROIC, and valuation of the company. The highest score possible is a 65. A score in the 50s is rare.
The rating system is far from foolproof; however, my initial testing (it has been in use for a year) indicates a combined score of 25/41 provides investment targets that often outperform the market. The overwhelming majority of companies score far below 25/41.
In this article, you may note that the highest rated stock may be ranked below a company with a lower rating. That is because I weigh other factors when ranking the company in question. Nonetheless, the rating score plays a large role in how I assess the likelihood of a company performing well over the long term.
Additional information regarding the rating system can be found in my article highlighting companies rated 20 through 17.
One Last Word
I hope to continue providing my articles without cost to SA readers. If you found this article of value, I would greatly appreciate your following me (above near the title) and/or pressing "Like this article" just below. This will aid me greatly in continuing to write for SA. Best of luck in your investing endeavors.
Additional Information
I have no formal training in investing. All articles are my personal perspective on a given prospective investment and should not be considered as investment advice. Due diligence should be exercised, and readers should engage in additional research and analysis before making their own investment decision. All relevant risks are not covered in this article. Readers should consider their own unique investment profile and consider seeking advice from an investment professional before making an investment decision.
Disclosure: I am/we are long PRU CCL. I wrote this article myself, and it expresses my own opinions. I am not receiving compensation for it (other than from Seeking Alpha). I have no business relationship with any company whose stock is mentioned in this article.


Unique Sorted Associative Container
|
|
| Category: containers |
Component type: concept |
Description
A Unique Sorted Associative Container is a Sorted Associative
Container that is also a Unique Associative Container. That is,
it is a Sorted Associative Container with the property that no two
elements in the container have the same key.
Refinement of
Sorted Associative Container,
Unique Associative Container
Associated types
None, except for those described in the
Sorted Associative Container
and Unique Associative Container
requirements.
Notation
|
X
|
A type that is a model of Unique Sorted Associative Container
|
|
a
|
Object of type X
|
|
t
|
Object of type X::value_type
|
|
k
|
Object of type X::key_type
|
|
p, q
|
Object of type X::iterator
|
|
c
|
Object of type X::key_compare
|
Definitions
Valid expressions
In addition to the expressions defined in
Sorted Associative Container and
Unique Associative Container,
the following expressions must be valid.
|
Name
|
Expression
|
Type requirements
|
Return type
|
|
Range constructor
|
X(i, j)
X a(i, j);
|
i and j are Input Iterators whose value type is convertible
to T [1].
|
|
|
Range constructor with compare
|
X(i, j, c)
X a(i, j, c);
|
i and j are Input Iterators whose value type is convertible
to T [1]. c is an object of type key_compare.
|
|
|
Insert with hint
|
a.insert(p, t)
|
|
iterator
|
|
Insert range
|
a.insert(i, j)
|
i and j are Input Iterators whose value type is convertible
to X::value_type. [1]
|
void
|
Expression semantics
|
Name
|
Expression
|
Precondition
|
Semantics
|
Postcondition
|
|
Range constructor
|
X(i, j)
X a(i, j);
|
[i,j) is a valid range.
|
Creates an associative container that contains all of the elements in the range [i,j)
that have unique keys. The comparison object used by the container
is key_compare().
|
size() is less than or equal to the distance from i to j.
|
|
Range constructor with compare
|
X(i, j, c)
X a(i, j, c);
|
[i,j) is a valid range.
|
Creates an associative container that contains all of the elements in the range [i,j)
that have unique keys. The comparison object used by the container
is c.
|
size() is less than or equal to the distance from i to j.
|
|
Insert with hint
|
a.insert(p, t)
|
p is a nonsingular iterator in a.
|
Inserts t into a if and only if a does not already contain
an element whose key is equivalent to t's key. The argument p is a hint:
it points to the location where the search will begin. The return
value is a dereferenceable iterator that points to the element with
a key that is equivalent to that of t.
|
a contains an element whose key is the same as that of t.
The size of a is incremented by either 1 or 0.
|
|
Insert range
|
a.insert(i, j)
|
[i, j) is a valid range.
|
Equivalent to a.insert(t) for each object t that is pointed to
by an iterator in the range [i, j). Each element is inserted into
a if and only if a does not already contain an element with
an equivalent key.
|
The size of a is incremented by at most j - i.
|
Complexity guarantees
The range constructor, and range constructor with compare, are in
general O(N * log(N)), where N is the size of the range. However,
they are linear in N if the range is already sorted by
value_comp().
Insert with hint is logarithmic in general, but it is amortized
constant time if t is inserted immediately before p.
Insert range is in general O(N * log(N)), where N is the size of
the range. However, it is linear in N if the range is already
sorted by value_comp().
Invariants
|
Strictly ascending order
|
The elements in a Unique Sorted Associative Container are always arranged
in strictly ascending order by key. That is, if a is a Unique Sorted
Associative Container, then is_sorted(a.begin(), a.end(),
a.value_comp()) is always true. Furthermore, if i and j
are dereferenceable iterators in a such that i precedes j,
then a.value_comp()(*i, *j) is always true. [2]
|
Models
Notes
[1]
At present (early 1998), not all compilers support
"member templates". If your compiler supports member
templates then i and j may be of any type that
conforms to the Input Iterator
requirements. If your compiler does not yet support member
templates, however, then i and j must be of type
const T* or of type X::const_iterator.
[2]
This is a more stringent invariant than that of
Sorted Associative Container.
In a Sorted Associative Container
we merely know that every element is less
than or equal to its successor; in a
Unique Sorted Associative Container, however,
we know that it must be less than its successor.
See also
Associative Container,
Sorted Associative Container,
Multiple Sorted Associative Container,
Hashed Associative Container
Copyright © 1996 Silicon Graphics, Inc.
|


--- title: rotate sidebar: function_reference_sidebar permalink: triplePointList.rotate.html folder: function_reference toc: false ---
rotate triple points
| tP | triplePointList |
| angle | double |
| rot | rotation |
| tP | triplePointList |
| center | [x,y] center of rotation, default is (0,0) |
| keepXY | rotate only the orientation data, i.e. the Euler angles |
| keepEuler | rotate only the spatial data, i.e., the x,y, and z values |


Skilled & creative UI/UX developer. Desktop apps are his specialty. Web apps are his future.
A developer that brings a unique and fresh perspective.
He's an outside the box thinker and a curious individual.
Strong willed with a propensity to do things a better way...the right way.
Want to know what makes Jason tick?
Download his technical resume here.
DownloadThis page is always a work in progress, so please check back for updates or changes. Feel free to email Jason to provide some feedback, give him suggestions, or to just say hello!


log4javascript
home
|
download
|
docs
|
quick start
|
demos
|
website
|
timdown.co.uk
log4javascript demos
Basic demo
In-page console demo
log4javascript Lite demo