I'm a Full Stack Developer from Nairobi, Kenya. Am also a freelance graphic designer with extensive experience in the information technology and services industry. I have a knack for user experience and beautiful interfaces with a focus in becoming a fully-fledged Fullstack Developer.
Below are some of the projects that I have gotten opportunity to work on.
My extensive experience has enabled me to pick a lot of skills. Below,
are the main ones that I am proficient in.
I do graphic designing using mainly Adobe Photoshop and Adobe Illustrator. I also have experience in Corel Draw and in printing.
I use pen and paper to conceptualize web wireframes and Figma to create prototypes. I develop web applications using Django for backend and Angular for frontend. I can also do WordPress websites.
I use Buffer to manage social media pages, create posts for different social media pages, reply to messages and monitor performance of social media pages.


2016 Computer Science Homework
This site contains the index page(Home page,) the Game page, where the game "Fly Fly Little Bird" is presented, and the Reference Page, where all resources of knowledge and material used to build this website is acknowledged.
It is the second homework assignment of the Computer Science class I took in the academic year of 2015. The assignment has been challenging mostly due to my unfamiliarity with coding, but the result was satisfying. Also I have learned alot about HTML, CSS, and Javascript from this. I wish to further my learning in programming by using the website w3schools.com where I could gain a certificate in HTML, CSS, and Javascript. This has been a very enjoyable class.


ATTRIBUTE_VALUE_TEXT_CLEANER
Documentation du Custom Transformer FME
Description
This custom transformer cleans all string attributes by performing the followin tasks:
- Remove html directive (ex.:

bla bla bla <\p>
) so that the string contains only plain text - Replace special character (carriage return, line feed, tab) by white spaces
- Replace curly braces {} by parenthesis
- Removing front and trailing white spaces
- Replace multiple white spaces by only one white space
Input Ports
INPUT: The input metadata records to clean
Output Ports
OUTPUT: The cleaned output metdata records
Parameters
None
Documentation du code ATTRIBUTE_VALUE_TEXT_CLEANER.py
|
Class that serves as the basis for parsing text files formatted in HTML (More informations:) |
Cleans all string attributes by performing the followin tasks: |
- class ATTRIBUTE_VALUE_TEXT_CLEANER.HTMLFilter(*, convert_charrefs=True)[source]
Bases:
html.parser.HTMLParser
Class that serves as the basis for parsing text files formatted in HTML (More informations:)
Notes
- textstr
Class variable needed to parse the html string.
- handle_data(data)[source]
This method is called to process arbitrary data (e.g. text nodes and the content of  and ).
- Parameters
data (str) – The data to process
- Returns
self.text – The parsed data
- Return type
str
- text = ''
- ATTRIBUTE_VALUE_TEXT_CLEANER.processFeature(feature)[source]
Cleans all string attributes by performing the followin tasks:
Remove html directive (ex.:
bla bla bla
) so that the string contains only plain text
Replace special character (carriage return, line feed, tab) by white spaces
Replace curly braces {} by parenthesis
Removing front and trailing white spaces
Replace multiple white spaces by only one white space
- Parameters
feature (FME feature) – FME feature to process
- Returns
feature – FME feature who’s attributes have been processed accordingly
- Return type
FME feature


ArchDaily Topics - November: Under The Radar
- by Nicolás Valencia
- about 15 hours
As architects, curators and readers we are always interested in knowing and disseminating the latest trends in architecture, healing the best of architecture around the world and chatting and meeting those who build our cities in English, Spanish, Portuguese and Chinese. However, as much as we try, we will always be ignoring something. In that sense, our only certainty is that the more we know, the more we will ignore.
How many times do we assume the properties of certain materials or maintain prejudices about certain countries just because we ignore them or have not spent time researching? What could inspire us if we knew more about the use of brick in Iran or knowing the main challenges of the architecture of the Global South? What techniques, designs and analysis do we share with cities in climates similar to ours, but in other latitudes and cultures? What local technologies are still relevant in cities, beyond what we really know?
It is time to open our minds. As a team we want to bring to light trends, stories, technologies, faces, voices and ideas that inspire us and make us know a little more about this great planet.
Do you think you know everything? Think again.
That is why we dedicate this month to the theme of Under The Radar. We are now receiving submissions related to our Monthly Topics. For our next issue, in December, we will review the world of architecture this year. In this dialogue about the future of architecture, we always want to hear about your ideas, projects, essays, and articles, so get in touch by sending us a message.


Protein KnotsThe knot server allows the user to check pdb entries or uploaded structures for
knots and to visualize them. The size of a knot is determined by deleting amino
acids from both ends. This procedure is, however, not perfect and the resulting
size should only be treated as a guideline.
List of known knots
How we define knotsReferences
Questions about particular knots? Contact Peter Virnau.
Contact webmaster


Why Automate Code Reviews?
September 6, 2015 · 1 minute read · CommentsAsk a programmer to review 10 lines of code, they’ll make 10 suggestions. Ask them to review 1,000 lines of code and they’ll say “it looks good!”
Many people have begun integrating bots into the GitHub ecosystem for code review. For example the folks who created the Bootstrap UI framework created a bot called rorshach to perform sanity checks on pull requests. If the sanity check fails it leaves a nice informative comment, explaining the issue and how to fix it.
Read On


Instagram Picture URL:
Generate
Picture with border
Border color:
Download picture
Original picture
Download original


Hi! I'm David, a developer capable to handle the Holy Trinity: HTML, CSS and JavaScript.
I can work in a Linux environment and to collaborate using Git and GitHub.
On the other hand, I'm a physics student and I can help with the maths.
Contact me!
Hi! I'm David, a developer capable to handle the Holy Trinity: HTML, CSS and JavaScript.
I can work in a Linux environment and to collaborate using Git and GitHub.
On the other hand, I'm a physics student and I can help with the maths.
Contact me!


Let’s begin the conversation
Join the fastest-growing medical tourism corporate in Mexico
--- title: Start Your Career in Medical Tourism Here | Sani Medical Tourism description: Be part of the fastest-growing medical tourism network in Mexico. Join Sani Medical Tourism and start your career in the Medical Tourism Industry. layout: default ---
Join the fastest-growing medical tourism corporate in Mexico


Array Data Accessor Interface 1 (ADAI1) is a data-I/O interface, mainly implemented by data container objects of language processor systems.
In this org.vcssl.connect package, multiple data I/O interfaces are provided for passing/receiving data without any data-conversions, between script-engine-side and plug-in-side, if required.
In them, this interface ADAI1 provides I/O methods of multi-dimensional array data.
The status of this interface is "FINALIZED".
The specification of this interface had been finalized at 2022/08/31. No modifications will be applied for this interface, excluding documents/comments.
This interface is currently supported by the scripting engine of Vnano. You can use this interface for development of plug-ins of applications equipped with the Vnano engine.
This interface is published under CC0, which is almost the same as the so-called "copyright-free" (domain).
This interface has a type parameter T, which should be specified when instantiate a class implementing this interface, as follows:
ArrayDataAccessorInterface1<double[]> instance = new ImplClass<double[]>();
Whete "ImplClass" implements this ADAI 1 interface. In the above, "double[]" is the type parameter.
In this document, we describe the type parameter as "T".
| Name | INTERFACE_TYPE_ID |
|---|---|
| Value | The type ID of this interface (value: "ADAI") referred when the plug-in will be loaded. |
| Type | static final String |
| Name | INTERFACE_GENERATION |
|---|---|
| Value | The generation of this interface (value: "1"). |
| Type | static final String |
| Name | ARRAY_SIZE_OF_SCALAR |
|---|---|
| Value | The value of the size of a scalar value (value: 1). |
| Type | static final int |
| Name | ARRAY_RANK_OF_SCALAR |
|---|---|
| Value | The number of dimensions (array-rank) of a scalar value (value: 0). |
| Type | static final int |
| Name | ARRAY_LENGTHS_OF_SCALAR |
|---|---|
| Value | An array storing dimension-lengths of a scalar value (value: { }). |
| Type | static final int[ ] |
| Name | setArrayData |
|---|---|
| Signature | void setArrayData(T data, int offset, int[] lengths) |
| Description |
Sets the serialized 1D array data with related information. On this interface, contents of any data including a scalar value, an 1-dimensional (1D) array, and a multi-dimensional array are always handled as an 1D array, so specify an 1D array for the argument "data". We call it as "serialized 1D array data" in this document. When set a scalar value: For the argument "data", specify an 1D array in which the scalar value is stored as an element, at any index. In addition, specify the array-index of the stored scalar value to the argument "offset". For the argument "lengths", specify an empty array of which length is 0 (so we regard an scalar value as a "0-dimensional array" on this interface). When set 1-dimensional array data: For the argument "data", specify the 1-D array data as it is. For the argument "offset", always specify 0. For the argument "lengths", specify an array of which length is 1, and stores the length of array data (specified to the argument "data") at [0]. When set multi-dimensional array data: For the argument "data", specify the serialized 1D array in which data of multi-dimensional array is aligned in the form of:
(The case of 2D array: multiDimArray[N1][N2])
data[ index1D ] = multiDimArray[ multiIndex1 ][ multiIndex2 ] Where "index1D" is determined as follows: index1D = N2*multiIndex1 + multiIndex3
(The case of 3D array: multiDimArray[N1][N2][N3])
data[ index1D ] = multiDimArray[ multiIndex1 ][ multiIndex2 ][ multiIndex3 ] Where "index1D" is determined as follows: index1D = N3*N2*multiIndex1 + N3*multiIndex2 + multiIndex3
(The case of 4D array: multiDimArray[N1][N2][N3][N4])
...
data[ index1D ] = multiDimArray[ multiIndex1 ][ multiIndex2 ][ multiIndex3 ][ multiIndex4 ] Where "index1D" is determined as follows: index1D = N4*N3*N2*multiIndex1 + N4*N3*multiIndex2 + N4*multiIndex3 + multiIndex4 For the argument "offset", always specify 0. For the argument "lengths", specify an array of which length equals to the number of dimensions of the serialized 1D data array, and stores lengths of each dimension, where [0] represents the length of most-left dimension, and [max] represents the length of most-right dimension (so specify {N1, N2, N3} for 3D array data of which lengths are [N1][N2][N3]). By the way, methods for setting a value "data", "offset", or "lengths" independently are not provided, for preventing inconsistency between them (never allowed even for a moment). |
| Parameters |
data: The serialized 1D array data to be set (see the above explanation).
offset: The index at with the scalar value is stored. lengths: An array storing lengths of each dimension (see the above explanation). |
| Return | None |
| Name | getArrayData |
|---|---|
| Signature | T getArrayData() |
| Description |
Returns the serialized 1D the array data.
How a scalar or a multi dimensional array is stored in the serialized 1D array data is explained in the section of setArrayData method. |
| Parameters | None |
| Return | The serialized 1D array data. |
| Name | hasArrayData |
|---|---|
| Signature | boolean hasArrayData() |
| Description | Returns whether any serialized 1D array data can be gotten. |
| Parameters | None |
| Return | Returns true if any serialized 1D array data can be gotton. |
| Name | getArrayOffset |
|---|---|
| Signature | int getArrayOffset() |
| Description | Returns the index of the scalar value in the serialized 1D array data. For details, see the description of setArrayData method. |
| Parameters | None |
| Return | The index of the scalar value in the serialized 1D array data. |
| Name | getArrayLengths |
|---|---|
| Signature | int[] getArrayLengths() |
| Description | Returns the array storing lengths of dimensions of the array. For details, see the description of setArrayData method. |
| Parameters | None |
| Return | The array storing lengths of dimensions of the array. |
| Name | getArraySize |
|---|---|
| Signature | int getArraySize() |
| Description |
Returns the size (lenth) of the serialized 1D array data.
When data is a scalar value, the size always is 1. When data is an 1-dimensional array, the size is its length. When data is a multi-dimensional array of which lengths are [N1][N2][N3]...[NM], the size is the value of the product of them: N1*n2*n3*...*NM. |
| Parameters | None |
| Return | The size (lenth) of the serialized 1D array data. |
| Name | getArrayRank |
|---|---|
| Signature | int getArrayRank() |
| Description |
Returns the number of dimensions (array-rank) of the array.
When data is a scalar value, the array-rank always is 0. When data is an 1-dimensional array, the array-rank always is 1. When data is an N-dimensional array, the array-rank is N. |
| Parameters | None |
| Return | The number of dimensions (array-rank) of multi-dimensional array data. |


Open a new window, and resize the width and height to 250px:
Tip: Press the "Resize window" multiple times (the window will increase 250px for each press).


