Make an image transparent using Gimp
Gimp is a free utility that can be downloaded from here
- Prepare the image by making the area you want to be transparent all the same color
- Open image file using Gimp
- Select Tools, By Color Select
- Click on the color that you want to be transparent (The area will be outlined)
- Select Colors, Color to Alpha, Ok (A checkered pattern will display)
- Select File, Export As
- Type in the name of the file (use .png)
- Click on export


Whats your name?
Pick a time you want to chat with {{ lobbyname }}
Availability
{{ openTime.text }}
{{confirmation}}
Schedule a hangout
Click to join early


yeeb bot
Started as a meme to confuse my friends on discord. Ended as a meme to confuse everyone on discord. Utilizes multiple python libraries to implement commands with some pretty funny and (sometimes) useful functionality. My favorites are the "shitty hearthstone" command group, which starts a game of HearthStone in the discord text channel, with each player typing in action indexes to play cards and attack. Also has multiple Music commands, with the ability to search and queue songs from youtube, then play them directly into the voice channel.
The bot also has multiple event listeners, which sends a meme after certain words are typed into the chat (when you least expect it).
Some libraries used include:
Commands List:
Sorry in advance...
| Command | What it do tho? | Details maybe |
|---|---|---|
| bruh apex (platform*) (user) | Check apex legends stats for (user). api is pretty trash rn tho, so it can only track one legend, and whatever trackers you have equipped | Default is pc because pc is better. You can also use xbox or psn |
| bruh help | Dms you "bet" | |
| bruh clear (num) | Clears (num) of messages from the chat channel | |
| bruh snap | Randomly clears half of all messages from the chat channel, and sends a gif of thanos doing fortnite dances | |
| bruh finnasmash | Tells you to use bruh finna smash instead lol | |
| bruh spam (message) (num) | Spams (message) into the chat channel (num) times | oof, luckily only I can use this |
| bruh thatsprettycringe | Sends a pic of a cringe-ass nae nae baby | |
| bruh howlong | Sends the years, months, days, hours, minutes, and seconds until Bobby Schmurda's release | |
| bruh code | Sends a link to the github project page | |
| bruh censor (user*) (time*) | Deletes new messages and retypes them using the |censor| format in discord (default 1 minute) | If a user or time is provided it will only censor that user or for that amount of time (in minutes) |
| bruh die | Stops the bot | Only I have the power |
| bruh invite | Sends a link to invite yeeb bot to your discord servers | |
| Hearthstone commands | ||
| bruh shitty hearthstone | Creates a bad game of hearthstone in the discord chat | Uses the fireplace hearthstone simulator |
| bruh hearthstone join | Allows a player to join the shitty hearthstone game | |
| bruh hearthstone itstimetoduel | Begins the game | |
| bruh hearthstone reset | Resets the game | |
| Music commands | ||
| bruh summon | Summons bot to the voice channel of the author | |
| bruh play (video) | Plays the audio from (video) | Can either be a url or keyword, and starts a queue |
| bruh volume (volume) | Adjusts the volume by (volume)% | |
| BRUH WARUDO | Pauses the song | |
| bruh resume | Unwarudo | |
| bruh stop | Stops playing and leaves the voice channel (resets queue too) | |
| bruh skip | Skips the current song if user requested the song, otherwise starts a vote | 3 votes to skip |
| bruh whatsthisfire | Displays now-playing info, along with number of skips | |
| bruh onjah | Plays moonlight earrape and sends a photo of gekyume's dad | |
| bruh moment | Plays bruh sound effect #2 | |
| bruh go sicko mode | Plays bass boosted sicko mode and sends a gif of howard | |
| bruh jojo | Plays a random jojo song or Joseph Joestar compilation | |
| bruh giogio | Plays il vento d'oro, with a 4/5 chance to only play the best part | |
| bruh this | If in a voice channel, says "This is so sad, alexa play (a random song from billboard top 100)", otherwise say "This is so (random wikipedia article), can we hit (random integer) (different wiki article)". | ye… possibly the best command |
| bruh finna smash | Plays a random smash bros theme, with a high chance of playing ringading | |
| bruh shid (time*) | Joins and leaves the author's voice channel for (time) seconds | Default 10 seconds |
sirmammingtonham/yeeb


Remittance Project
Admin
Sender address
Sender balance
=
Create Hash
Deposit
Withdraw
Reclaim
Claim Fees
Password
Looks good!
Fill in this field.
Receiver address
I wish I was the receiver!
Must be a valid ethereum address!
Create Hash
Hash
This is a valid hash!
Must be a valid hash!
WEI Amount
Looks good!
Must be greater than one
=
Receiver address
I wish I was the receiver!
Must be a valid ethereum address!
Block Days Limit
Looks good!
Fill in this field with a value between 1 and 7.
Deposit
Password
Looks good!
Fill in this field.
Withdraw
Hash
This is a valid hash!
Must be a valid hash!
Reclaim
Your Fees
=
Claim Fees
Current Transaction
Logs
Deposit
Withdraw
Reclaim
Claim Fees