Document Information
Preface
Part I Introduction
1. Overview
2. Using the Tutorial Examples
Part II The Web Tier
3. Getting Started with Web Applications
4. JavaServer Faces Technology
5. Introduction to Facelets
6. Expression Language
7. Using JavaServer Faces Technology in Web Pages
8. Using Converters, Listeners, and Validators
9. Developing with JavaServer Faces Technology
10. JavaServer Faces Technology: Advanced Concepts
11. Using Ajax with JavaServer Faces Technology
12. Composite Components: Advanced Topics and Example
13. Creating Custom UI Components and Other Custom Objects
14. Configuring JavaServer Faces Applications
15. Java Servlet Technology
16. Java Servlet Technology: Advanced Topics
17. Internationalizing and Localizing Web Applications
Part III Web Services
18. Introduction to Web Services
19. Building Web Services with JAX-WS
20. Building RESTful Web Services with JAX-RS
21. JAX-RS: Advanced Topics and Example
Part IV Enterprise Beans
22. Enterprise Beans
23. Getting Started with Enterprise Beans
24. Running the Enterprise Bean Examples
25. A Message-Driven Bean Example
26. Using the Embedded Enterprise Bean Container
27. Using Asynchronous Method Invocation in Session Beans
Part V Contexts and Dependency Injection for the Java EE Platform
28. Introduction to Contexts and Dependency Injection for the Java EE Platform
29. Running the Basic Contexts and Dependency Injection Examples
30. Contexts and Dependency Injection for the Java EE Platform: Advanced Topics
31. Running the Advanced Contexts and Dependency Injection Examples
Part VI Persistence
32. Introduction to the Java Persistence API
33. Running the Persistence Examples
34. The Java Persistence Query Language
35. Using the Criteria API to Create Queries
36. Creating and Using String-Based Criteria Queries
37. Controlling Concurrent Access to Entity Data with Locking
38. Improving the Performance of Java Persistence API Applications By Setting a Second-Level Cache
Part VII Security
39. Introduction to Security in the Java EE Platform
40. Getting Started Securing Web Applications
41. Getting Started Securing Enterprise Applications
42. Java EE Security: Advanced Topics and Example
Part VIII Java EE Supporting Technologies
43. Introduction to Java EE Supporting Technologies
44. Transactions
45. Resources and Resource Adapters
46. Running the Resource Adapter Example
47. Java Message Service Concepts
48. Java Message Service Examples
49. Bean Validation: Advanced Topics
50. Using Java EE Interceptors
Part IX Case Studies
51. Duke's Bookstore Case Study Example
52. Duke's Tutoring Case Study Example
53. Duke's Forest Case Study Example
Index
|
|
Q
- qualifiers, using in CDI, Using Qualifiers
- Quality of Service, Characteristics of Application Security
- query language
- ABS function, Functional Expressions
- abstract schemas
- Query Language Terminology
- Select Statements
- Range Variable Declarations
- ALL expression, Subqueries
- ANY expression, Subqueries
- arithmetic functions, Functional Expressions
- ASC keyword, ORDER BY Clause
- AVG function, Return Types
- BETWEEN expression
- The BETWEEN Expression
- BETWEEN Expressions
- Boolean literals, Literals
- Boolean logic, NULL Values
- case expressions, Case Expressions
- collection member expressions
- Collection Member Declarations
- Collection Member Expressions
- collections
- Collection Member Declarations
- Empty Collection Comparison Expressions
- Collection Member Expressions
- compared to SQL
- Queries That Navigate to Related Entities
- Identifiers
- Path Expressions
- comparison operators
- Comparison Operators
- BETWEEN Expressions
- CONCAT function, Functional Expressions
- conditional expressions
- Queries with Other Conditional Expressions
- WHERE Clause
- Conditional Expressions
- Equality Semantics
- constructors, Constructor Expressions
- COUNT function, Return Types
- DELETE expression
- Bulk Updates and Deletes
- Delete Queries
- DELETE statement, Update and Delete Statements
- DESC keyword, ORDER BY Clause
- DISTINCT keyword, Eliminating Duplicate Values
- domain of query
- The Java Persistence Query Language
- FROM Clause
- Identification Variables
- duplicate values, Eliminating Duplicate Values
- enum literals, Literals
- equality, Equality Semantics
- ESCAPE clause, LIKE Expressions
- examples
- Using Queries
- Example Queries
- EXISTS expression, Subqueries
- FETCH JOIN operator, Joins
- FROM clause
- Select Statements
- FROM Clause
- grammar, Full Query Language Syntax
- GROUP BY clause
- Select Statements
- GROUP BY and HAVING Clauses
- HAVING clause
- Select Statements
- GROUP BY and HAVING Clauses
- identification variables
- Select Statements
- FROM Clause
- Identification Variables
- identifiers, Identifiers
- INNER JOIN operator, Joins
- IN operator
- Joins
- IN Expressions
- input parameters
- Traversing Relationships with an Input Parameter
- Input Parameters
- IS EMPTY expression, The IS EMPTY Expression
- IS FALSE operator, Equality Semantics
- IS NULL expression, The IS NULL Expression
- IS TRUE operator, Equality Semantics
- JOIN statement
- A Simple Query with Relationships
- Navigating to Single-Valued Relationship Fields
- Joins
- LEFT JOIN operator, Joins
- LEFT OUTER JOIN operator, Joins
- LENGTH function, Functional Expressions
- LIKE expression
- The LIKE Expression
- LIKE Expressions
- literals, Literals
- LOCATE function, Functional Expressions
- LOWER function, Functional Expressions
- MAX function, Return Types
- MEMBER expression, Collection Member Expressions
- MIN function, Return Types
- MOD function, Functional Expressions
- multiple declarations, Identification Variables
- multiple relationships, Traversing Multiple Relationships
- named parameters
- Using Named Parameters
- Input Parameters
- navigation
- Queries That Navigate to Related Entities
- A Simple Query with Relationships
- Navigating According to Related Fields
- Range Variable Declarations
- Navigation
- negation, Equality Semantics
- NOT operator, Equality Semantics
- null values
- NULL Comparison Expressions
- NULL Values
- numeric comparisons, Equality Semantics
- numeric literals, Literals
- operator precedence, Operators and Their Precedence
- operators, Operators and Their Precedence
- ORDER BY clause
- Select Statements
- ORDER BY Clause
- parameters, Eliminating Duplicate Values
- parentheses, Conditional Expressions
- path expressions
- Query Language Terminology
- Path Expressions
- positional parameters, Input Parameters
- range variables, Range Variable Declarations
- relationship fields, Query Language Terminology
- relationships
- Query Language Terminology
- A Simple Query with Relationships
- Traversing Relationships with an Input Parameter
- return types, Return Types
- root, Range Variable Declarations
- scope, The Java Persistence Query Language
- SELECT clause
- Select Statements
- SELECT Clause
- setNamedParameter method, Using Named Parameters
- SIZE function, Functional Expressions
- SQRT function, Functional Expressions
- state fields, Query Language Terminology
- string comparison, Equality Semantics
- string functions, Functional Expressions
- string literals, Literals
- subqueries, Subqueries
- SUBSTRING function, Functional Expressions
- SUM function, Return Types
- syntax
- Simplified Query Language Syntax
- Full Query Language Syntax
- TRIM function, Functional Expressions
- types
- Expression Types
- Equality Semantics
- UPDATE expression
- Update and Delete Statements
- Bulk Updates and Deletes
- Update Queries
- UPPER function, Functional Expressions
- WHERE clause
- Select Statements
- WHERE Clause
- wildcards, LIKE Expressions
- query parameters
- JAX-RS
- Extracting Request Parameters
- Extracting Query Parameters
- query roots, Query Roots
- QueueBrowser interface, JMS Queue Browsers
- JMS client example, A Simple Example of Browsing Messages in a Queue
- Queue interface, JMS Destinations
- queues, JMS Destinations
- browsing
- JMS Queue Browsers
- A Simple Example of Browsing Messages in a Queue
- creating
- JMS Destinations
- To Create JMS Resources Using NetBeans IDE
- injecting resources, The simplemessage Application Client
- temporary
- Creating Temporary Destinations
- Coding the Application Client: HumanResourceClient.java
Copyright © 2012, Oracle and/or its affiliates. All rights reserved. Legal Notices
|


--- layout: default ---
Internet Engineering Task Force (IETF) W. Dec, Ed. Request for Comments: 6911 Cisco Systems, Inc. Category: Standards Track B. Sarikaya ISSN: 2070-1721 Huawei USA G. Zorn, Ed. Network Zen D. Miles Google B. Lourdelet Juniper Networks April 2013 RADIUS Attributes for IPv6 Access Networks Abstract This document specifies additional IPv6 RADIUS Attributes useful in residential broadband network deployments. The Attributes, which are used for authorization and accounting, enable assignment of a host IPv6 address and an IPv6 DNS server address via DHCPv6, assignment of an IPv6 route announced via router advertisement, assignment of a named IPv6 delegated prefix pool, and assignment of a named IPv6 pool for host DHCPv6 addressing. Status of This Memo This is an Internet Standards Track document. This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Further information on Internet Standards is available in Section 2 of RFC 5741. Information about the current status of this document, any errata, and how to provide feedback on it may be obtained at http://www.rfc-editor.org/info/rfc6911. Dec, et al. Standards Track [Page 1] RFC 6911 RADIUS IPv6 Access April 2013 Copyright Notice Copyright (c) 2013 IETF Trust and the persons identified as the document authors. All rights reserved. This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (http://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Simplified BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Simplified BSD License. Table of Contents 1.                       Introduction
This document specifies additional RADIUS Attributes used to support configuration of DHCPv6 and/or ICMPv6 Router Advertisement (RA) parameters on a per-user basis. The Attributes, which complement those defined in [RFC3162] and [RFC4818], support the following: o The assignment of specific IPv6 addresses to hosts via DHCPv6. o The assignment of an IPv6 DNS server address, via DHCPv6 or Router Advertisement [RFC6106]. o The configuration of more specific routes to be announced to the user via the Route Information Option defined in [RFC4191], Section 2.3. o The assignment of a named delegated prefix pool for use with "IPv6 Prefix Options for Dynamic Host Configuration Protocol (DHCP) version 6" [RFC3633]. o The assignment of a named stateful address pool for use with DHCPv6 stateful address assignment [RFC3315].1.1. Requirements Language
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in RFC 2119 [RFC2119].2. Deployment Scenarios
The extensions in this document are intended to be applicable across a wide variety of network access scenarios in which RADIUS is involved. One such typical network scenario is illustrated in Figure 1. It is composed of an IP Routing Residential Gateway (RG) or host; a Layer 2 Access Node (AN), e.g., a Digital Subscriber Line Access Multiplexer (DSLAM); an IP Network Access Server (NAS) (incorporating an Authentication, Authorization, and Accounting (AAA) client); and a AAA server. Dec, et al. Standards Track [Page 3] RFC 6911 RADIUS IPv6 Access April 2013 +-----+ | AAA | | | +--+--+ ^ . .(RADIUS) . v +------+ +---+---+ +------+ | | | | | RG/ +-------| AN +-----------+----------+ NAS | | host | | | | | +------+ (DSL) +------+ (Ethernet) +-------+ Figure 1 In the depicted scenario, the NAS may utilize an IP address configuration protocol (e.g., DHCPv6) to handle address assignment to RGs/hosts. The RADIUS server authenticates each RG/host and returns the Attributes used for authorization and accounting. These Attributes can include a host's IPv6 address, a DNS server address, and a set of IPv6 routes to be advertised via any suitable protocol, e.g., ICMPv6 (Neighbor Discovery). The name of a prefix pool to be used for DHCPv6 Prefix Delegation or the name of an address pool to be used for DHCPv6 address assignment can also be Attributes provided to the NAS by the RADIUS AAA server. The following subsections discuss how these Attributes are used in more detail.2.1. IPv6 Address Assignment
DHCPv6 [RFC3315] provides a mechanism to assign one or more non- temporary IPv6 addresses to hosts. To provide a DHCPv6 server residing on a NAS with one or more IPv6 addresses to be assigned, this document specifies the Framed-IPv6-Address Attribute (Section 3.1). While [RFC3162] permits the specification of an IPv6 address via the combination of the Framed-Interface-Id and Framed-IPv6-Prefix Attributes, this separation is more natural for use with PPP's IPv6 Control Protocol than it is for use with DHCPv6, and the use of a single IPv6 address Attribute makes for easier processing of accounting records. Dec, et al. Standards Track [Page 4] RFC 6911 RADIUS IPv6 Access April 2013 Because DHCPv6 can be deployed on the same network as ICMPv6 stateless address autoconfiguration (SLAAC) [RFC4862], it is possible that the NAS will require both stateful and stateless configuration information. Therefore, it is possible for the Framed-IPv6-Address, Framed-IPv6-Prefix, and Framed-Interface-Id Attributes [RFC3162] to be included within the same packet. To avoid ambiguity in this case, the Framed-IPv6-Address Attribute is intended for authorization and accounting of DHCPv6-assigned addresses, and the Framed-IPv6-Prefix and Framed-Interface-Id Attributes are used for authorization and accounting of addresses assigned via SLAAC.2.2. DNS Servers
DHCPv6 provides an option for configuring a host with the IPv6 address of a DNS server. The IPv6 address of a DNS server can also be conveyed to the host using ICMPv6 with Router Advertisements, via the Recursive DNS Server Option [RFC6106]. To provide the NAS with the IPv6 address of one or more DNS servers, this document specifies the DNS-Server-IPv6-Address Attribute (Section 3.2).2.3. IPv6 Route Information
The IPv6 Route Information Option [RFC4191], is intended to be used to inform a host connected to the NAS that a specific route is reachable via any given NAS. This document specifies the Route-IPv6-Information Attribute (Section 3.3) that allows the AAA server to provision the announcement by the NAS of a specific Route Information Option to an accessing host. The NAS may advertise this route using the method defined in RFC 4191 or other equivalent methods. Any other information, such as preference or lifetime values, that is to be present in the actual announcement using a given method is assumed to be determined by the NAS using means not specified by this document (e.g., local configuration on the NAS). While the Framed-IPv6-Prefix Attribute ([RFC3162], Section 2.3) allows the route to be advertised in an RA, it cannot be used to configure more specific routes. While the Framed-IPv6-Route Attribute ([RFC3162], Section 2.5) causes the route to be configured on the NAS and potentially to be announced via an IP routing protocol, depending on the value of Framed-Routing, it does not result in the route being announced in an RA. Dec, et al. Standards Track [Page 5] RFC 6911 RADIUS IPv6 Access April 20132.4. Delegated IPv6 Prefix Pool
DHCPv6 Prefix Delegation (DHCPv6-PD) [RFC3633] involves a delegating router selecting a prefix and delegating it on a temporary basis to a requesting router. The delegating router may implement a number of strategies as to how it chooses what prefix is to be delegated to a requesting router, one of them being the use of a local named prefix pool. The Delegated-IPv6-Prefix-Pool Attribute (Section 3.4) allows the RADIUS server to convey a prefix pool name to a NAS that is hosting a DHCPv6-PD server and that is acting as a delegating router. Because DHCPv6 Prefix Delegation can be used with SLAAC on the same network, it is possible for the Delegated-IPv6-Prefix-Pool and Framed-IPv6-Pool Attributes to be included within the same packet. To avoid ambiguity in this scenario, use of the Delegated-IPv6- Prefix-Pool Attribute should be restricted to authorization and accounting of prefix pools used in DHCPv6 Prefix Delegation, and the Framed-IPv6-Pool Attribute should be used for authorization and accounting of prefix pools used in SLAAC.2.5. Stateful IPv6 Address Pool
DHCPv6 [RFC3315] provides a mechanism to assign one or more non- temporary IPv6 addresses to hosts. Section 3.1 introduces the Framed-IPv6-Address Attribute to be used to provide a DHCPv6 server residing on a NAS with one or more IPv6 addresses to be assigned to the clients. An alternative way to achieve a similar result is for the NAS to select the IPv6 address to be assigned from an address pool configured for this purpose on the NAS. This document specifies the Stateful-IPv6-Address-Pool Attribute (Section 3.5) to allow the RADIUS server to convey a pool name to be used for such stateful DHCPv6-based addressing and for any subsequent accounting.3. Attributes
The fields shown in the diagrams below are transmitted from left to right.3.1. Framed-IPv6-Address
The Framed-IPv6-Address Attribute indicates an IPv6 address that is assigned to the NAS-facing interface of the RG/host. It MAY be used in Access-Accept packets and MAY appear multiple times. It MAY be used in an Access-Request packet as a hint by the NAS to the RADIUS server that it would prefer this IPv6 address, but the RADIUS server is not required to honor the hint. Because it is assumed that the Dec, et al. Standards Track [Page 6] RFC 6911 RADIUS IPv6 Access April 2013 NAS will add a route corresponding to the address, it is not necessary for the RADIUS server to also send a host Framed-IPv6-Route Attribute for the same address. This Attribute can be used by a DHCPv6 process on the NAS to assign a unique IPv6 address to the RG/host. A summary of the Framed-IPv6-Address Attribute format is shown below. The format of the Address field is identical to that of the corresponding field in the NAS-IPv6-Address Attribute [RFC3162]. 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type | Length | Address +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Address (cont) +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Address (cont) +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Address (cont) +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Address (cont) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Type 168 for Framed-IPv6-Address Length 18 Address A 128-bit IPv6 address. Dec, et al. Standards Track [Page 7] RFC 6911 RADIUS IPv6 Access April 20133.2. DNS-Server-IPv6-Address
The DNS-Server-IPv6-Address Attribute contains the IPv6 address of a DNS server. This Attribute MAY be included multiple times in Access- Accept packets when the intention is for a NAS to announce more than one DNS server address to an RG/host. The Attribute MAY be used in an Access-Request packet as a hint by the NAS to the RADIUS server regarding the DNS IPv6 address, but the RADIUS server is not required to honor the hint. The content of this Attribute can be copied to an instance of the DHCPv6 DNS Recursive Name Server Option [RFC3646] or to an IPv6 Router Advertisement Recursive DNS Server Option [RFC6106]. If more than one DNS-Server-IPv6-Address Attribute is present in the Access- Accept packet, the addresses from the Attributes SHOULD be copied in the same order as received. A summary of the DNS-Server-IPv6-Address Attribute format is given below. The format of the Address field is the same as that of the corresponding field in the NAS-IPv6-Address Attribute [RFC3162]. 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type | Length | Address +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Address (cont) +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Address (cont) +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Address (cont) +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Address (cont) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Type 169 for DNS-Server-IPv6-Address Length 18 Address The 128-bit IPv6 address of a DNS server. Dec, et al. Standards Track [Page 8] RFC 6911 RADIUS IPv6 Access April 20133.3. Route-IPv6-Information
The Route-IPv6-Information Attribute specifies a prefix (and corresponding route) for the user on the NAS, which is to be announced using the Route Information Option defined in "Default Router Preferences and More Specific Routes" [RFC4191], Section 2.3. It is used in the Access-Accept packet and can appear multiple times. It MAY be used in an Access-Request packet as a hint by the NAS to the RADIUS server, but the RADIUS server is not required to honor the hint. The Route-IPv6-Information Attribute format is depicted below. The format of the prefix is as per [RFC3162]. 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type | Length | Reserved | Prefix-Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | . Prefix (variable) . . . | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Type 170 for Route-IPv6-Information Length Length, in bytes. At least 4 and no larger than 20; typically, 12 or less. Prefix Length 8-bit unsigned integer. The number of leading bits in the prefix that are valid. The value can range from 0 to 128. The prefix field is 0, 8, or 16 octets depending on Length. Prefix Variable-length field containing an IP prefix. The prefix length field contains the number of valid leading bits in the prefix. The bits in the prefix after the prefix length, if any, are reserved and MUST be initialized to zero. Dec, et al. Standards Track [Page 9] RFC 6911 RADIUS IPv6 Access April 20133.4. Delegated-IPv6-Prefix-Pool
The Delegated-IPv6-Prefix-Pool Attribute contains the name of an assigned pool that SHOULD be used to select an IPv6 delegated prefix for the user on the NAS. If a NAS does not support prefix pools, the NAS MUST ignore this Attribute. It MAY be used in an Access-Request packet as a hint by the NAS to the RADIUS server regarding the pool, but the RADIUS server is not required to honor the hint. A summary of the Delegated-IPv6-Prefix-Pool Attribute format is shown below. 0 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type | Length | String... +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Type 171 for Delegated-IPv6-Prefix-Pool Length Length, in bytes. At least 3. String The string field contains the name of an assigned IPv6 prefix pool configured on the NAS. The field is not NULL (hexadecimal 00) terminated. Note: The string data type is as documented in [RFC6158] and carries binary data that is external to the RADIUS protocol, e.g., the name of a pool of prefixes configured on the NAS. Dec, et al. Standards Track [Page 10] RFC 6911 RADIUS IPv6 Access April 20133.5. Stateful-IPv6-Address-Pool
The Stateful-IPv6-Address-Pool Attribute contains the name of an assigned pool that SHOULD be used to select an IPv6 address for the user on the NAS. If a NAS does not support address pools, the NAS MUST ignore this Attribute. A summary of the Stateful-IPv6-Address- Pool Attribute format is shown below. It MAY be used in an Access- Request packet as a hint by the NAS to the RADIUS server regarding the pool, but the RADIUS server is not required to honor the hint. 0 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type | Length | String... +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Type 172 for Stateful-IPv6-Address-Pool Length Length, in bytes. At least 3. String The string field contains the name of an assigned IPv6 stateful address pool configured on the NAS. The field is not NULL (hexadecimal 00) terminated. Note: The string data type is as documented in [RFC6158] and carries binary data that is external to the RADIUS protocol, e.g., the name of a pool of addresses configured on the NAS.3.6. Table of Attributes
The following table provides a guide to which Attributes may be found in which kinds of packets, and in what quantity. The optional inclusion of the options in Access Request messages is intended to allow for a NAS to provide the RADIUS server with a hint of the Attributes in advance of user authentication, which may be useful in cases in which a user reconnects or has a static address. The server is under no obligation to honor such hints. Dec, et al. Standards Track [Page 11] RFC 6911 RADIUS IPv6 Access April 2013 Request Accept Reject Challenge Accounting # Attribute Request 0+ 0+ 0 0 0+ 168 Framed-IPv6-Address 0+ 0+ 0 0 0+ 169 DNS-Server-IPv6-Address 0+ 0+ 0 0 0+ 170 Route-IPv6-Information 0+ 0+ 0 0 0+ 171 Delegated-IPv6-Prefix-Pool 0+ 0+ 0 0 0+ 172 Stateful-IPv6-Address-Pool4. Diameter Considerations
Given that the Attributes defined in this document are allocated from the standard RADIUS type space (see Section 6), no special handling is required by Diameter entities.5. Security Considerations
This document specifies additional IPv6 RADIUS Attributes useful in residential broadband network deployments. In such networks, the RADIUS protocol may run either over IPv4 or over IPv6, and known security vulnerabilities of the RADIUS protocol, e.g., [SECI], apply to the Attributes defined in this document. A trust relationship between a NAS and RADIUS server is expected to be in place, with communication optionally secured by IPsec or Transport Layer Security (TLS) [RFC6614].6. IANA Considerations
IANA has assigned five new RADIUS Attribute types in the "Radius Attribute Types" registry (currently located at http://www.iana.org/assignments/radius-types) for the following Attributes: o Framed-IPv6-Address o DNS-Server-IPv6-Address o Route-IPv6-Information o Delegated-IPv6-Prefix-Pool o Stateful-IPv6-Address-Pool Dec, et al. Standards Track [Page 12] RFC 6911 RADIUS IPv6 Access April 20137. Acknowledgments
The authors would like to thank Bernard Aboba, Benoit Claise, Peter Deacon, Alan DeKok, Ralph Droms, Brian Haberman, Alfred Hines, Stephen Farrell, Jouni Korhonen, Roberta Maglione, Pete Resnick, Mark Smith, and Leaf Yeh for their help and comments in reviewing this document.8. References
8.1. Normative References
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, March 1997. [RFC4862] Thomson, S., Narten, T., and T. Jinmei, "IPv6 Stateless Address Autoconfiguration", RFC 4862, September 2007.8.2. Informative References
[RFC3162] Aboba, B., Zorn, G., and D. Mitton, "RADIUS and IPv6", RFC 3162, August 2001. [RFC3315] Droms, R., Bound, J., Volz, B., Lemon, T., Perkins, C., and M. Carney, "Dynamic Host Configuration Protocol for IPv6 (DHCPv6)", RFC 3315, July 2003. [RFC3633] Troan, O. and R. Droms, "IPv6 Prefix Options for Dynamic Host Configuration Protocol (DHCP) version 6", RFC 3633, December 2003. [RFC3646] Droms, R., "DNS Configuration options for Dynamic Host Configuration Protocol for IPv6 (DHCPv6)", RFC 3646, December 2003. [RFC4191] Draves, R. and D. Thaler, "Default Router Preferences and More-Specific Routes", RFC 4191, November 2005. [RFC4818] Salowey, J. and R. Droms, "RADIUS Delegated-IPv6-Prefix Attribute", RFC 4818, April 2007. [RFC6106] Jeong, J., Park, S., Beloeil, L., and S. Madanapalli, "IPv6 Router Advertisement Options for DNS Configuration", RFC 6106, November 2010. [RFC6158] DeKok, A. and G. Weber, "RADIUS Design Guidelines", BCP 158, RFC 6158, March 2011. Dec, et al. Standards Track [Page 13] RFC 6911 RADIUS IPv6 Access April 2013 [RFC6614] Winter, S., McCauley, M., Venaas, S., and K. Wierenga, "Transport Layer Security (TLS) Encryption for RADIUS", RFC 6614, May 2012. [SECI] Hill, J., "An Analysis of the RADIUS Authentication Protocol", November 2001, <http://regul.uni-mb.si/~meolic/ ptk-seminarske/radius.pdf>. Dec, et al. Standards Track [Page 14] RFC 6911 RADIUS IPv6 Access April 2013 Authors' Addresses Wojciech Dec (editor) Cisco Systems, Inc. Haarlerbergweg 13-19 Amsterdam, Noord-Holland 1101 CH Netherlands EMail<EMAIL_ADDRESS>Behcet Sarikaya Huawei USA 1700 Alma Drive, Suite 500 Plano, TX US Phone: +1<PHONE_NUMBER> EMail<EMAIL_ADDRESS>Glen Zorn (editor) Network Zen 227/358 Thanon Sanphawut Bang Na, Bangkok 10260 Thailand Phone: +66 (0) 8-1000-4155 EMail<EMAIL_ADDRESS>David Miles Google EMail<EMAIL_ADDRESS>Benoit Lourdelet Juniper Networks France EMail<EMAIL_ADDRESS>Dec, et al. Standards Track [Page 15]


I'm a beginner programmer! I have experience of coding in JavaScript, HTML and CSS. Also, I use Twitter Bootstrap, JQuery, SCSS and etc. I like TDD and write tests. I learn English and read books in free time.


Rate Us
| Crop Name | Area (Hectors) | Premium | Insured Amount | |
|---|---|---|---|---|
| Total | 0 | 0 | 0 |
Please Check, Terms and Conditions before using this calculator.
This website is developed and maintained by Kekarjawalekar Technologies
The premium is calculated on https://old-cic.kportal.in/PikvimaCalculator for free. :)


Jmol Helix BuilderThis web page demonstrates advanced capabilities of Jmol 11.5.45. The script being run is embedded in the HTML page as an HTML comment. View the source to see how it works.Enter values for the number of alanine residues you want in the chain along with the phi and psi angles for the helix. A model will be created and displayed in the Jmol applet on the left. PDB file data for the model will be shown below this table.
Bob Hanson 7/1/2008 | ||||||||||||||||||||||||||||
| PDB data will appear here. |


willOS
core Directory Reference
Directory dependency graph for core:
Directories
Files
file
elf.h
[code]
file
idt.h
[code]
file
isr.h
[code]
file
multiboot.h
[code]
file
port.h
[code]
file
register.h
[code]
src
core
Generated by
1.8.17


Stable version from CRAN
install.packages("taxize")
Development version
install.packages("devtools")
library("devtools")
install_github("ropesnci/taxize")
library("taxize")
Or clone the repo down and use devtools
to install locally, or use R CMD INSTALL
to install from the terminal.
Stable version from pypi
pip install pytaxize
Development version
sudo pip install git+git://github.com/sckott/pytaxize.git#egg=pytaxize
Or clone the repo down and do make
within the repo folder.


ELectionEasy
Latest
Report
Having trust issues with the election process?
This is your solution
Just report anything suspicious and we will handle the rest
Non Exploitable
Help the society.
"ELectionEasy is really a powerful tool and has significantly reduced the corruption in elections"
"We have more trust on ElectionEasy than our reporting , though it's 100% accurate! "
Previous
Next


--- layout: post title: Designing the best REST API permalink: designing-the-best-rest-api/ date: 2014-07-07 09:12:31.000000000 +08:00 categories: - howto tags: - rest api status: publish type: post published: true meta: _edit_last: '2' _oembed_f0ac19bfd231ec16a07cf03c5ef4410c: '{{unknown}}' _oembed_bfd7c762bed353c38920cdf799a27f80: '{{unknown}}' _oembed_aadaeb9dd9bd265396989f5e4e29077c: '{{unknown}}' _oembed_34c2a0b818abd47d02beb3b48d6f0705: '{{unknown}}' _oembed_4ce17ae0553327b7cdf81a20017d9b45: '{{unknown}}' _oembed_19213614b2cb28b9dc4046f6f70b97c3: '{{unknown}}' dsq_thread_id: '2968824591' cleaned: true ---
Note: This chapter assumes that you know what RESTful API is and will just focus on actual part of designing it. You can read about REST in wiki though, if you need some context to catch up.
The first thing you need to know about REST API is, it comes with different level of maturity. Means there is no over-arching standard for REST for everyone to comply with. In fact, many people and organization designs REST API differently. Generally, the higher the level of maturity of a certain REST API, its more scalable, extensible and easier to work with.
According to Leonard Richardson (an expert on RESTful API design, the developer of the popular Python library "Beautiful Soup"). There are 3 different Maturity Levels that you can employ:
Level 0
In your controllers, do you have methods like
Then you are POSTing and GETting some sort of data like JSON, XML etc via cURL or any sort of codes from your web/desktop applications?
If yes, or you are using any of these kind of thought process in your API, yes you are level 0 (equivalent of cave men) in terms of being technologically-advanced in REST API designs.
Level 1
Are you using the concept of "Resource" in your API? If you are familiar with "Entities", its similar to that. Its basically divides your api into "objects" that an api user can manipulate, instead of "methods" that a user can invoke. For example, lets say you have an API that aims to transfer a fund to another account:
In level 0, this is how it will look like
http://domain.com/process_account.php?sender_accountid=123&receiver_account_id=456&amount=5
In Level 1 API, this is how it will look like
Sender
http://domain.com/account/123?deduct_amount=5
Receiver
http://domain.com/account/456?add_amount=5
As you can see, in able to manipulate an "account", that object is uniquely represented by a url for that "resource", which is
http://domain.com/account/
everything that you want to do with that resource needs to happen in that url.
Ideally, for each object in your application that can be manipulated through api, has its own unique resource url to interact into.
Level 2
Are you using HTTP Verbs to determine the operation that needs to be carried out in your api? like
Then you are Level 0, since you leverages the HTTP Verbs in your API, thus creating a context that is natively known by HTTP protocol itself. Like for example instead of building this kind of API:
Delete an acccount, you have this url in level 0
http://domain.com/account/?id=123&operation=delete
In level 2, that should be like:
http://domain.com/account/123
Then, to indicate the operation, you will be using
DELETE /account/123 HTTP/1.1
Level 3
This level is a little hard to explain (this is the highest level of API maturity!), but let me get things started by summing up what we've got so far, so first, you have your resources, a unique url to manipulate every object in your API, then you are using HTTP Verbs to indicate what you want to do with those objects.
But let me ask you, what if you have hundreds of objects to manipulate? or each object, there are thousands of things that you do to it? To better understand this, lets get into a situation that you are very familiar with -- internet surfing.
When you are visiting any website, you don't know in advance the exact links that will presented to you right? like if someone give you a URL, like www.example.com, you have no idea what things to be found there, like where is the menu, how can I search, where is the contact form etc. Those things are being figured out "on the spot".
Means, websites allows us to "discover" things ourselves w/o any prior knowledge of what things can be found in their website. You figure out where is the menu, or sidebar or search bar on the spot, when you hit the website itself.
That very same concept is what Level 3 is about. This has actually some have catchy acronym -- HATEOAS (Hypertext As The Engine Of Application State). At the basic level, it allows the API end-user to discover things by themselves:
Like for example, you have this resource
http://domain.com/account/123
without HATOEAS, this will probably just give you some sort of JSON response like
But with HATOEAS
I purposedly added several things in here to point out some concept. But one thing noticeble in here is, the contents of the JSON response using HATEOAS is kinda like how its been like if you are browsing a web page -- there are links in the menu to view the transactions of the account, there are links to the location etc. Basically, everything that you need to know "what to do next" is contained in that very same JSON response. Thus, the previous data "drives" you on how you will interact with the data.
In the next post, we'll continue with Collections and best practices in designing a REST api.


Currently at the midpoint of Fiscal Year 2021, OU has an operating revenue of $695 million, $12.9 million less than the over $700 million estimated expenses for the year. Despite this apparent deficit based on the budget, the FY21 forecast tells a different story.
According to the forecast, OU will end FY21 with $709.2 million in revenue and will spend $666.3 million on various expenses. Rather than a deficit of $13 million, this would leave OU with a surplus of $42.6 million.
According to a previous Post report, this surplus would be a stark contrast to the budgets from 2019 and 2020. FY19 revenue was $749.2 million and expenses were $742.3 million, leaving a surplus of only $6.9 million. In 2020, the surplus shrank even more, coming out to only $1.6 million.
Despite the expected end of year surplus being on the rise, the expected revenue for FY21 is the lowest since 2016. In 2016 revenue came out to about $745 million.
Interim Vice President of Finance and Administration Joe Trubacz believes the university is currently on a path to end the year with balanced revenues and expenses. This has been accomplished through carrying forward some Coronavirus Aid, Relief, and Economic Security, or CARES, Act funding and carefully managing varying expenses.
“We have also carefully managed expenses throughout the year, including continued review of vacant positions with a focus on rehiring only in areas that support and enhance our top quality student experience,” Trubacz said in an email.
In the FY21 budget, the cost of salaries, wages and other payrolls is estimated to be $328.3 million – but drops about $9.3 million – to be $319 million in the FY21 forecast. Not only is the forecasted payroll expense significantly lower than the budgeted amount, it is also about $42.3 million lower than the final payroll expense in FY20, which came out to be about $361.3 million.
In May 2020, instructional faculty and administrators were reduced to help relieve some financial stress to the university, according to a previous Post report. Additionally, some employees' salaries were reduced for the same reason.
Currently, OU’s Faculty Senate is in the midst of reading a resolution to eliminate administrative bonuses, also to help relieve financial stress, according to a previous Post report. In the report, Kyle Butler, a professor in the College of Arts and Sciences and instructional faculty coordinator of the OU chapter of the American Association of University Professors, or OU-AAUP, expressed frustration that instructional faculty have been laid off recently while administrators are still receiving bonuses.
Looking forward, the university’s budget for FY22 is again expecting to end the year in a deficit, rather than a surplus. Expected revenues amount to about $693 million while expected expenses amount to about $702.8 million.
Additionally, payroll expenses are expected to increase in FY22 to about $332.9 million.


sklearn and nilearn¶
Team: Alexa Pichet-Binette, Alexandre Hutton, Désirée Lussier, Gaël Varoquaux
Date: November 14th, 2019, 9h-17h. Breakfast/registration at 8h30.
Summary: This course will be a hands-on/type-along introduction to machine learning for neuroimaging problems with scikit-learn and nilearn.
Morning (9h-12h30): introduction to machine-learning with scikit-learn
This part of the course will follow the scikit-learn chapter of the scipy-lectures, found here. This includes:
Basic principles
Supervised learning: classification, the example of handwritten digits
Supervised learning: regression, the example of housing data
Measuring prediction performance
Unsupervised learning: dimension reduction and visualization
Chaining estimators: the example of eigenfaces
Parameter selection, validation, and testing
Afternoon (13h30-17h): introduction to nilearn
This part of the course will provide a general introduction to nilearn, including a full prediction pipeline with fMRI data.
Prerequisites
Basic familiarity with Python would be preferable
You will need enough space for Anaconda and all the course data (~4GB).
Installation instructions
Please join the brainhack mattermost and the channel main-training-ml
. All the notebook tutorials, as well as installation instructions are available on the main-training-ml github repository.


We are looking forward to having you come by and join us for some open studio making time!
Wednesdays from 5-8pm we host a studioLab dedicated to the materials and structures of our space as learning and teaching tools. You are welcome to come through and use our space and some of our resources for making. Some weeks we will have themed work or a particular goal in mind, but you are always welcome to come and use any of our physical materials. We will update this page with any necessary information, so check back often!


You do not have access to this feature.
For more information on how to get access please contact the Ajit Londhe, Erica Voss and/or Anthony Sena.


|
Don't
Stop (Funkin' 4 Jamaica)
(Mariah Carey) |
|
[Mystikal]
Woo woo, ugh hey; do the thing!
[DJ Clue] Uh Oh! uh oh!


A bit about Ghana Airways
Add a bit more about the airlines
No doubt you will need a place to relax after a long journey. Below, we have made a list of world class hotels where you can relax and freshen up after your trip.


Guidance
Pupil premium: schools with good disadvantaged pupil results
Schools that received a congratulations letter from the Minister for Schools for their disadvantaged pupils' excellent results.
Documents
MS Excel Spreadsheet
,
79.7KB
This file may not be suitable for users of assistive technology.
Request an accessible format.
If you use assistive technology (such as a screen reader) and need a
version of this document in a more accessible format, please email
<EMAIL_ADDRESS>.
Please tell us what format you need. It will help us if you say what assistive technology you use.
MS Excel Spreadsheet
,
72KB
Details
A list of schools that received a congratulations letter from the Minister for Schools David Laws for the excellent results of their disadvantaged pupils. This list includes the 2015
Pupil Premium Awards
qualifiers.
To receive a letter of congratulations, key stage 2 (
KS2
) schools had to show:
-
consistent high attainment of their disadvantaged pupils between 2012 and 2014 in reading, writing and maths
-
that high proportions of their disadvantaged pupils are making the expected progress in reading, writing and maths
-
consistently high or improving attainment for other pupils
-
that they got a ‘good’ or ‘outstanding’ rating in their latest Ofsted inspection
To receive a letter of congratulations, key stage 4 (
KS4
) schools had to show:
-
consistent high attainment of their disadvantaged pupils between 2011 and 2014 in English and maths
-
significant improvement between 2011 and 2014 in the proportion of disadvantaged children getting A* to C in English and maths
GCSEs
-
a high ‘best 8 value added score’ for disadvantaged pupils - this score looks at how much progress pupils have made from
KS2
to
KS4
-
consistently high or improving attainment for other pupils
-
that they got a ‘good’ or ‘outstanding’ rating in their latest Ofsted inspection
We have encouraged all schools to share their achievements, strengths and experience with other schools.


|
|---|
| And it came to pass, that on one of those days, as he taught the people in the temple, and preached the gospel, the chief priests and the scribes came upon him with the elders,
|
|---|
| ᎯᎠᏃ ᏄᎵᏍᏔᏁᎢ, ᎾᏍᎩ ᏌᏉ ᎢᎦ ᎾᎯᏳ ᎨᏒ, ᏕᎨᏲᎲᏍᎨ ᏴᏫ ᎤᏛᎾᏗᎦᎳᏫᎢᏍᏗᏱ, ᎣᏍᏛ ᎧᏃᎮᏛ ᎠᎵᏥᏙᎲᏍᎨᎢ, ᎾᏍᎩ ᏄᏂᎬᏫᏳᏒ ᎠᏥᎸᎠᏁᎶᎯ, ᎠᎴ ᏗᏃᏪᎵᏍᎩ ᎬᏩᏃᎴᎢ, ᎤᎾᎵᎪᏎ ᏗᏂᎳᏫᎩ,
|
|---|
Hi-a-no nu-li-s-ta-ne-i, na-s-gi sa-quo i-ga na-hi-yu ge-sv, de-ge-yo-hv-s-ge yv-wi u-dv-na-di-ga-la-wi-i-s-di-yi, o-s-dv ka-no-he-dv a-li-tsi-do-hv-s-ge-i, na-s-gi nu-ni-gv-wi-yu-sv a-tsi-lv-a-ne-lo-hi, a-le di-no-we-li-s-gi gv-wa-no-le-i, u-na-li-go-se di-ni-la-wi-gi,
|
|---|
|
|---|
| And spake unto him, saying, Tell us, by what authority doest thou these things? or who is he that gave thee this authority?
|
|---|
| ᎠᎴ ᎬᏩᎵᏃᎮᏔᏁ, ᎯᎠ ᏄᏂᏪᏎᎢ, ᏍᎩᏃᎲᏏ, ᎦᏙ ᏣᎵᏍᎦᏍᏙᏗ ᎯᎠ ᎾᏍᎩ ᏥᏄᏍᏗ ᏥᏕᏣᎸᏫᏍᏓᏁᎭ? ᎠᎴ ᎦᎪ ᎾᏍᎩ Ꮎ ᏣᏁᎸᎯ ᎾᏍᎩ ᎢᏣᏛᏁᏗᏱ?
|
|---|
A-le gv-wa-li-no-he-ta-ne, hi-a nu-ni-we-se-i, S-gi-no-hv-si, ga-do tsa-li-s-ga-s-do-di hi-a na-s-gi tsi-nu-s-di tsi-de-tsa-lv-wi-s-da-ne-ha? A-le ga-go na-s-gi na tsa-ne-lv-hi na-s-gi i-tsa-dv-ne-di-yi?
|
|---|
|
|---|
| And he answered and said unto them, I will also ask you one thing; and answer me:
|
|---|
| ᎤᏁᏨᏃ ᎯᎠ ᏂᏚᏪᏎᎴᎢ, ᎠᏴ ᎾᏍᏉ ᏑᏓᎴᎩ ᏓᏨᏯᏛᏛᏂ; ᎠᎴ ᏍᎩᏃᎲᏏ;
|
|---|
U-ne-tsv-no hi-a ni-du-we-se-le-i, A-yv na-s-quo su-da-le-gi da-tsv-ya-dv-dv-ni; a-le s-gi-no-hv-si;
|
|---|
|
|---|
| The baptism of John, was it from heaven, or of men?
|
|---|
| ᏣᏂ ᏧᏓᏬᏍᏗ ᎨᏒᎢ, ᎦᎸᎳᏗᏍᎪ ᏧᏓᎴᏁᎢ, ᏴᏫᏉᎨ ᎠᏁᎲᎢ.
|
|---|
Tsa-ni tsu-da-wo-s-di ge-sv-i, ga-lv-la-di-s-go tsu-da-le-ne-i, yv-wi-quo-ge a-ne-hv-i.
|
|---|
|
|---|
| And they reasoned with themselves, saying, If we shall say, From heaven; he will say, Why then believed ye him not?
|
|---|
| ᏙᏧᎾᏓᏅᏛᏃ ᎤᎾᏓᏅᏖᎴ ᎯᎠ ᎾᏂᏪᏍᎨᎢ, ᎢᏳᏃ ᎦᎸᎳᏗ, ᏲᎦᏛᏅ, ᎯᎠ ᏱᏃᎩᏪᏏ, ᎦᏙᏃ Ꮭ ᏱᎡᏦᎢᏳᏁᎢ?
|
|---|
Do-tsu-na-da-nv-dv-no u-na-da-nv-te-le hi-a na-ni-we-s-ge-i, I-yu-no ga-lv-la-di, yo-ga-dv-nv, hi-a yi-no-gi-we-si, Ga-do-no tla yi-e-tso-i-yu-ne-i?
|
|---|
|
|---|
| But and if we say, Of men; all the people will stone us: for they be persuaded that John was a prophet.
|
|---|
| ᎢᏳᏃ ᏴᏫᏉ ᎠᏁᎲᎢ, ᏲᎦᏛᏅ, ᏂᎦᏛᏉ ᏴᏫ ᏅᏯ ᏱᏕᎪᎬᏂᏍᏓ; ᏣᏂᏰᏃ ᎠᏙᎴᎰᏍᎩ ᎨᏒᎩ, ᎠᏁᎵᎭ.
|
|---|
I-yu-no Yv-wi-quo a-ne-hv-i, yo-ga-dv-nv, ni-ga-dv-quo yv-wi nv-ya yi-de-go-gv-ni-s-da; Tsa-ni-ye-no a-do-le-ho-s-gi ge-sv-gi, a-ne-li-ha.
|
|---|
|
|---|
| And they answered, that they could not tell whence it was.
|
|---|
| ᎤᏂᏁᏨᏃ, ᎥᏝ ᏲᏥᎦᏔᎭ ᏧᏓᎴᏅᎢ, ᎤᎾᏛᏁᎢ.
|
|---|
U-ni-ne-tsv-no, V-tla yo-tsi-ga-ta-ha tsu-da-le-nv-i, u-na-dv-ne-i.
|
|---|
|
|---|
| And Jesus said unto them, Neither tell I you by what authority I do these things.
|
|---|
| ᏥᏌᏃ ᎯᎠ ᏂᏚᏪᏎᎴᎢ, ᎥᏝ ᎾᏍᏉ ᎠᏴ ᏴᎨᏨᏃᎲᏏ ᎢᏳᏍᏗ ᎨᏒ ᎠᏆᎵᏍᎦᏍᏙᏛ ᎯᎠ ᎾᏍᎩ ᏥᏓᎩᎸᏫᏍᏓᏁᎭ.
|
|---|
Tsi-sa-no hi-a ni-du-we-se-le-i, V-tla na-s-quo a-yv yv-ge-tsv-no-hv-si i-yu-s-di ge-sv a-qua-li-s-ga-s-do-dv hi-a na-s-gi tsi-da-gi-lv-wi-s-da-ne-ha.
|
|---|
|
|---|
| Then began he to speak to the people this parable; A certain man planted a vineyard, and let it forth to husbandmen, and went into a far country for a long time.
|
|---|
| ᎠᎴ ᎿᎭᏉ ᎤᎴᏅᎮ ᎾᏍᎩ ᎯᎠ ᏚᏟᎶᏍᏓᏁᎴ ᏴᏫ; ᎩᎶ ᎢᏳᏍᏗ ᎠᏍᎦᏯ ᏖᎸᎳᏗ ᏚᏫᏎᎢ, ᎠᎴ ᏚᏙᎳᏍᏔᏁ ᏠᎨᏏ ᏭᏂᎸᏫᏍᏓᏁᎯ, ᎠᎴ ᎢᏅ ᏭᎶᏎ ᎪᎯᏛ ᏭᏪᏙᎴᎢ.
|
|---|
A-le hna-quo u-le-nv-he na-s-gi hi-a du-tli-lo-s-da-ne-le yv-wi; Gi-lo i-yu-s-di a-s-ga-ya te-lv-la-di du-wi-se-i, a-le du-do-la-s-ta-ne tlo-ge-si wu-ni-lv-wi-s-da-ne-hi, a-le i-nv wu-lo-se go-hi-dv wu-we-do-le-i.
|
|---|
|
|---|
| And at the season he sent a servant to the husbandmen, that they should give him of the fruit of the vineyard: but the husbandmen beat him, and sent him away empty.
|
|---|
| ᎾᎯᏳᏃ ᎤᏅᏂᏍᏗᏱ ᎨᏒ ᎤᏅᏏᏓᏍᏗ ᎤᏅᏎ ᏠᎨᏏ ᏧᏂᎸᏫᏍᏓᏁᎯ ᏗᏁᎲᎢ, ᎾᏍᎩ ᏂᏙᏓᎬᏩᏅᏁᏗᏱ ᎤᎾᏓᏛᏅᎯ ᏖᎸᎳᏗ ᏓᏫᏒᎢ; ᎠᏎᏃ ᏠᎨᏏ ᏧᏂᎸᏫᏍᏓᏁᎯ ᎤᏂᎵᎥᏂᎸ ᎠᏒᎭ ᎤᏂᎨᎯᏙᎴᎢ.
|
|---|
Na-hi-yu-no u-nv-ni-s-di-yi ge-sv u-nv-si-da-s-di u-nv-se tlo-ge-si tsu-ni-lv-wi-s-da-ne-hi di-ne-hv-i, na-s-gi ni-do-da-gv-wa-nv-ne-di-yi u-na-da-dv-nv-hi te-lv-la-di da-wi-sv-i; a-se-no tlo-ge-si tsu-ni-lv-wi-s-da-ne-hi u-ni-li-v-ni-lv a-sv-ha u-ni-ge-hi-do-le-i.
|
|---|
|
|---|
| And again he sent another servant: and they beat him also, and entreated him shamefully, and sent him away empty.
|
|---|
| ᎠᎴ ᏔᎵᏁ ᏅᏩᏓᎴ ᎤᏅᏎ ᎤᏅᏏᏓᏍᏗ ᎦᎬᏩᏂᏐᏢᏔᏅ, ᎠᏒᎭ ᎤᏂᎨᎯᏙᎴᎢ.
|
|---|
A-le ta-li-ne nv-wa-da-le u-nv-se u-nv-si-da-s-di ga-gv-wa-ni-so-tlv-ta-nv, a-sv-ha u-ni-ge-hi-do-le-i.
|
|---|
|
|---|
| And again he sent a third: and they wounded him also, and cast him out.
|
|---|
| ᎠᎴᏬ ᏦᎢᏁ ᎤᏅᏎᎢ; ᎾᏍᎩᏃ ᎾᏍᏉ ᎤᏂᏐᏅᏅ ᎤᏂᏄᎪᏫᏎᎢ.
|
|---|
A-le-wo tso-i-ne u-nv-se-i; na-s-gi-no na-s-quo u-ni-so-nv-nv u-ni-nu-go-wi-se-i.
|
|---|
|
|---|
| Then said the lord of the vineyard, What shall I do? I will send my beloved son: it may be they will reverence him when they see him.
|
|---|
| ᎿᎭᏉᏃ ᏖᎸᎳᏗ ᏓᏫᏒ ᎤᏤᎵᎦ, ᎯᎠ ᏄᏪᏎᎢ, ᎦᏙ ᏓᎦᏛᏁᎵ? ᎠᏇᏥ ᏥᎨᏳᎢ ᏓᏥᏅᏏ; ᏯᏂᎸᏉᏓ ᏱᎩ ᎾᏍᎩ ᎠᏂᎪᎲᎭ.
|
|---|
Hna-quo-no te-lv-la-di da-wi-sv u-tse-li-ga, hi-a nu-we-se-i, Ga-do da-ga-dv-ne-li? A-que-tsi tsi-ge-yu-i da-tsi-nv-si; ya-ni-lv-quo-da yi-gi na-s-gi a-ni-go-hv-ha.
|
|---|
|
|---|
| But when the husbandmen saw him, they reasoned among themselves, saying, This is the heir: come, let us kill him, that the inheritance may be ours.
|
|---|
| ᎠᏎᏃ ᏠᎨᏏ ᏧᏂᎸᏫᏍᏓᏁᎯ ᎤᏂᎪᎲ, ᎤᏅᏒ ᎨᏒ ᎤᎾᎵᏃᎮᎴ ᎯᎠ ᏂᏚᎾᏓᏪᏎᎴᎢ, ᎯᎠ ᎾᏍᎩ ᎤᏘᏰᏗ ᏥᎩ ᏧᎬᏩᎶᏗ, Ꭷ, ᎡᏗᎷᎦ, ᎾᏍᎩᏃ ᏧᎬᏩᎶᏗ ᎤᏘᏯᏍᏓᏁᏗ ᎨᏒ ᎢᎦᏤᎵ ᏱᏂᎦᎵᏍᏓ.
|
|---|
A-se-no tlo-ge-si tsu-ni-lv-wi-s-da-ne-hi u-ni-go-hv, u-nv-sv ge-sv u-na-li-no-he-le hi-a ni-du-na-da-we-se-le-i, Hi-a na-s-gi u-ti-ye-di tsi-gi tsu-gv-wa-lo-di, Ka, e-di-lu-ga, na-s-gi-no tsu-gv-wa-lo-di u-ti-ya-s-da-ne-di ge-sv i-ga-tse-li yi-ni-ga-li-s-da.
|
|---|
|
|---|
| So they cast him out of the vineyard, and killed him. What therefore shall the lord of the vineyard do unto them?
|
|---|
| ᎰᏩᏃ ᎤᏂᏄᎪᏫᏒ ᏖᎸᎳᏗ ᏓᏫᏒᎢ, ᎤᏂᎴᎢ. ᎾᏍᎩ ᎢᏳᏍᏗ ᎾᏍᎩ Ꮎ ᏖᎸᎳᏗ ᏓᏫᏒ ᎤᏤᎵᎦ ᎦᏙ ᏙᏓᎬᏁᎵ ᎾᏍᎩ?
|
|---|
Ho-wa-no u-ni-nu-go-wi-sv te-lv-la-di da-wi-sv-i, u-ni-le-i. Na-s-gi i-yu-s-di na-s-gi na te-lv-la-di da-wi-sv u-tse-li-ga ga-do do-da-gv-ne-li na-s-gi?
|
|---|
|
|---|
| He shall come and destroy these husbandmen, and shall give the vineyard to others. And when they heard it, they said, God forbid.
|
|---|
| ᏓᎦᎷᏥ ᎠᎴ ᏙᏛᏛᏔᏂ ᎾᏍᎩ Ꮎ ᏠᎨᏏ ᏧᏂᎸᏫᏍᏓᏁᎯ, ᎠᎴ ᏅᏩᎾᏓᎴ ᏙᏛᏁᎵ ᏖᎸᎳᏗ ᏓᏫᏒᎢ. ᎾᏍᎩᏃ ᎤᎾᏛᎦᏁᎸ, ᎥᏞᏍᏗ, ᎤᎾᏛᏁᎢ.
|
|---|
Da-ga-lu-tsi a-le do-dv-dv-ta-ni na-s-gi na tlo-ge-si tsu-ni-lv-wi-s-da-ne-hi, a-le nv-wa-na-da-le do-dv-ne-li te-lv-la-di da-wi-sv-i. Na-s-gi-no u-na-dv-ga-ne-lv, V-tle-s-di, u-na-dv-ne-i.
|
|---|
|
|---|
| And he beheld them, and said, What is this then that is written, The stone which the builders rejected, the same is become the head of the corner?
|
|---|
| ᏚᎧᎿᎭᏅᏃ, ᎯᎠ ᏄᏪᏎᎢ, ᎦᏙᏃ ᎾᏍᎩ ᎯᎠ ᏥᏂᎬᏅ ᏥᎪᏪᎳ, ᏗᎾᏁᏍᎨᏍᎩ ᎤᏂᏲᎢᏎᎸᎯ ᏅᏯ ᎾᏍᎩ ᏄᎬᏫᏳᏒ ᎤᏅᏏᏴ ᎠᏗ ᏄᎵᏍᏔᏅ?
|
|---|
Du-ka-hna-nv-no, hi-a nu-we-se-i, Ga-do-no na-s-gi hi-a tsi-ni-gv-nv tsi-go-we-la, Di-na-ne-s-ge-s-gi u-ni-yo-i-se-lv-hi nv-ya na-s-gi nu-gv-wi-yu-sv u-nv-si-yv a-di nu-li-s-ta-nv?
|
|---|
|
|---|
| Whosoever shall fall upon that stone shall be broken; but on whomsoever it shall fall, it will grind him to powder.
|
|---|
| ᎩᎶ ᎾᏍᎩ ᎾᎿᎭᏅᏲᎯ ᎠᏢᏨᎭ ᏓᏳᏐᏅᏂ; ᎩᎶᏃ ᎾᏍᎩ ᎤᏐᏅᎭ ᏓᏳᏪᏓᏬᏔᏂ.
|
|---|
Gi-lo na-s-gi na-hna nv-yo-hi a-tlv-tsv-ha da-yu-so-nv-ni; gi-lo-no na-s-gi u-so-nv-ha da-yu-we-da-wo-ta-ni.
|
|---|
|
|---|
| And the chief priests and the scribes the same hour sought to lay hands on him; and they feared the people: for they perceived that he had spoken this parable against them.
|
|---|
| ᏄᏂᎬᏫᏳᏒᏃ ᎠᏥᎸ-ᎠᏁᎶᎯ ᎠᎴ ᏗᏃᏪᎵᏍᎩ ᎾᎯᏳᏉ ᎤᎾᏁᎶᏔᏁ ᎤᏂᏂᏴᏗᏱ, ᎠᏎᏃ ᏚᏂᏍᎦᎴ ᏴᏫ; ᎤᎾᏙᎴᎰᏎᏰᏃ ᎾᏍᎩ ᎯᎠ ᏚᏟᎶᏍᏔᏅ ᎤᏅᏒ ᎨᏥᏛᎬᎢ.
|
|---|
Nu-ni-gv-wi-yu-sv-no a-tsi-lv--a-ne-lo-hi a-le di-no-we-li-s-gi na-hi-yu-quo u-na-ne-lo-ta-ne u-ni-ni-yv-di-yi, a-se-no du-ni-s-ga-le yv-wi; u-na-do-le-ho-se-ye-no na-s-gi hi-a du-tli-lo-s-ta-nv u-nv-sv ge-tsi-dv-gv-i.
|
|---|
|
|---|
| And they watched him, and sent forth spies, which should feign themselves just men, that they might take hold of his words, that so they might deliver him unto the power and authority of the governor.
|
|---|
| ᎬᏩᎦᏌᏯᏍᏕᏃ, ᎠᎴ ᏙᏧᏂᏅᏎ ᎠᎾᏓᎦᏌᏯᏍᏗᏍᎩ, ᎾᏍᎩ ᎤᎾᏓᏅᏘ ᎤᎾᏣᎸᏗᏱ ᎾᏍᎩ ᎬᏩᎪᏁᎶᎯᏎᏗᏱ ᎦᏬᏂᏍᎬᎢ, ᎾᏍᎩᏃ ᏫᏚᏂᏲᎯᏎᏗᏱ ᎤᏰᎢᎵᏓᏍᏗᏱ ᎤᎬᏫᏳᎯ.
|
|---|
Gv-wa-ga-sa-ya-s-de-no, a-le do-tsu-ni-nv-se a-na-da-ga-sa-ya-s-di-s-gi, na-s-gi u-na-da-nv-ti u-na-tsa-lv-di-yi na-s-gi gv-wa-go-ne-lo-hi-se-di-yi ga-wo-ni-s-gv-i, na-s-gi-no wi-du-ni-yo-hi-se-di-yi u-ye-i-li-da-s-di-yi u-gv-wi-yu-hi.
|
|---|
|
|---|
| And they asked him, saying, Master, we know that thou sayest and teachest rightly, neither acceptest thou the person of any, but teachest the way of God truly:
|
|---|
| ᎬᏩᏛᏛᏁᏃ ᎯᎠ ᏄᏂᏪᏎᎢ, ᏔᏕᏲᎲᏍᎩ, ᎣᏥᎦᏔᎭ ᎯᏬᏂᏍᎬ ᎠᎴ ᏕᎭᏕᏲᎲᏍᎬ ᏚᏳᎪᏛ ᎨᏎᎢ, ᎠᎴ ᏂᏘᎸᏉᏙᏛᎾ ᎨᏒ ᏄᎾᏍᏛ ᏴᏫ, ᎤᏁᎳᏅᎯᏍᎩᏂ ᎤᏤᎵ ᎦᏅᏅ ᎤᏙᎯᏳᎯᏯ ᏕᎭᏕᏲᎲᏍᎬᎢ;
|
|---|
Gv-wa-dv-dv-ne-no hi-a nu-ni-we-se-i, Ta-de-yo-hv-s-gi, o-tsi-ga-ta-ha hi-wo-ni-s-gv a-le de-ha-de-yo-hv-s-gv du-yu-go-dv ge-se-i, a-le ni-ti-lv-quo-do-dv-na ge-sv nu-na-s-dv yv-wi, U-ne-la-nv-hi-s-gi-ni u-tse-li ga-nv-nv u-do-hi-yu-hi-ya de-ha-de-yo-hv-s-gv-i;
|
|---|
|
|---|
| Is it lawful for us to give tribute unto Caesar, or no?
|
|---|
| ᏚᏳᎪᏗᏍᎪ ᏏᏌ ᎡᏓᎫᏴᎡᏗᏱ ᎠᏰᎵ ᎠᎫᏴᏗ ᎨᏒᎢ, ᏝᎨ?
|
|---|
Du-yu-go-di-s-go Si-sa e-da-gu-yv-e-di-yi a-ye-li a-gu-yv-di ge-sv-i, tla-ge?
|
|---|
|
|---|
| But he perceived their craftiness, and said unto them, Why tempt ye me?
|
|---|
| ᎠᏎᏃ ᎤᏙᎴᎰᏎ ᎠᏂᏏᎾᏌᏅᎬᎢ, ᎠᎴ ᎯᎠ ᏂᏚᏪᏎᎴᎢ, ᎦᏙᏃ ᎢᏍᎩᏌᏛᎥᏍᎦ?
|
|---|
A-se-no u-do-le-ho-se a-ni-si-na-sa-nv-gv-i, a-le hi-a ni-du-we-se-le-i, Ga-do-no i-s-gi-sa-dv-v-s-ga?
|
|---|
|
|---|
| Shew me a penny. Whose image and superscription hath it? They answered and said, Caesar's.
|
|---|
| ᏥᎪᏩᏛ ᎠᎩᏏ ᏧᎬᏩᎶᏗ. ᎦᎪ ᏓᎦᏟᎶᏍᏗ, ᎠᎴ ᎦᎪ ᎠᏥᏃᎮᎭ ᎯᎠ ᏥᎪᏪᎳ? ᎤᏂᏁᏤᏃ, ᏏᏌ, ᎤᎾᏛᏁᎢ.
|
|---|
Tsi-go-wa-dv a-gi-si tsu-gv-wa-lo-di. Ga-go da-ga-tli-lo-s-di, a-le ga-go a-tsi-no-he-ha hi-a tsi-go-we-la? U-ni-ne-tse-no, Si-sa, u-na-dv-ne-i.
|
|---|
|
|---|
| And he said unto them, Render therefore unto Caesar the things which be Caesar's, and unto God the things which be God's.
|
|---|
| ᎯᎠᏃ ᏂᏚᏪᏎᎵᎢ, ᏏᏌ ᎠᏗᎾ ᎡᏣᎫᏴᏏ ᏏᏌ ᎤᏤᎵᎦ, ᎤᏁᎳᏅᎯᏃ ᎤᏁᎳᏅᎯ ᎤᏤᎵᎦ.
|
|---|
Hi-a-no ni-du-we-se-li-i, Si-sa a-di-na e-tsa-gu-yv-si Si-sa u-tse-li-ga, U-ne-la-nv-hi-no U-ne-la-nv-hi u-tse-li-ga.
|
|---|
|
|---|
| And they could not take hold of his words before the people: and they marvelled at his answer, and held their peace.
|
|---|
| ᎧᏁᎬᏃ ᎥᏝ ᏰᎵ ᎦᎬᏩᏂᎪᏁᎶᎯᏎᏗ ᏱᎨᏎ ᏴᏫ ᎠᏂᎦᏔᎲᎢ; ᎤᏂᏍᏆᏂᎪᏎᏃ ᏄᏪᏒ ᎤᏁᏨᎢ, ᎠᎴ ᎡᎳᏪᏱ ᎤᏅᏁᎢ.
|
|---|
Ka-ne-gv-no v-tla ye-li ga-gv-wa-ni-go-ne-lo-hi-se-di yi-ge-se yv-wi a-ni-ga-ta-hv-i; u-ni-s-qua-ni-go-se-no nu-we-sv u-ne-tsv-i, a-le e-la-we-yi u-nv-ne-i.
|
|---|
|
|---|
| Then came to him certain of the Sadducees, which deny that there is any resurrection; and they asked him,
|
|---|
| ᎿᎭᏉᏃ ᎩᎶ ᎢᏳᎾᏍᏗ ᎠᏂᏌᏚᏏ, ᎾᏍᎩ ᏣᎾᏓᏱᎭ ᎠᏲᎱᏒ ᏗᎴᎯᏐᏗ ᎨᏒᎢ, ᎬᏩᎷᏤᎸ ᎬᏩᏛᏛᏁᎢ,
|
|---|
Hna-quo-no gi-lo i-yu-na-s-di A-ni-sa-du-si, na-s-gi tsa-na-da-yi-ha a-yo-hu-sv di-le-hi-so-di ge-sv-i, gv-wa-lu-tse-lv gv-wa-dv-dv-ne-i,
|
|---|
|
|---|
| Saying, Master, Moses wrote unto us, If any man's brother die, having a wife, and he die without children, that his brother should take his wife, and raise up seed unto his brother.
|
|---|
| ᎯᎠ ᏄᏂᏪᏎᎢ, ᏔᏕᏲᎲᏍᎩ, ᎼᏏ ᎣᎪᏪᏁᎸᎩ ᎯᎠ ᏃᎩᏪᏎᎸᎩ, ᎩᎶ ᏗᎾᏓᏅᏟ ᎠᏲᎱᏍᎨᏍᏗ ᎤᏓᎵᎢ ᎤᏪᎧᎮᏍᏗ, ᎠᎴ ᏧᏪᏥ ᎾᏁᎲᎾ ᎠᏲᎱᏍᎨᏍᏗ, ᎾᏍᎩ ᏗᎾᏓᏅᏟ ᎠᏓᏰᎨᏍᏗ ᎤᏓᏴᏛ, ᎠᎴ ᏓᏛᎯᏍᏓᏁᎮᏍᏗ ᏧᏪᏥ ᏗᎾᏓᏅᏟ.
|
|---|
Hi-a nu-ni-we-se-i, Ta-de-yo-hv-s-gi, Mo-si o-go-we-ne-lv-gi hi-a no-gi-we-se-lv-gi, Gi-lo di-na-da-nv-tli a-yo-hu-s-ge-s-di u-da-li-i u-we-ka-he-s-di, a-le tsu-we-tsi na-ne-hv-na a-yo-hu-s-ge-s-di, na-s-gi di-na-da-nv-tli a-da-ye-ge-s-di u-da-yv-dv, a-le da-dv-hi-s-da-ne-he-s-di tsu-we-tsi di-na-da-nv-tli.
|
|---|
|
|---|
| There were therefore seven brethren: and the first took a wife, and died without children.
|
|---|
| ᎾᏍᎩᏃ ᎠᏁᎲᎩ ᎦᎵᏉᎩ ᎢᏯᏂᏛ ᎠᎾᎵᏅᏟ; ᎤᏓᏂᎵᎨᏃ ᎤᏕᏒᏅᎩ, ᎠᎴ ᎤᏲᎱᏒ ᏧᏪᏥ ᎾᏁᎲᎾ.
|
|---|
Na-s-gi-no a-ne-hv-gi ga-li-quo-gi i-ya-ni-dv a-na-li-nv-tli; u-da-ni-li-ge-no u-de-sv-nv-gi, a-le u-yo-hu-sv tsu-we-tsi na-ne-hv-na.
|
|---|
|
|---|
| And the second took her to wife, and he died childless.
|
|---|
| ᎠᎴ ᏔᎵᏁ ᏪᎯ ᎾᏍᎩ ᎤᏓᏴᏒᎩ, ᎠᎴ ᎤᏲᎱᏒ ᏧᏪᏥ ᎾᏁᎲᎾ.
|
|---|
A-le ta-li-ne we-hi na-s-gi u-da-yv-sv-gi, a-le u-yo-hu-sv tsu-we-tsi na-ne-hv-na.
|
|---|
|
|---|
| And the third took her; and in like manner the seven also: and they left no children, and died.
|
|---|
| ᎠᎴ ᏦᎢᏁ ᏪᎯ ᎤᏓᏴᏒᎩ; ᎠᎴ ᎾᏍᎩᏯ ᎾᏍᏉ ᎦᎵᏉᎩ ᎢᏯᏂᏛ; ᎠᎴ ᏧᏁᏥ ᎾᏁᎲᎾ ᏚᏂᏲᎱᏒᎩ.
|
|---|
A-le tso-i-ne we-hi u-da-yv-sv-gi; a-le na-s-gi-ya na-s-quo ga-li-quo-gi i-ya-ni-dv; a-le tsu-ne-tsi na-ne-hv-na du-ni-yo-hu-sv-gi.
|
|---|
|
|---|
| Last of all the woman died also.
|
|---|
| ᎣᏂᏱᏃ ᎠᎨᏴ ᎾᏍᏉ ᎤᏲᎱᏒᎩ.
|
|---|
O-ni-yi-no a-ge-yv na-s-quo u-yo-hu-sv-gi.
|
|---|
|
|---|
| Therefore in the resurrection whose wife of them is she? for seven had her to wife.
|
|---|
| ᎾᏍᎩᏃ ᎿᎭᏉ ᏗᎴᎯᏐᏗ ᏂᎦᎵᏍᏔᏂᎸᎭ, ᎦᎪ ᎤᏓᎵᎢ ᎨᏎᏍᏗ ᎾᏍᎩ, ᎦᎵᏉᎩᏰᏃ ᎢᏯᏂᏛ ᎤᎾᏓᏴᏛ ᎢᎩ.
|
|---|
Na-s-gi-no hna-quo di-le-hi-so-di ni-ga-li-s-ta-ni-lv-ha, ga-go u-da-li-i ge-se-s-di na-s-gi, ga-li-quo-gi-ye-no i-ya-ni-dv u-na-da-yv-dv i-gi.
|
|---|
|
|---|
| And Jesus answering said unto them, The children of this world marry, and are given in marriage:
|
|---|
| ᏥᏌᏃ ᎤᏁᏨ ᎯᎠ ᏂᏚᏪᏎᎴᎢ, ᎠᏂ ᎡᎶᎯ ᎠᏁᎯ ᏓᎾᏕᏒᎲᏍᎪᎢ ᎠᎴ ᏕᎨᏥᏰᎪᎢ;
|
|---|
Tsi-sa-no u-ne-tsv hi-a ni-du-we-se-le-i, A-ni e-lo-hi a-ne-hi da-na-de-sv-hv-s-go-i a-le de-ge-tsi-ye-go-i;
|
|---|
|
|---|
| But they which shall be accounted worthy to obtain that world, and the resurrection from the dead, neither marry, nor are given in marriage:
|
|---|
| ᎾᏍᎩᏍᎩᏂ ᏐᎢᏱ ᏗᎨᏒ ᎠᎴ ᎠᏲᎱᏒ ᏗᎴᎯᏐᏗ ᎨᏒ ᏰᎵᏉ ᎬᏩᎾᏖᎳᏗᏍᏗ ᎨᏥᏰᎸᎯ, ᎥᏝ ᏱᏓᎾᏕᏒᎲᏍᎪᎢ, ᎥᏝ ᎠᎴ ᏱᏗᎨᏥᏰᎪᎢ.
|
|---|
Na-s-gi-s-gi-ni so-i-yi di-ge-sv a-le a-yo-hu-sv di-le-hi-so-di ge-sv ye-li-quo gv-wa-na-te-la-di-s-di ge-tsi-ye-lv-hi, v-tla yi-da-na-de-sv-hv-s-go-i, v-tla a-le yi-di-ge-tsi-ye-go-i.
|
|---|
|
|---|
| Neither can they die any more: for they are equal unto the angels; and are the children of God, being the children of the resurrection.
|
|---|
| ᎥᏝ ᎠᎴ ᎿᎭᏉ ᏗᎬᏩᏂᏲᎱᎯᏍᏗ ᏱᎨᏎᏍᏗ; ᏗᏂᎧᎿᎭᏩᏗᏙᎯᏍᎩᏂ ᎦᎸᎳᏗ ᎠᏁᎯ ᏄᎾᏍᏛ ᎾᏍᎩᏯ ᏄᎾᏍᏕᏍᏗ; ᎠᎴ ᎤᏁᎳᏅᎯ ᏧᏪᏥ ᎾᏍᎩ, ᎠᏲᎱᏒ ᏗᎴᎯᏐᏗ ᎨᏒ ᏧᏪᏥ ᎨᏒ ᎢᏳᏍᏗ.
|
|---|
V-tla a-le hna-quo di-gv-wa-ni-yo-hu-hi-s-di yi-ge-se-s-di; di-ni-ka-hna-wa-di-do-hi-s-gi-ni ga-lv-la-di a-ne-hi nu-na-s-dv na-s-gi-ya nu-na-s-de-s-di; a-le U-ne-la-nv-hi tsu-we-tsi na-s-gi, a-yo-hu-sv di-le-hi-so-di ge-sv tsu-we-tsi ge-sv i-yu-s-di.
|
|---|
|
|---|
| Now that the dead are raised, even Moses shewed at the bush, when he calleth the Lord the God of Abraham, and the God of Isaac, and the God of Jacob.
|
|---|
| ᎾᏃ ᏧᏂᏲᎱᏒᎯ ᏧᎾᎴᎯᏐᏗ ᎨᏒ, ᏱᏏ ᎬᏂᎨᏒ ᏄᏩᏁᎴ ᎤᏪᏲᏓᏛᎢ, ᎾᎯᏳ ᏱᎰᏩ ᎤᏁᎳᏅᎯ ᎡᏆᎭᎻ ᎤᏤᎵᎦ, ᎠᎴ ᎤᏁᎳᏅᎯ ᎡᏏᎩ ᎤᏤᎵᎦ, ᎠᎴ ᎤᏁᎳᏅᎯ ᏤᎦᏈ ᎤᏤᎵᎦ, ᏧᏬᏎᎴᎢ.
|
|---|
Na-no tsu-ni-yo-hu-sv-hi tsu-na-le-hi-so-di ge-sv, Yi-si gv-ni-ge-sv nu-wa-ne-le u-we-yo-da-dv-i, na-hi-yu Yi-ho-wa U-ne-la-nv-hi E-qua-ha-mi u-tse-li-ga, a-le U-ne-la-nv-hi E-si-gi u-tse-li-ga, a-le U-ne-la-nv-hi Tse-ga-qui u-tse-li-ga, tsu-wo-se-le-i.
|
|---|
|
|---|
| For he is not a God of the dead, but of the living: for all live unto him.
|
|---|
| ᎤᏁᎳᏅᎯᏰᏃ ᎥᏝ ᏧᏂᏲᎱᏒᎯ ᎤᎾᏤᎵᎦ ᏱᎩ, ᏗᏅᏃᏛᏍᎩᏂ; ᎾᏍᎩᏰᏃ ᎠᏓᏅᏖᏍᎬ ᏂᎦᏗᏳ ᏗᏅᏃᏛ.
|
|---|
U-ne-la-nv-hi-ye-no v-tla tsu-ni-yo-hu-sv-hi u-na-tse-li-ga yi-gi, di-nv-no-dv-s-gi-ni; na-s-gi-ye-no a-da-nv-te-s-gv ni-ga-di-yu di-nv-no-dv.
|
|---|
|
|---|
| Then certain of the scribes answering said, Master, thou hast well said.
|
|---|
| ᎿᎭᏉᏃ ᎩᎶ ᎢᏳᎾᏍᏗ ᏗᏃᏪᎵᏍᎩ ᎤᏂᏁᏤ ᎯᎠ ᏄᏂᏪᏎᎢ, ᏔᏕᏲᎲᏍᎩ, ᏰᎵᎦᏯ ᏂᏫ.
|
|---|
Hna-quo-no gi-lo i-yu-na-s-di di-no-we-li-s-gi u-ni-ne-tse hi-a nu-ni-we-se-i, Ta-de-yo-hv-s-gi, ye-li-ga-ya ni-wi.
|
|---|
|
|---|
| And after that they durst not ask him any question at all.
|
|---|
| ᎾᎯᏳᏃ ᎢᏳᏓᎴᏅᏛ ᎠᏂᏍᎦᎢᎮ ᎪᎱᏍᏗ ᎬᏩᏛᏛᏗᏱ.
|
|---|
Na-hi-yu-no i-yu-da-le-nv-dv a-ni-s-ga-i-he go-hu-s-di gv-wa-dv-dv-di-yi.
|
|---|
|
|---|
| And he said unto them, How say they that Christ is David's son?
|
|---|
| ᎯᎠᏃ ᏂᏚᏪᏎᎴᎢ, ᎦᏙ ᏗᎦᎵᏍᏙᏗᎭ ᎦᎶᏁᏛ ᏕᏫ ᎤᏪᏥ ᏣᎾᏗᎭ?
|
|---|
Hi-a-no ni-du-we-se-le-i, ga-do di-ga-li-s-do-di-ha Ga-lo-ne-dv De-wi u-we-tsi tsa-na-di-ha?
|
|---|
|
|---|
| And David himself saith in the book of Psalms, The LORD said unto my Lord, Sit thou on my right hand,
|
|---|
| ᏕᏫᏃ ᎤᏩᏒ ᎯᎠ ᏂᎦᏪᎭ ᏗᎧᏃᎩᏍᏗᏱ ᎪᏪᎵ, ᏱᎰᏩ ᎯᎠ ᏄᏪᏎᎴ ᎤᎬᏫᏳᎯ ᎠᏆᏤᎵᎦ, ᏥᎦᏘᏏ ᎢᏗᏢ ᏦᎴᏍᏗ,
|
|---|
De-wi-no u-wa-sv hi-a ni-ga-we-ha Di-ka-no-gi-s-di-yi go-we-li, Yi-ho-wa hi-a nu-we-se-le U-gv-wi-yu-hi a-qua-tse-li-ga, Tsi-ga-ti-si i-di-tlv tso-le-s-di,
|
|---|
|
|---|
| Till I make thine enemies thy footstool.
|
|---|
| ᎬᏂ ᎨᏣᏍᎦᎩ ᏗᏣᎳᏏᏗᏱ ᎦᏍᎩᎶ ᏂᎦᏥᏴᏁᎸᎭ.
|
|---|
Gv-ni ge-tsa-s-ga-gi di-tsa-la-si-di-yi ga-s-gi-lo ni-ga-tsi-yv-ne-lv-ha.
|
|---|
|
|---|
| David therefore calleth him Lord, how is he then his son?
|
|---|
| ᏕᏫᏰᏃ ᏣᎬᏫᏳᎯ ᎪᏎᎭ; ᎦᏙᏃ ᏗᎦᎵᏍᏙᏗᎭ ᎤᏪᏥ ᎢᎩ?
|
|---|
De-wi-ye-no Tsa-gv-wi-yu-hi go-se-ha; ga-do-no di-ga-li-s-do-di-ha u-we-tsi i-gi?
|
|---|
|
|---|
| Then in the audience of all the people he said unto his disciples,
|
|---|
| ᎿᎭᏉᏃ ᏂᎦᏛ ᏴᏫ ᎤᎾᏛᏓᏍᏛ, ᎯᎠ ᏂᏚᏪᏎᎴ ᎬᏩᏍᏓᏩᏗᏙᎯ,
|
|---|
Hna-quo-no ni-ga-dv yv-wi u-na-dv-da-s-dv, hi-a ni-du-we-se-le gv-wa-s-da-wa-di-do-hi,
|
|---|
|
|---|
| Beware of the scribes, which desire to walk in long robes, and love greetings in the markets, and the highest seats in the synagogues, and the chief rooms at feasts;
|
|---|
| ᏕᏤᏯᏙᏤᎮᏍᏗ ᏗᏃᏪᎵᏍᎩ, ᎾᏍᎩ ᏧᎾᏚᎵᏍᎪ ᏗᎦᏅᎯᏛ ᏧᎾᏄᏩᎢ ᎤᏁᏓᏍᏗᏱ, ᎠᎴ ᎣᏏᏳ ᏧᏂᏰᎸᎭ ᎨᏥᏲᎵᏍᏗᏱ ᏗᎦᏃᏙᏗᏱ, ᎠᎴ ᏄᎬᏫᏳᏒ ᏕᎦᏍᎩᎸ ᏗᎦᎳᏫᎢᏍᏗᏱ, ᎠᎴ ᏄᎬᏫᏳᏒ ᏗᎾᏢᏗᏱ ᏓᎾᎵᏍᏓᏴᎲᏍᎬᎢ;
|
|---|
De-tse-ya-do-tse-he-s-di di-no-we-li-s-gi, na-s-gi tsu-na-du-li-s-go di-ga-nv-hi-dv tsu-na-nu-wa-i u-ne-da-s-di-yi, a-le o-si-yu tsu-ni-ye-lv-ha ge-tsi-yo-li-s-di-yi di-ga-no-do-di-yi, a-le nu-gv-wi-yu-sv de-ga-s-gi-lv di-ga-la-wi-i-s-di-yi, a-le nu-gv-wi-yu-sv di-na-tlv-di-yi da-na-li-s-da-yv-hv-s-gv-i;
|
|---|
|
|---|
| Which devour widows' houses, and for a shew make long prayers: the same shall receive greater damnation.
|
|---|
| ᎾᏍᎩ ᏥᏓᏂᏒᏁᎰ ᏧᏃᏑᎶᏨᎯ ᏓᏂᏁᎸᎢ, ᎠᎴ ᎤᎾᏠᎾᏍᏛ ᎪᎯᏗᏳ ᏣᎾᏓᏙᎵᏍᏗᏍᎪᎢ; ᎾᏍᎩ ᎤᏟᎯᏳ ᎢᎦᎢ ᎤᏂᎩᎵᏲᎢᏍᏗ ᎨᏎᏍᏗ.
|
|---|
Na-s-gi tsi-da-ni-sv-ne-ho tsu-no-su-lo-tsv-hi da-ni-ne-lv-i, a-le u-na-tlo-na-s-dv go-hi-di-yu tsa-na-da-do-li-s-di-s-go-i; na-s-gi u-tli-hi-yu i-ga-i u-ni-gi-li-yo-i-s-di ge-se-s-di.
|
|---|


This method enables the following syntax:
This method enables the following syntax:
result should be < (7)
^
Note that the less than operator will be invoked on be
in this expression, not
on a result of passing be
to should
, as with most other operators
in the matchers DSL, because the less than operator has a higher precedence than should
.
Thus in the above case the first expression evaluated will be be < (7)
, which results
in a matcher that is passed to should
.
This method also enables the following syntax:
result should not (be < (7))
^
This method enables the following syntax:
This method enables the following syntax:
result should be <= (7)
^
Note that the less than or equal to operator will be invoked on be
in this expression, not
on a result of passing be
to should
, as with most other operators
in the matchers DSL, because the less than or equal to operator has a higher precedence than should
.
Thus in the above case the first expression evaluated will be be <= (7)
, which results
in a matcher that is passed to should
.
This method also enables the following syntax:
result should not (be <= (7))
^
This method enables the following syntax:
This method enables the following syntax:
result should be === (7)
^
Note that the === operator will be invoked on be
in this expression, not
on a result of passing be
to should
, as with most other operators
in the matchers DSL, because the ===n operator has a higher precedence than should
.
Thus in the above case the first expression evaluated will be be === (7)
, which results
in a matcher that is passed to should
.
This method also enables the following syntax:
result should not (be === (7))
^
This method enables the following syntax:
This method enables the following syntax:
result should be > (7)
^
Note that the greater than operator will be invoked on be
in this expression, not
on a result of passing be
to should
, as with most other operators
in the matchers DSL, because the greater than operator has a higher precedence than should
.
Thus in the above case the first expression evaluated will be be > (7)
, which results
in a matcher that is passed to should
.
This method also enables the following syntax:
result should not (be > (7))
^
This method enables the following syntax:
This method enables the following syntax:
result should be >= (7)
^
Note that the greater than or equal to operator will be invoked on be
in this expression, not
on a result of passing be
to should
, as with most other operators
in the matchers DSL, because the greater than or equal to operator has a higher precedence than should
.
Thus in the above case the first expression evaluated will be be >= (7)
, which results
in a matcher that is passed to should
.
This method also enables the following syntax:
result should not (be >= (7))
^
This method enables the following syntax, where fileMock
is, for example, of type File
and
file
refers to a BePropertyMatcher[File]
:
This method enables the following syntax, where fileMock
is, for example, of type File
and
file
refers to a BePropertyMatcher[File]
:
fileMock should not { be a (file) } ^
This method enables the following syntax:
This method enables the following syntax:
fileMock should not { be a ('file) }
^
This method enables the following syntax, where keyEvent
is, for example, of type KeyEvent
and
actionKey
refers to a BePropertyMatcher[KeyEvent]
:
This method enables the following syntax, where keyEvent
is, for example, of type KeyEvent
and
actionKey
refers to a BePropertyMatcher[KeyEvent]
:
keyEvent should not { be an (actionKey) } ^
This method enables the following syntax:
This method enables the following syntax:
animal should not { be an ('elephant) }
^
This method enables be
to be used for equality comparison.
This method enables be
to be used for equality comparison. Here are some examples:
result should be (None) result should be (Some(1)) result should be (true) result should be (false) sum should be (19) ^
This method enables the following syntax, where open
refers to a BePropertyMatcher
:
This method enables the following syntax, where open
refers to a BePropertyMatcher
:
door should be (open) ^
This method enables the following syntax, where num
is, for example, of type Int
and
odd
refers to a BeMatcher[Int]
:
This method enables the following syntax, where num
is, for example, of type Int
and
odd
refers to a BeMatcher[Int]
:
num should be (odd) ^
This method enables the following syntax:
This method enables the following syntax:
set should be ('empty)
^
This method enables the following syntax:
This method enables the following syntax:
result should be (null)
^
This method enables the following syntax:
This method enables the following syntax:
result should be (true)
^
This method enables the following syntax:
This method enables the following syntax:
sevenByte should be (7.toByte plusOrMinus 2.toByte) ^
This method enables the following syntax:
This method enables the following syntax:
sevenShort should be (7.toShort plusOrMinus 2.toShort) ^
This method enables the following syntax:
This method enables the following syntax:
sevenInt should be (7 plusOrMinus 2) ^
This method enables the following syntax:
This method enables the following syntax:
sevenLong should be (7L plusOrMinus 2L) ^
This method enables the following syntax:
This method enables the following syntax:
sevenDotOhFloat should be (7.1f plusOrMinus 0.2f) ^
This method enables the following syntax:
This method enables the following syntax:
sevenDotOh should be (7.1 plusOrMinus 0.2) ^
This method enables the following syntax:
This method enables the following syntax:
result should be theSameInstancreAs (anotherObject) ^
This class is part of the ScalaTest matchers DSL. Please see the documentation for
ShouldMatchers
orMustMatchers
for an overview of the matchers DSL.Class
BeWord
contains anapply
method that takes aSymbol
, which uses reflection to find and access aBoolean
property and determine if it istrue
. If the symbol passed is'empty
, for example, theapply
method will use reflection to look for a public Java field named "empty", a public method named "empty", or a public method named "isEmpty". If a field, it must be of typeBoolean
. If a method, it must take no parameters and returnBoolean
. If multiple candidates are found, theapply
method will select based on the following algorithm:TestFailedException
, because no candidates foundisEmpty()
isEmpty()
empty()
empty()
empty()
isEmpty()
empty()
(this can occur whenBeanProperty
annotation is used)empty
empty
empty
isEmpty()
isEmpty()
empty
empty()
empty()
empty
empty()
isEmpty()
empty()
(this can occur whenBeanProperty
annotation is used)


Apple Safari 6 1 6 Version Free Download Macupdate
Safari 6 1 6 Dmg Newplex
Silverlight How To Remove Mac Os X Mavericks Safari 6 1 Sandbox Restrictions For Silverlight Enabled Websites Microsoft Tech Community
Safari 6 1 6 Download For Mac
Safari Web Browser Wikipedia
How To Update Safari On Mac 12 Steps With Pictures Wikihow
Safari 6 1 6 Download For Mac Bossdwnload
Download Safari 7 0 1 Safari 6 1 1 For Os X
Apple Releases Os X 10 9 4 Mavericks Seed With New Focus Areas Safari 6 1 5 And Os X Server 3 2 Betas Appleinsider
Apple Releases Ios 6 1 For Download For Iphone Ipad And Ipod Touch Iphone In Canada Blog
Safari Apple
Safari 6 0 4 Update Fixes Webkit Flaw And Improves Java Control The Mac Security Blog
Apple Seeds Safari 6 1 1 7 0 1 Updates To Developers Following Internal Testing 9to5mac
Cookie For Mac Download Free Latest Version Macos
How Do I Update To Safari 6 For Os X Lion Apple Community
How To Choose When Safari Clears The Downloaded File List On Your Mac Macrumors
Apple Seeds Safari 7 0 3 And 6 1 3 Seed 2 To Developers 9to5mac
Apple Issues Safari 7 0 3 And 6 1 3 Betas With Focus On Autofill Push Notifications Appleinsider
Safari 6 1 Download For Mac Supportsonic
Panic Blog Coda Notes A Safari Extension
How To Download And Install Safari Youtube
Safari Browser For Mac 14 Download Techspot
Question Is There Another Way To Download Youtube On Ios 6 1 3 Legacyjailbreak
How To Install Safari Extensions On Your Mac Apple Support
Safari 6 1 1 Download For Mac Peatix
Cydia Download Ipod 4g No Computer
How To Uninstall Safari On Mac A Complete How To Guide To Remove Safari Browser From Macos And Earlier Os X
Where To Download Iphone Firmware Files From Iclarified
Ios 7 Jailbreak Untethered Download Links Jailbreak 6 1 3 Ios 7 Ios 7 Apple Ios Ios


The generics/is_elemental.h
header defines a macro that determines if the type of a generic data structure is elemental.
#include <chaos/preprocessor/generics/is_elemental.h>
The CHAOS_PP_IS_ELEMENTAL
macro determines if the type represented by its argument is elemental.
CHAOS_PP_IS_ELEMENTAL
(type)
The type to be tested.
If the type represented by type is elemental, this macro expands to 1
.
Otherwise, it expands to 0
.
The type of a generic data structure is elemental if the elements contained therein are not variadic (i.e. the contained elements are all the same arity).
Consequently, in C (prior to C99) and C++ this macro always expands to 1
because only unary elements are supported.
#include<chaos/preprocessor/config.h>
#include<chaos/preprocessor/generics/is_elemental.h>
#include<chaos/preprocessor/list/core.h>
#include<chaos/preprocessor/seq/variadic/core.h>
CHAOS_PP_IS_ELEMENTAL
(CHAOS_PP_LIST
) // 1 #ifCHAOS_PP_VARIADICS
CHAOS_PP_IS_ELEMENTAL
(CHAOS_PP_VARIADIC_SEQ
) // 0 #endif
The CHAOS_PP_IS_ELEMENTAL_ID
macro indirectly expands to CHAOS_PP_IS_ELEMENTAL
.
CHAOS_PP_IS_ELEMENTAL_ID
()
This macro exists only for uniformity with other macros that require indirect invocation.
The CHAOS_PP_IS_ELEMENTAL_
macro expands to a λ expression representing CHAOS_PP_IS_ELEMENTAL
.
CHAOS_PP_IS_ELEMENTAL_
This macro is a shorthand form of the following λ binding:


run: >>> Filename? always_lyrics.txt [Blink:4] [But:2] [Calling:3] [Falling:3] [I:1] [Ill:1] [Im:7] [In:2] [It:5] [Just:1] [Leave:1] [Like:1] [Lonely:1] [My:1] [Now:3] [Oh:1] [On:1] [Put:1] [That:1] [When:1] [You:1] [a:5] [alone:1] [always:8] [and:2] [apart:1] [are:1] [at:3] [back:5] [bad:1] [be:1] [blinking:3] [bone:1] [card:1] [castles:1] [could:1] [dead:1] [end:3] [fine:1] [fly:1] [for:6] [get:1] [gets:1] [glue:1] [heavy:1] [it:1] [kid:1] [king:1] [know:4] [let:4] [levy:1] [life:1] [light:3] [little:1] [lonely:1] [me:12] [my:1] [myself:1] [of:3] [on:1] [outside:1] [road:3] [rusty:1] [says:1] [siege:1] [sign:1] [skin:1] [spiders:1] [taking:1] [that:2] [thats:1] [the:12] [theres:3] [thinking:2] [throne:1] [time:3] [to:4] [too:1] [trapped:1] [under:1] [was:5] [web:1] [well:1] [world:1] [you:5] [your:1]


Pirate (ARRR) is a cryptocurrency that solves the issue of financial privacy on the blockchain through forced anonymous transactions. Protect your wallet and transactions with Pirate’s completely anonymous network. With forced private transactions, your privacy cannot be compromised by another users’ activity on the network. If you wish to learn more, please join the official Pirate Discord at https://pirate.black/discord/ or message FishyGuts#5085, who will be happy to help out.
100 messages
Before 05-Dec-19 12:00 AM
grewalsatinder26-Sep-18 02:37 PM
ComputerGenie 👴👴👴26-Sep-18 02:37 PM
I was searching all over github trying to find 42d
grewalsatinder26-Sep-18 02:37 PM
then it should't show as this notification in wallet
Desktop App for SuperNET DAPPs. Contribute to KomodoPlatform/Agama development by creating an account on GitHub.
grewalsatinder26-Sep-18 02:56 PM
@SHossain yes it's clear mate
1
but v42c shouldn't point to 41d(edited)
in it's new version notice
see screen shot
SHossain26-Sep-18 02:56 PM
oh. yes. that is the new development happening in Agama
still being tested. once ready @pbca26 will fully implement it
That is Under Construction (Development)
CryptoNinjaa26-Sep-18 03:01 PM
I have created 2 more pirates from twitter
house26-Sep-18 03:02 PM
Arrr ... yep, am sounds good
CryptoNinjaa26-Sep-18 03:05 PM
Network Hash/s: 8.46 MSol/s climbing again
Hermes26-Sep-18 03:07 PM
I am buying amounts of around 1000s Pirates if interested send me your offers PM
LesDudis26-Sep-18 03:13 PM
Hello. How often does piratepool.io send payments?
0x0326-Sep-18 03:14 PM
@webworker01
CryptoNinjaa26-Sep-18 03:15 PM
im getting payouts every few minutes
LesDudis26-Sep-18 03:16 PM
Hmm. Been mining for about day but I have nothing on my address yet.(edited)
Mark8126-Sep-18 03:16 PM
Once i dived through BCT of PIRATE and read this thread ---> I start see jl777 effect... Of course seeing pirate airdrop on my wallet successfully landed i cant wait jl777 vice words to come true: komodo $1000 and PIRATE $100
LesDudis26-Sep-18 03:17 PM
yeah, it shows 0
getblockcount gives 36858
costa243926-Sep-18 03:22 PM
Btw 10000 pirates
0x0326-Sep-18 03:22 PM
thats the wrong chain then
costa243926-Sep-18 03:22 PM
Wtb*
sungrace26-Sep-18 03:22 PM
Hello
Good day
Pls I want to buy pirate
0x0326-Sep-18 03:22 PM
@sungrace check the pinned posts
LesDudis26-Sep-18 03:30 PM
I'll give it a go webworker01, thanks
klunex26-Sep-18 03:34 PM
there is always the argument optional privacy is bad. I never understood why.
jl777c26-Sep-18 03:35 PM
because it allows privacy to be lost
with mandatory privacy there is no issue of mixing with de-anonymized transparent funds
Mylo26-Sep-18 03:54 PM
who is in charge or pirate.black? i've got a question, wanna DM them.
FishyGuts26-Sep-18 03:54 PM
700 messages in the last 8 hours, not counting #deleted-channel.
You sure Pirate doesn’t need its own discord?
I was asking the same thing last night Mylo.
jl777c26-Sep-18 03:54 PM
@grewalsatinder does pirate.black
grewalsatinder26-Sep-18 03:55 PM
ME E @Mylo
how can I help
ComputerGenie 👴👴👴26-Sep-18 03:57 PM
looks like Jack Skellington(edited)
Sharifa26-Sep-18 03:58 PM
Can i create a $PIRATE address & send 15 KMD from Agama 0.1.0 (Android) and receive 777 PIRATE in my Mobile Wallet ?(edited)
SHossain26-Sep-18 03:59 PM
you need native mode
Sharifa26-Sep-18 03:59 PM
@SHossain
SHossain26-Sep-18 03:59 PM
web, spv or android has not support
you can use KMD, but not PIRATE
Sharifa26-Sep-18 04:00 PM
@SHossain what's PIRATE contract address?
NedBGQ26-Sep-18 04:01 PM
I'm looking around trying to find any mentioned major differences btw. pirate and btch.
SHossain26-Sep-18 04:01 PM
There is no contract address. Check the pinned posts to learn more about PIRATE.
Sharifa26-Sep-18 04:01 PM
@SHossain ok thx
SHossain26-Sep-18 04:01 PM
@NedBGQ BTCH can use t transaction. PIRATE doesn't. It only does z tx
ComputerGenie 👴👴👴26-Sep-18 04:02 PM
And PIRATE didn't include the moneygrab airdrop of BTCH
NedBGQ26-Sep-18 04:02 PM
true story bro
grewalsatinder26-Sep-18 04:03 PM
there's the one and only single thing that I think PIRATE will feel annoyed with.....
till sapling....
the long time of z tx processing
nothing else would be annoying....
only patience can help
PIRATE will teach you how to be patient
till Sapling
SHossain26-Sep-18 04:03 PM
@Sharifa you can't receive PIRATE in your KMD R address
0x0326-Sep-18 04:04 PM
parrrrtience
grewalsatinder26-Sep-18 04:04 PM
yarrrrr
2
ComputerGenie 👴👴👴26-Sep-18 04:04 PM
has a real PC and isn't bothered by the 20-30 seconds it takes to do a z tx
2
grewalsatinder26-Sep-18 04:04 PM
happy far ya matey
0x0326-Sep-18 04:04 PM
NedBGQ26-Sep-18 04:05 PM
it was super fast btw
0x0326-Sep-18 04:05 PM
btw, is komodo now building on raspberry pi?
talking about 'taking a while'
grewalsatinder26-Sep-18 04:05 PM
Rock64 you can expect
but not raspberry pi
it will run, but die soon
0x0326-Sep-18 04:06 PM
because of little ram?
grewalsatinder26-Sep-18 04:06 PM
R.I.P by KMD
yes
or may be Sapling will help keep it alive
0x0326-Sep-18 04:06 PM
lets see
grewalsatinder26-Sep-18 04:06 PM
big hopes from sapling
let's see
@webworker01 yea, on arm dependencies is another headache
Scaleway is a cloud computing platform offering SSD cloud servers for any workload, starting at €1.99 per month. Pay as you go with a simple and flexible pricing.
Litecoin source tree. Contribute to emc2foundation/einsteinium development by creating an account on GitHub.
maybe that is helpful to someone ?
grewalsatinder26-Sep-18 04:08 PM
yep, that's good choice. used them
I'll test soon compiling KMD on Rock64
sorted it out to install linux on it
took me long to sort it
0x0326-Sep-18 04:10 PM
i'll try that emc2 howto now, thanks for hinting(edited)
Mark8126-Sep-18 04:12 PM
Anyone used Windows 10 pro Hyper-V for virtual pc? I tryed that for installing ubuntu and it is amazing. It has fast Ubuntu 18.04.1 setup with few clicks.(edited)
Mylo26-Sep-18 04:15 PM
ah cool @0x03 lmk how far you go. otherwise gentoo has some good docs/hints on cross compiling


Uruguay
The Girl and the Puma
Five hundred years ago when the Spanish entered South America, Native American tribes often fought back against the invaders. One way tribes could put pressure on the Spanish was to surround their settlements. This is what happened in the early 1500's when Maldonado, a Spanish girl, was 15 years old. Hostile Native Americans of the Querandí tribe had encircled the Spanish settlement where Maldonado lived. Before long, their food supplies were depleted. The people faced starvation. They begged their captain to allow them to take their chances and leave the settlement in search of food - but this the captain would not allow. Famished, Maldonado escaped the settlement and fled into the jungle. As night fell, she heard with alarm the calls of wild animals. Where could she safely sleep for the night? But there was one call that drew her closer. It was a cry of pain. She followed the sound to a cave where she found a puma that had just given birth. Maldonado helped the mother puma clean the cubs. Later, she watched the babies while the mother went out to hunt. And so days went by. One day, while Maldonado was gathering food and the mother puma was inside the cave with her cubs, the girl was surprised by Querandí warriors. They captured her and brought her to their village. Fearing the worst, Maldonado braced herself for the death she felt certain was to come. But the Querandís were kind to the girl. They taught her tasks to help in their village, and she gladly took part. One day, a band of Spaniards attacked the Querandí village. Recognizing a Spanish girl, they grabbed Maldonado and forced her to return home. The Spanish captain was furious that she had disobeyed him by escaping to the jungle. To make an example of her, he commanded that she be tied to a tree and left there for wild animals to devour. After several days, the sad villagers ventured where Maldonado had been tied to the tree, fearing the worst. Much to their surprise they found her still tied to the tree and very much alive. Much more surprised were they to learn that it was a mother puma who had fed and protected the girl all that time. Notes to the story: The story is a legend. History tells us that Maldonado's Spanish settlement was abandoned in 1540 and moved to modern-day Paraguay. Forty years later, the site was re-founded 40 years as Buenos Aires. It's also interesting to note there's a city in Uruguay (across the Río de la Plata, or in English, the Plata River) named Maldonado in honor of the heroine of this tale.
Source: Here


×
Simple Fabric Bags
4 customer reviews
$17.20
$45.00
Designed for simplicity and made from high quality materials. Its sleek geometry and material combinations creates a modern look.
Select color
Red
Gold
Orange
Orange
Select size
L
M
S
XL
XXL
Share this product
Add to cart


--- layout: ion_page title: Events permalink: /events/ ---
In the academic year 2016/2017, we will organize suturing workshops, career nights and regular seminars for all Hong Kong medical students. We may also send a team of representatives for International Symposium in 2017.
Surgical pioneers will share with us their personal experiences, and the reasons why they chose to become a surgeon. Furthermore, there will be talks on technological breakthroughs in surgery, such as robotic surgery, and other advancing techniques that are put into practice recently. Finally, they will talk about medical students’ future career paths, and the preparation needed to pursue a surgical career.
It is a semi-formal event. Students will have the chance to meet and talk with surgical experts from different specialties in a relaxing environment. We expect it to help in building lasting relationships between the students and the surgeons.
It is an introductory session on suturing and knot tying, in which a mentor will teach students in a small-group setting (around 10 pre-clinical students). Each participant will receive their own set of materials. Both basic and advanced workshops will be offered.
In order to build connections with surgical societies around the world, we will register with the International Association of Student Surgical Societies (IASSS) this year. There will be exchange opportunities with other universities and we may send representatives to the International Symposium of IASSS in the summer of 2017.
Surgical Taster Day is a two-day programme designed specially for secondary school students who have great interest in studying medicine or even choosing surgery as a career. Participants will spend each day at one of the two medical schools in Hong Kong, and learn fundamental surgical skills and knowledge with surgery as the overarching theme.