{% extends "base-documentation.html" %} {% block documentation %}
The primary way to interact with Liftpass is via the API, both for editing the content of applications (ex. registering new applications, modifying goods, uploading new prices) and supplying the application with new prices via the Liftpass SDK.
All API calls are standarized for interacting with the Backend as well as the SDK. The API follows normal REST best practices where the HTTP request method is as important as the URL itself. All parameters sent are in JSON format.
The minimal backend JSON call must contain:
{% highlight 'json' %} { "liftpass-user": "<32 character long user key>", "liftpass-url": "The minimal SDK JSON call must contain:
{% highlight 'json' %} { "liftpass-application": "<32 character long application key>", "liftpass-time": "For GET calls the JSON request should be encoded into Base64 and added to the URL request for example: /applications/list/v1/?json=...
. Other REST requests including POST, PUT, and DELETE the JSON content can be placed in the request body of the HTTP request.
liftpass-debug
flag can be set to True
. This will log all SDK requests as well as responses to the dashboard.
Liftpass authenticates all API REST requests using HMAC. HMAC fundamentally creates a unique hash (using SHA-256) of the JSON request and the application/user secret (depending if the API call is coming from an application or backend). The hash generated must be then added to the HTTP request header with the name liftpass-hash
. Liftpass will then check this hash value with the one it calculates. This process ensures that the request has come from a source that knew the application/user secret key. Any modification of the JSON body during transmission will render the request invalid.
In more detail the HMAC authentication works as follows:
liftpass-user
, liftpass-url
, and liftpass-time
.liftpass-application
and liftpass-time
.liftpass-hash
.liftpass-time
(in UTC time) must be no more than 15 minutes different from that of the Liftpass server.


Dear [customer],
Hello and welcome to the Butterscotch Rose Photography storefront! We are a sister team established in January of 2017 with years of professional experience and an enormous amount of passion between us. We pride ourselves on our unparalleled work ethic and attention to detail; it takes time and hard work to capture and edit amazing photos & video, and we don't believe in one-filter-fits-most!
Working with Alyssa and Stephanie was so easy and comfortable. Everything from the our first conversations about packages and pricing to the day of our wedding and post-wedding communications, I knew we were in good hands.
Sincerely,
Alyssa & Stephanie


Search for users to check if they have this role. Once users are found, you can add or remove them from this role.
{{rolesHash[role]}}
| First Name | {{element.first_name}} | Department Name | {{element.department_name}} | Email ID | {{element.email}} | Last Name | {{element.last_name}} |
|
|---|


Let this...
Be the answer to...
Due to lack of funding, many students in the Chicago area lose an important opportunity to engage in fine arts. This program encourages students from the 1st grade to the 12th. With your $1 donation you will be providing art supplies to many young artists. Most importantly your each submission is kept in our gallery archive!
Your donation will go towards opportunities for fine arts to be a part of students lives. These opportunities include after school events at open venues (YMCA) and providing students with art supplies.


Toggle navigation
Home
Help
About
Add new zone
{{zone.Name}}
Expires:
{{zone['Expired-at']| date}}
Activity by time:
Topics:
{{topic}}
Messages:
Create Zone
Name:
Expiry Date:
Topics:
add topic
delete topic
Zone:
Reset
Submit
{{topic}}
{{ title }}
{{ message }}
{{ name }}
Topics: {{ topics }}
An Ephemeral Experience
Explore the map!
Find help in the bar above!


These should only be vacancies for permanent or temporary staff.
To show DHSC and others how the level of staff vacancies and the number employed affects the sector over time.
Total vacancies: {{ totalVacancies }}


Before Change
"perc_labels": rect_labels,
"cohort_label": cohort_label}
student = Student("Johnny Doe", 2, "boy")
scores = dict(zip(testNames,
(Score(v, p) for v, p in
zip(["7", "48", "12:52", "17", "14"],
np.round(np.random.uniform(0, 1,
len(testNames))*100, 0)))))
cohort_size = 62 // The number of other 2nd grade boys
arts = plot_student_results(student, scores, cohort_size)
plt.show()
After Change
// GLOBAL CONSTANTS
testNames = ["Pacer Test", "Flexed Arm\n Hang", "Mile Run", "Agility",
"Push Ups"]
testMeta = dict(zip(testNames, ["laps", "sec", "min:sec", "sec", ""]))
def attach_ordinal(num):
helper function to add ordinal string to integers


public interface IFetchResult
com.ibm.team.repository.service.IRepositoryItemService
.| Modifier and Type | Method and Description |
|---|---|
java.util.List |
getMissingItems()
Returns all missing items in a list.
|
java.util.List |
getNotFoundItems()
Return a list containing all items that the fetch call could not find
|
java.util.List |
getPermissionDeniedItems()
Return a list containing all of the items requested in the fetch for
which the current user was denied permission to read.
|
java.util.List |
getRetrievedItems()
Return a list containing all items that the fetch call retrieved.
|
boolean |
hasMissingItems()
Returns true if the fetch could not retrieve any of the requested items
for any reason.
|
boolean |
hasNotFoundItems()
Returns true if any of the requested items to the fetch call were not
found.
|
boolean |
hasPermissionDeniedItems()
Returns true if the user was denied permission to read any of the
requested items.
|
java.util.List getRetrievedItems()
java.util.List getNotFoundItems()
java.util.List getPermissionDeniedItems()
java.util.List getMissingItems()
boolean hasNotFoundItems()
boolean hasPermissionDeniedItems()
boolean hasMissingItems()


{{ partial "header.html" . }}
{{ partial "navigation.html" . }}
{{ partial "post-content.html" . }}
{{ partial "sidebar.html" . }}
{{ partial "footer.html" . }}
{{ partial "scripts.html" . }}


Using the Python Interface¶
Once installed, you can simply import the desired submodular function and optimizer via PySSM
. For a detailed explanation on specific parameters / functions provided please have a look at the documentation of the individual optimizers. Generally, each optimizer provides
fit(X)
: Selects a summary of the given data set (batch processing)next(x)
: Consumes the next data item from a stream (stream processing)get_solution()
: Returns the current solutionget_ids()
: Returns the id (if any) of each objectget_num_candidate_solutions
: Returns the number of intermediate solutions stored by the optimizerget_num_elements_stored
: Returns the number of elements stored by the optimizerget_fval
: Returns the function value
The following example uses the Greedy optimizer to select a data summary by maximizing the Informative Vector Machine (the full examples can be found in tests/main.py
)
from PySSM import RBFKernel
from PySSM import IVM
from PySSM import Greedy
X = [
[0, 0],
[1, 1],
[0.5, 1.0],
[1.0, 0.5],
[0, 0.5],
[0.5, 1],
[0.0, 1.0],
[1.0, 0.]
]
K = 3
kernel = RBFKernel(sigma=1,scale=1)
ivm = IVM(kernel = kernel, sigma = 1.0)
opt = Greedy(K, ivm)
opt.fit(X)
# Alternativley, you can use the streaming interface.
#for x in X:
# opt.next(x)
fval = opt.get_fval()
solution = np.array(opt.get_solution())
print("Found a solution with fval = {}".format(fval))
print(solution)
Implementing a custom kernel for the IVM¶
Implementing your own custom kernel is easy. To do so, there are two options. Either you simply implement a python function accepting two arguments x1 and x2 and simply pass them to the IVM / FastIVM object. We recommend this approach for stateless kernel functions. Alternatively, you can extend the Kernel class by implementing the clone and __call__ method. The clone method must return a clone (_not_ a copy) of the object, whereas the __call__ method accepts two the two instances x1 and x2. Use this approach if you want to implement a stateful kernel.
Note: The parameters x1 and x2 are regular python lists. Make sure to transform them to the appropriate data types before using them.
from PySSM import Kernel
# Define a new kernel by implementing the clone and __call__ function
class PolyKernel(Kernel):
def clone(self):
return PolyKernel()
def __call__(self,x1,x2):
return np.dot(np.array(x1), np.array(x2))
# Define a new kernel by implementing the function directly
def poly_kernel(x1,x2):
return np.dot(np.array(x1), np.array(x2))
# Use the class interface
kernel = PolyKernel()
ivm = FastIVM(K, kernel = kernel, sigma = 1.0)
#Alternatively use the function directly
#ivm = FastIVM(K, kernel = poly_kernel, sigma = 1.0)
Implementing custom submodular functions¶
Implementing your own submodular function is easy. Again there are two options: First, you simply provide a python function which evaluates the function value of the provided summary X. Any optimizer accepts these regular python functions and an example is given below which computes the kernel matrix of the provided summary and computes its logdet via numpys slogdet method. We recommend this approach if you want to implement stateless submodular functions.
Re-computing the kernel matrix can become slow for larger summaries. Thus, you can also implement the SubmodularFunction interface directly to cache computations. To do so, you have to implement the peek, the update, the clone and the __call__ method. For more details please see the dedicated documentation for the C++ back-end of SubmodularFunction. An example is given below.
Note: The parameters X and x are regular python lists. Make sure to transform them to the appropriate data types before using them.
from numpy.linalg import slogdet
from PySSM import SubmodularFunction
# Compute the kernel matrix + its logdet
def ivm(X):
X = np.array(X)
K = X.shape[0]
kmat = np.zeros((K,K))
for i, xi in enumerate(X):
for j, xj in enumerate(X):
kval = 1.0*np.exp(-np.sum((xi-xj)**2) / 1.0)
if i == j:
kmat[i][i] = 1.0 + kval / 1.0**2
else:
kmat[i][j] = kval / 1.0**2
kmat[j][i] = kval / 1.0**2
return slogdet(kmat)[1]
# This is a dummy implementation of the IVM function which caches the kernel matrix
class FastLogdet(SubmodularFunction):
def __init__(self, K):
super().__init__()
self.added = 0
self.K = K
self.kmat = np.zeros((K,K))
def peek(self, X, x):
# if self.added == 0:
# return 0
if self.added < self.K:
#X = np.array(X)
x = np.array(x)
row = []
for xi in X:
kval = 1.0*np.exp(-np.sum((xi-x)**2) / 1.0)
row.append(kval)
kval = 1.0*np.exp(-np.sum((x-x)**2) / 1.0)
row.append(1.0 + kval / 1.0**2)
self.kmat[:self.added, self.added] = row[:-1]
self.kmat[self.added, :self.added + 1] = row
return slogdet(self.kmat[:self.added + 1,:self.added + 1])[1]
else:
return 0
def update(self, X, x):
#X = np.array(X)
if self.added < self.K:
x = np.array(x)
row = []
for xi in X:
kval = 1.0*np.exp(-np.sum((xi-x)**2) / 1.0)
row.append(kval)
kval = 1.0*np.exp(-np.sum((x-x)**2) / 1.0)
row.append(1.0 + kval / 1.0**2)
self.kmat[:self.added, self.added] = row[:-1]
self.kmat[self.added, :self.added + 1] = row
self.added += 1
return slogdet(self.kmat[:self.added + 1,:self.added + 1])[1]
else:
return 0
def clone(self):
return FastLogdet(self.K)
def __call__(self, X):
return ivm(X)
Implementing your own optimizer¶
We currently do not support the implementation of new optimizers in Python, but only in C++. Sorry. Please have a look at the C++ documentation.


TradingCalendar
class can help us find all the available holidays during a period of time.
GetDaysByType
returns trading days of the specified TradingDayType
that contains trading events associated with the range of dates.
Here we choose the type to be TradingDayType.PublicHoliday
and list all holidays from today to the next two days. As PublicHoliday
includes weekends,
we use the type TradingDayType.Weekend
to subtract weekend holidays.
def OnData(self, data): calendar1 = self.TradingCalendar.GetDaysByType(TradingDayType.PublicHoliday, self.Time, self.Time+timedelta(days=2)) calendar2 = self.TradingCalendar.GetDaysByType(TradingDayType.Weekend, self.Time, self.Time+timedelta(days=2)) holidays = [i.Date for i in calendar1] weekends = [i.Date for i in calendar2] public_holidays = list(set(holidays) - set(weekends))
The investment vehicle is SPDR S&P500 ETF. The algorithm will trade the ETF if there are holidays within the next two days and stays in cash during other trading days.
if not self.Portfolio.Invested and len(holidays)>0: self.SetHoldings("SPY", 1) elif self.Portfolio.Invested and len(holidays)==0: self.Liquidate()


--- title: Who's Using Bedework menuTitle: Who’s Using Bedework menuRoot: About layout: default permalink: /about/deployments ---
Bedework is in use by institutions large and small, educational, commercial, and non-profit. Below is a sampling of institutions running Bedework.
Are you using Bedework? Please let us know. Even if you don't want to be listed here, we'd like to know about your experiences and the use cases you've employed.


EnableManualEntityBoneControl()
Syntax
EnableManualEntityBoneControl(#Entity, Bone$, State, InheritOrientation)Description
Enable the manual control of a bone. It can be manually moved with MoveEntityBone() and rotated with RotateEntityBone().
Parameters
#Entity The entity to use. Bone$ The bone name in the OGRE mesh. State It can be one of the following value: #True : the manual bone control is enabled. #False: the manual bone control is disabled.InheritOrientation (optional) Tells if the bone orientation should inherit from the entity orientation. It can be one of the following value: #True : the manual bone orientation inherit from the entity. #False: the manual bone orientation doesn't take in account the entity orientation.
Return value
None.
Supported OS
All


Info
Hidden in the depths of Contstable country is the last place you would expect a web page to generate from.
Stour Valley Designs is the exception.
The Goal
You might have seen clever promises of SEO, web2.0 or other buzz words that create images of cutting edge, trendy web sites. Sorry but there is none of that here.
It is my goal to work with you at your level of experience and knowledge and provide you with a simple website that does exactly what you require.
How We Get There
There are a lot of technologies out there and the terminology behind them can be quite overwhelming, that is why I concentrate on listening to your requirements and not putting technology first.
You will not find mountains of flashy animations and bloated content, I produce simple, effective and clean pages that are search engine friendly and written to the recognised standards of todays internet.
Nothing more, nothing less.
The Who
My name is Adam Chamberlin, I have had an online presence for the last few years and it was about time I put some of my skills to better use.
To which I offer myself and my toolset as a freelance coder and creator of web sites. I am no grahic designer, I know my way round Photoshop but I do not claim to be an expert. I can help with brand identity and image representation but if you want the full monty try some of the full time proffesional designers out there; I can recommend a few.
The Why
So I took a bite from the html apple when designing my first web site, and found it tasted good. However I learnt with tables and spacer.gif, some thing new was needed; symantic coding was introduced. So I went about re-teaching myself based upon xhtml and CSS, which is what creates web pages to the W3C standards; the approved mark of the internet.
The When
This is not my full time vocation, there is just not enough hours in the day to make it so, neither is there enough clients to start on your own.
So why bother?
Good question, the answer is simple; why not. I would like to take what started as a hobby to the next level.
Contact
If you feel that I can help with your next project then please get in touch.
From helping you understand how exactly the internet can fit into your business model, to creating a site.
Or maybe you have a site that just needs a quick update, or just some one to help ease the load of creating a few web pages.
What ever your requirement drop me a line and I'll see if I can help.
email<EMAIL_ADDRESS>tel: +44 (0)7816 905 420


Debugging is a time consuming and brain draining process. It’s essential part of learning and writing maintainable code. Every person has their way of debugging, approaches and tools. Sometimes you can view the traceback, pull the code from memory, and find a quick fix. Some other times, you opt different tricks like the print statement, debugger, and rubber duck method.
Debugging multi-processing bug in Python is hard because of various reasons.
- The print statement is simple to start. When all the processes write the log to the same file, there is no guarantee of the order without synchronization. You need to use
-u
orsys.stdout.flush()
or synchronizing the log statements using process ids or any identifier. Without PID it’s hard to know which process is stuck. - You can’t put
pdb.set_trace()
inside a multi-processing pool target function.
Let’s say a program reads a metadata file which contains a list of JSON files and total records. Files may have a total of 100 JSON records, but you may need only 5. In any case, the function can return first five or random five records.
Sample code
The code is just for demonstrating the workflow and production code is not simple like above one.
Consider multiprocessing.Pool.starmap
a function call with read_data
as target and number of processes as 40.
Let’s say there are 80 files to process. Out of 80, 5 are problematic files(function takes ever to complete reading the data). Whatever be the position of five files, the processes continues forever, while other processes enter sleep
state after completing the task.
Once you know the PID of the running process, you can look what system calls process calls using strace -s $PID
. The process in running
state was calling the system call read
with same file name again and again. The while loop went on since the file had zero records and had only one file in the queue.
Strace looks like one below
You may argue a well-placed print may solve the problem. All times, you won’t have the luxury to modify the running program or replicate the code in the local environment.
See also
- Parameterize Python Tests
- “Don’t touch your face” - Neural Network will warn you
- Capture all browser HTTP[s] calls to load a web page
- How long do Python Postgres tools take to load data?
- Book Review: Software Architecture with Python
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.


Introduction to HTML
HTML SYNTAX
HTML tags and uses
HTML comments
Text Formatting
Attributes
Headings and Lines
Links
Lists
Tables
Adding Images To Webpages
Adding Audio To Webpages
Adding Video To Webpages
The Marquee Tag
Forms
HTML colors
CONCLUSION
<--


The Mofflys is a vr shooter game. In the game you are a creation of the mofflys, 'murder clone'. With a wide variety of weapons you will play through sets of minigames to invade earth and cause mayhem. The game exists of multiple worlds with classic themes like Egypt, Amazon River, Western world and more. Earn stars to unlock new levels and progress in the game. Find the hidden secrets and conquer the leaderboards. The video above is our announcement trailer.
...


| Interface | Description |
|---|---|
| Attachment |
An attachment is a ZIP (or an optionally signed JAR) that contains one or more files. Attachments are meant to
contain public static data which can be referenced from transactions and utilised from contracts. Good examples
of how attachments are meant to be used include:
|
| BilateralNettableState<N extends BilateralNettableState<N>> |
Interface for state objects that support being netted with other state objects.
|
| CommandData |
Marker interface for classes that represent commands
|
| Contract |
Implemented by a program that implements business logic on the shared ledger. All participants run this code for
every LedgerTransaction they see on the network, for every input and output state. All contracts must accept the
transaction for it to be accepted: failure of any aborts the entire thing. The time is taken from a trusted
timestamp attached to the transaction itself i.e. it is NOT necessarily the current time.
|
| ContractState |
A contract state (or just "state") contains opaque data used by a contract program. It can be thought of as a disk
file that the program can use to persist data across transactions. States are immutable: once created they are never
updated, instead, any changes must generate a new successor state. States can be updated (consumed) only once: the
notary is responsible for ensuring there is no "double spending" by only signing a transaction if the input states
are all free.
|
| DealState |
Interface representing an agreement that exposes various attributes that are common. Implementing it simplifies
implementation of general flows that manipulate many agreement types.
|
| FixableDealState |
Interface adding fixing specific methods.
|
| FungibleAsset<T> |
Interface for contract states representing assets which are fungible, countable and issued by a
specific party. States contain assets which are equivalent (such as cash of the same currency),
so records of their existence can be merged or split as needed where the issuer is the same. For
instance, dollars issued by the Fed are fungible and countable (in cents), barrels of West Texas
crude are fungible and countable (oil from two small containers can be poured into one large
container), shares of the same class in a specific company are fungible and countable, and so on.
|
| IssuanceDefinition |
Marker interface for data classes that represent the issuance state for a contract. These are intended as templates
from which the state object is initialised.
|
| IssueCommand |
A common issue command, to enforce that issue commands have a nonce value.
|
| LinearState |
A state that evolves by superseding itself, all of which share the common "linearId".
|
| MoveCommand |
A common move command for contracts which can change owner.
|
| MultilateralNettableState<T> |
Interface for state objects that support being netted with other state objects.
|
| NamedByHash |
Implemented by anything that can be named by a secure hash value (e.g. transactions, attachments).
|
| NetCommand |
A common netting command for contracts whose states can be netted.
|
| NettableState<N extends BilateralNettableState<N>,T> | |
| OwnableState |
A contract state that can have a single owner.
|
| SchedulableState | |
| Scheduled |
Something which is scheduled to happen at a point in time
|
| Class | Description |
|---|---|
| Amount<T> |
Amount represents a positive quantity of some token (currency, asset, etc.), measured in quantity of the smallest
representable units. Note that quantity is not necessarily 1/100ths of a currency unit, but are the actual smallest
amount used in whatever underlying thing the amount represents.
|
| AuthenticatedObject<T> |
Wraps an object that was signed by a public key, which may be a well known/recognised institutional key.
|
| BusinessCalendar |
A business calendar performs date calculations that take into account national holidays and weekends. This is a
typical feature of financial contracts, in which a business may not want a payment event to fall on a day when
no staff are around to handle problems.
|
| Command |
Command data/content plus pubkey pair: the signature is stored at the end of the serialized bytes
|
| Commodity |
Class representing a commodity, as an equivalent to the Currency class. This exists purely to enable the
CommodityContract contract, and is likely to change in future.
|
| ContractsDSL | |
| DummyContract | |
| DummyContractKt | |
| DummyState |
Dummy state for use in testing. Not part of any contract, not even the
class DummyContract . |
| Expression |
Represents a textual expression of e.g. a formula
|
| ExpressionDeserializer | |
| ExpressionSerializer | |
| FinanceTypesKt | |
| Fix |
A
class Fix represents a named interest rate, on a given day, for a given duration. It can be embedded in a tx. |
| FixOf |
A
class FixOf identifies the question side of a fix: what day, tenor and type of fix ("LIBOR", "EURIBOR" etc) |
| FungibleAssetKt | |
| Issued<P> |
Definition for an issued product, which can be cash, a cash-like thing, assets, or generally anything else that's
quantifiable with integer quantities.
|
| PartyAndReference |
Reference to something being stored or issued by a party e.g. in a vault or (more likely) on their normal
ledger. The reference is intended to be encrypted so it's meaningless to anyone other than the party.
|
| Requirements | |
| ScheduledActivity |
This class represents the lifecycle activity that a contract state of type
interface LinearState would like to perform at a given point in time.
e.g. run a fixing flow. |
| ScheduledStateRef |
Represents a contract state (unconsumed output) of type
interface LinearState and a point in time that a lifecycle event is expected to take place
for that contract state. |
| StateAndRef<T extends ContractState> |
A StateAndRef is simply a (state, ref) pair. For instance, a vault (which holds available assets) contains these.
|
| StateRef |
A stateref is a pointer (reference) to a state, this is an equivalent of an "outpoint" in Bitcoin. It records which
transaction defined the state and where in that transaction it was.
|
| StructuresKt | |
| Tenor |
Placeholder class for the Tenor datatype - which is a standardised duration of time until maturity
|
| Timestamp |
If present in a transaction, contains a time that was verified by the uniqueness service. The true time must be
between (after, before).
|
| TransactionForContract |
A transaction to be passed as input to a contract verification function. Defines helper methods to
simplify verification logic in contracts.
|
| TransactionGraphSearch |
Given a map of transaction id to
class SignedTransaction , performs a breadth first search of the dependency graph from
the starting point down in order to find transactions that match the given query criteria. |
| TransactionState<T extends ContractState> |
A wrapper for
interface ContractState containing additional platform-level state information.
This is the definitive state that is stored on the ledger and used in transaction outputs. |
| TransactionType |
Defines transaction build & validation logic for a specific transaction type
|
| TypeOnlyCommandData |
Commands that inherit from this are intended to have no data items: it's only their presence that matters.
|
| UniqueIdentifier |
This class provides a truly unique identifier of a trade, state, or other business object, bound to any existing
external ID. Equality and comparison are based on the unique ID only; if two states somehow have the same UUID but
different external IDs, it would indicate a problem with handling of IDs.
|
| Enum | Description |
|---|---|
| AccrualAdjustment |
Simple enum for returning accurals adjusted or unadjusted.
We don't actually do anything with this yet though, so it's ignored for now.
|
| DateRollConvention |
This reflects what happens if a date on which a business event is supposed to happen actually falls upon a non-working day.
Depending on the accounting requirement, we can move forward until we get to a business day, or backwards.
There are some additional rules which are explained in the individual cases below.
|
| DateRollDirection |
This is utilised in the
enum DateRollConvention class to determine which way we should initially step when
finding a business day. |
| DayCountBasisDay |
This forms the day part of the "Day Count Basis" used for interest calculation.
Note that the first character cannot be a number (enum naming constraints), so we drop that
in the toString lest some people get confused.
|
| DayCountBasisYear |
This forms the year part of the "Day Count Basis" used for interest calculation.
|
| Frequency |
Frequency at which an event occurs - the enumerator also casts to an integer specifying the number of times per year
that would divide into (eg annually = 1, semiannual = 2, monthly = 12 etc).
|
| NetType |
Enum for the types of netting that can be applied to state objects. Exact behaviour
for each type of netting is left to the contract to determine.
|
| PaymentRule |
Whether the payment should be made before the due date, or after it.
|
| Exception | Description |
|---|---|
| InsufficientBalanceException | |
| TransactionConflictException | |
| TransactionResolutionException | |
| TransactionVerificationException |


Uses of Class
org.uma.jmetal.util.AbstractAlgorithmRunner
-
Uses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective Modifier and Type Class Description class
ABYSSRunner
This class is the main program used to configure and run AbYSS, a multiobjective scatter search metaheuristics, which is described in: A.J.class
AGEMOEAIIRunner
Class to configure and run the AGE-MOEA-II algorithmclass
AGEMOEARunner
Class to configure and run the AGEMOEA algorithmclass
CDGRunner
Class for configuring and running the CDG algorithm The paper and Matlab code can be download at http://xinyecai.github.io/class
DMOPSORunner
Class for configuring and running the DMOPSO algorithmclass
ESPEARunner
Class to configure and run the ESPEA algorithmclass
FAMERunner
Class to configure and run the FAME algorithm, described in: A.class
IBEARunner
Class for configuring and running the IBEA algorithmclass
MicroFAMERunner
Class to configure and run the Micro-FAME algorithmclass
MOMBI2Runner
Class to configure and run the MOMBI2 algorithmclass
MOMBIRunner
Class to configure and run the MOMBI algorithmclass
NSGAIIIntegerRunner
Class for configuring and running the NSGA-II algorithm (integer encoding)class
NSGAIIIRunner
Class to configure and run the NSGA-III algorithmclass
OMOPSORunner
Class for configuring and running the OMOPSO algorithmclass
ParallelPESA2Runner
Class for configuring and running the PESA2 algorithm (parallel version)class
PESA2Runner
Class for configuring and running the PESA2 algorithmclass
RandomSearchRunner
Class for configuring and running the random search algorithm -
Uses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.gde3
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.gde3 Modifier and Type Class Description class
GDE3Runner
Class for configuring and running the GDE3 algorithmclass
ParallelGDE3Runner
Class for configuring and running the GDE3 algorithm (parallel version) -
Uses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.mocell
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.mocell Modifier and Type Class Description class
GMOCellRunner
Class to configure and run the MOCell algorithm with DM support applying the concept of g-dominanceclass
MOCellChangingMutationAndCrossoverProbabilitiesRunner
Class to configure and run the MOCell algorithmclass
MOCellHVRunner
Class to configure and run the MOCell algorithmclass
MOCellRunner
Class to configure and run the MOCell algorithm -
Uses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.mochc
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.mochc Modifier and Type Class Description class
MOCHC45Runner
This class executes the algorithm described in: A.J.class
MOCHCRunner
This class executes the algorithm described in: A.J. -
Uses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.moead
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.moead Modifier and Type Class Description class
MOEAD3DProblemRunner
Class for configuring and running the MOEA/D-DE algorithmclass
MOEADConstraintRunner
Class for configuring and running the MOEA/D algorithmclass
MOEADDRARunner
Class for configuring and running the MOEA/D-DRA algorithmclass
MOEADDRunner
Class for configuring and running the MOEA/DD algorithmclass
MOEADIEpsilonRunner
Class for configuring and running the MOEA/D-IEpsilon algorithm, described in: An Improved epsilon-constrained Method in MOEA/D for CMOPs with Large Infeasible Regions * Fan, Z., Li, W., Cai, X. et al.class
MOEADRunner
Class for configuring and running the MOEA/D algorithmclass
MOEADSTMRunner
Class for configuring and running the MOEA/D algorithm -
Uses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.mosa
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.mosa Modifier and Type Class Description class
MOSARunner
Class for configuring and running theMOSA
algorithm -
Uses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.nsgaii
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.nsgaii Modifier and Type Class Description class
DNSGAIIRunner
created at 2:50 pm, 2019/1/29 runner of DIR-Enhanced NSGA-IIclass
NSGAII45Runner
Class to configure and run the implementation of the NSGA-II algorithm included inNSGAII45
class
NSGAIIBigDataRunner
Class for configuring and running the NSGA-II algorithm to solve a problem of the CEC 2015 Big Optimization competitionclass
NSGAIIBinaryRunner
Class for configuring and running the NSGA-II algorithm (binary encoding)class
NSGAIIComposableSchafferProblemRunner
Class to configure and run the NSGA-II algorithm to solve theSchaffer
problem, which is defined dynamically by using theComposableDoubleProblem
class.class
NSGAIIComposableSrinivasProblemRunner
Class to configure and run the NSGA-II algorithm to solve theSrinivas
problem, which is defined dynamically by using theComposableDoubleProblem
class.class
NSGAIIEbesRunner
Class to configure and run the NSGA-II algorithm to solve the Ebes problemclass
NSGAIIMeasuresRunner
Class to configure and run the NSGA-II algorithm (variant with measures)class
NSGAIIMeasuresWithChartsRunner
Class to configure and run the NSGA-II algorithm (variant with measures)class
NSGAIIMeasuresWithHypervolumeRunner
Class to configure and run the NSGA-II algorithm (variant with measures)class
NSGAIIMeasuresWithQualityIndicatorRunner
Class to configure and run the NSGA-II algorithm (variant with measures) getting the value of quality indicators of each iteration.class
NSGAIIRunner
Class to configure and run the NSGA-II algorithm to solve problem ZDT1class
NSGAIISolvingConstrainedProblemRunner
Class to configure and run the NSGA-II algorithmclass
NSGAIISteadyStateRunner
Class to configure and run the NSGA-II (steady state version) algorithmclass
NSGAIIStoppingByTimeRunner
Class to configure and run the NSGA-II algorithm (version NSGAIIStoppingByTime)class
NSGAIITSPRunner
Class for configuring and running the NSGA-II algorithm to solve the bi-objective TSPclass
ParallelNSGAIIRunner
Class for configuring and running the NSGA-II algorithm (parallel version)class
RNSGAIIConstraintRunner
Class to configure and run the R-NSGA-II algorithmclass
RNSGAIIRunner
Class to configure and run the R-NSGA-II algorithmclass
RNSGAIIWithChartsRunner
Class to configure and run the R-NSGA-II algorithm -
Uses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.paes
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.paes Modifier and Type Class Description class
PAESRunner
Class for configuring and running the PAES algorithmclass
PAESWithCrowdingDistanceArchiveRunner
Class for configuring and running the PAES algorithm -
Uses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.smpso
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.smpso Modifier and Type Class Description class
ParallelSMPSORunner
Class for configuring and running the SMPSO algorithm (parallel version)class
SMPSOBigDataRunner
Class for configuring and running the SMPSO algorithm to solve a problem of the CEC2015 Big Optimization competitionclass
SMPSOHvRunner
Class for configuring and running the SMPSO algorithm using an HypervolumeArchive, i.e, the SMPSOhv algorithm described in: A.J Nebro, J.J.class
SMPSOMeasuresRunner
Class to configure and run the NSGA-II algorithm (variant with measures)class
SMPSOMeasuresWithChartsRunner
Class to configure and run the NSGA-II algorithm (variant with measures)class
SMPSORunner
Class for configuring and running the SMPSO algorithmclass
SMPSOSSolvingConstrainedProblemRunner
Class for configuring and running the SMPSO algorithm -
Uses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.smsemoa
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.smsemoa Modifier and Type Class Description class
SMSEMOARunner
Class to configure and run the SMS-EMOA algorithm -
Uses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.spea2
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.spea2 Modifier and Type Class Description class
ParallelSPEA2Runner
/** Class for configuring and running the SPEA2 algorithmclass
SPEA2BinaryRunner
Class for configuring and running the SPEA2 algorithm (binary encoding)class
SPEA2Runner
Class for configuring and running the SPEA2 algorithm -
Uses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.wasfga
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.multiobjective.wasfga Modifier and Type Class Description class
GWASGFARunner
class
WASFGABinaryRunner
class
WASFGAMeasuresRunner
class
WASFGAMeasuresRunner3D
class
WASFGARunner
-
Uses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.singleobjective
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.algorithm.examples.singleobjective Modifier and Type Class Description class
RandomSearchRunner
Class for configuring and running the random search algorithmclass
SMPSORunner
Class for configuring and running the SMPSO algorithm to solve a single-objective problem -
Uses of AbstractAlgorithmRunner in org.uma.jmetal.component.examples.multiobjective.smpso
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.component.examples.multiobjective.smpso Modifier and Type Class Description class
SMPSOWithPlotliyChartExample
Class for configuring and running the SMPSO algorithmclass
SMPSOWithRealTimeChartExample
Class for configuring and running the SMPSO algorithm -
Uses of AbstractAlgorithmRunner in org.uma.jmetal.component.examples.multiobjective.smsemoa
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.component.examples.multiobjective.smsemoa Modifier and Type Class Description class
SMSEMOADefaultConfigurationExample
Class to configure and run the SMSEMOA algorithmclass
SMSEMOAWithRealTimeChartExample
Class to configure and run the SMSEMOA algorithm -
Uses of AbstractAlgorithmRunner in org.uma.jmetal.component.examples.singleobjective.geneticalgorithm
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.component.examples.singleobjective.geneticalgorithm Modifier and Type Class Description class
GeneticAlgorithmTSPExample
Class to configure and run a genetic algorithm to solve an instance of the TSP -
Uses of AbstractAlgorithmRunner in org.uma.jmetal.component.examples.singleobjective.randomsearch
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.component.examples.singleobjective.randomsearch Modifier and Type Class Description class
RandomSearchSingleObjectiveBinaryEncodingExample
Class to configure and run the a random search. -
Uses of AbstractAlgorithmRunner in org.uma.jmetal.parallel.example
Subclasses of AbstractAlgorithmRunner in org.uma.jmetal.parallel.example Modifier and Type Class Description class
SynchronousComponentBasedNSGAIIWithSparkExample
Class to configure and run the NSGA-II algorithm using aSparkEvaluation
object.class
SynchronousNSGAIIWithSparkExample
Class for configuring and running the NSGA-II algorithm (parallel version)


# Routing Filter
Routing filters wrap around the complex beast that the Rails routing system is to allow for unseen flexibility and power in Rails URL recognition and generation.
As powerful and awesome the Rails’ routes are, when you need to design your URLs in a manner that only slightly leaves the paved cowpaths of Rails conventions, you’re usually unable to use all the goodness of helpers and convenience that Rails ships with.
This library comes with four more or less reusable filters and it is easy to implement custom ones. Maybe the most popular one is the Locale routing filter:
- `Locale` - prepends the page’s :locale (e.g. /de/products)
- `Pagination` - appends page/:num (e.g. /products/page/2)
- `Uuid` - prepends a uuid for authentication or other purposes (e.g. /d00fbbd1-82b6-4c1a-a57d-098d529d6854/products/1)
- `Extension` - appends an extension (e.g. /products.html)
Please note that Rails 3’s routing system is much more powerful and flexible than Rails 2 was. There are many usecases that now can be covered with just Rails 3 default routing features that weren’t doable in Rails 2. For an example of a quite complex and flexible route see this [gist by Andrew White](gist.github.com/653543)
## Requirements
routing-filter currently only works with Rails. It should not be all too hard to get it working with plain Rack::Mount but I haven’t had that usecase, yet.
## Installation
Just install the Gem:
$ gem install routing-filter
The Gem should work out of the box for Rails 3 after specifying it in your application’s Gemfile.
# Gemfile gem 'routing-filter'
In order to use it with Rails 2.x you could specify it in your environment.rb
# config/environment.rb gem 'routing-filter'
## Usage
Once the Gem has loaded you can setup the filters in your routes file like this:
# in config/routes.rb Rails.application.routes.draw do filter :pagination, :uuid end
Filters can also accept options:
Rails.application.routes.draw do filter :extension, :exclude => %r(^admin/) end
## Running the tests
To run the tests against different dependencies [appraisal](github.com/thoughtbot/appraisal) is used.
Running the tests for all supported Rails versions:
$ bundle install $ bundle exec rake all
Running the tests for a single version, for example Rails 3.1:
$ bundle install $ bundle exec rake appraisal:rails-3.1 test
Valid appraisal targets include rails-2.3, rails-3.0, rails-3.1 and rails-3.2
## Filter order
You can picture the way routing-filter wraps filters around your application as a russian puppet pattern. Your application sits in the center and is wrapped by a number of filters. An incoming request’s path will be past through these layers of filters from the outside in until it is passed to the regular application routes set. When you generate URLs on the other hand then the filters will be run from the inside out.
Filter order might be confusing at first. The reason for that is that the way rack/mount (which is used by Rails as a core routing engine) is confusing in this respect and Rails tries to make the best of it.
 Then Rails makes it so that your application’s routes file will be loaded first (basically route.rb files are loaded in reverse engine load order).
Thus routing-filter will make your :custom filter the inner-most filter, wrapping the application first. The :common filter from your engine will be wrapped around that onion and will be made the outer-most filter.
This way common base filters (such as the locale filter) can run first and do not need to know about the specifics of other (more specialized, custom) filters. Custom filters on the other hand can easily take into account that common filters might already have run and adjust accordingly.
## Implementing your own filters
For example implementations have a look at the existing filters in [lib/routing_filter/filters](github.com/svenfuchs/routing-filter/tree/master/lib/routing_filter/filters)
The following would be a sceleton of an empty filter:
module RoutingFilter class Awesomeness < Filter def around_recognize(path, env, &block) # Alter the path here before it gets recognized. # Make sure to yield (calls the next around filter if present and # eventually `recognize_path` on the routeset): yield.tap do |params| # You can additionally modify the params here before they get passed # to the controller. end end def around_generate(params, &block) # Alter arguments here before they are passed to `url_for`. # Make sure to yield (calls the next around filter if present and # eventually `url_for` on the controller): yield.tap do |result| # You can change the generated url_or_path here. Make sure to use # one of the "in-place" modifying String methods though (like sub! # and friends). end end end end
You can specify the filter explicitely in your routes.rb:
Rails.application.routes.draw do filter :awesomeness end
(I am not sure if it makes sense to provide more technical information than this because the usage of this plugin definitely requires some advanced knowledge about Rails internals and especially its routing system. So, I figure, anyone who could use this should also be able to read the code and figure out what it’s doing much better then from any lengthy documentation.
If I’m mistaken on this please drop me an email with your suggestions.)
## Rationale: Two example usecases
### Conditionally prepending the locale
An early usecase from which this originated was the need to define a locale at the beginning of an URL in a way so that
- the locale can be omitted when it is the default locale
- all the url_helpers that are generated by named routes as well as url_for continue to work in
a concise manner (i.e. without specifying all parameters again and again)
- ideally also plays nicely with default route helpers in tests/specs
You can read about this struggle and two possible, yet unsatisfying solutions [here](www.artweb-design.de/2007/5/13/concise-localized-rails-url-helpers-solved-twice). The conclusion so far is that Rails itself does not provide the tools to solve this problem in a clean and dry way.
### Expanding /sections/:id to nested tree segments
Another usecase that eventually spawned the implementation of this plugin was the need to map an arbitrary count of path segments to a certain model instance. In an application that I’ve been working on recently I needed to map URL paths to a nested tree of models like so:
root + docs + api + wiki
E.g. the docs section should map to the path `/docs`, the api section to the path `/docs/api` and so on. Furthermore, after these paths there need to be more things to be specified. E.g. the wiki needs to define a whole Rails resource with URLs like `/docs/wiki/pages/1/edit`.
The only way to solve this problem with Rails’ routing toolkit is to map a big, bold `/*everything` catch-all (“globbing”) route and process the whole path in a custom dispatcher.
This, of course, is a really unsatisfying solution because one has to reimplement everything that Rails routes are here to help with: regarding both URL recognition (like parameter mappings, resources, …) and generation (url_helpers).
## Solution
This plugin offers a solution that takes exactly the opposite route.
Instead of trying to change things between the URL recognition and generation stages to achieve the desired result it *wraps around* the whole routing system and allows to pre- and post-filter both what goes into it (URL recognition) and what comes out of it (URL generation).
This way we can leave everything else completely untouched.
- We can tinker with the URLs that we receive from the server and feed URLs to
Rails that perfectly match the best breed of Rails’ conventions.
- Inside of the application we can use all the nice helper goodness and
conveniences that rely on these conventions being followed.
- Finally we can accept URLs that have been generated by the url_helpers and,
again, mutate them in the way that matches our requirements.
So, even though the plugin itself is a blatant monkey-patch to one of the most complex area of Rails internals, this solution seems to be effectively less intrusive and pricey than others are.
## Etc
Authors: [Sven Fuchs](www.artweb-design.de)


Front-end web developer with a strong work ethic, dedication and the courage to seek interests that give me an edge on life. My passion for technology led me to Grand Circus where I completed an intensive 10-week coding boot camp. I hope to dedicate myself in a company as a web developer with my passion to learn more every day.
Grand Circus / Detroit
April, 2017 - June, 2017
Itt-Tech / Troy, MI
March, 20176 - September, 2017
Nail Tech June, 2016 - Present
Fancy Nails/Hazel Park, MI
24/7 Nails/Detroit, MI
Repair Industries of Michigan/Detroit,MI


Default size is medium
but you can use size
input property with small
or big
value to adjust the size accordingly.
Optionally, spinner color can be customized using color
input property with red
, green
, blue
or yellow
value.
Spinners can be customized using the following properties on the mz-spinner
element.
| Property | Mandatory | Type | Description | Default value |
|---|---|---|---|---|
| color | string | Spinner color, could be red , green , blue or yellow |
default color | |
| size | string | Spinner size, could be small , medium or big |
medium |


@* * Copyright 2023 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import config.ApplicationConfig @import views.html.helpers._ @import uk.gov.hmrc.govukfrontend.views.html.components._ @import uk.gov.hmrc.govukfrontend.views.Implicits.RichRadios @import uk.gov.hmrc.hmrcfrontend.views.Implicits.RichErrorSummary @import views.ViewUtils._ @this( formWithCSRF: FormWithCSRF, awrsMain: main, govukRadios: GovukRadios, awrsWarningHelper: awrsWarningHelper, govukErrorSummary: GovukErrorSummary) @(withdrawalConfirmationForm: Form[models.WithdrawalConfirmation])(implicit request: Request[AnyRef], messages: Messages, applicationConfig: ApplicationConfig) @conditionalHtml = { @awrsWarningHelper(declarationTxt = messages("awrs.generic.wait_info", messages("awrs.generic.wait_info_withdraw")), id = "confirmation-content") } @awrsMain( title = s"${errorPrefix(withdrawalConfirmationForm)} ${messages("awrs.generic.tab.title", messages("awrs.withdrawal.confirm_page.heading"))}", userLoggedIn = true) { @backLink(backUrl = controllers.routes.WithdrawalController.showWithdrawalReasons.toString) @if(withdrawalConfirmationForm.errors.nonEmpty) { @govukErrorSummary(ErrorSummary().withFormErrorsAsText(withdrawalConfirmationForm)) }


Police rescue two stolen children in Anambra
by Tony OkaforTony Okafor, Awka
The Anambra Police Command on Monday rescued two children allegedly stolen by two women suspects in the state.
The children who were stolen from Enugwu Aguleri in the Anambra East Local Government Area were rescued in Nkpor in the Idemili Local Government Area of the State.
Handing over the children to their parents at the command’s headquarters in Amawbia on Monday, the police warned parents to be wary about the whereabouts of their children.
The Police Public Relations Officer in the State, Haruna Mohammed confirmed the incident.
He said the two women from Enugu and Imo States, who allegedly stole the children had been arrested.
The police spokesperson said the children had been reunited with their parents.
Mohammed said, “Following intelligence report, police detectives in Anambra State arrested two female suspects at Nkpor in Idemili North LGA of the State.
“Preliminary investigation by Police detectives attached to Otoucha Division revealed that the two children were allegedly stolen from Enugwu Aguleri in Anambra East LGA by one Ani Chisom, 28, of Amuri in Nkanu-East LGA of Enugu State and Afamefuna Udodili, 32, of Orodo in Mbaitolu LGA of Imo State respectively.
“Following the public announcement by the command, parents of the two kids from Enugwu Aguleri came and identified their children. They also revealed their names as Confidence, five years and Blessing, seven months old respectively.
“The children have since reunited with their parents and the case is under investigation after which the suspects would be charged to court.


Jeff Bezos asked Michael Bloomberg to consider running for president
by Caitlin YilekAmazon CEO Jeff Bezos asked former New York City Mayor Michael Bloomberg to consider running for president.
Bezos, the world’s richest man, called Bloomberg months ago to ask him to consider entering the 2020 presidential race, according to Vox.
Bloomberg, 77, turned down the request at the time, but months later the billionaire is preparing to enter the race. He filed paperwork last week with the Alabama Democratic Party to have his name on the primary ballot in the state.
Despite the move, Bloomberg has yet to make a final decision on whether to join the race.
The former New York politician, who is worth an estimated $52 billion, is expected to fund his own campaign if he runs for the White House.
It’s not clear what prompted Bezos’ call urging Bloomberg to enter the race. It’s also not known whether the conversation took place before or after Bloomberg said March 5 that he would not run.


Realme C1, Realme 2, and Realme 3 updates bring November 2019 patches, dark mode, and more
by Pranob MehrotraOver the last week, Realme pushed updates for a couple of its devices introducing the new dark mode and Android security patches. Along with these changes, the updates also introduced wide-angle video capture for the Realme 5, Digital Wellbeing for the Realme 3/3i, and nightscape mode on the front camera for the Realme XT and Realme X2. Now, the company has added even more devices to the list and has started rolling out updates for the Realme C1, Realme 2, and Realme 3.
Realme 2 XDA Forums || Realme 3 XDA Forums
The budget-centric Realme C1 is now getting ColorOS 6.0 (vRMX1805EX_11_A.62) which weighs in at 2.07GB. The update includes the Android security patch for November 2019, along with the new system-wide dark mode, and a couple of minor changes. Here’s the official changelog for the latest ColorOS update for the Realme C1:
-
Security
- Android security patch: November, 2019
-
System
- Updated charging animation
- Updated font change supporting in Theme Store
-
Settings
- Added realme Laboratory
- Added Dark Mode
- Added a switch of notification dot for updates
-
Notification Center and Status Bar
- Added a switch of down on home screen for global search or notification center
- Added fast switch toggles between SIM in notification center
- Removed the reminder after the hotspot enabled
- Removed the prompt while rooted
- Swipe left or right to remove the message prompt after receiving the message
-
Known issue fixed
- Fixed probabilistic crashes of partial applications
The Realme 2 from last year is also getting ColorOS 6.0 (vRMX1805EX_11_A.62) with the same package size as the C1. It also includes the Android security patch for November 2019, dark mode, and a couple of minor changes. The changelog for the update is the same as that for the Realme C1. A similar ColorOS 6.0 update (vRMX1821EX_11.A.24) is rolling out to the Realme 3, with the Android security patch, but there are some other minor changes as well. Here’s the complete changelog for the latest ColorOS 6.0 update on the Realme 3:
-
Security
- Android security patch: November, 2019
-
System
- Added the manual lock feature by long press the power button
- Customizable data consumed reminder
- Updated charging animation
-
Settings
- Added realme Laboratory
- Added Dark Mode
- Added Google Digital Wellbeing
- Updated battery interface to display the screen on time
- Added a switch of notification dot for updates
- Clone Apps support more third-party applications (PayTM, PhonePe, Amazon, Flipkart)
-
Launcher
- Optimized lock screen clock widget design
- Added date and weather widget
- Optimized Smart Assistant interface
-
Notification Center and Status Bar
- Redesigned the notification center style
- Swipe left or right to remove the message prompt after receiving the message
- Added fast switch toggles between SIM in notification center
- Removed the reminder after the hotspot enabled
- Added a switch of swipe down on home screen for global search or notification center
- Removed the prompt while rooted
The updates have already started rolling out the Realme C1, Realme 2, and Realme 3. In case you haven’t received it yet, you can download the update package from the link below and flash it manually.
ColorOS 6.0 (vRMX1805EX_11_A.62) for the Realme C1 || ColorOS 6.0 (vRMX1805EX_11_A.62) for the Realme 2 || ColorOS 6.0 (vRMX1821EX_11.A.24) for the Realme 3


About
At Milne4 we provide a whole house approach to energy saving and energy generation.
As a fully qualified Retrofit Assessor under PAS2035 all surveys will be government backed by Trustmark, the highest standards in the domestic retrofit industry.
We are not tied to specific products or manufacturers, so any energy saving measures we recommend will be right for you and your home.
Depending on your circumstances, many of the measures we recommend will be subject to total or partial funding under new ECO3 (Energy Company Obligation) Scheme or Subsidised by monthly payments once installed by the RHI. (Renewable Heat Incentive)
Funding
RHI
The Domestic Renewable Heat Incentive (Domestic RHI) is a government financial incentive to promote the use of renewable heat. Switching to heating systems that use eligible energy sources can help the UK reduce its carbon emissions and meet its renewable energy targets.
People who join the scheme and stick to its rules receive quarterly payments for seven years for the amount of clean, green renewable heat it’s estimated their system produces.
Since opening in April 2014, the scheme has already seen thousands of people successfully join and receive payments.
ECO Funding
Under ECO, medium and larger energy suppliers fund the installation of energy efficiency measures in British households.
Each obligated supplier has an overall target based on its share of the domestic energy market in Britain.
The obligated energy suppliers work with installers to introduce certain efficiency measures into your home, such as loft or wall insulation, or heating measures.
The ECO3 scheme consists of one distinct obligation: the Home Heating Cost Reduction Obligation (HHCRO).
Services
Retrofit Assessment
Whole House Retrofit is a complete approach to making homes more energy efficient.
It maps out a journey for each property that includes strategies for improving insulation, ventilation and heating efficiency, and is fundamental to achieving PAS2030 and PAS2035 standards for energy efficiency in buildings.
Technical Survey
Should You decide to explore any energy saving measures in more detail we can move straight to a more invasive technical survey, that will in turn be passed on to an available retrofit coordinator and eventually our chosen PAS 2030 compliant installer.
This will flag any potential issues, such as existing damp, access, or indeed the potential for any issues to arise if we are recommending more than one measure.
By adhering to these standards we ensure your installation will comply with ECO funding regulations.
Contact
Please feel free to contact me via email or telephone +44 7756 918 188


| metaonly module ti.sysbios.posix.Settings |
Obsolete module for POSIX support
| Configuration settings | sourced in ti/sysbios/posix/Settings.xdc |
| config Settings.supportsMutexPriority // module-wide |
Include support for pthread mutex priority protocols. Default is false
| Configuration settings |


{% extends "base.html" %}
You've heard of UBER, Lyft, DoorDash, GrubHub etc.. These apps/companies have not only changed the game of delivery and transportation, but they've created the chance for people to turn their vehicle into an asset instead of a liability. Before these apps people just had to accept the reality that their vehicle was just a liability because they just don't appreciate in value unless it's a collector car or something to that nature. However, with these delivery and taxi apps people can now utilize their personal vehicle to generate some money in their spare time... and voila personal vehicles can now be considered assets. Signing up to drive for these apps is quick and easy. They require some "hoops to jump through" but it's much easier than applying for a regular part time job for earning extra money. Another benefit is you can work whatever hours you want after signing up to drive for them. There are some things to consider before you decide to drive for these apps. First, when working for these apps the money you earn will be considered 1099 income so you will be taxed at a higher than w-2 income. Second, you will be adding miles to your vehicle which will result in added "wear and tear" on your vehicle which could result in more maintenance and repair costs. You can make good money driving for these apps but keep those details in mind so you can mitigate their impact on how much money you end up keeping after taxes and repairs. If you track your mileage then you could potentially offset your tax implication for example.
{% endblock %}


Bugmark is a market that connects people who want better software to people who can build it.
We make open collaboration more effecive, with simple market mechanisms that give users a way to hedge their exposure to software risk while giving developers incentives to increase software quality.


About me
I am a coder, gamer, and hiker. I worked in QA for about 2 years, and before that I recieved my Bachelors in Computer Science from SFSU. During my time at SFSU I attended several internships, which I found helpful in getting experience with a variety of different programming languages. I am currently undergoing a Full Stack Web Development Bootcamp out of UC Berkeley Extension.
I grew up in the bay area, moving from Berkeley to Oakland. One of the things I really enjoy is traveling to all the different parks. There is all of this park land stretching from Port Costa to Hayward and beyond. It also helps that the weather is almost always beautiful, making it easier get out to nature and take a nice walk.
Currently my favorite game is Hollow Knight. It's a game about a bug traveling through caverns, learning about the ancient civilization that once inhabited the area known as Hollow Nest. I would definately recommend picking this game up.


Popup window tests

window.open(...,"_blank")
window.open(...,"_blank","popup")
window.open(...,"_blank","popup,width=300,height=200")
window.open(...,"target=_blank","popup,left=100,top=100,width=300,height=200")
window.open("google.com","_blank","popup")


New Protest against the Election of Attorney General - Ivan Geshev
A new protest against the election of Attorney General - Ivan Geshev.
Tonight, the non-governmental organization "Justice for All" and the civic association "Fighter" will meet in front of the Sofia Court House. They organize a procession to the presidency. The reason- they insist that the Head of State should approach the Constitutional Court.
Last Thursday, the Supreme Judicial Council gave strong support to Ivan Geshev, for the second time, and selected him as the new Attorney General.


Your Letters!!
Just drag and drop from the top! (
Ctrl+Z
to undo)
What're my options?
The board!
Need a differrent board? Use the arrows above to switch!
Once you've picked a board, click a tile and type away!
Note: Backspace and Delete don't work--use
Ctrl+Z
to undo.


@Don King I might start contributing my time working on CHIPS, but it's not guaranteed yet, I need to improve my skills first
Don King01-May-19 10:19 AM
Thanks guys, CHIPS is one ecosystem project that could really gain viral adoption during next bull market, just needs some funding to finish GUI etc afaik(edited)
1
metaphilibert01-May-19 10:19 AM
@phm87 is also planning to support CHIPS
TonyL01-May-19 10:20 AM
I've played few games with sg777 @Don King , pretty interesting thing, with GUI should be boomer
phm8701-May-19 10:20 AM
Yes. Financial support (20%) and other things (see proposal: servers, explorer, docker)
TonyL01-May-19 10:21 AM
Just CHIPS coins distribution looks not very healthy
But since it's opensourced anybody will able to run own chain to make own pokerroom
Don King01-May-19 10:23 AM
@phm87 20% funding sounds good,
@TonyL hopefully CHIPS distro improves when players start buying tokens for actual gameplay
Mylo01-May-19 10:23 AM
@patchkez cheers. Bridge already
Don King01-May-19 10:24 AM
No chips premine, so distro ticks all the boxes for 'fairness'
Mylo01-May-19 10:25 AM
Seems to be going okay now with 2 NNs on same host. Maybe it was auto split. I have disabled it now
CHIPS, LN, Bet, Poker, PANGEA. GitHub Gist: instantly share code, notes, and snippets.
TonyL01-May-19 10:30 AM
Oh it made +400% for the last two weeks on coinexchange - looks like somebody filling bags
But it's for sure topic for #talk-trading rather than this channel
Mylo01-May-19 10:33 AM
@phm87 just a suggestion
rename your gist to a .md files
then with your links, surround them like this so they are clickable links
link to repo
phm8701-May-19 10:34 AM
Good idea thx.
I have md files in my repos. I did not know it is possible for gist
komodo-in-a-box management interface download & run - komodo-in-a-box.management-interface.md
silly photos.
jeezy01-May-19 10:49 AM
currently trying to sync CHIPS but it wont start syncing, tried recompiling fresh, etc, maybe an addnode list in config will help, does anyone have such a list? via PM is fine
I will make a bootstrap (for my selfish use but it will be public)
jeezy01-May-19 10:52 AM
@phm87 good idea to look there! will try thanks
bootstrap would be a last resort kinda thing, rather go clean sync
Mylo01-May-19 10:53 AM
@TonyL have you got notes on compiling chips/ln/bet. i lost track of where i was, and i really want to add it to cakeshop-in-a-box so ppl can play with GUI thru rev-ssh-tunnel to localhost web server
I've decided to back out of this years election process. I know only 8% of the votes have been cast and there is a fortnight to go, but I have to be realistic with being 100,000s behind, it ain't going to happen and my rolling contract with my server ends in a few days, so better I pull out, backup my server and try again next year. I can then focus my attentions on making my mining pool server work, which is close to being finished.
Please can my details be removed from the voting process, and my server will go offfline at the end of the week.(edited)
jorian01-May-19 01:12 PM
most of the votes are cast at the end of the election period
@Don King I will be creating a bounty fund and the initial funds will be put towards CHIPS development. I am indeed excited about blockchain poker!
 None of the usual reset , resync tricks seem to bring nx's back
other chains still looking good
do I need to clear BEER chain and resync it from scratch? Doesn't seem practical.. If it syncs it syncs right ?
Mylo01-May-19 02:55 PM
1. is it synced
2. is your key imported
3. is there balance
4. is there UTXOs
5. if too many UTXOs, will be slower; then send balance to self and resplit
6. make sure iguana is dpow-ing (output from iguana/log will show BEER heights), run curl command from bottom of m_notary_testnet, either it returns sucecss, dpow was not on but now it is, or it retuns cannot dpow a coin twice it is already dpowing.
7. check debug.log for errors
8. check peers getpeerinfo to see you have peers conencted
9. check against explorer that you are not on a fork
Dr.Terminus01-May-19 03:00 PM
Mylo01-May-19 03:00 PM
getinfo, get height, then getblockhash and ask others if they have same blockhash
have tried taking server all the way down, relaunching everything / resyncing all assets etc, other assets work well, while beer stays at 0
ran walletreset on all assets
I see BEER activity like PIZZA and TXSCLCC
but no actual NX's
PHBA206101-May-19 03:42 PM
do you see something like this
[39] END isratify.0:0 bestk.19 8cc48 sigs.8cc48 state.ffffffff machine ht.81182 completed state.ffffffff KMD.00abe69251d92522f762f8594fc4d8395569b6c5d7d43693bce474817b374fc3 BEER.d313c6d580d4d031a05cf41786d3253bd9129dd4e0c6dc9a864b8eace8bfdf11 recvmask.19ce5a paxwdcrc.21144b24 0x7f1ce9cb8010 0x7f1d000ee010 ?
Dr.Terminus01-May-19 03:46 PM
[KMD].117972 BEER 05717d249c3dc4cf492172050422c8ce4b8097b730d51bc23726677e4a5e2ea8 height.117973 vs last.117973
Alright01-May-19 03:46 PM
a bit late, sorry. Going to change sigs to 12 in a moment
I am going to make a game blockchain based on the new paymentsCC that we can use to test it. Its using a lot of new stuff added recently. I need a list of address for people that would like to join in.
It will probably require a fair bit of knowledge of utxos and raw transactions to be effecive at winning it. Or just luck. A decent statagey may be just using lots of random balances in hundreds of address.
The basic idea is, there is a daily "prize" that is paid to a set of address that fall into a range on the rich list. So for example one day it would be the top 50%, and the next day the bottom 50%. But it could be something silly like 51/49 so the 2% between this range would get the entire daily mining reward. The maximum number of address that is used is 3999. so using a balance that is too low will mean those address will not participate.
1
1
Dr.Terminus01-May-19 03:49 PM
[KMD].117974 BEER 09ed725da3e94576b9fe0d7845cea99bc3afda9a581c6b3f6af19fddf330a801 height.117975 vs last.117975
PIZZA hwmheight.107374 vs pindex->GetHeight().107373 t.1556725512 reorg.1
[KMD].107374 PIZZA 02d62349cff6a23ccdd54522fef649a85b787ff80b0c9a9668b069fc4db5c9b6 height.107375 vs last.107375
[KMD].221907 TXSCLCC 060385f42ba21f5a73321aebd528d6a8570c91e0c80c662110c1b75860b39855 height.221908 vs last.221908
just showing what I see..
as it comes, I see beer activity, but never much more than this
Alright01-May-19 03:49 PM
Going to hold off changing sigs until tomorrow as CHMEX isn't around to change the stats page
unless he gets back to me in the next couple minutes
@blackjok3r what.
PHBA206101-May-19 03:51 PM
@blackjok3r count me in, so I need to dm you my addresses ?
blackjok3r01-May-19 03:51 PM
Sure DM the address seems a good way to collect them
PHBA206101-May-19 03:52 PM
as many addressed as I want right ? probably 2 or 3


|
|---|
| And he went out from thence, and came into his own country; and his disciples follow him.
|
|---|
| ᎤᏄᎪᏤᏃ ᎾᎿᎭᏂ, ᎠᎴ ᎤᏩᏒ ᎤᏤᎵᎪᎯ ᏭᎷᏤᎢ; ᎬᏩᏍᏓᏩᏗᏙᎯᏃ ᎬᏩᏍᏓᏩᏛᏎᎢ.
|
|---|
U-nu-go-tse-no na-hna-ni, a-le u-wa-sv u-tse-li-go-hi wu-lu-tse-i; gv-wa-s-da-wa-di-do-hi-no gv-wa-s-da-wa-dv-se-i.
|
|---|
|
|---|
| And when the sabbath day was come, he began to teach in the synagogue: and many hearing him were astonished, saying, From whence hath this man these things? and what wisdom is this which is given unto him, that even such mighty works are wrought by his hands?
|
|---|
| ᎤᎾᏙᏓᏆᏍᎬᏃ ᎤᎵᏰᎶᎸ, ᎤᎴᏅᎮ ᏚᏕᏲᏁ ᏗᎦᎳᏫᎢᏍᏗᏱ; ᎤᏂᏣᏘᏃ ᎬᏩᏛᎦᏁᎸ ᎤᏂᏍᏆᏂᎪᏎᎢ, ᎯᎠ ᎾᏂᏪᏍᎨᎢ, ᎭᏢ ᎠᎩᎭ ᎯᎠ ᎠᏍᎦᏯ ᎯᎠ ᎾᏍᎩ ᎢᎬᏩᏛᏁᏗ ᏥᎩ? ᎠᎴ ᎦᏙ ᎤᏍᏗ ᎠᎦᏙᎥᎯᏍᏗ ᎾᏍᎩ ᎠᏥᏁᎸᎯ ᏥᎩ, ᎾᏍᎩ ᎢᏳᏍᏗ ᎤᏍᏆᏂᎪᏗ ᏥᏚᎸᏫᏍᏓᏁᎭ?
|
|---|
U-na-do-da-qua-s-gv-no u-li-ye-lo-lv, u-le-nv-he du-de-yo-ne di-ga-la-wi-i-s-di-yi; u-ni-tsa-ti-no gv-wa-dv-ga-ne-lv u-ni-s-qua-ni-go-se-i, hi-a na-ni-we-s-ge-i, Ha-tlv a-gi-ha hi-a a-s-ga-ya hi-a na-s-gi i-gv-wa-dv-ne-di tsi-gi? A-le ga-do u-s-di a-ga-do-v-hi-s-di na-s-gi a-tsi-ne-lv-hi tsi-gi, na-s-gi i-yu-s-di u-s-qua-ni-go-di tsi-du-lv-wi-s-da-ne-ha?
|
|---|
|
|---|
| Is not this the carpenter, the son of Mary, the brother of James, and Joses, and of Juda, and Simon? and are not his sisters here with us? And they were offended at him.
|
|---|
| ᏝᏍᎪ ᎾᏍᎩ ᎯᎠ ᏗᏁᏍᎨᏍᎩ ᏱᎩ, ᎺᎵ ᎤᏪᏥ, ᏥᎻ, ᎠᎴ ᏦᏏ, ᎠᎴ ᏧᏓ, ᎠᎴ ᏌᏩᏂ ᎠᎾᎵᏅᏟ? ᎠᎴ ᏧᏙ ᏝᏍᎪ ᎠᏂ ᏱᎨᎦᏓᏑᏯ? ᎥᎬᏩᏐᏅᏤᎸᎩᏃ.
|
|---|
Tla-s-go na-s-gi hi-a di-ne-s-ge-s-gi yi-gi, Me-li u-we-tsi, Tsi-mi, a-le Tso-si, a-le Tsu-da, a-le Sa-wa-ni a-na-li-nv-tli? A-le tsu-do tla-s-go a-ni yi-ge-ga-da-su-ya? V-gv-wa-so-nv-tse-lv-gi-no.
|
|---|
|
|---|
| But Jesus said unto them, A prophet is not without honour, but in his own country, and among his own kin, and in his own house.
|
|---|
| ᏥᏌᏃ ᎯᎠ ᏂᏚᏪᏎᎴᎢ; ᎠᏙᎴᎰᏍᎩ ᎥᏝ ᎾᏥᎸᏉᏛᎾ ᏱᎨᏐᎢ, ᎤᏤᎵᎪᎯᏍᎩᏂᏃᏅ ᎤᏩᏒ, ᎠᎴ ᏧᏴᏫ ᎠᏁᎲᎢ, ᎠᎴ ᎤᏩᏒ ᎦᏁᎸᎢ.
|
|---|
Tsi-sa-no hi-a ni-du-we-se-le-i; a-do-le-ho-s-gi v-tla na-tsi-lv-quo-dv-na yi-ge-so-i, u-tse-li-go-hi-s-gi-ni-no-nv u-wa-sv, a-le tsu-yv-wi a-ne-hv-i, a-le u-wa-sv ga-ne-lv-i.
|
|---|
|
|---|
| And he could there do no mighty work, save that he laid his hands upon a few sick folk, and healed them.
|
|---|
| ᎠᎴ ᎾᎿᎭᎥᏝ ᎪᎱᏍᏗ ᎤᏍᏆᏂᎪᏗ ᏗᎬᏩᎸᏫᏍᏓᏁᏗ ᏱᎨᏎᎢ, ᎤᏩᏒᏍᎩᏂᏃᏅ ᎢᎸᏍᎩ ᎢᏯᏂᏛ ᏧᏂᏢᎩ ᏚᏏᏔᏛ ᎠᎴ ᏚᏅᏩᏅᎢ.
|
|---|
A-le na-hna v-tla go-hu-s-di u-s-qua-ni-go-di di-gv-wa-lv-wi-s-da-ne-di yi-ge-se-i, u-wa-sv-s-gi-ni-no-nv i-lv-s-gi i-ya-ni-dv tsu-ni-tlv-gi du-si-ta-dv a-le du-nv-wa-nv-i.
|
|---|
|
|---|
| And he marvelled because of their unbelief. And he went round about the villages, teaching.
|
|---|
| ᎠᎴ ᎤᏍᏆᏂᎪᏎ ᎾᏃᎯᏳᎲᏍᎬᎾ ᎨᏒᎢ. ᎠᎴ ᎤᏪᏙᎴ ᎤᏚᏫᏛ ᏕᎦᏚᏩᏗᏒᎢ ᏓᏕᏲᎲᏍᎨᎢ.
|
|---|
A-le u-s-qua-ni-go-se na-no-hi-yu-hv-s-gv-na ge-sv-i. A-le u-we-do-le u-du-wi-dv de-ga-du-wa-di-sv-i da-de-yo-hv-s-ge-i.
|
|---|
|
|---|
| And he called unto him the twelve, and began to send them forth by two and two; and gave them power over unclean spirits;
|
|---|
| ᏔᎳᏚᏃ ᎢᏯᏂᏛ ᏫᏚᏯᏅᎮᎢ, ᎠᎴ ᏚᏅᏏᏙᎴ ᏔᎵᎭ ᏧᎵᎪᏅᏛ, ᎠᎴ ᏚᎵᏍᎪᎸᏓᏁᎴ ᏧᏂᏄᎪᏫᏍᏗᏱ ᏗᎦᏓᎭ ᏗᏓᏅᏙ;
|
|---|
Ta-la-du-no i-ya-ni-dv wi-du-ya-nv-he-i, a-le du-nv-si-do-le ta-li-ha tsu-li-go-nv-dv, a-le du-li-s-go-lv-da-ne-le tsu-ni-nu-go-wi-s-di-yi di-ga-da-ha di-da-nv-do;
|
|---|
|
|---|
| And commanded them that they should take nothing for their journey, save a staff only; no scrip, no bread, no money in their purse:
|
|---|
| ᎠᎴ ᏚᏁᏤᎴ ᎾᏍᎩ ᎪᎱᏍᏗ ᎤᏂᏴᏍᏗᏱ ᏂᎨᏒᎾ ᎤᎾᎵᏍᏕᎸᏙᏗ ᎠᏁᏙᎲᎢ, ᎠᏙᎳᏅᏍᏗ ᎤᏩᏒ; ᎥᏝ ᏕᎦᎶᏗ, ᎠᎴ ᎦᏚ, ᎠᎴ ᎥᏣᏱ ᏚᎾᏓᏠᎲᎢ;
|
|---|
A-le du-ne-tse-le na-s-gi go-hu-s-di u-ni-yv-s-di-yi ni-ge-sv-na u-na-li-s-de-lv-do-di a-ne-do-hv-i, a-do-la-nv-s-di u-wa-sv; v-tla de-ga-lo-di, a-le ga-du, a-le v-tsa-yi du-na-da-tlo-hv-i;
|
|---|
|
|---|
| But be shod with sandals; and not put on two coats.
|
|---|
| ᏧᎾᎳᏑᎸᏗᏱᏍᎩᏂ; ᎠᎴ ᏞᏍᏗ ᏔᎵ ᏱᏗᏣᏄᏬᏍᎨᏍᏗ.
|
|---|
Tsu-na-la-su-lv-di-yi-s-gi-ni; a-le tle-s-di ta-li yi-di-tsa-nu-wo-s-ge-s-di.
|
|---|
|
|---|
| And he said unto them, In what place soever ye enter into an house, there abide till ye depart from that place.
|
|---|
| ᎠᎴ ᎯᎠ ᏂᏚᏪᏎᎴᎢ, ᎠᏓᏁᎸ ᎢᎸᎯᏢ ᎢᏥᏴᎯᎮᏍᏗ, ᎾᎿᎭᏉ ᎢᏣᏅᎥᏍᎨᏍᏗ ᎬᏂ ᎥᏣᏂᎩ ᎾᎿᎭᏂ.
|
|---|
A-le hi-a ni-du-we-se-le-i, a-da-ne-lv i-lv-hi-tlv i-tsi-yv-hi-he-s-di, na-hna-quo i-tsa-nv-v-s-ge-s-di gv-ni v-tsa-ni-gi na-hna-ni.
|
|---|
|
|---|
| And whosoever shall not receive you, nor hear you, when ye depart thence, shake off the dust under your feet for a testimony against them. Verily I say unto you, It shall be more tolerable for Sodom and Gomorrha in the day of judgment, than for that city.
|
|---|
| ᎠᎴ ᎩᎶ ᏂᏗᏣᏓᏂᎸᎬᎾ ᎠᎴ ᏂᏣᏛᏓᏍᏓᏁᎲᎾ ᎢᎨᏎᏍᏗ, ᎿᎭᏉ ᎾᎿᎭᎢᏣᏂᎩᏍᎨᏍᏗ, ᏗᏣᎳᏏᏕᏂ ᎪᏍᏚ ᏕᏥᏅᎪᎥᏗᏍᎨᏍᏗ, ᎾᏍᎩ ᎪᎯᏳᏗᏍᎩ ᎤᎾᏡᏗᏍᎩ. ᎤᏙᎯᏳᎯᏯ ᎯᎠ ᏂᏨᏪᏎᎭ, ᎡᏍᎦᏉ ᎢᎦᎢ ᎤᏂᎩᎵᏲᎢᏍᏗ ᎨᏎᏍᏗ ᏐᏓᎻ, ᎠᎴ ᎪᎹᎵ, ᏗᎫᎪᏙᏗᏱ ᎢᎦ ᎨᏎᏍᏗ, ᎤᏟᎯᏳ ᎾᎿᎭᎦᏚᎲᎢ.
|
|---|
A-le gi-lo ni-di-tsa-da-ni-lv-gv-na a-le ni-tsa-dv-da-s-da-ne-hv-na i-ge-se-s-di, hna-quo na-hna i-tsa-ni-gi-s-ge-s-di, di-tsa-la-si-de-ni go-s-du de-tsi-nv-go-v-di-s-ge-s-di, na-s-gi go-hi-yu-di-s-gi u-na-tlu-di-s-gi. U-do-hi-yu-hi-ya hi-a ni-tsv-we-se-ha, e-s-ga-quo i-ga-i u-ni-gi-li-yo-i-s-di ge-se-s-di So-da-mi, a-le Go-ma-li, di-gu-go-do-di-yi i-ga ge-se-s-di, u-tli-hi-yu na-hna ga-du-hv-i.
|
|---|
|
|---|
| And they went out, and preached that men should repent.
|
|---|
| ᎤᏂᏄᎪᏤᏃ, ᏭᎾᎵᏥᏙᏁ ᎾᏍᎩ ᏴᏫ ᎠᏎ ᏧᏂᏁᏟᏴᏍᏗ ᎨᏒ ᏚᎾᏓᏅᏛᎢ.
|
|---|
U-ni-nu-go-tse-no, wu-na-li-tsi-do-ne na-s-gi yv-wi a-se tsu-ni-ne-tli-yv-s-di ge-sv du-na-da-nv-dv-i.
|
|---|
|
|---|
| And they cast out many devils, and anointed with oil many that were sick, and healed them.
|
|---|
| ᎤᏂᏣᏘᏃ ᏚᏂᏄᎪᏫᏎ ᎠᏂᏍᎩᎾ, ᎠᎴ ᎪᎢ ᏚᏂᎶᏁᏔᏁ ᎤᏂᏣᏘ ᏧᏂᏢᎩ, ᎠᎴ ᏚᏂᏅᏩᏁᎢ.
|
|---|
U-ni-tsa-ti-no du-ni-nu-go-wi-se a-ni-s-gi-na, a-le go-i du-ni-lo-ne-ta-ne u-ni-tsa-ti tsu-ni-tlv-gi, a-le du-ni-nv-wa-ne-i.
|
|---|
|
|---|
| And king Herod heard of him; (for his name was spread abroad:) and he said, That John the Baptist was risen from the dead, and therefore mighty works do shew forth themselves in him.
|
|---|
| ᎡᎶᏛᏃ ᎤᎬᏫᏳᎯ ᎤᏛᎦᏁ ᎾᏍᎩ ᎠᏥᏃᎮᏍᎬᎢ; ᏚᏃᏣᎶᏤᏰᏃ ᎾᏍᎩ ᏚᏙᎥᎢ; ᎠᎴ ᎯᎠ ᏄᏪᏎ ᎡᎶᏛ, ᏣᏂ ᏗᏓᏬᏍᎩ ᏓᎴᎯᏌ ᎤᏲᎱᏒᎢ, ᎠᎴ ᎾᏍᎩ ᏅᏗᎦᎵᏍᏙᏗᎭ ᎤᏍᏆᏂᎪᏗ ᏥᏕᎤᎸᏫᏍᏓᏁᎭ.
|
|---|
E-lo-dv-no u-gv-wi-yu-hi u-dv-ga-ne na-s-gi a-tsi-no-he-s-gv-i; du-no-tsa-lo-tse-ye-no na-s-gi du-do-v-i; a-le hi-a nu-we-se E-lo-dv, Tsa-ni Di-da-wo-s-gi da-le-hi-sa u-yo-hu-sv-i, a-le na-s-gi nv-di-ga-li-s-do-di-ha u-s-qua-ni-go-di tsi-de-u-lv-wi-s-da-ne-ha.
|
|---|
|
|---|
| Others said, That it is Elias. And others said, That it is a prophet, or as one of the prophets.
|
|---|
| ᎢᎦᏛᏃ ᎯᎠ ᎾᏂᏪᏍᎨᎢ, ᎢᎳᏯ ᎯᎠ. ᎢᎦᏛᏃ ᎯᎠ ᎾᏂᏪᏍᎨᎢ, ᎠᏙᎴᎰᏍᎩ ᎯᎠ, ᎠᎴ ᎩᎶ ᎠᎾᏙᎴᎰᏍᎩ ᎨᏒ ᎾᏍᎩᏯᎢ.
|
|---|
I-ga-dv-no hi-a na-ni-we-s-ge-i, I-la-ya hi-a. I-ga-dv-no hi-a na-ni-we-s-ge-i, a-do-le-ho-s-gi hi-a, a-le gi-lo a-na-do-le-ho-s-gi ge-sv na-s-gi-ya-i.
|
|---|
|
|---|
| But when Herod heard thereof, he said, It is John, whom I beheaded: he is risen from the dead.
|
|---|
| ᎡᎶᏛᏍᎩᏂ ᎤᏛᎦᏅ, ᎯᎠ ᏄᏪᏎᎢ; ᏣᏂ ᎯᎠ, ᎾᏍᎩ ᎠᏴ ᏥᏥᏍᎫᏕᏒᎩ; ᎾᏍᎩ ᏚᎴᎯᏌᏅ ᎤᏲᎱᏒᎢ.
|
|---|
E-lo-dv-s-gi-ni u-dv-ga-nv, hi-a nu-we-se-i; Tsa-ni hi-a, na-s-gi a-yv tsi-tsi-s-gu-de-sv-gi; na-s-gi du-le-hi-sa-nv u-yo-hu-sv-i.
|
|---|
|
|---|
| For Herod himself had sent forth and laid hold upon John, and bound him in prison for Herodias' sake, his brother Philip's wife: for he had married her.
|
|---|
| ᎡᎶᏛᏰᏃ ᎤᏩᏒ ᎤᏓᏅᏒᎯ ᎨᏎ ᏭᏂᏴᎲᎯ ᎨᏎ ᏣᏂ, ᎠᎴ ᏗᏓᏍᏚᏗᏱ ᎤᎸᎸᎯ ᎨᏎᎢ, ᎠᏍᏛᏗᏍᏗᏍᎨ ᎡᎶᏗᏏ, ᎤᏅᏟ ᏈᎵᎩ ᎤᏓᎵᎢ; ᎾᏍᎩᏰᏃ ᎠᏓᏰᎮᎢ.
|
|---|
E-lo-dv-ye-no u-wa-sv u-da-nv-sv-hi ge-se wu-ni-yv-hv-hi ge-se Tsa-ni, a-le di-da-s-du-di-yi u-lv-lv-hi ge-se-i, a-s-dv-di-s-di-s-ge E-lo-di-si, u-nv-tli Qui-li-gi u-da-li-i; na-s-gi-ye-no a-da-ye-he-i.
|
|---|
|
|---|
| For John had said unto Herod, It is not lawful for thee to have thy brother's wife.
|
|---|
| ᏣᏂᏰᏃ ᎯᎠ ᎢᏳᏪᏎᎸᎯ ᎨᏎ ᎡᎶᏛ, ᎥᏝ ᏱᏚᏳᎪᏗ ᎡᏣᏅᏟ ᎤᏓᎵᎢ ᏣᏓᏰᎭ.
|
|---|
Tsa-ni-ye-no hi-a i-yu-we-se-lv-hi ge-se E-lo-dv, v-tla yi-du-yu-go-di e-tsa-nv-tli u-da-li-i tsa-da-ye-ha.
|
|---|
|
|---|
| Therefore Herodias had a quarrel against him, and would have killed him; but she could not:
|
|---|
| ᎾᏍᎩ ᎢᏳᏍᏗ ᎡᎶᏗᏏ ᎠᏍᎦᎨ [ᏣᏂ] ᎠᎴ ᏳᎴᎢ; ᎠᏎᏃ ᎥᏝ ᎾᏍᎩ ᎢᎬᏩᏛᏁᏗ ᏱᎨᏎᎢ.
|
|---|
Na-s-gi i-yu-s-di E-lo-di-si a-s-ga-ge [Tsa-ni] a-le yu-le-i; a-se-no v-tla na-s-gi i-gv-wa-dv-ne-di yi-ge-se-i.
|
|---|
|
|---|
| For Herod feared John, knowing that he was a just man and an holy, and observed him; and when he heard him, he did many things, and heard him gladly.
|
|---|
| ᎡᎶᏛᏰᏃ ᎤᎸᏉᏗᏳ ᎨᏎ ᏣᏂ, ᎠᎦᏔᎮᏰᏃ ᎤᏓᏅᏘᏳ ᎠᎴ ᎾᏍᎦᏅᎾ ᎨᏒ ᎠᏍᎦᏯ, ᎠᎴ ᎤᎦᏌᏯᏍᏗᏳ ᎨᏎᎢ; ᎾᏍᎩᏃ ᎤᏛᎦᏅ [ᎠᎵᏥᏙᎲᏍᎬ,] ᎤᏣᏖ ᏚᎸᏫᏍᏓᏁᎴᎢ, ᎠᎴ ᎤᎵᎮᎵᏨᎯ ᎠᏛᏓᏍᏓᏁᎮᎢ.
|
|---|
E-lo-dv-ye-no u-lv-quo-di-yu ge-se Tsa-ni, a-ga-ta-he-ye-no u-da-nv-ti-yu a-le na-s-ga-nv-na ge-sv a-s-ga-ya, a-le u-ga-sa-ya-s-di-yu ge-se-i; na-s-gi-no u-dv-ga-nv [a-li-tsi-do-hv-s-gv,] u-tsa-te du-lv-wi-s-da-ne-le-i, a-le u-li-he-li-tsv-hi a-dv-da-s-da-ne-he-i.
|
|---|
|
|---|
| And when a convenient day was come, that Herod on his birthday made a supper to his lords, high captains, and chief estates of Galilee;
|
|---|
| ᎠᎯᏛᏃ ᎾᏍᎩ ᎢᎬᏛᏁᏗ ᎨᏒ ᎤᏍᏆᎸᎲ, ᎾᏍᎩ ᎡᎶᏛ ᎤᏕᏅ ᎢᏳ ᎢᎦ ᎤᏛᏅᎢᏍᏔᏁ ᎬᏩᎵᏍᏓᏴᎾᏁᏗᏱ ᏧᏤᎵ ᎤᏂᎬᏫᏳᎯ, ᎠᎴ ᎠᏂᏍᎦᏰᎬᏍᏓ, ᎠᎴ ᏗᎨᎦᏁᎶᏗ ᎨᎵᎵ ᎠᏁᎯ,
|
|---|
A-hi-dv-no na-s-gi i-gv-dv-ne-di ge-sv u-s-qua-lv-hv, na-s-gi E-lo-dv u-de-nv i-yu i-ga u-dv-nv-i-s-ta-ne gv-wa-li-s-da-yv-na-ne-di-yi tsu-tse-li u-ni-gv-wi-yu-hi, a-le a-ni-s-ga-ye-gv-s-da, a-le di-ge-ga-ne-lo-di Ge-li-li a-ne-hi,
|
|---|
|
|---|
| And when the daughter of the said Herodias came in, and danced, and pleased Herod and them that sat with him, the king said unto the damsel, Ask of me whatsoever thou wilt, and I will give it thee.
|
|---|
| ᎾᏍᎩᏃ ᎡᎶᏗᏏ ᎤᏪᏥ ᎠᏛ ᎤᏴᎵᎸ, ᎠᎴ ᎤᎵᏍᎩᏒ, ᎠᎴ ᎡᎶᏛ ᎠᎴ ᎾᏍᎩ ᎢᏧᎳᎭ ᎠᏂᏂᏜᏓᎢ ᎣᏏᏳ ᎤᏂᏰᎸᏅ, ᎤᎬᏫᏳᎯ ᎯᎠ ᏄᏪᏎᎴ ᎠᏛ, ᏍᎩᏔᏲᏏ ᎢᏳᏍᏗᏉ ᎮᎵᏍᎬᎢ, ᏓᎬᏁᎵᏃ.
|
|---|
Na-s-gi-no E-lo-di-si u-we-tsi a-dv u-yv-li-lv, a-le u-li-s-gi-sv, a-le E-lo-dv a-le na-s-gi i-tsu-la-ha a-ni-ni-dla-i o-si-yu u-ni-ye-lv-nv, u-gv-wi-yu-hi hi-a nu-we-se-le a-dv, S-gi-ta-yo-si i-yu-s-di-quo he-li-s-gv-i, da-gv-ne-li-no.
|
|---|
|
|---|
| And he sware unto her, Whatsoever thou shalt ask of me, I will give it thee, unto the half of my kingdom.
|
|---|
| ᎤᏎᎵᏓᏁᎴᏃ [ᎯᎠ ᏄᏪᏎᎢ,] ᎢᏳᏍᏗᏉ ᎮᎵᏍᎬ ᏍᎩᏔᏲᏏ, ᏓᎬᏁᎵᏃ, ᎾᏍᏉ ᎠᏰᎵ ᎢᏴᏛ ᏱᎩ ᎾᎿᎭᎠᎩᎬᏫᏳᎯ ᎨᏒᎢ.
|
|---|
U-se-li-da-ne-le-no [hi-a nu-we-se-i,] I-yu-s-di-quo he-li-s-gv s-gi-ta-yo-si, da-gv-ne-li-no, na-s-quo a-ye-li i-yv-dv yi-gi na-hna a-gi-gv-wi-yu-hi ge-sv-i.
|
|---|
|
|---|
| And she went forth, and said unto her mother, What shall I ask? And she said, The head of John the Baptist.
|
|---|
| ᎤᏄᎪᏨᏃ ᎯᎠ ᏫᏄᏪᏎᎴ ᎤᏥ, ᎦᏙ ᏓᏥᏔᏲᎵ? ᎯᎠᏃ ᏄᏪᏎᎴᎢ, ᏣᏂ ᏗᏓᏬᏍᎩ ᎠᏍᎪᎵ.
|
|---|
U-nu-go-tsv-no hi-a wi-nu-we-se-le u-tsi, ga-do da-tsi-ta-yo-li? Hi-a-no nu-we-se-le-i, Tsa-ni Di-da-wo-s-gi a-s-go-li.
|
|---|
|
|---|
| And she came in straightway with haste unto the king, and asked, saying, I will that thou give me by and by in a charger the head of John the Baptist.
|
|---|
| ᎢᎬᏪᏅᏛᏉᏃ ᎤᎵᏍᏗ ᎤᏴᎵᎴ ᎤᎬᏫᏳᎯ ᎠᏯᎥᎢ, ᎠᎴ ᎤᏔᏲᎴ ᎯᎠ ᏄᏪᏎᎢ, ᎠᏆᏚᎵ ᎩᎳᏉ ᎢᏴᏛ ᏍᎩᏁᏗᏱ, ᎠᏖᎵᏙᎩᎯ, ᏣᏂ ᏗᏓᏬᏍᎩ ᎤᏍᎪ.
|
|---|
I-gv-we-nv-dv-quo-no u-li-s-di u-yv-li-le u-gv-wi-yu-hi a-ya-v-i, a-le u-ta-yo-le hi-a nu-we-se-i, A-qua-du-li gi-la-quo i-yv-dv s-gi-ne-di-yi, a-te-li-do-gi-hi, Tsa-ni di-da-wo-s-gi u-s-go.
|
|---|
|
|---|
| And the king was exceeding sorry; yet for his oath's sake, and for their sakes which sat with him, he would not reject her.
|
|---|
| ᎤᎬᏫᏳᎯᏃ ᎤᏣᏘ ᏝᏉ ᎤᏰᎸᏁᎢ; ᎠᏎᏃ ᎤᏎᎵᏔᏅᎢ, ᎠᎴ ᎾᏍᎩ ᎢᏧᎳᎭ ᎤᎾᏂᏜᏓᏅᎯ ᏅᏧᎵᏍᏙᏔᏁ, ᎥᏝ ᎬᏩᎨᏳᏙᏗ ᏱᎨᏎᎢ.
|
|---|
U-gv-wi-yu-hi-no u-tsa-ti tla-quo u-ye-lv-ne-i; a-se-no u-se-li-ta-nv-i, a-le na-s-gi i-tsu-la-ha u-na-ni-dla-nv-hi nv-tsu-li-s-do-ta-ne, v-tla gv-wa-ge-yu-do-di yi-ge-se-i.
|
|---|
|
|---|
| And immediately the king sent an executioner, and commanded his head to be brought: and he went and beheaded him in the prison,
|
|---|
| ᎩᎳᏉᏃ ᎢᏴᏛ ᎤᎬᏫᏳᎯ ᎤᏅᏎ ᎠᏯᏫᏍᎩ, ᎠᎴ ᎤᏁᏤ ᎤᏍᎪ ᎤᏂᏲᎯᏍᏗᏱ; ᎤᏪᏅᏎᏃ, ᎠᎴ ᏭᏍᎫᏕᏎ ᏗᏓᏍᏚᏗᏱ ᎠᏯᎥᎢ,
|
|---|
Gi-la-quo-no i-yv-dv u-gv-wi-yu-hi u-nv-se a-ya-wi-s-gi, a-le u-ne-tse u-s-go u-ni-yo-hi-s-di-yi; u-we-nv-se-no, a-le wu-s-gu-de-se di-da-s-du-di-yi a-ya-v-i,
|
|---|
|
|---|
| And brought his head in a charger, and gave it to the damsel: and the damsel gave it to her mother.
|
|---|
| ᎠᎴ ᎤᏲᎴ ᎤᏍᎪ ᎠᏖᎵᏙᎩᎯ ᎦᎶᏕᎢ, ᎠᎴ ᎠᏛ ᎤᏁᎴᎢ; ᎠᏛᏃ ᎤᏥ ᎤᏁᎴᎢ.
|
|---|
A-le u-yo-le u-s-go a-te-li-do-gi-hi ga-lo-de-i, a-le a-dv u-ne-le-i; a-dv-no u-tsi u-ne-le-i.
|
|---|
|
|---|
| And when his disciples heard of it, they came and took up his corpse, and laid it in a tomb.
|
|---|
| ᎬᏩᏍᏓᏩᏗᏙᎯᏃ ᎤᎾᏛᎦᏅ, ᎤᏂᎷᏤ ᎠᎴ ᎤᏂᏁᏎ ᎠᏰᎸᎢ, ᎠᎴ ᎠᏤᎵᏍᏛ ᎤᏂᏅᏁᎢ.
|
|---|
Gv-wa-s-da-wa-di-do-hi-no u-na-dv-ga-nv, u-ni-lu-tse a-le u-ni-ne-se a-ye-lv-i, a-le a-tse-li-s-dv u-ni-nv-ne-i.
|
|---|
|
|---|
| And the apostles gathered themselves together unto Jesus, and told him all things, both what they had done, and what they had taught.
|
|---|
| ᎨᏥᏅᏏᏛᏃ ᎤᎾᏓᏟᏌᏁ ᏥᏌ ᎡᏙᎲᎢ, ᎠᎴ ᎬᏩᏃᏁᎴ ᏂᎦᏛ ᏄᎾᏛᏁᎵᏙᎸ, ᎠᎴ ᎾᏍᏉ ᏄᏍᏛ ᏚᎾᏕᏲᏅᎢ.
|
|---|
Ge-tsi-nv-si-dv-no u-na-da-tli-sa-ne Tsi-sa e-do-hv-i, a-le gv-wa-no-ne-le ni-ga-dv nu-na-dv-ne-li-do-lv, a-le na-s-quo nu-s-dv du-na-de-yo-nv-i.
|
|---|
|
|---|
| And he said unto them, Come ye yourselves apart into a desert place, and rest a while: for there were many coming and going, and they had no leisure so much as to eat.
|
|---|
| ᎯᎠᏃ ᏂᏚᏪᏎᎴᎢ, ᎢᏕᎾ ᎢᏨᏒᏉ ᎢᏴᏛ ᏫᏗᎶᎯ ᎢᎾᎨ ᏗᎨᏒᎢ, ᎠᎴ ᏞᎦ ᎢᏣᏣᏪᏐᎸᏍᏓ; ᎤᏂᏣᏖᏰᏃ ᎠᏂᎷᎨ ᎠᎴ ᏓᏁᎨᎢ, ᎥᏞᏃ ᏯᏜᏓᏅᏓᏗᏍᎨ ᎾᏍᏉ ᎤᎾᎵᏍᏓᏴᏗᏱ ᎢᎪᎯᏛ.
|
|---|
Hi-a-no ni-du-we-se-le-i, I-de-na i-tsv-sv-quo i-yv-dv wi-di-lo-hi i-na-ge di-ge-sv-i, a-le tle-ga i-tsa-tsa-we-so-lv-s-da; u-ni-tsa-te-ye-no a-ni-lu-ge a-le da-ne-ge-i, v-tle-no ya-dla-nv-da-di-s-ge na-s-quo u-na-li-s-da-yv-di-yi i-go-hi-dv.
|
|---|
|
|---|
| And they departed into a desert place by ship privately.
|
|---|
| ᏥᏳᎯᏃ ᎤᎾᏣᎡᎢ, ᎤᎾᏂᎩᏎ ᎢᎾᎨ ᏭᏂᎶᏎ ᎤᏕᎵᏛ.
|
|---|
Tsi-yu-hi-no u-na-tsa-e-i, u-na-ni-gi-se i-na-ge wu-ni-lo-se u-de-li-dv.
|
|---|
|
|---|
| And the people saw them departing, and many knew him, and ran afoot thither out of all cities, and outwent them, and came together unto him.
|
|---|
| ᏴᏫᏃ ᎬᏩᏂᎪᎮ ᎠᎾᏂᎩᏍᎬᎢ, ᎠᎴ ᎤᏂᏣᏖ ᎬᏬᎵᎨᎢ, ᎠᎴ ᎡᎳᏗᏉ ᏚᏂᏍᏆᎸᏔᏁ ᎾᎿᎭᎢᏗᏢ ᏭᏂᎶᏎ ᏕᎦᏚᏩᏗᏒ ᏂᏙᏓᏳᏂᎶᏒᎯ, ᏕᎬᏩᏂᎩᏰᏃ, ᎠᎴ ᏫᎬᏩᏓᏟᏌᏁᎴᎢ.
|
|---|
Yv-wi-no gv-wa-ni-go-he a-na-ni-gi-s-gv-i, a-le u-ni-tsa-te gv-wo-li-ge-i, a-le e-la-di-quo du-ni-s-qua-lv-ta-ne na-hna i-di-tlv wu-ni-lo-se de-ga-du-wa-di-sv ni-do-da-yu-ni-lo-sv-hi, de-gv-wa-ni-gi-ye-no, a-le wi-gv-wa-da-tli-sa-ne-le-i.
|
|---|
|
|---|
| And Jesus, when he came out, saw much people, and was moved with compassion toward them, because they were as sheep not having a shepherd: and he began to teach them many things.
|
|---|
| ᏥᏌᏃ ᎤᏣᎢᏒ, ᏚᎪᎮ ᎤᏂᏣᏘ ᏴᏫ, ᎠᎴ ᏚᏪᏙᎵᏤᎢ, ᏅᏗᎦᎵᏍᏙᏗᏍᎨ ᎠᏫ ᎤᏂᏃᏕᎾ ᏓᎾᏤᎳᎬ ᏁᎲᎾ ᏥᎨᏐ ᎤᏂᎦᏘᏯ; ᎤᎴᏅᎮᏃ ᎤᏣᏘ ᏧᏓᎴᏅᏛ ᏚᏪᏲᏁᎢ.
|
|---|
Tsi-sa-no u-tsa-i-sv, du-go-he u-ni-tsa-ti yv-wi, a-le du-we-do-li-tse-i, nv-di-ga-li-s-do-di-s-ge a-wi u-ni-no-de-na da-na-tse-la-gv ne-hv-na tsi-ge-so u-ni-ga-ti-ya; u-le-nv-he-no u-tsa-ti tsu-da-le-nv-dv du-we-yo-ne-i.
|
|---|
|
|---|
| And when the day was now far spent, his disciples came unto him, and said, This is a desert place, and now the time is far passed:
|
|---|
| ᎿᎭᏉᏃ ᎤᎶᏐᏂᏕᎾ ᎨᏎ ᎢᎦ, ᎬᏩᏍᏓᏩᏗᏙᎯ ᎬᏩᎷᏤᎴ, ᎯᎠ ᏄᏂᏪᏎᎢ, ᎠᏂ ᎢᎾᎨᎢ, ᎠᎴ ᎿᎭᏉ ᎤᎶᏐᏂᏗ ᎢᎦ.
|
|---|
Hna-quo-no u-lo-so-ni-de-na ge-se i-ga, gv-wa-s-da-wa-di-do-hi gv-wa-lu-tse-le, hi-a nu-ni-we-se-i, A-ni i-na-ge-i, a-le hna-quo u-lo-so-ni-di i-ga.
|
|---|
|
|---|
| Send them away, that they may go into the country round about, and into the villages, and buy themselves bread: for they have nothing to eat.
|
|---|
| ᏘᏰᎵᎯᏍᏓ, ᎾᏍᎩ ᏓᏓᏁᎳᏗᏒ ᎬᏩᏚᏫᏛ ᏩᏂᎶᎯ, ᎠᎴ ᏕᎦᏚᏩᏗᏒᎢ, ᎠᎴ ᏭᏂᏩᎯ ᎦᏚ, ᎥᏞᏰᏃ ᎪᎱᏍᏗ ᏯᏂᏰ ᎤᎾᎵᏍᏓᏴᏗ.
|
|---|
Ti-ye-li-hi-s-da, na-s-gi da-da-ne-la-di-sv gv-wa-du-wi-dv wa-ni-lo-hi, a-le de-ga-du-wa-di-sv-i, a-le wu-ni-wa-hi ga-du, v-tle-ye-no go-hu-s-di ya-ni-ye u-na-li-s-da-yv-di.
|
|---|
|
|---|
| He answered and said unto them, Give ye them to eat. And they say unto him, Shall we go and buy two hundred pennyworth of bread, and give them to eat?
|
|---|
| ᏚᏁᏤᎴᏃ ᎯᎠ ᏂᏚᏪᏎᎴᎢ, ᏂᎯ ᏗᏤᎳᏍᏓ. ᎯᎠᏃ ᏂᎬᏩᏪᏎᎴᎢ, ᏥᎪ ᏓᏲᏤᏏ ᏔᎵᏧᏈ ᎠᏂᎩᏏ ᏧᎬᏩᎶᏗ ᎦᏚ ᏮᏓᏲᎩᏩᏏ, ᎠᎴ ᏙᏓᏲᏤᎳᏍᏔᏂ?
|
|---|
Du-ne-tse-le-no hi-a ni-du-we-se-le-i, Ni-hi di-tse-la-s-da. Hi-a-no ni-gv-wa-we-se-le-i, Tsi-go da-yo-tse-si ta-li-tsu-qui a-ni-gi-si tsu-gv-wa-lo-di ga-du wv-da-yo-gi-wa-si, a-le do-da-yo-tse-la-s-ta-ni?
|
|---|
|
|---|
| He saith unto them, How many loaves have ye? go and see. And when they knew, they say, Five, and two fishes.
|
|---|
| ᎯᎠᏃ ᏂᏚᏪᏎᎴᎢ, ᎢᎳᎪ ᎦᏚ ᏕᏥᏰᎭ? ᏫᏣᎦᏔ. ᎤᎾᏙᎴᎰᏒᏃ, ᎯᎠ ᏄᎯᏪᏎᎢ, ᎯᏍᎩ, ᏔᎵᏃ ᎠᏣᏗ.
|
|---|
Hi-a-no ni-du-we-se-le-i, I-la-go ga-du de-tsi-ye-ha? Wi-tsa-ga-ta. U-na-do-le-ho-sv-no, hi-a nu-hi-we-se-i, Hi-s-gi, ta-li-no a-tsa-di.
|
|---|
|
|---|
| And he commanded them to make all sit down by companies upon the green grass.
|
|---|
| ᏚᏁᏤᎴᏃ ᎤᎾᏂᏢᏗᏱ ᏂᎦᏛ ᎢᏤ ᎧᏁᏍᎪᎯ ᎨᏒ ᏧᎾᏓᏡᏅᏛ.
|
|---|
Du-ne-tse-le-no u-na-ni-tlv-di-yi ni-ga-dv i-tse ka-ne-s-go-hi ge-sv tsu-na-da-tlu-nv-dv.
|
|---|
|
|---|
| And they sat down in ranks, by hundreds, and by fifties.
|
|---|
| ᎤᎾᏂᏢᏁᏃ ᎣᏍᏛ ᏚᎾᏓᏅᎿᎭᏁᎢ ᎠᏍᎪᎯᏧᏈ, ᎠᎴ ᎯᏍᎦᏍᎪᎯ ᏧᎾᏓᏡᏅᏛ.
|
|---|
U-na-ni-tlv-ne-no o-s-dv du-na-da-nv-hna-ne-i a-s-go-hi-tsu-qui, a-le hi-s-ga-s-go-hi tsu-na-da-tlu-nv-dv.
|
|---|
|
|---|
| And when he had taken the five loaves and the two fishes, he looked up to heaven, and blessed, and brake the loaves, and gave them to his disciples to set before them; and the two fishes divided he among them all.
|
|---|
| ᎯᏍᎩᏃ ᎦᏚ ᏚᎩᏒ ᎠᎴ ᏔᎵ ᎠᏣᏗ ᏚᏁᏒ, ᎦᎸᎳᏗ ᏫᏚᎧᎿᎭᏁᎢ, ᎠᎴ ᎤᎵᎮᎵᏤᎢ, ᎠᎴ ᏚᎬᎭᎷᏰ ᎦᏚ, ᎠᎴ ᎬᏩᏍᏓᏩᏗᏙᎯ ᏚᏁᎴ ᏧᏂᏁᏗᏱ; ᏔᎵᏃ ᎠᏣᏗ ᏂᎦᏛ ᏚᏯᏙᎮᎴᎢ.
|
|---|
Hi-s-gi-no ga-du du-gi-sv a-le ta-li a-tsa-di du-ne-sv, ga-lv-la-di wi-du-ka-hna-ne-i, a-le u-li-he-li-tse-i, a-le du-gv-ha-lu-ye ga-du, a-le gv-wa-s-da-wa-di-do-hi du-ne-le tsu-ni-ne-di-yi; ta-li-no a-tsa-di ni-ga-dv du-ya-do-he-le-i.
|
|---|
|
|---|
| And they did all eat, and were filled.
|
|---|
| ᏂᎦᏛᏃ ᎤᎾᎵᏍᏓᏴᏁᎢ; ᎠᎴ ᏚᏃᎸᏎᎢ.
|
|---|
Ni-ga-dv-no u-na-li-s-da-yv-ne-i; a-le du-no-lv-se-i.
|
|---|
|
|---|
| And they took up twelve baskets full of the fragments, and of the fishes.
|
|---|
| ᎤᏄᏖᏎᏃ ᎤᎵᎬᎭᎷᏴᎯ ᏔᎳᏚ ᏗᎧᎵᎢ ᏔᎷᏣ, ᎠᎴ ᎾᏍᏉ ᎠᏣᏗ.
|
|---|
U-nu-te-se-no u-li-gv-ha-lu-yv-hi ta-la-du di-ka-li-i ta-lu-tsa, a-le na-s-quo a-tsa-di.
|
|---|
|
|---|
| And they that did eat of the loaves were about five thousand men.
|
|---|
| ᎾᏍᎩᏃ Ꮎ ᎦᏚ ᏧᏂᎬᎯ ᎯᏍᎩ ᎢᏯᎦᏴᎵ ᎢᏴᏛ ᎾᏂᎡ ᎠᏂᏍᎦᏯ.
|
|---|
Na-s-gi-no na ga-du tsu-ni-gv-hi hi-s-gi i-ya-ga-yv-li i-yv-dv na-ni-e a-ni-s-ga-ya.
|
|---|
|
|---|
| And straightway he constrained his disciples to get into the ship, and to go to the other side before unto Bethsaida, while he sent away the people.
|
|---|
| ᎩᎳᏉᏃ ᎢᏴᏛ ᏚᏅᏫᏍᏔᏁ ᎬᏩᏍᏓᏩᏗᏙᎯ ᏥᏳᎯ ᎤᎾᏦᏗᏱ, ᎠᎴ ᎢᎬᏱ ᏧᏂᏐᎯᏍᏗᏱ, ᏇᏣᏱᏗ ᏭᏂᎷᎯᏍᏗᏱ, ᎠᏏᏉ ᎤᏩᏒ ᏓᏰᎵᎯᏍᏗᏍᎬ ᎤᏂᏣᏘ.
|
|---|
Gi-la-quo-no i-yv-dv du-nv-wi-s-ta-ne gv-wa-s-da-wa-di-do-hi tsi-yu-hi u-na-tso-di-yi, a-le i-gv-yi tsu-ni-so-hi-s-di-yi, Que-tsa-yi-di wu-ni-lu-hi-s-di-yi, a-si-quo u-wa-sv da-ye-li-hi-s-di-s-gv u-ni-tsa-ti.
|
|---|
|
|---|
| And when he had sent them away, he departed into a mountain to pray.
|
|---|
| ᏚᏰᎵᎯᏍᏔᏅᏃ, ᎣᏓᎸ ᏭᎶᏎ ᎤᏓᏙᎵᏍᏔᏅᏎᎢ.
|
|---|
Du-ye-li-hi-s-ta-nv-no, o-da-lv wu-lo-se u-da-do-li-s-ta-nv-se-i.
|
|---|
|
|---|
| And when even was come, the ship was in the midst of the sea, and he alone on the land.
|
|---|
| ᎤᏒᏃ ᏄᎵᏍᏔᏅ ᏥᏳ ᎥᏓᎵ ᎠᏰᎵ ᎠᏂᏂᏎᎢ, ᎤᏩᏒᏃ ᏙᏱ ᎡᏙᎮᎢ.
|
|---|
U-sv-no nu-li-s-ta-nv tsi-yu v-da-li a-ye-li a-ni-ni-se-i, u-wa-sv-no do-yi e-do-he-i.
|
|---|
|
|---|
| And he saw them toiling in rowing; for the wind was contrary unto them: and about the fourth watch of the night he cometh unto them, walking upon the sea, and would have passed by them.
|
|---|
| ᏚᎪᎮᏃ ᎠᏂᎩᎵᏲᎬ ᎠᏂᎦᏪᎯᎲᎢ; ᏩᏂᎦᏛᏃ ᎢᏗᏏ ᏗᎦᏃᎸᏗᏍᎨᎢ. ᏅᎩᏁᏃ ᎢᏴᏛ ᎠᏂᏯᏫᏍᎬ ᏒᏃᏱ ᏚᎷᏤᎴᎢ, ᎥᏓᎵ ᎦᏚᎢ ᎠᎢᏎᎢ, ᎠᎴ ᏱᏚᎶᎯᏎᎴᎢ.
|
|---|
Du-go-he-no a-ni-gi-li-yo-gv a-ni-ga-we-hi-hv-i; wa-ni-ga-dv-no i-di-si di-ga-no-lv-di-s-ge-i. Nv-gi-ne-no i-yv-dv a-ni-ya-wi-s-gv sv-no-yi du-lu-tse-le-i, v-da-li ga-du-i a-i-se-i, a-le yi-du-lo-hi-se-le-i.
|
|---|
|
|---|
| But when they saw him walking upon the sea, they supposed it had been a spirit, and cried out:
|
|---|
| ᎠᏎᏃ ᏫᎬᏩᎪᎲ ᎥᏓᎵ ᎦᏚᎢ ᎠᎢᏒᎢ, ᎤᏤᎸᏅᎯ ᎤᏁᎵᏎᎢ, ᎠᎴ ᎤᏁᎷᏁᎢ.
|
|---|
A-se-no wi-gv-wa-go-hv v-da-li ga-du-i a-i-sv-i, u-tse-lv-nv-hi u-ne-li-se-i, a-le u-ne-lu-ne-i.
|
|---|
|
|---|
| For they all saw him, and were troubled. And immediately he talked with them, and saith unto them, Be of good cheer: it is I; be not afraid.
|
|---|
| (ᏂᎦᏛᏰᏃ ᎬᏩᎪᎮᎢ, ᎠᎴ ᎤᎾᏕᏯᏔᏁᎴᎢ.) ᎩᎳᏉᏃ ᎢᏴᏛ ᏚᎵᏃᎮᏔᏁᎢ, ᎠᎴ ᎯᎠ ᏂᏚᏪᏎᎴᎢ, ᎤᎦᎵᏍᏗᏉ ᎢᏣᏓᏅᏓᏓ; ᎠᏴᏉ; ᏞᏍᏗ ᏱᏥᏍᎦᎢᎮᏍᏗ.
|
|---|
(Ni-ga-dv-ye-no gv-wa-go-he-i, a-le u-na-de-ya-ta-ne-le-i.) Gi-la-quo-no i-yv-dv du-li-no-he-ta-ne-i, a-le hi-a ni-du-we-se-le-i, U-ga-li-s-di-quo i-tsa-da-nv-da-da; a-yv-quo; tle-s-di yi-tsi-s-ga-i-he-s-di.
|
|---|
|
|---|
| And he went up unto them into the ship; and the wind ceased: and they were sore amazed in themselves beyond measure, and wondered.
|
|---|
| ᎤᎩᎳᏫᏎᏃ ᏫᏚᏣᏁᎴ ᏥᏳᎯ; ᎦᏃᎸᎥᏍᎬᏃ ᎤᏎᎵᎪᏤᎢ; ᎠᎴ ᎤᎶᏒᏍᏔᏅᎯ ᎤᎾᏓᏅᏖᏔᏁ ᏙᏧᎾᏓᏅᏛᎢ, ᎠᎴ ᎤᏂᏍᏆᏂᎪᏎᎢ.
|
|---|
U-gi-la-wi-se-no wi-du-tsa-ne-le tsi-yu-hi; ga-no-lv-v-s-gv-no u-se-li-go-tse-i; a-le u-lo-sv-s-ta-nv-hi u-na-da-nv-te-ta-ne do-tsu-na-da-nv-dv-i, a-le u-ni-s-qua-ni-go-se-i.
|
|---|
|
|---|
| For they considered not the miracle of the loaves: for their heart was hardened.
|
|---|
| ᎥᏝᏰᏃ ᏱᏚᎾᏓᏅᏖᎴ ᎦᏚ; ᏧᏂᎾᏫᏰᏃ ᏗᏍᏓᏱᏳ ᎨᏎᎢ.
|
|---|
V-tla-ye-no yi-du-na-da-nv-te-le ga-du; tsu-ni-na-wi-ye-no di-s-da-yi-yu ge-se-i.
|
|---|
|
|---|
| And when they had passed over, they came into the land of Gennesaret, and drew to the shore.
|
|---|
| ᏚᏂᏐᏨᏃ, ᎨᏂᏏᎳᏗ ᏭᏂᎷᏤᎢ, ᎠᎴ ᎤᏂᏔᎳᏕᎢ.
|
|---|
Du-ni-so-tsv-no, Ge-ni-si-la-di wu-ni-lu-tse-i, a-le u-ni-ta-la-de-i.
|
|---|
|
|---|
| And when they were come out of the ship, straightway they knew him,
|
|---|
| ᏥᏳᎯᏃ ᎤᎾᏣᎢᏒ ᎩᎳᏉ ᎢᏴᏛ ᎬᏬᎵᏤᎢ.
|
|---|
Tsi-yu-hi-no u-na-tsa-i-sv gi-la-quo i-yv-dv gv-wo-li-tse-i.
|
|---|
|
|---|
| And ran through that whole region round about, and began to carry about in beds those that were sick, where they heard he was.
|
|---|
| ᎠᎴ ᎾᎿᎭᎬᏩᏚᏫᏛ ᎤᏁᏙᎴᎢ, ᎠᎴ ᏧᏂᏢᎩ ᏚᏂᏂᏙᎴ ᏗᏤᏍᏙᎩᎯ ᏚᏂᏢᏕ, ᏫᏓᏂᏃᎯᎮ ᎠᎾᏛᎬᎦ ᎾᎿᎭᎡᏙᎲᎢ.
|
|---|
A-le na-hna gv-wa-du-wi-dv u-ne-do-le-i, a-le tsu-ni-tlv-gi du-ni-ni-do-le di-tse-s-do-gi-hi du-ni-tlv-de, wi-da-ni-no-hi-he a-na-dv-gv-ga na-hna e-do-hv-i.
|
|---|
|
|---|
| And whithersoever he entered, into villages, or cities, or country, they laid the sick in the streets, and besought him that they might touch if it were but the border of his garment: and as many as touched him were made whole.
|
|---|
| ᎠᎴ ᎢᎸᎯᏢ ᏫᎦᎷᎩ, ᏧᏍᏗ ᏕᎦᏚᎲ, ᎠᎴ ᏧᏛᎾ ᏕᎦᏚᎲ, ᎠᎴ ᎢᏴᏛ ᏗᏓᏁᎶᎯ ᎨᏒᎢ, ᏧᏂᏢᎩ ᏕᎦᎳᏅᏛ ᏓᏂᏅᎥᏍᎨᎢ, ᎠᎴ ᎬᏩᏔᏲᏎᎮ ᎤᎾᏒᏂᏍᏗᏱ, ᎦᏓᎷᏯᏛᏉ ᎾᏍᏉ ᎤᏄᏮᎢ; ᎾᏂᎥᏃ ᎾᏍᎩ ᎬᏩᏒᏂᎸᎯ ᏚᎾᏗᏩᏍᎨᎢ.
|
|---|
A-le i-lv-hi-tlv wi-ga-lu-gi, tsu-s-di de-ga-du-hv, a-le tsu-dv-na de-ga-du-hv, a-le i-yv-dv di-da-ne-lo-hi ge-sv-i, tsu-ni-tlv-gi de-ga-la-nv-dv da-ni-nv-v-s-ge-i, a-le gv-wa-ta-yo-se-he u-na-sv-ni-s-di-yi, ga-da-lu-ya-dv-quo na-s-quo u-nu-wv-i; na-ni-v-no na-s-gi gv-wa-sv-ni-lv-hi du-na-di-wa-s-ge-i.
|
|---|