| Book of Mormon |
Annotations |
|
The record of the Jaredites, taken from the twenty-four
plates found by the people of Limhi in the days of King Mosiah.
|
|
|
Chapter 1
|
|
|
1 And now I, Moroni, proceed to give an account of those ancient
inhabitants who were destroyed by the hand of the Lord upon the face of this
north country.
|
|
|
2 And I take mine account from the twenty and four
plates which were found by the people of Limhi, which is called the Book of
Ether.
|
Ether 1:2-5
Moroni tells us here that his account of the Book of Ether is from the 24
Jaredite plates, but it is only an abridgement. He is leaving out the “things
which transpired from the days of Adam until that time [of the great tower].”
He tells us later in Ether 15:33 that he has not written a hundredth part of
the record of Ether. The abridged version known as Book of Ether is 15
chapters long and goes from page 487 to page 518 of the current edition of
the Book of Mormon, or 31 pages. Some of the 31 pages is commentary by
Moroni. There are 16,629 words in the Book of Ether (not counting chapter
summaries). Taking out Moroni’s commentary, I come up with 13,293 words. That’s
79.9%. Taking 79.9% of 31 pages gives 24.8 pages of the Book of Ether without
Moroni’s commentary.
Summary:
The abridgement of the 24 Jaredite plates which does not contain the first
part of the 24 plates (history from Adam until the tower) and is not a
hundredth part of the record of Ether, translates to 24.8 pages in the
current English version.
|
|
3 And as I suppose that the first part of this record,
which speaks concerning the creation of the world, and also of Adam, and an
account from that time even to the great tower, and whatsoever things
transpired among the children of men until that time, is had among the Jews—
|
Annotation for Ether 1:2-5 above
|
|
4 Therefore I do not write those things which
transpired from the days of Adam until that time; but they are had upon the
plates; and whoso findeth them, the same will have power that he may get
the full account.
|
Annotation for Ether 1:2-5 above
|
|
5 But behold, I give not the full account, but a part
of the account I give, from the tower down until they were destroyed.
|
Annotation for Ether 1:2-5 above
|
|
6 And on this wise do I give the account. He that wrote
this record was Ether, and he was a descendant of Coriantor.
|
Ether 1:6-32
Moroni is supposedly writing an abridgement, but he takes 27 verses to supply
this genealogy, so we can do what with it?
Also consider that there are 29 generations between Ether and Jared. Doing
the math from 600 BCE (roughly when Ether put his book together) back to
Jared, we’d have to assume an average age difference between the fathers and
sons listed of about 55 years in order for the math to work out to place
Jared at the tower of Babel at about 2200 BCE.
Now it’s possible that in Ether 1:23 where it says “Morianton was a
descendant of Riplakish,” multiple generations were left out. That’s doubtful
from the beginning to me, because it would be like saying “It’s important to
have all these son/father relationships listed, but not for this one span of
generations.” In addition, in the other two instances in this genealogy,
where it says “was a descendant of” we know the author means “was a son of.”
Ether 1:6 says Ether “was a descendant of Coriantor.” Then in Ether 11:23 we
learn that, “Coriantor begat Ether,” so we know that in this case “was a
descendant of” means “was the son of.” Same for Aaron and Heth in Ether 1:16
and Ether 10:31.
|
|
7 Coriantor was the son of Moron.
|
Annotation for Ether 1:6-32 above
|
|
8 And Moron was the son of Ethem.
|
Annotation for Ether 1:6-32 above
|
|
9 And Ethem was the son of Ahah.
|
Annotation for Ether 1:6-32 above
|
|
10 And Ahah was the son of Seth.
|
Annotation for Ether 1:6-32 above
|
|
11 And Seth was the son of Shiblon.
|
Annotation for Ether 1:6-32 above
|
|
12 And Shiblon was the son of Com.
|
Annotation for Ether 1:6-32 above
|
|
13 And Com was the son of Coriantum.
|
Annotation for Ether 1:6-32 above
|
|
14 And Coriantum was the son of Amnigaddah.
|
Annotation for Ether 1:6-32 above
|
|
15 And Amnigaddah was the son of Aaron.
|
Annotation for Ether 1:6-32 above
|
|
16 And Aaron was a descendant of Heth, who was the son of
Hearthom.
|
Annotation for Ether 1:6-32 above
|
|
17 And Hearthom was the son of Lib.
|
Annotation for Ether 1:6-32 above
|
|
18 And Lib was the son of Kish.
|
Annotation for Ether 1:6-32 above
|
|
19 And Kish was the son of Corom.
|
Annotation for Ether 1:6-32 above
|
|
20 And Corom was the son of Levi.
|
Annotation for Ether 1:6-32 above
|
|
21 And Levi was the son of Kim.
|
Annotation for Ether 1:6-32 above
|
|
22 And Kim was the son of Morianton.
|
Annotation for Ether 1:6-32 above
|
|
23 And Morianton was a descendant of Riplakish.
|
Annotation for Ether 1:6-32 above
|
|
24 And Riplakish was the son of Shez.
|
Annotation for Ether 1:6-32 above
|
|
25 And Shez was the son of Heth.
|
Annotation for Ether 1:6-32 above
|
|
26 And Heth was the son of Com.
|
Annotation for Ether 1:6-32 above
|
|
27 And Com was the son of Coriantum.
|
Annotation for Ether 1:6-32 above
|
|
28 And Coriantum was the son of Emer.
|
Annotation for Ether 1:6-32 above
|
|
29 And Emer was the son of Omer.
|
Annotation for Ether 1:6-32 above
|
|
30 And Omer was the son of Shule.
|
Annotation for Ether 1:6-32 above
|
|
31 And Shule was the son of Kib.
|
Annotation for Ether 1:6-32 above
|
|
32 And Kib was the son of Orihah, who was the son of
Jared;
|
Annotation for Ether 1:6-32 above
|
|
33 Which Jared came forth with his brother and their
families, with some others and their families, from the great tower, at
the time the Lord confounded the language of the people, and swore in his
wrath that they should be scattered upon all the face of the earth; and
according to the word of the Lord the people were scattered.
|
This declares the Tower of Babel account a literal and
factual event. If true, this would mean that until about 4,200 years ago
(according to Bible chronologies I’ve seen including those at www.churchofjesuschrist.org)
there was only one language on the earth, then at the Tower of Babel event,
all languages were confounded (except for the Jaredites). This is not
compatible with what we know about the evolution of language. (See also the
second paragraph to the Introduction to the Book of Mormon, Omni 1:22, Mosiah 28:17, Helaman 6:28)
|
|
34 And the brother of Jared being a large and mighty man,
and a man highly favored of the Lord, Jared, his brother, said unto him: Cry
unto the Lord, that he will not confound us that we may not understand our
words.
|
|
|
35 And it came to pass that the brother of Jared did cry
unto the Lord, and the Lord had compassion upon Jared; therefore he did not
confound the language of Jared; and Jared and his brother were not
confounded.
|
|
|
36 Then Jared said unto his brother: Cry again unto the
Lord, and it may be that he will turn away his anger from them who are our
friends, that he confound not their language.
|
|
|
37 And it came to pass that the brother of Jared did cry
unto the Lord, and the Lord had compassion upon their friends and their
families also, that they were not confounded.
|
|
|
38 And it came to pass that Jared spake again unto his
brother, saying: Go and inquire of the Lord whether he will drive us out of
the land, and if he will drive us out of the land, cry unto him whither we
shall go. And who knoweth but the Lord will carry us forth into a land which
is choice above all the earth? And if it so be, let us be faithful unto the
Lord, that we may receive it for our inheritance.
|
|
|
39 And it came to pass that the brother of Jared did cry
unto the Lord according to that which had been spoken by the mouth of Jared.
|
|
|
40 And it came to pass that the Lord did hear the brother
of Jared, and had compassion upon him, and said unto him:
|
|
|
41 Go to and gather together thy flocks, both male and
female, of every kind; and also of the seed of the earth of every kind; and
thy families; and also Jared thy brother and his family; and also thy friends
and their families, and the friends of Jared and their families.
|
|
|
42 And when thou hast done this thou shalt go at the head
of them down into the valley which is northward. And there will I meet thee,
and I will go before thee into a land which is choice above all the lands of
the earth.
|
|
|
43 And there will I bless thee and thy seed, and raise up
unto me of thy seed, and of the seed of thy brother, and they who shall go
with thee, a great nation.
And thus I will do unto thee because this long time ye have cried unto me.
|
|


|
Charge Tracker
Charge tracking platform for RIT Student Government.
|
Functions | |
| def | send_invite (new_user, committee) |
| Sends an invitation to join a committee when user doesn't exist in ChargeTracker. More... | |
| def | send_request (new_user, committee) |
| Sends a request email to join a committee to the committee head. More... | |
| def | get_invitation (user_data) |
| Gets the data for a specific invitation/request. More... | |
| def | set_invitation (user_data) |
| Changes the status of an invitation/request. More... | |
filename: controllers.py description: Controllers for email invitations. created by: Omar De La Hoz<EMAIL_ADDRESS>created on: 10/12/17
| def app.invitations.controllers.get_invitation | ( | user_data | ) |
Gets the data for a specific invitation/request.
| user_data | The data to display a specific invitation, contains the keys (all required):
|
Data of a specific invitation or errors.
| def app.invitations.controllers.send_invite | ( | new_user, | |
| committee | |||
| ) |
Sends an invitation to join a committee when user doesn't exist in ChargeTracker.
| committee | The committee to join. |
| new_user | The user to be invited. |
| def app.invitations.controllers.send_request | ( | new_user, | |
| committee | |||
| ) |
Sends a request email to join a committee to the committee head.
| new_user | The user to be added. |
| committee | The committee to join. |
| def app.invitations.controllers.set_invitation | ( | user_data | ) |
Changes the status of an invitation/request.
| user_data | The data to modify a specific invitation, contains the keys (all required):
|
UserAdded, InviteDeleted or errors.


Data Structures | |
| struct | opj_mqc |
| MQ coder. More... | |
| struct | opj_mqc_state |
| This struct defines the state of a context. More... | |
Exported functions | |
| #define | opj_mqc_setcurctx(mqc, ctxno) (mqc)->curctx = &(mqc)->ctxs[(OPJ_UINT32)(ctxno)] |
| Set the current context used for coding/decoding. | |
Local static functions | |
| void | opj_mqc_byteout (opj_mqc_t *mqc) |
| Output a byte, doing bit-stuffing if necessary. | |
| void | opj_mqc_renorme (opj_mqc_t *mqc) |
| Renormalize mqc->a and mqc->c while encoding, so that mqc->a stays between 0x8000 and 0x10000. | |
| void | opj_mqc_codemps (opj_mqc_t *mqc) |
| Encode the most probable symbol. | |
| void | opj_mqc_codelps (opj_mqc_t *mqc) |
| Encode the most least symbol. | |
| void | opj_mqc_setbits (opj_mqc_t *mqc) |
| Fill mqc->c with 1's for flushing. | |
| INLINE OPJ_INT32 | opj_mqc_mpsexchange (opj_mqc_t *const mqc) |
| FIXME DOC. | |
| INLINE OPJ_INT32 | opj_mqc_lpsexchange (opj_mqc_t *const mqc) |
| FIXME DOC. | |
| INLINE void | opj_mqc_bytein (opj_mqc_t *const mqc) |
| Input a byte. | |
| INLINE void | opj_mqc_renormd (opj_mqc_t *const mqc) |
| Renormalize mqc->a and mqc->c while decoding. | |
Defines | |
| #define | MQC_NUMCTXS 19 |
Typedefs | |
| typedef opj_mqc_state | opj_mqc_state_t |
| This struct defines the state of a context. | |
| typedef opj_mqc | opj_mqc_t |
| MQ coder. | |
Functions | |
| opj_mqc_t * | opj_mqc_create (void) |
| Create a new MQC handle. | |
| void | opj_mqc_destroy (opj_mqc_t *mqc) |
| Destroy a previously created MQC handle. | |
| OPJ_UINT32 | opj_mqc_numbytes (opj_mqc_t *mqc) |
| Return the number of bytes written/read since initialisation. | |
| void | opj_mqc_resetstates (opj_mqc_t *mqc) |
| Reset the states of all the context of the coder/decoder (each context is set to a state where 0 and 1 are more or less equiprobable). | |
| void | opj_mqc_setstate (opj_mqc_t *mqc, OPJ_UINT32 ctxno, OPJ_UINT32 msb, OPJ_INT32 prob) |
| Set the state of a particular context. | |
| void | opj_mqc_init_enc (opj_mqc_t *mqc, OPJ_BYTE *bp) |
| Initialize the encoder. | |
| void | opj_mqc_encode (opj_mqc_t *mqc, OPJ_UINT32 d) |
| Encode a symbol using the MQ-coder. | |
| void | opj_mqc_flush (opj_mqc_t *mqc) |
| Flush the encoder, so that all remaining data is written. | |
| void | opj_mqc_bypass_init_enc (opj_mqc_t *mqc) |
| BYPASS mode switch, initialization operation. | |
| void | opj_mqc_bypass_enc (opj_mqc_t *mqc, OPJ_UINT32 d) |
| BYPASS mode switch, coding operation. | |
| OPJ_UINT32 | opj_mqc_bypass_flush_enc (opj_mqc_t *mqc) |
BYPASS mode switch, flush operation Not fully implemented and tested !! | |
| void | opj_mqc_reset_enc (opj_mqc_t *mqc) |
| RESET mode switch. | |
| OPJ_UINT32 | opj_mqc_restart_enc (opj_mqc_t *mqc) |
| RESTART mode switch (TERMALL). | |
| void | opj_mqc_restart_init_enc (opj_mqc_t *mqc) |
| RESTART mode switch (TERMALL) reinitialisation. | |
| void | opj_mqc_erterm_enc (opj_mqc_t *mqc) |
| ERTERM mode switch (PTERM). | |
| void | opj_mqc_segmark_enc (opj_mqc_t *mqc) |
| SEGMARK mode switch (SEGSYM). | |
| OPJ_BOOL | opj_mqc_init_dec (opj_mqc_t *mqc, OPJ_BYTE *bp, OPJ_UINT32 len) |
| Initialize the decoder. | |
| OPJ_INT32 | opj_mqc_decode (opj_mqc_t *const mqc) |
| Decode a symbol. |
|
|
|
|
|
Set the current context used for coding/decoding.
|
|
|
This struct defines the state of a context.
|
|
|
MQ coder.
|
|
|
BYPASS mode switch, coding operation. JPEG 2000 p 505.  JPEG 2000 p 505. Not fully implemented and tested !!
|
|
|
Input a byte.
|
|
|
Output a byte, doing bit-stuffing if necessary. After a 0xff byte, the next byte must be smaller than 0x90.
|
|
|
Encode the most least symbol.
|
|
|
Encode the most probable symbol.
|
|
|
Create a new MQC handle.
|
|
|
Decode a symbol.
|
|
|
Destroy a previously created MQC handle.
|
|
|
Encode a symbol using the MQ-coder.
|
|
|
ERTERM mode switch (PTERM).
|
|
|
Flush the encoder, so that all remaining data is written.
|
|
|
Initialize the decoder.
|
|
|
Initialize the encoder.
|
|
|
FIXME DOC.
|
|
|
FIXME DOC.
|
|
|
Return the number of bytes written/read since initialisation.
|
|
|
Renormalize mqc->a and mqc->c while decoding.
|
|
|
Renormalize mqc->a and mqc->c while encoding, so that mqc->a stays between 0x8000 and 0x10000.
|
|
|
RESET mode switch.
|
|
|
Reset the states of all the context of the coder/decoder (each context is set to a state where 0 and 1 are more or less equiprobable).
|
|
|
RESTART mode switch (TERMALL).
|
|
|
RESTART mode switch (TERMALL) reinitialisation.
|
|
|
SEGMARK mode switch (SEGSYM).
|
|
|
Fill mqc->c with 1's for flushing.
|
|
|
Set the state of a particular context.
|


A split button is a button broken into two seperately actionable portions: a common action (a button) at the start, and supplemental actions (a menu button) at the end.
Split buttons are for actions only, and should not be used for site navigation.
Note the usage of btn--split-start to denote the start of a split button sequence, and btn--split-end to denote its end.
Use the secondary modifiers to create a secondary split button style.
Use the tertiary modifiers to create a tertiary split button style.


Below are different types of pizza images that we offer
There are different types of pizza all over the country,they include:
Ksh"750"
Ksh 900
Ksh2000
Ksh1500


**Part 1 RTL Simulation of the GCD Core**
**by [Erwin Setiawan](https://yohanes-erwin.github.io/)**
**[Easy FPGA and Embedded Linux on ZYBO](../index.html)**
Introduction
===========================
This is part 1 of the tutorial series, entitled, Easy FPGA and Embedded Linux on ZYBO.
In this tutorial, we are going to build the GCD accelerator core in Verilog.
After that, we will simulate the GCD core. We are going to use [Xilinx Vivado 2016.4](https://www.xilinx.com/support/download/index.html/content/xilinx/en/downloadNav/vivado-design-tools/archive.html) for this tutorial series.
The GCD algorithm in this tutorial is based on the code from the book [Embedded SoPC Design with Nios II Processor and Verilog Examples](https://onlinelibrary.wiley.com/doi/book/10.1002/9781118309728), page 663-679, by Pong P. Chu.
You can get the full source code of this part from [here](https://github.com/yohanes-erwin/handsonembedded/tree/master/gcd_accelerator/part_1_gcd_core).
GCD Algorithm
===========================
Greatest common divisor (GCD) between two numbers is the largest number that divides them without remainder.
We have gcd(a, b).
This gcd function returns the largest number that divides both a and b without remainder.
For example, gcd(35, 25) is 5, and gcd(128, 72) is 8.
We will use the binary GCD algorithm.
It is shown in Figure [fig:gcd_algorithm].
This algorithm uses only subtraction and divide-by-2 operations.
It has six equations that should be applied repetitively until a is equal to b (equation 1).
![Figure [fig:gcd_algorithm]: GCD algorithm](gcd_algorithm.jpg width=400px)
For example, this is step-by-step how to calculate **gcd(24, 15)**:
* **gcd(24, 15)**, apply equation 4, then the result is,
* **gcd(12, 15)**, apply equation 4, then the result is,
* **gcd(6, 15)**, apply equation 4, then the result is,
* **gcd(3, 15)**, apply equation 6, then the result is,
* **gcd(3, 12)**, apply equation 3, then the result is,
* **gcd(3, 6)**, apply equation 3, then the result is,
* **gcd(3, 3)**, apply equation 1, then the result is,
* **3**
Software Implementation
===========================
Now that we have the GCD algorithm, the next step is to implement this in C program.
Later on, we can use this C program for both bare metal application and Linux application.
This C program is used for verification of the hardware implementation and performance comparison between hardware and software.
The C program is shown in Listing [lst:c_program].
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ C linenumbers
uint8_t gcd(uint8_t a, uint8_t b)
{
uint8_t n = 0;
while (1)
{
if (a == b)
break;
if ((a % 2) == 0) // a even
{
a = a >> 1;
if ((b % 2) == 0) // b even
{
b = b >> 1;
n++;
}
}
else // a odd
{
if ((b % 2) == 0) // b even
b = b >> 1;
else // b odd
{
if (a > b)
a = a - b;
else
b = b - a;
}
}
}
a = a << n;
return a;
}
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[Listing [lst:c_program]: C program of the GCD algorithm]
In equation 2, we should multiply the gcd result by 2.
In C program, it is implemented by counting the occurrences this condition, saved in a variable, n.
At the end, in line 31, we should multiply the result by 2n. Note that multiplying by 2 can be done by shifting it to the left once.
Then multiplying by 2n is equal to left shifting n times.
Hardware GCD Core
===========================
Now that we have the C program for the GCD algorithm.
Based on this program, we can build the Verilog code.
The ASMD chart of the GCD algorithm is shown in Figure [fig:asmd_gcd].
The state machine has two states: **S_IDLE** and **S_OP**.
In **S_IDLE** state, it waits until the start signal is equal to 1.
In this state the ready signal is also 1 meaning that it is ready to accept new inputs.
In **S_OP** state, it calculates the GCD using the same algorithm as in the C program.
After the calculation is finished, it goes back to the **S_IDLE** state.
The Verilog code for this GCD core is shown in Listing [lst:verilog_gcd].
![Figure [fig:asmd_gcd]: ASMD of the GCD algorithm](asmd_gcd.jpg width=700px)
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ none linenumbers
`timescale 1ns / 1ps
module gcd_core
(
input wire clk,
input wire rst_n,
input wire start,
input wire [31:0] a,
input wire [31:0] b,
output wire done,
output wire ready,
output wire [31:0] r
);
// State definition
localparam S_IDLE = 2'h0,
S_OP = 2'h1;
reg [1:0] _cs, _ns;
reg [31:0] a_cv, a_nv;
reg [31:0] b_cv, b_nv;
reg [4:0] n_cv, n_nv;
reg done_cv, done_nv;
// Output
assign ready = (_cs == S_IDLE) ? 1 : 0;
assign done = done_cv;
assign r = a_cv;
// Register
always @(posedge clk)
begin
if (!rst_n)
begin
_cs <= S_IDLE;
a_cv <= 0;
b_cv <= 0;
n_cv <= 0;
done_cv <= 0;
end
else
begin
_cs <= _ns;
a_cv <= a_nv;
b_cv <= b_nv;
n_cv <= n_nv;
done_cv <= done_nv;
end
end
// Next state
always @(*)
begin
_ns = _cs;
a_nv = a_cv;
b_nv = b_cv;
n_nv = n_cv;
done_nv = 0;
case(_cs)
S_IDLE:
begin
if (start)
begin
a_nv = a;
b_nv = b;
n_nv = 0;
_ns = S_OP;
end
end
S_OP:
begin
if (a_cv == b_cv)
begin
a_nv = a_cv << n_cv;
done_nv = 1;
_ns = S_IDLE;
end
else
begin
if (!a_cv[0]) // a even
begin
a_nv = {1'b0, a_cv[31:1]};
if (!b_cv[0]) // a and b even
begin
b_nv = {1'b0, b_cv[31:1]};
n_nv = n_cv + 1;
end
end
else // a odd
begin
if (!b_cv[0]) // b even
begin
b_nv = {1'b0, b_cv[31:1]};
end
else // a and b odd
begin
if (a_cv > b_cv)
a_nv = a_cv - b_cv;
else
b_nv = b_cv - a_cv;
end
end
end
end
endcase
end
endmodule
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[Listing [lst:verilog_gcd]: Verilog code of the GCD core]
Simulation Result
===========================
The timing diagram of the GCD core is shown in Figure [fig:gcd_core_timing].
In the idle state, the ready signal is 1.
It indicates that the GCD core is ready to accept new inputs.
When the GCD core is in the process of calculating GCD, the ready signal is 0, and it goes back to 1 when the process is finished.
The testbench file of this simulation is shown in Listing [lst:verilog_gcd_tb].
![Figure [fig:gcd_core_timing]: Timing diagram of the GCD core](gcd_core_timing.jpg width=600px)
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ none linenumbers
`timescale 1ns / 1ps
module gcd_core_tb();
// Clock period
localparam T = 10;
reg clk;
reg rst_n;
reg start;
reg [31:0] a;
reg [31:0] b;
wire done;
wire ready;
wire [31:0] r;
gcd_core dut
(
.clk(clk),
.rst_n(rst_n),
.start(start),
.a(a),
.b(b),
.done(done),
.ready(ready),
.r(r)
);
always
begin
clk = 0;
#(T/2);
clk = 1;
#(T/2);
end
initial
begin
// Initial value
a = 0;
b = 0;
start = 0;
// Reset
rst_n = 0;
#T;
rst_n = 1;
#T;
// gcd(35, 25)
a = 35;
b = 25;
start = 1;
#T;
start = 0;
#(T*10);
// gcd(128, 72)
a = 128;
b = 72;
start = 1;
#T;
start = 0;
#(T*15);
// gcd(24, 15)
a = 24;
b = 15;
start = 1;
#T;
start = 0;
#(T*10);
end
endmodule
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[Listing [lst:verilog_gcd_tb]: Testbench code for the GCD core]
Summary
===========================
In this tutorial, we have build a GCD core in Verilog.
The hardware GCD algorithm is modeled using the ASMD chart.
The simulation result shows that GCD core is work without any error.


Created by Ryan Whitley / @apollolm
Let's take a step back
Let's start with a web page
Fictitious site: Doohickey.com
Open notepad or another text editor on your machine.
Paste the code, name the file site.html, and open in Chrome.
https://gist.github.com/apollolm
Or, use this link:
http://jsfiddle.net/apollolm/jcr50on2/7/
Because there is no JavaScript!
JavaScript is a programming language.
Created in 1995 (19 years old!)
Created to make web pages come alive.
JavaScript and Webpages are like
Peanut Butter & Jelly
Ike & Tina
An HTML webpage is a cold, static, lifeless skeleton
JavaScript *listens* to stuff happening in the page, and can respond.
JavaScript can detect:
JavaScript can alter a webpage
Copy the code yourself:
https://gist.github.com/apollolm
Look for site_javascript.html
Or, use JSFiddle:
http://jsfiddle.net/apollolm/qzata3c5/
Let's go thru step by step.
The Button Click
We need a button.
The container
When we click the button, we'll update some text in a container
When you click the button, this should change.
The button doesn't do anything until we add some code to tell it to.
//Tell jQuery to listen for the button to be clicked.
$("#button1").on('click', function(){
$("#resultArea").html("You just pushed the button!");
});
The Green Box
Just a dumb box until we add some code to tell it what to do
Move your mouse over this area.
You've moused over 0 times.
Listen for mouse event called MouseOver, just for the green box
//Tell jQuery to listen for the mouse to move over the green square.
//Let's keep a count of how many times this happens
var greenBoxCounter = 0; //start it off at 0
$("#mouseOverArea").on('mouseover', function(){
//Add 1 to the count
greenBoxCounter = greenBoxCounter + 1; //you could also do this: greenBoxCounter++;
//Update the text inside the mouse counter area so the user can see how many times they've done it.
$("#mouseCounter").html('You\'ve moused over ' + greenBoxCounter + ' times.');
});
Map container. It's empty until we use javascript to make it come alive!
Map of your current location
Load the leaflet mapping library (from leafletjs.com)
Part 1 - Ask for the user's location from JavaScript
//Keep a placeholder that will store the user's location information once we have it.
var userLocation;
//Not all browsers can do this. Check to see if it can.
if(navigator.geolocation){
//If we made it here, we're good. Get the position. Once the location is found, call the function called
'gotPosition'
navigator.geolocation.getCurrentPosition(gotPosition);
}
else{
alert("Geolocation is not available.");
}
Part 2 - If we get the location, pass it off to a function
//Let's create a function called 'gotPosition' that will be called once the user's location has been found.
function gotPosition(position){
//Position contains the coordinates of the user's position
userLocation = position; //store it in a 'global variable' so it can be used by any javascript functions in this
page
//Add to map
var myIcon = L.divIcon({className: '', html: ''});
L.marker([position.coords.latitude, position.coords.longitude], {icon: myIcon}).addTo(map);
//zoom the map to the current location
map.setView([position.coords.latitude, position.coords.longitude]);
}
Hammertime!
Another button, lifeless until we tell it to respond to a click
Listen for the click, then insert an image.
//Tell jQuery to listen for the hammertime button to be clicked!
$("#hammerTimeButton").on('click', function(){
$("#hammerTimeContainer").html("");
});
What topics did we just cover?
JavaScript makes web pages interactive.
JavaScript code runs on your computer
It's what makes most stuff work
JavaScript can now be used apart from web pages.
Node.js (another workshop?)
Server side code.
An entire ecosystem of modules and plugins
This presentation can be found at http://tech-diversified.github.io/Workshops/3worldofjavascript


The world wide web functions by users sending Hypertext Transfer Protocol (or HTTP) requests via web browser to a server. The server then interprets the request and sends the correct HTML document back to the web browser which interprets and displays it for the user.
HTMLHTML or Hypertext Markup Language is the language used by the documents that form the majority of the content on the web. HTML contains text content which is what you see, markup which is how it looks, references to other doccuments such as images, or videos, and links to other html pages.
Tags, Elements and AttributesAn HTML element has 3 basic components, an opening tag, it's contents and a closing tag.Tags are used to tell a web browswer how to display thier content. Tags look something like this < opening tag > content < /closing tag >. An example is the b tag. < b > content < b > will make the content appear in bold. An opening tag, content and a closing tag are refered to as an element. Some elements contain attributes which are found within the opening tag. The anchor tag or < a > is used display when the link is clicked.
Limitations of ComputersComputers lack the ability to infer or assume and all instructions given to a computer must be very precise and literal. This makes syntax critical to HTML.
Adding ImagesAdding images requires the use of the image tag and the source and alternate attributes "src=" and "alt=". The source attribute is used to link to the images URL and the alterante attribute displays text when the image does not display properly. The alterante text is also used by the blind. The image tag has no content or closing tag making it a void tag.
Creating White SpaceAll HTML content is defualt interpreted as a single line (see limitations of computers). If you desire any white space you must create it with HTML tags. There are two types of linebreak tags < br > (break) which creates a single line break per tag (this is a void tag as it does not require a closing tag) and < p > (paragraph) which creates an invisible box around it's content.
Inline and Block ElementsInline elements simply end one line and begin another where as block elements create an invisible box around their content.
Span and Div ElementsThe Span and DIv elements are used to contain their content and style elements which will adjust how that content is displayed. Span is an inline element and Div is a block element.
Document StructureThe first element in an HTML document is the document type which assigns which type of HTML the document is. In HTML5 documents this string is simply HTML. The doctype tag is followed by the opening HTML tag which, along with it's closing html tag, surround the entire document both head and body sction. Next is the head tag which can include Javascript and CSS style elements. The head tag includes the title element which defines what is displayed in the browser tab. Next is the body tag which cantains the contents of the document.


Users must be able to create games
Given: user yakuita.test have logged in and is on games page
When: clicking create game button on games page
Then: create game page shows up with header
Create game
And when: user adds a friend to game
Then: list size is:
2
And when: user add a game name and click the create game button
Then: user is redirected to games page with game list size:
1


We're sorry but go-blog-backend doesn't work properly without JavaScript enabled. Please enable it to continue.


--- layout: page title: About header-img: "img/about-bg.png" ---
Dallas is a student focusing on a full-stack Software Engineering course.


Though they are not easy to find in print, there are some general conventions for rounding numbers. When rounding a summary statistic such as the mean or median, the number of rounded digits shown should be governed by the precision of the statistic. For instance, authors are usually asked to present means plus or minus standard deviations in published research, or regression coefficients plus or minus the standard error. The convention applied here is to
find the place of the first significant digit of the error
round the estimate to that place
round the error to 1 additional place
present the combination in a form such as estimate (error) or estimate +/- error
table_ester( estimate, error, form = "{estimate} ± {error}", majority_rule = FALSE ) table_estin( estimate, lower, upper, form = "{estimate} ({lower}, {upper})", majority_rule = FALSE )
| estimate | a numeric vector of estimate values. |
|---|---|
| error | a numeric vector of error values. All errors should be >0. |
| form | a character value that indicates how the error and estimate
should be formatted together. Users can specify anything they like
as long as they use the terms |
| majority_rule | a logical value. If |
| lower | the lower-bound of an interval for the estimate. |
| upper | the upper-bound of an interval for the estimate. |
a character vector
Blackstone, Eugene H. "Rounding numbers" (2016): The Journal of Thoracic and Cardiovascular Surgery. DOI: https://doi.org/10.1016/j.jtcvs.2016.09.003
Other table helpers:
table_glue()
,
table_pvalue()
,
table_value()
# ---- examples are taken from Blackstone, 2016 ---- # Example 1: ---- # Mean age is 72.17986, and the standard deviation (SD) is 9.364132. ## Steps: ## - Nine is the first significant figure of the SD. ## - Nine is in the ones place. Thus... ## + round the mean to the ones place (i.e., round(x, digits = 0)) ## + round the SD to the tenths place (i.e., round(x, digits = 1)) table_ester(estimate = 72.17986, error = 9.364132)#> [1] "72 ± 9.4"# > [1] 72 +/- 9.4 # an estimated lower and upper bound for 95% confidence limits lower <- 72.17986 - 1.96 * 9.364132 upper <- 72.17986 + 1.96 * 9.364132 table_estin(estimate = 72.17986, lower = lower, upper = upper, form = "{estimate} (95% CI: {lower}, {upper})")#> [1] "72 (95% CI: 54, 91)"# > [1] "72 (95% CI: 54, 91)" # Example 2: ---- # Mean cost is $72,347.23, and the standard deviation (SD) is $23,994.06. ## Steps: ## - Two is the first significant figure of the SD. ## - Nine is in the ten thousands place. Thus... ## + round mean to the 10-thousands place (i.e., round(x, digits = -4)) ## + round SD to the thousands place (i.e., round(x, digits = -3)) table_ester(estimate = 72347.23, error = 23994.06)#> [1] "70,000 ± 24,000"# > [1] "70,000 +/- 24,000" # an estimated lower and upper bound for 95% confidence limits lower <- 72347.23 - 1.96 * 23994.06 upper <- 72347.23 + 1.96 * 23994.06 table_estin(estimate = 72347.23, lower = lower, upper = upper, form = "{estimate} (95% CI: {lower} - {upper})")#> [1] "70,000 (95% CI: 30,000 - 120,000)"# > [1] "70,000 (95% CI: 30,000 - 120,000)"


| Relationship Maternal/Paternal Needs to be indicated: Grandparent, Sibling, Aunt/Uncle, Cousin, Etc. | Maternal/ Paternal | Name | Address
City, State, Zip |
Phone # | Can child live with relative? | SFCS Use ONLY
If yes, efforts to place with relatives. If no, why are they not an option for placement?


Typed redux local storage class that mirrors state to and from JavaScript's window.localStorage.
window.localStorage
Passthrough default state with marker added to identify defaultState in the reducer.
Generated using TypeDoc
Typed redux local storage class that mirrors state to and from JavaScript's
window.localStorage
.


Experiemnt General
The overall information about the experiment.
The top section of this panel shows a summary of the key metadata, this include experiment title,
project name, sample species, sample tissues, mass spec instrument and a short experiment
description.
References of this experiment will be displayed if present, along with contact information and
additional support information.
Sample & Protocol
Additional information on the sample investigated in the experiment. Both mzML and PRIDE XML format contain this information. It generally contains the species, tissue and cell type investigated in the experiment.
The protocol table gives a detailed description on the experimental steps. It starts with the protocol name, followed by a list of steps. Note that, only PRIDE XML contains this information.
Instrument & Processing
Instrument Configuration captures the mass spectrometer model. It contains the following key sections:
- Instrument Name - Descriptive name of the instrument (make, model, significant customisations)
- Source - Invariant ion source (e.g. MALDI) information, as a run of name-value pairs
- Analyzer - Mass analyzer component (e.g. quadrupole, collision cell), ordered so as to reflect the physical order of the described components in the mass spectrometer.
- Detector - Ion detector information, as a run of name-value pairs.
Data processing shows a description of the default processing by which the peak list(s) were generated, it also displayed the software been used.


This page gives instructions on accessing the Sea Glass Look and Feel.
See the usage page for more information.
The current version is:
0.2
If you are using Maven, you may include the
following in your pom.xml
file:
<dependencies> <dependency> <groupId>com.seaglasslookandfeel</groupId> <artifactId>seaglasslookandfeel</artifactId> <version>0.2</version> </dependency> </dependencies>
To test against a staged or snapshot version, you must also include the following:
<repositories> <repository> <id>OSS Staging</id> <name>Sonatype Staging Repository</name> <url>http://oss.sonatype.org/content/groups/staging/</url> </repository> </repositories>
If you are not using Maven you may download the jar, its documentation, and source from the following links:
Older versions are available at the following site:


| curve25519 {openssl} | R Documentation |
Curve25519 is a recently added low-level algorithm that can be used both for diffie-hellman (called X25519) and for signatures (called ED25519). Note that these functions are only available when building against version 1.1.1 or newer of the openssl library. The same functions are also available in the sodium R package.
read_ed25519_key(x) read_ed25519_pubkey(x) read_x25519_key(x) read_x25519_pubkey(x) ed25519_sign(data, key) ed25519_verify(data, sig, pubkey) x25519_diffie_hellman(key, pubkey)
x |
a 32 byte raw vector with (pub)key data |
data |
raw vector with data to sign or verify |
key |
private key as returned by |
sig |
raw vector of length 64 with signature as returned by |
pubkey |
public key as returned by |
# Generate a keypair if(openssl_config()$x25519){ key <- ed25519_keygen() pubkey <- as.list(key)$pubkey # Sign message msg <- serialize(iris, NULL) sig <- ed25519_sign(msg, key) # Verify the signature ed25519_verify(msg, sig, pubkey) # Diffie Hellman example: key1 <- x25519_keygen() key2 <- x25519_keygen() # Both parties can derive the same secret x25519_diffie_hellman(key1, key2$pubkey) x25519_diffie_hellman(key2, key1$pubkey) # Import/export sodium keys rawkey <- sodium::sig_keygen() rawpubkey <- sodium::sig_pubkey(rawkey) key <- read_ed25519_key(rawkey) pubkey <- read_ed25519_pubkey(rawpubkey) # To get the raw key data back for use in sodium as.list(key)$data as.list(pubkey)$data }


Kidlet is a mobile app to transfer Kidlet Coins (Kids) easily and securely and is built on top of Nempay which is an open source solution.
Kidlet aims to teach children about cryptocurrency and personal finance which will greatly benefit them for their future.


Team {{teamData.TeamName}} with ID {{teamData.TeamID}}
Team description:
{{teamData.Description}}
Captain:
{{teamData.Captain.PlayerName}} with ID {{teamData.Captain.PlayerID}}
{{teamData.Captain.Position}}
Players:
{{item.PlayerName}} with ID {{item.PlayerID}}
{{item.Position}}


At Lewis University, I am majoring in both computer and data science and am minoring in math. In October, I will turn 21 years old and am anticipating graduating this December. Also, I have 7 other siblings, am engaged, and plan to be married in June of 2022.
Due to the inner peace I obtain by fishing, fishing is my favorite hobby. Personally, I love being in nature regardless of the reason. However, since an early age, I've always gone fishing with friends and family. I am to the point where fishing is what I resort to when I need some time away from work and school.
Although I am a nerd by education, I am very active in the world of sports. You may see me playing basketball from time-to-time in the req center


Freedom Meals
Freedom Meals
Meal planning, your way.
Welcome Back!
Email
Password
Log In
NEED TO CODE: On click, send SELECT command to Customers table where email = this.email AND password = password. IF match, display checkout page. ELSE, display error message.
Sign Up Here!
Sign Up Here!
Customer Information
First Name
Last Name
Email
We'll never share your email with anyone else.
Phone Number
Password
Sign Up
NEED TO CODE: On click, send INSERT command to Customers table.
Admin?


{% extends "base.html" %} {% block content %}
Go ahead and play with it, drag and drop some image and save it


3. THE CROSSING PROJECT
3.1. Description
The Crossing Project was a virtual environment created by Stacey Spiegel in collaboration with Rodney Hoinkes, presented at the Rotterdam harbour simulator, as part of DEAF 95 -- 'The Dutch Electronic Art Festival'. The idea behind the Crossing Project was that virtual agents collect data on a particular subject on the world wide web. This information was then used as data to 'grow' or 'build' a virtual environment.
What immediately appealed to me about this concept, was that one could apply any data as a source for virtual growth. The social issues that the implementation of information technology implied -- touched upon in my initial research -- could be visualized in dramatic and spectacular fashion. The harbour simulator, situated in Rotterdam (arguably the biggest export harbour of the world) and utilizing some of the most advanced computer simulation technology, became a very powerful symbol for me of the Western world’s adventure into the world of cyberspace and its position towards the rest of the world -- 'left behind in reality'. At a time of unequalled wealth disparity, never made visible so clearly because of the global communications revolution, the challenge was how to make a powerful artistic statement using this facility. The Crossing Project provided some answers...
3.2. Concept
"Crossings is focused on the discourse surrounding the mechanization of nature. Its environment is the signature of our post-industrial era and reasserts that both reality and virtuality are constructs that extend beyond the geographical terrain into the conceptual realm." (Spiegel 1997) [10] [Figure 8]
As an alternative method to navigate the information space of cyberspace, Spiegel and Hoinkes' "basic assumption is that, by translating experience from the real world, virtual landscapes become primary opportunities to explore cultural identity and play with the nature of information." Spiegel explains that reconstructing a simulated 3-dimensional landscape, this "metaphor for real space -- dimensionally accurate, though abstracted in representation -- extends the surreal potential meaning through landscape." Spiegel and Hoinkes are playing at the boundary of representation. Although their discourse takes place in cyberspace it is their belief that all the environments they create are visual analogues of the 'real' 3-dimensional world we live in. (Spiegel 1997) [Figure 9]
"As one roams around, the symbolic layers of the environment unfold into psychological, emotional and intellectual spaces. Like Alice passing through the looking-glass, each form one encounters in the landscape has the potential to link the participant to other realities." (Spiegel 1997)
3.3 Experience
In practice the idea was that hypermedia links allow the viewer to access sound, text and images as well as animations and video available on the world wide web. Having experienced the installation myself, this aspect of the installation did not seem to be implemented at the time.
However, what did excite me very much about this installation was the element of "playing at the boundary of representation." As viewer one was standing on a moving platform (the pilothouse) that could be 'navigated' through the 360° surround computer generated landscape created by Spiegel and Hoinkes. Experiencing this with a group of other people that reacted to situations unfolding and sounds coming from the virtual landscape contributed very much to the overall sensation.
The absence of bulky and inconvenient VR headgear, allowing for only a solo experience into virtual reality, appealed very much to me. The pace of the movements (being a ship simulator) were also very smooth and almost dreamlike, thereby enhancing the surreal feeling. Unlike any virtual reality worlds experienced in game arcades and Disneyworld attractions before, this 'show' really felt like a journey into someone else's imagination, but then accompanied by a group of people -- talking, laughing and discussing our shared experience.
3.4 Technical
Two primary software packages, PolyTRIM [Figure 10], a real-time design inquiry program, and CLRMosaic [Figure 11], a simplified version of Polytrim that is integrated with the Mosaic web browser were used by Spiegel and Hoinkes. Models and environments have been developed in PolyTRIM, AutoCAD and other modellers (incorporated through DXF file format), automated algorithms, and C-library additions. Filters also exist from many GIS (Geographic Information Systems) and CAD (DXF, SGO, and Architrion) systems or can be generated directly into SDML format.
"PolyTRIM is a research toolkit for the exploration of design and planning issues at both a pedagogical and professional level. It is premised around the ideas of interaction with design ideas and constructs to allow investigation at an intuitive speed, and the facilitation of more democratic design processes through participatory workshop strategies." (PolyTRIM 1997) [11]
"CLRMosaic is a World-Wide Web client, allowing the handling of spatial databases along with traditional hypertext data sources. This provides a mechanism for people to provide hooks to resources that are fundamentally spatially organized, geographic mapping, 3d reconstructions, architectural proposals, cyberspaces, etc. This client is premised around the notion of interactive exploration of environments and easy access to information through it." ( CLRMosaic 1997) [12]


De Niro named Screen Actors Guild life achievement honoree
LOS ANGELES (AP) - Robert De Niro will receive the Screen Actors Guild’s life achievement award.
The guild announced that De Niro will be the 56th recipient of its highest honor at its SAG Awards on Jan. 19, 2020.
SAG cited De Niro’s extraordinary accomplishments in film and television, including two Academy Awards, a Presidential Medal of Freedom and numerous other honors. It also noted his co-founding and championing of New York City’s Tribeca Film Festival.
De Niro’s latest film is “The Irishman,” which is playing in theaters in limited release before arriving on Netflix at the end of the month.
The actor says in a statement that he’s honored to receive the award from a union that he’s been a part of for more than 50 years.
Sign up for Daily Newsletters
Copyright © 2019 The Washington Times, LLC.
Please read our comment policy before commenting.


surface Fig. states single crystal structure bulk atoms oxygen {border-style band electron evolution px;} #ffffff;} http://orcid.org/--- single-crystal topological OER Zhang shown catalytic orbital Liu activity high Chem. Fermi Kagome crystal. electronic transfer water Wang oxidation reaction robust (fig. Phys. S). atoms, hydrogen magnetic potential results Rev. active crystals measurements spin surface. using Sci. analysis energy located nontrivial px; spectra {font-family Felser Kim Mater. Tafel XPS bonding catalysts charge coordination derived efficient font-size kinetics lattice physical properties semimetal used Chen However, Research Sun Weyl XRD [], atoms. confirmed current double; electrochemical fig. large linear loss observed obtained performed phase sites spectroscopy states, Angew. Data Ed. Int. Nat. Science Table Yan Zhao applied atomic based border-color border-width calculations catalyst. cleaved cobalt configuration density determined different diffraction electrocatalyst electrocatalysts electrode formation group image lower measured pattern peak process reactions resistivity solid; value {font-style {font-weight (no. Adv. Engl. High-resolution Kumar LINK Lett. SOC Supplementary Surface Thus, Topological Xie Yang addition, adsorbates area bold calculated carried center contributed coordinated courier; dec easily electrical electrocatalytic electrode. em; enhanced expose high-quality highly indicates just mV) materials measurement. metallic nanosheets nodal octahedrally orbitals overpotential oxide paint perovskite points position provide provides pt;} recorded reported sample semimetals shows silver state study temperature theoretical topologically transition wire


This was my first major web development school project, called it Komizon, a shopping website heaven for comic book lovers. Main feats consisting of product showcasing, sorting, carting, content management system, sales report, stock reports, user profile, and payment. A standard website for buyers and sellers in the online market.


top
| up
| prev
| next
FiberServer Class
Definition at line 25
of FiberConnection.hpp
Constructors
Member Functions
| void |
Exit() override |
| const std::string& |
Name() const override |
Member Variables
Constructor Details
FiberServer Constructor
cmajor::build::FiberServer::FiberServer()
Definition at line 27
of FiberConnection.cpp
:
27 : name("fiber server")
28 {
29 }
Declaration at line 28
of FiberConnection.hpp
Member Function Details
Exit Member Function
void
cmajor::build::FiberServer::Exit() override
Definition at line 36
of FiberConnection.cpp
:
37 {
38 }
Declaration at line 30
of FiberConnection.hpp
Base class overridden functions: cmajor::build::Host::Exit
Name Member Function
const
std::string& cmajor::build::FiberServer::Name() const override
Definition at line 31
of FiberConnection.cpp
:
32 {
33 return name;
34 }
Declaration at line 29
of FiberConnection.hpp
Base class overridden functions: cmajor::build::Host::Name
Called by: cmajor::build::FiberConnection::GetActor
top
| up
| prev
| next


Starting Options (Menu Options)
In this dialog you can change the following settings:
- Whether the "How to start" dialog is shown when starting CrypTool.
- Whether a sample text file is opened automatically within the main window of CrypTool when starting it.


--- date: 2010-01-31T00:00:00Z published: true title: Filmed and ridden by the same guy that filmed and edited http://imonahorse.com/ url: /2010/01/31/filmed-ridden-by-the-same-guy-that-filmed-edited-http-imonahorse-com-fb/ ---
Nice work Matt!


| id |
string |
Column identifier, when row provided to the table from json object, value from the row[id] property will
be provided for this column if bind is not defined.
|
| bind (optional) |
(row: Table.Row) => any |
This function provides value which must be displayed inside the cell.
-
Given generated row this method must return some value to be displayed as cell
content.
-
If this property is not defined then default binding will be used, it will take value from row
property with name id.
-
Before displaying the bound value could be
formatted.
|
| title |
string |
Column title |
| sort (optional) |
string | boolean (default false) |
Define column as sortable
When column sortable it will have underline under the title, to mark column as sortable
When user click this column, table will be reloaded with appropriate sort parameter
The sort field in data provider
mapState argument will
have name equal to the column id
If this value is a string, column considered sortable and sort field in data provider will have one
value instead of column id
|
| cls (optional) |
string |
Class to apply on content of the column value
- It could be just a sting - name of the class
-
It could be function which will set class of cell content based on condition
-
conditional function has cell value as a first param and optional second param - row
itself
-
result of the function must be either class to apply to the cell content or undefined to
apply nothing
-
if you return object with `cls: 'class name'` from
format property it will be joined to this value
|
| format (optional) |
(val: any, row: any) => string | FormatFun |
function or reference name from configured
default formatters
map used to format cell value to displayed string
- the function first arg is the cell value and second optional is the row object itself
- function could return simple string object, it will be considered value to display
-
function could also return ` val: 'val', cls: 'cls' ` object. It will be considered : `val` as a
formatted value to display and `cls` is a class to apply to cell content
-
it is recommended to use
default formatters map instead of defining
formatter function for each table. Use HLC_CLR_TABLE_CELL_FORMAT_MAP provider to
define map of default formatters which could be used across the application simple by using
reference name.
|


Directives allow you to attach attributes to an HTML tag. For instance, you could associated a class, id, name, etc to a DOM element (HTML tag) with a directive. In Angular, there are lots of built in directives, such as np-app, ng-controller, etc. This application shows how to write your own directives. In particular, a directive call showPicture, which takes boolean value.


Performs parametric and non-parametric estimation and simulation for multi-state discrete-time semi-Markov processes. For the parametric estimation, several discrete distributions are considered for the sojourn times: Uniform, Geometric, Poisson, Discrete Weibull and Negative Binomial. The non-parametric estimation concerns the sojourn time distributions, where no assumptions are done on the shape of distributions. Moreover, the estimation can be done on the basis of one or several sample paths, with or without censoring at the beginning or/and at the end of the sample paths. The implemented methods are described in Barbu, V.S., Limnios, N. (2008) <doi:10.1007/978-0-387-73173-5>, Barbu, V.S., Limnios, N. (2008) <doi:10.1080/10485250701261913> and Trevezas, S., Limnios, N. (2011) <doi:10.1080/10485252.2011.555543>. Estimation and simulation of discrete-time k-th order Markov chains are also considered.
| Version: | 1.0.1 |
| Depends: | seqinr, DiscreteWeibull |
| Suggests: | utils |
| Published: | 2017-09-08 |
| Author: | Vlad Stefan Barbu, Caroline Berard, Dominique Cellier, Mathilde Sautreuil and Nicolas Vergne |
| Maintainer: | Nicolas Vergne <nicolas.vergne at univ-rouen.fr> |
| License: | GPL-2 | GPL-3 [expanded from: GPL] |
| NeedsCompilation: | no |
| CRAN checks: | SMM results |
| Reference manual: | SMM.pdf |
| Vignettes: |
SMM Vignette |
| Package source: | SMM_1.0.1.tar.gz |
| Windows binaries: | r-devel: SMM_1.0.1.zip, r-release: SMM_1.0.1.zip, r-oldrel: SMM_1.0.1.zip |
| OS X binaries: | r-release: SMM_1.0.1.tgz, r-oldrel: SMM_1.0.1.tgz |
| Old sources: | SMM archive |
Please use the canonical form https://CRAN.R-project.org/package=SMM to link to this page.


Your facility is required to place a labeled container outside of your front door or at curbside to accept donated masks.
Once your request is filled, then you must:
If you have any questions or need help, e-mail Nancy Gaus.


A state-variable 2- or 4-pole filter.
- Input
- The partials input source.
- Cutoff
- The cutoff frequency.
- State
- The type of filter. The filter state can range from High Pass through Notch, through Low Pass, through Band Pass, and then to High Pass again.
- Resonance
- The degree of resonance.
- 4-Pole
- The filter is normally a 2-pole filter. This changes to a 4-pole (by doing two 2-pole filters in series).
- Relative
- Is the cutoff frequency shifted relative to the base pitch of the note?
- Taper
- Should we gradually taper off the amplitude so that it reaches 0 at the Nyquist limit? Tapering more closely approximates a digital filter; not tapering (the default) more closely approximates an analog filter.


|
Connected Home over IP
672cf7684
|
Adaptation for LwIP ip4_addr_t type. More...
Namespaces | |
| ArgParser | |
| ble | |
| Ble | |
| Callback | |
| ChipBleBase | |
| ChipBleUtility | |
| ChipBluezMgr | |
| ChipCoreBluetoothMgr | |
| ChipDeviceCtrl | |
| ChipStack | |
| ChipUtility | |
| clusters | |
| configuration | |
| Controller | |
| Crypto | |
| package | devicecontroller |
| DeviceLayer | |
| Encoding | |
| exceptions | |
| Header | |
| Inet | |
| interaction_model | |
| internal | |
| logging | |
| Logging | |
| This namespace includes all interfaces within chip for shared logging support. | |
| Mdns | |
| native | |
| Platform | |
| Profiles | |
| python | |
| Retransmit | |
| RotatingDeviceId | |
| package | setuppayload |
| SetupPayloadData | |
| Shell | |
| System | |
| Time | |
| TLV | |
| tlv | |
| Transport | |
| Uint8 | |
Classes | |
| class | AdditionalDataPayloadGenerator |
| class | AdditionalDataPayloadParser |
| class | BitFlags |
| Stores bit flags in a type safe manner. More... | |
| class | BitMapObjectPool |
| A class template used for allocating Objects. More... | |
| class | CASESession |
| struct | CASESessionSerializable |
| struct | CASESessionSerialized |
| class | ChipKeyId |
| The definition of the CHIP Key identifier. This class contains key types, key flags, key ID fields definition, and API functions. More... | |
| class | Counter |
| An interface for managing a counter as an integer value. More... | |
| class | DeleteDeletor |
| class | EncryptedPacketBufferHandle |
| Tracks ownership of a encrypted packet buffer. More... | |
| struct | ErrorFormatter |
| class | LifetimePersistedCounter |
| A class for managing a counter as an integer value intended to persist across reboots. More... | |
| class | ManualSetupPayloadGenerator |
| class | ManualSetupPayloadParser |
| class | MessageAuthenticationCode |
| Handles encoding/decoding of CHIP message headers. More... | |
| class | MonotonicallyIncreasingCounter |
| A class for managing a monotonically-increasing counter as an integer value. More... | |
| class | Optional |
| Pairs an object with a boolean value to determine if the object value is actually valid or not. More... | |
| struct | OptionalQRCodeInfo |
| A structure to hold optional QR Code info. More... | |
| struct | OptionalQRCodeInfoExtension |
| class | PacketHeader |
| Handles encoding/decoding of CHIP packet message headers. More... | |
| class | PairingSession |
| class | PayloadHeader |
| Handles encoding/decoding of CHIP payload headers. More... | |
| class | PersistedCounter |
| A class for managing a counter as an integer value intended to persist across reboots. More... | |
| class | PersistentStorageDelegate |
| class | PersistentStorageResultDelegate |
| class | QRCodeSetupPayloadGenerator |
| class | QRCodeSetupPayloadParser |
| class | ReferenceCounted |
| A reference counted object maintains a count of usages and when the usage count drops to 0, it deletes itself. More... | |
| class | RendezvousDeviceCredentialsDelegate |
| class | RendezvousSessionDelegate |
| class | SecureSession |
| class | SecureSessionHandle |
| class | SecureSessionMgr |
| class | SecureSessionMgrDelegate |
| This class provides a skeleton for the callback functions. More... | |
| class | SerializableU64Set |
| class | SerializableU64SetBase |
| class | SessionEstablishmentDelegate |
| class | SetupPayload |
| struct | SetupPayloadParameter |
| class | Span |
| A wrapper class for holding objects and its length, without the ownership of it. More... | |
| class | StaticAllocatorBase |
| class | StaticAllocatorBitmap |
| class | StringBuilder |
| a preallocated sized string builder More... | |
| class | StringBuilderBase |
| Build a c-style string out of distinct parts. More... | |
| struct | test_suites_t |
| class | TransportMgr |
| class | TransportMgrBase |
| class | TransportMgrDelegate |
Typedefs | |
| typedef char(* | Base64ValToCharFunct) (uint8_t val) |
| typedef uint8_t(* | Base64CharToValFunct) (uint8_t c) |
| using | ByteSpan = Span< uint8_t > |
| typedef int(* | UnitTestTriggerFunction) () |
| using | RendezvousInformationFlags = chip::BitFlags< RendezvousInformationFlag, uint16_t > |
| typedef struct chip::CASESessionSerialized | CASESessionSerialized |
| typedef uint64_t | NodeId |
| Convenience type to make it clear a number represents a node id. More... | |
| typedef int | PacketHeaderFlags |
Functions | |
| void | RegisterCHIPLayerErrorFormatter () |
| Register a text error formatter for CHIP core errors. More... | |
| bool | FormatCHIPError (char *buf, uint16_t bufSize, int32_t err) |
| Given a CHIP error, returns a human-readable NULL-terminated C string describing the error. More... | |
| static char | Base64ValToChar (uint8_t val) |
| static uint8_t | Base64CharToVal (uint8_t c) |
| static char | Base64URLValToChar (uint8_t val) |
| static uint8_t | Base64URLCharToVal (uint8_t c) |
| uint16_t | Base64Encode (const uint8_t *in, uint16_t inLen, char *out, Base64ValToCharFunct valToCharFunct) |
| uint16_t | Base64Encode (const uint8_t *in, uint16_t inLen, char *out) |
| uint16_t | Base64URLEncode (const uint8_t *in, uint16_t inLen, char *out) |
| uint32_t | Base64Encode32 (const uint8_t *in, uint32_t inLen, char *out, Base64ValToCharFunct valToCharFunct) |
| uint32_t | Base64Encode32 (const uint8_t *in, uint32_t inLen, char *out) |
| uint16_t | Base64Decode (const char *in, uint16_t inLen, uint8_t *out, Base64CharToValFunct charToValFunct) |
| uint16_t | Base64Decode (const char *in, uint16_t inLen, uint8_t *out) |
| uint16_t | Base64URLDecode (const char *in, uint16_t inLen, uint8_t *out) |
| uint32_t | Base64Decode32 (const char *in, uint32_t inLen, uint8_t *out, Base64CharToValFunct charToValFunct) |
| uint32_t | Base64Decode32 (const char *in, uint32_t inLen, uint8_t *out) |
| const DLL_EXPORT char * | ErrorStr (int32_t err) |
| This routine returns a human-readable NULL-terminated C string describing the provided error. More... | |
| DLL_EXPORT void | RegisterErrorFormatter (ErrorFormatter *errFormatter) |
| Add a new error formatter function to the global list of error formatters. More... | |
| DLL_EXPORT void | DeregisterErrorFormatter (ErrorFormatter *errFormatter) |
| Remove an error formatter function from the global list of error formatters. More... | |
| DLL_EXPORT void | FormatError (char *buf, uint16_t bufSize, const char *subsys, int32_t err, const char *desc) |
| Generates a human-readable NULL-terminated C string describing the provided error. More... | |
| const char * | StatusReportStr (uint32_t profileId, uint16_t statusCode) |
| uint32_t | GetFibonacciForIndex (uint32_t index) |
| This function generates 32-bit Fibonacci number for a given 32 bit index. More... | |
| uint64_t | GetRandU64 () |
| This function generates 64-bit unsigned random number. More... | |
| uint32_t | GetRandU32 () |
| This function generates 32-bit unsigned random number. More... | |
| uint16_t | GetRandU16 () |
| This function generates 16-bit unsigned random number. More... | |
| uint8_t | GetRandU8 () |
| This function generates 8-bit unsigned random number. More... | |
| template<typename T , typename U > | |
| bool | CanCastTo (U arg) |
| A template function that determines whether it's safe to cast the given value of type U to the given type T. More... | |
| template<typename T > | |
| std::enable_if< std::is_unsigned< T >::value, typename std::make_signed< T >::type >::type | CastToSigned (T arg) |
| A function to reverse the effects of a signed-to-unsigned integer cast. More... | |
| template<class ToPtr , class From > | |
| std::enable_if_t< std::is_pointer< ToPtr >::value, ToPtr > | SafePointerCast (From *from) |
| A template function that casts a pointer of type From* to a pointer of type To* and verifies that both From and To are trivially copyable structures, size of To is not greater than size of From, and To doesn't have more strict alignment requirements than From. More... | |
| constexpr size_t | MaxStringLength () |
| A function that determines, at compile time, the maximal length (not counting the null terminator) of a list of literal C strings. More... | |
| template<size_t FirstLength, typename... RestOfTypes> | |
| constexpr size_t | MaxStringLength (const char(&)[FirstLength], RestOfTypes &&... aArgs) |
| static uint8_t | DaysToMarch1 (uint16_t year) |
| static uint16_t | MarchBasedMonthToDayOfYear (uint8_t month) |
| static uint8_t | MarchBasedDayOfYearToMonth (uint16_t dayOfYear) |
| bool | IsLeapYear (uint16_t year) |
| uint8_t | DaysInMonth (uint16_t year, uint8_t month) |
| uint8_t | FirstWeekdayOfYear (uint16_t year) |
| void | OrdinalDateToCalendarDate (uint16_t year, uint16_t dayOfYear, uint8_t &month, uint8_t &dayOfMonth) |
| void | CalendarDateToOrdinalDate (uint16_t year, uint8_t month, uint8_t dayOfMonth, uint16_t &dayOfYear) |
| bool | CalendarDateToDaysSinceEpoch (uint16_t year, uint8_t month, uint8_t dayOfMonth, uint32_t &daysSinceEpoch) |
| bool | DaysSinceEpochToCalendarDate (uint32_t daysSinceEpoch, uint16_t &year, uint8_t &month, uint8_t &dayOfMonth) |
| bool | AdjustCalendarDate (uint16_t &year, uint8_t &month, uint8_t &dayOfMonth, int32_t relativeDays) |
| bool | CalendarTimeToSecondsSinceEpoch (uint16_t year, uint8_t month, uint8_t dayOfMonth, uint8_t hour, uint8_t minute, uint8_t second, uint32_t &secondsSinceEpoch) |
| static void | SecondsSinceEpochToCalendarTime (uint64_t secondsSinceEpoch, uint16_t &year, uint8_t &month, uint8_t &dayOfMonth, uint8_t &hour, uint8_t &minute, uint8_t &second) |
| Convert the number of seconds since 1970-01-01 00:00:00 UTC to a calendar date and time. More... | |
| void | SecondsSinceEpochToCalendarTime (uint32_t secondsSinceEpoch, uint16_t &year, uint8_t &month, uint8_t &dayOfMonth, uint8_t &hour, uint8_t &minute, uint8_t &second) |
| bool | CalendarToChipEpochTime (uint16_t year, uint8_t month, uint8_t dayOfMonth, uint8_t hour, uint8_t minute, uint8_t second, uint32_t &chipEpochTime) |
| Convert a calendar date and time to the number of seconds since CHIP Epoch (2020-01-01 00:00:00 UTC). More... | |
| void | ChipEpochToCalendarTime (uint32_t chipEpochTime, uint16_t &year, uint8_t &month, uint8_t &dayOfMonth, uint8_t &hour, uint8_t &minute, uint8_t &second) |
| Convert the number of seconds since CHIP Epoch (2020-01-01 00:00:00 UTC) to a calendar date and time. More... | |
| bool | UnixEpochToChipEpochTime (uint32_t unixEpochTime, uint32_t &chipEpochTime) |
| Convert the number of seconds since Unix Epoch (1970-01-01 00:00:00 UTC) to CHIP Epoch (2020-01-01 00:00:00 UTC). More... | |
| uint32_t | secondsToMilliseconds (uint32_t seconds) |
| CHIP_ERROR | RegisterUnitTests (UnitTestTriggerFunction tests) |
| int | RunRegisteredUnitTests () |
| std::string | base41Encode (const uint8_t *buf, size_t buf_len) |
| static CHIP_ERROR | decodeChar (char c, uint8_t &value) |
| CHIP_ERROR | base41Decode (std::string base41, std::vector< uint8_t > &result) |
| static uint32_t | chunk1PayloadRepresentation (const SetupPayload &payload) |
| static uint32_t | chunk2PayloadRepresentation (const SetupPayload &payload) |
| static uint32_t | chunk3PayloadRepresentation (const SetupPayload &payload) |
| static std::string | decimalStringWithPadding (uint32_t number, int minLength) |
| static CHIP_ERROR | checkDecimalStringValidity (std::string decimalString, std::string &decimalStringWithoutCheckDigit) |
| static CHIP_ERROR | checkCodeLengthValidity (const std::string &decimalString, bool isLongCode) |
| static CHIP_ERROR | toNumber (const std::string &decimalString, uint32_t &dest) |
| static CHIP_ERROR | readDigitsFromDecimalString (const std::string &decimalString, size_t &index, uint32_t &dest, size_t numberOfCharsToRead) |
| static CHIP_ERROR | populateBits (uint8_t *bits, size_t &offset, uint64_t input, size_t numberOfBits, size_t totalPayloadDataSizeInBits) |
| static CHIP_ERROR | populateTLVBits (uint8_t *bits, size_t &offset, const uint8_t *tlvBuf, size_t tlvBufSizeInBytes, size_t totalPayloadDataSizeInBits) |
| CHIP_ERROR | writeTag (TLV::TLVWriter &writer, uint64_t tag, OptionalQRCodeInfo &info) |
| CHIP_ERROR | writeTag (TLV::TLVWriter &writer, uint64_t tag, OptionalQRCodeInfoExtension &info) |
| static CHIP_ERROR | generateBitSet (SetupPayload &payload, uint8_t *bits, uint8_t *tlvDataStart, size_t tlvDataLengthInBytes) |
| static CHIP_ERROR | payloadBase41RepresentationWithTLV (SetupPayload &setupPayload, std::string &base41Representation, size_t bitsetSize, uint8_t *tlvDataStart, size_t tlvDataLengthInBytes) |
| static CHIP_ERROR | readBits (std::vector< uint8_t > buf, size_t &index, uint64_t &dest, size_t numberOfBitsToRead) |
| static CHIP_ERROR | openTLVContainer (TLV::TLVReader &reader, TLV::TLVType type, uint64_t tag, TLV::TLVReader &containerReader) |
| static CHIP_ERROR | retrieveOptionalInfoString (TLV::TLVReader &reader, OptionalQRCodeInfo &info) |
| static CHIP_ERROR | retrieveOptionalInfoInt32 (TLV::TLVReader &reader, OptionalQRCodeInfo &info) |
| static CHIP_ERROR | retrieveOptionalInfoInt64 (TLV::TLVReader &reader, OptionalQRCodeInfoExtension &info) |
| static CHIP_ERROR | retrieveOptionalInfoUInt32 (TLV::TLVReader &reader, OptionalQRCodeInfoExtension &info) |
| static CHIP_ERROR | retrieveOptionalInfoUInt64 (TLV::TLVReader &reader, OptionalQRCodeInfoExtension &info) |
| static CHIP_ERROR | retrieveOptionalInfo (TLV::TLVReader &reader, OptionalQRCodeInfo &info, optionalQRCodeInfoType type) |
| static CHIP_ERROR | retrieveOptionalInfo (TLV::TLVReader &reader, OptionalQRCodeInfoExtension &info, optionalQRCodeInfoType type) |
| static std::string | extractPayload (std::string inString) |
| bool | IsCHIPTag (uint8_t tag) |
| bool | IsVendorTag (uint8_t tag) |
| static CHIP_ERROR | resolveSetupPayloadParameter (SetupPayloadParameter ¶meter, const std::string &key, const std::string &value) |
| static CHIP_ERROR | addParameter (SetupPayload &setupPayload, const SetupPayloadParameter ¶meter) |
| CHIP_ERROR | loadPayloadFromFile (SetupPayload &setupPayload, const std::string &filePath) |
| CHIP_ERROR | generateQRCodeFromFilePath (std::string filePath, std::string &outCode) |
| CHIP_ERROR | generateManualCodeFromFilePath (std::string filePath, std::string &outCode) |
Variables | |
| static char | sErrorStr [CHIP_CONFIG_ERROR_STR_SIZE] |
| Static buffer to store the formatted error string. More... | |
| static ErrorFormatter * | sErrorFormatterList = nullptr |
| Linked-list of error formatter functions. More... | |
| const size_t | kTestSuitesMax = 64 |
| static test_suites_t | gs_test_suites |
| static const char | codes [] |
| static const int | kBase41ChunkLen = 3 |
| static const int | kBytesChunkLen = 2 |
| static const int | kRadix = sizeof(codes) / sizeof(codes[0]) |
| const int | kVersionFieldLengthInBits = 3 |
| const int | kVendorIDFieldLengthInBits = 16 |
| const int | kProductIDFieldLengthInBits = 16 |
| const int | kCustomFlowRequiredFieldLengthInBits = 1 |
| const int | kRendezvousInfoFieldLengthInBits = 8 |
| const int | kPayloadDiscriminatorFieldLengthInBits = 12 |
| const int | kManualSetupDiscriminatorFieldLengthInBits = 4 |
| const int | kManualSetupChunk1DiscriminatorMsbitsPos = 0 |
| const int | kManualSetupChunk1DiscriminatorMsbitsLength = 2 |
| const int | kManualSetupChunk1VidPidPresentBitPos |
| const int | kManualSetupChunk2PINCodeLsbitsPos = 0 |
| const int | kManualSetupChunk2PINCodeLsbitsLength = 14 |
| const int | kManualSetupChunk2DiscriminatorLsbitsPos = (kManualSetupChunk2PINCodeLsbitsPos + kManualSetupChunk2PINCodeLsbitsLength) |
| const int | kManualSetupChunk2DiscriminatorLsbitsLength = 2 |
| const int | kManualSetupChunk3PINCodeMsbitsPos = 0 |
| const int | kManualSetupChunk3PINCodeMsbitsLength = 13 |
| const int | kSetupPINCodeFieldLengthInBits = 27 |
| const int | kPaddingFieldLengthInBits = 5 |
| const int | kRawVendorTagLengthInBits = 7 |
| const int | kManualSetupShortCodeCharLength = 10 |
| const int | kManualSetupLongCodeCharLength = 20 |
| const int | kManualSetupCodeChunk1CharLength = 1 |
| const int | kManualSetupCodeChunk2CharLength = 5 |
| const int | kManualSetupCodeChunk3CharLength = 4 |
| const int | kManualSetupVendorIdCharLength = 5 |
| const int | kManualSetupProductIdCharLength = 5 |
| const uint8_t | kSerialNumberTag = 128 |
| const uint16_t | kMaxDiscriminatorValue = 0xFFF |
| const int | kTotalPayloadDataSizeInBits |
| const int | kTotalPayloadDataSizeInBytes = kTotalPayloadDataSizeInBits / 8 |
| const char *const | kQRCodePrefix = "CH:" |
| static P256ECDHDerivedSecret | fabricSecret |
| constexpr uint8_t | kIPKInfo [] |
| constexpr uint8_t | kKDFSR2Info [] = { 0x53, 0x69, 0x67, 0x6d, 0x61, 0x52, 0x32 } |
| constexpr uint8_t | kKDFSR3Info [] = { 0x53, 0x69, 0x67, 0x6d, 0x61, 0x52, 0x33 } |
| constexpr size_t | kKDFInfoLength = sizeof(kKDFSR2Info) |
| constexpr uint8_t | kKDFSEInfo [] = { 0x53, 0x65, 0x73, 0x73, 0x69, 0x6f, 0x6e, 0x4b, 0x65, 0x79, 0x73 } |
| constexpr size_t | kKDFSEInfoLength = sizeof(kKDFSEInfo) |
| constexpr uint8_t | kIVSR2 [] = { 0x4e, 0x43, 0x41, 0x53, 0x45, 0x5f, 0x53, 0x69, 0x67, 0x6d, 0x61, 0x52, 0x32 } |
| constexpr uint8_t | kIVSR3 [] = { 0x4e, 0x43, 0x41, 0x53, 0x45, 0x5f, 0x53, 0x69, 0x67, 0x6d, 0x61, 0x52, 0x33 } |
| constexpr size_t | kIVLength = sizeof(kIVSR2) |
| constexpr size_t | kTAGSize = 16 |
| constexpr uint16_t | kAEADKeySize = 16 |
| constexpr uint16_t | kSigmaParamRandomNumberSize = 32 |
| constexpr uint16_t | kTrustedRootIdSize = 20 |
| constexpr uint16_t | kMaxTrustedRootIds = 5 |
| constexpr uint16_t | kIPKSize = 32 |
| static constexpr NodeId | kUndefinedNodeId = 0ULL |
| static constexpr NodeId | kAnyNodeId = 0xFFFFFFFFFFFFFFFFULL |
| static constexpr size_t | kMaxTagLen = 16 |
| static const size_t | kMax_SecureSDU_Length = 1024 |
Adaptation for LwIP ip4_addr_t type.
File contains definitions on how a connection to a peer can be defined.
Defines state relevant for an active connection to a peer.
Defines a table of admins that have provisioned the device.
defines a generic time source interface that uses a real clock at runtime but can be substituted by a test one for unit tests.
Before LwIP 2.0.0, the ip_addr_t
type alias referred to a structure comprising an IPv4 address. At LwIP 2.0.0 and thereafter, this type alias is renamed ip4_addr_t
and ip_addr_t
is replaced with an alias to a union of both. Here, the ip4_addr_t
type alias is provided even when the LwIP version is earlier than 2.0.0 so as to prepare for the import of the new logic.
| typedef uint8_t(* chip::Base64CharToValFunct) (uint8_t c) |
| typedef char(* chip::Base64ValToCharFunct) (uint8_t val) |
| using chip::ByteSpan = typedef Span<uint8_t> |
| typedef struct chip::CASESessionSerialized chip::CASESessionSerialized |
| typedef uint64_t chip::NodeId |
Convenience type to make it clear a number represents a node id.
| typedef int chip::PacketHeaderFlags |
| using chip::RendezvousInformationFlags = typedef chip::BitFlags<RendezvousInformationFlag, uint16_t> |
| typedef int(* chip::UnitTestTriggerFunction) () |
| anonymous enum |
| anonymous enum |
| anonymous enum |
|
strong |
|
strong |
| enum chip::VendorId : uint16_t |
|
static |
| bool chip::AdjustCalendarDate | ( | uint16_t & | year, |
| uint8_t & | month, | ||
| uint8_t & | dayOfMonth, | ||
| int32_t | relativeDays | ||
| ) |
| CHIP_ERROR chip::base41Decode | ( | std::string | base41, |
| std::vector< uint8_t > & | result | ||
| ) |
| std::string chip::base41Encode | ( | const uint8_t * | buf, |
| size_t | buf_len | ||
| ) |
|
static |
| uint16_t chip::Base64Decode | ( | const char * | in, |
| uint16_t | inLen, | ||
| uint8_t * | out | ||
| ) |
| uint16_t chip::Base64Decode | ( | const char * | in, |
| uint16_t | inLen, | ||
| uint8_t * | out, | ||
| Base64CharToValFunct | charToValFunct | ||
| ) |
| uint32_t chip::Base64Decode32 | ( | const char * | in, |
| uint32_t | inLen, | ||
| uint8_t * | out | ||
| ) |
| uint32_t chip::Base64Decode32 | ( | const char * | in, |
| uint32_t | inLen, | ||
| uint8_t * | out, | ||
| Base64CharToValFunct | charToValFunct | ||
| ) |
| uint16_t chip::Base64Encode | ( | const uint8_t * | in, |
| uint16_t | inLen, | ||
| char * | out | ||
| ) |
| uint16_t chip::Base64Encode | ( | const uint8_t * | in, |
| uint16_t | inLen, | ||
| char * | out, | ||
| Base64ValToCharFunct | valToCharFunct | ||
| ) |
| uint32_t chip::Base64Encode32 | ( | const uint8_t * | in, |
| uint32_t | inLen, | ||
| char * | out | ||
| ) |
| uint32_t chip::Base64Encode32 | ( | const uint8_t * | in, |
| uint32_t | inLen, | ||
| char * | out, | ||
| Base64ValToCharFunct | valToCharFunct | ||
| ) |
|
static |
| uint16_t chip::Base64URLDecode | ( | const char * | in, |
| uint16_t | inLen, | ||
| uint8_t * | out | ||
| ) |
| uint16_t chip::Base64URLEncode | ( | const uint8_t * | in, |
| uint16_t | inLen, | ||
| char * | out | ||
| ) |
|
static |
|
static |
| bool chip::CalendarDateToDaysSinceEpoch | ( | uint16_t | year, |
| uint8_t | month, | ||
| uint8_t | dayOfMonth, | ||
| uint32_t & | daysSinceEpoch | ||
| ) |
| void chip::CalendarDateToOrdinalDate | ( | uint16_t | year, |
| uint8_t | month, | ||
| uint8_t | dayOfMonth, | ||
| uint16_t & | dayOfYear | ||
| ) |
| bool chip::CalendarTimeToSecondsSinceEpoch | ( | uint16_t | year, |
| uint8_t | month, | ||
| uint8_t | dayOfMonth, | ||
| uint8_t | hour, | ||
| uint8_t | minute, | ||
| uint8_t | second, | ||
| uint32_t & | secondsSinceEpoch | ||
| ) |
| bool chip::CalendarToChipEpochTime | ( | uint16_t | year, |
| uint8_t | month, | ||
| uint8_t | dayOfMonth, | ||
| uint8_t | hour, | ||
| uint8_t | minute, | ||
| uint8_t | second, | ||
| uint32_t & | chipEpochTime | ||
| ) |
Convert a calendar date and time to the number of seconds since CHIP Epoch (2020-01-01 00:00:00 UTC).
| year | Gregorian calendar year in the range 2020 to 2155. |
| month | Month in standard form (1=January ... 12=December). |
| dayOfMonth | Day-of-month in standard form (1=1st, 2=2nd, etc.). |
| hour | Hour (0-23). |
| minute | Minute (0-59). |
| second | Second (0-59). |
| chipEpochTime | Number of seconds since 2020-01-01 00:00:00 UTC. |
| bool chip::CanCastTo | ( | U | arg | ) |
A template function that determines whether it's safe to cast the given value of type U to the given type T.
It does this by verifying that the value is in the range of valid values for T.
| std::enable_if<std::is_unsigned<T>::value, typename std::make_signed<T>::type>::type chip::CastToSigned | ( | T | arg | ) |
A function to reverse the effects of a signed-to-unsigned integer cast.
If the argument is small enough to be representable as a positive signed integer, returns that integer. Otherwise, returns a negative integer which would, if cast to the type of the argument, produce the given value.
So for example, if a uint8_t with value 254 is passed in this function will return an int8_t with value -2.
|
static |
|
static |
| void chip::ChipEpochToCalendarTime | ( | uint32_t | chipEpochTime, |
| uint16_t & | year, | ||
| uint8_t & | month, | ||
| uint8_t & | dayOfMonth, | ||
| uint8_t & | hour, | ||
| uint8_t & | minute, | ||
| uint8_t & | second | ||
| ) |
Convert the number of seconds since CHIP Epoch (2020-01-01 00:00:00 UTC) to a calendar date and time.
Input time values are limited to positive values up to 2^32-1. This limits the representable date range to the year 2155.
| chipEpochTime | Number of seconds since 2020-01-01 00:00:00 UTC. |
| year | Gregorian calendar year. |
| month | Month in standard form (1=January ... 12=December). |
| dayOfMonth | Day-of-month in standard form (1=1st, 2=2nd, etc.). |
| hour | Hour (0-23). |
| minute | Minute (0-59). |
| second | Second (0-59). |
|
static |
|
static |
|
static |
| uint8_t chip::DaysInMonth | ( | uint16_t | year, |
| uint8_t | month | ||
| ) |
| bool chip::DaysSinceEpochToCalendarDate | ( | uint32_t | daysSinceEpoch, |
| uint16_t & | year, | ||
| uint8_t & | month, | ||
| uint8_t & | dayOfMonth | ||
| ) |
|
inlinestatic |
|
static |
|
inlinestatic |
| void chip::DeregisterErrorFormatter | ( | ErrorFormatter * | errFormatter | ) |
Remove an error formatter function from the global list of error formatters.
| [in] | errFormatter | An ErrorFormatter structure containing a pointer to the new error function. |
| const char * chip::ErrorStr | ( | int32_t | err | ) |
This routine returns a human-readable NULL-terminated C string describing the provided error.
| [in] | err | The error for format and describe. |
|
static |
| uint8_t chip::FirstWeekdayOfYear | ( | uint16_t | year | ) |
| bool chip::FormatCHIPError | ( | char * | buf, |
| uint16_t | bufSize, | ||
| int32_t | err | ||
| ) |
Given a CHIP error, returns a human-readable NULL-terminated C string describing the error.
| [in] | buf | Buffer into which the error string will be placed. |
| [in] | bufSize | Size of the supplied buffer in bytes. |
| [in] | err | The error to be described. |
| void chip::FormatError | ( | char * | buf, |
| uint16_t | bufSize, | ||
| const char * | subsys, | ||
| int32_t | err, | ||
| const char * | desc | ||
| ) |
Generates a human-readable NULL-terminated C string describing the provided error.
| [in] | buf | Buffer into which the error string will be placed. |
| [in] | bufSize | Size of the supplied buffer in bytes. |
| [in] | subsys | A short string describing the subsystem that originated the error, or NULL if the origin of the error is unknown/unavailable. This string should be 10 characters or less. |
| [in] | err | The error to be formatted. |
| [in] | desc | A string describing the cause or meaning of the error, or NULL if no such information is available. |
|
static |
| CHIP_ERROR chip::generateManualCodeFromFilePath | ( | std::string | filePath, |
| std::string & | outCode | ||
| ) |
| CHIP_ERROR chip::generateQRCodeFromFilePath | ( | std::string | filePath, |
| std::string & | outCode | ||
| ) |
| uint32_t chip::GetFibonacciForIndex | ( | uint32_t | index | ) |
This function generates 32-bit Fibonacci number for a given 32 bit index.
| uint16_t chip::GetRandU16 | ( | ) |
This function generates 16-bit unsigned random number.
| uint32_t chip::GetRandU32 | ( | ) |
This function generates 32-bit unsigned random number.
| uint64_t chip::GetRandU64 | ( | ) |
This function generates 64-bit unsigned random number.
| uint8_t chip::GetRandU8 | ( | ) |
This function generates 8-bit unsigned random number.
| bool chip::IsCHIPTag | ( | uint8_t | tag | ) |
| bool chip::IsLeapYear | ( | uint16_t | year | ) |
| bool chip::IsVendorTag | ( | uint8_t | tag | ) |
| CHIP_ERROR chip::loadPayloadFromFile | ( | SetupPayload & | setupPayload, |
| const std::string & | filePath | ||
| ) |
|
static |
|
static |
|
constexpr |
A function that determines, at compile time, the maximal length (not counting the null terminator) of a list of literal C strings.
Suitable for determining sizes of buffers that might need to hold any of the given strings.
Do NOT pass things that are not string literals to this function.
Use like: constexpr size_t maxLen = MaxStringLength("abc", "defhij", "something");
|
constexpr |
|
static |
| void chip::OrdinalDateToCalendarDate | ( | uint16_t | year, |
| uint16_t | dayOfYear, | ||
| uint8_t & | month, | ||
| uint8_t & | dayOfMonth | ||
| ) |
|
static |
|
static |
|
static |
|
static |
|
static |
| void chip::RegisterCHIPLayerErrorFormatter | ( | ) |
Register a text error formatter for CHIP core errors.
| void chip::RegisterErrorFormatter | ( | ErrorFormatter * | errFormatter | ) |
Add a new error formatter function to the global list of error formatters.
| [in] | errFormatter | An ErrorFormatter structure containing a pointer to the new error function. Note that a pointer to the supplied ErrorFormatter structure will be retained by the function. Thus the memory for the structure must remain reserved. |
| CHIP_ERROR chip::RegisterUnitTests | ( | UnitTestTriggerFunction | tests | ) |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
| int chip::RunRegisteredUnitTests | ( | ) |
| std::enable_if_t<std::is_pointer<ToPtr>::value, ToPtr> chip::SafePointerCast | ( | From * | from | ) |
A template function that casts a pointer of type From* to a pointer of type To* and verifies that both From and To are trivially copyable structures, size of To is not greater than size of From, and To doesn't have more strict alignment requirements than From.
That is to make sure that access to fields of To is safe.
| void chip::SecondsSinceEpochToCalendarTime | ( | uint32_t | secondsSinceEpoch, |
| uint16_t & | year, | ||
| uint8_t & | month, | ||
| uint8_t & | dayOfMonth, | ||
| uint8_t & | hour, | ||
| uint8_t & | minute, | ||
| uint8_t & | second | ||
| ) |
|
static |
Convert the number of seconds since 1970-01-01 00:00:00 UTC to a calendar date and time.
|
inline |
| const char* chip::StatusReportStr | ( | uint32_t | profileId, |
| uint16_t | statusCode | ||
| ) |
|
static |
| bool chip::UnixEpochToChipEpochTime | ( | uint32_t | unixEpochTime, |
| uint32_t & | chipEpochTime | ||
| ) |
Convert the number of seconds since Unix Epoch (1970-01-01 00:00:00 UTC) to CHIP Epoch (2020-01-01 00:00:00 UTC).
Input time values are limited to positive values up to 2^32-1. This limits the representable date range to the year 2155.
| unixEpochTime | Number of seconds since 1970-01-01 00:00:00 UTC. |
| chipEpochTime | Number of seconds since 2020-01-01 00:00:00 UTC. |
| CHIP_ERROR chip::writeTag | ( | TLV::TLVWriter & | writer, |
| uint64_t | tag, | ||
| OptionalQRCodeInfo & | info | ||
| ) |
| CHIP_ERROR chip::writeTag | ( | TLV::TLVWriter & | writer, |
| uint64_t | tag, | ||
| OptionalQRCodeInfoExtension & | info | ||
| ) |
|
static |
|
static |
|
static |
|
constexpr |
|
staticconstexpr |
|
static |
|
static |
| const int chip::kCustomFlowRequiredFieldLengthInBits = 1 |
|
constexpr |
|
constexpr |
|
constexpr |
|
constexpr |
|
constexpr |
|
constexpr |
|
constexpr |
|
constexpr |
|
constexpr |
|
constexpr |
| const int chip::kManualSetupChunk1DiscriminatorMsbitsLength = 2 |
| const int chip::kManualSetupChunk1DiscriminatorMsbitsPos = 0 |
| const int chip::kManualSetupChunk1VidPidPresentBitPos |
| const int chip::kManualSetupChunk2DiscriminatorLsbitsLength = 2 |
| const int chip::kManualSetupChunk2DiscriminatorLsbitsPos = (kManualSetupChunk2PINCodeLsbitsPos + kManualSetupChunk2PINCodeLsbitsLength) |
| const int chip::kManualSetupChunk2PINCodeLsbitsLength = 14 |
| const int chip::kManualSetupChunk2PINCodeLsbitsPos = 0 |
| const int chip::kManualSetupChunk3PINCodeMsbitsLength = 13 |
| const int chip::kManualSetupChunk3PINCodeMsbitsPos = 0 |
| const int chip::kManualSetupCodeChunk1CharLength = 1 |
| const int chip::kManualSetupCodeChunk2CharLength = 5 |
| const int chip::kManualSetupCodeChunk3CharLength = 4 |
| const int chip::kManualSetupDiscriminatorFieldLengthInBits = 4 |
| const int chip::kManualSetupLongCodeCharLength = 20 |
| const int chip::kManualSetupProductIdCharLength = 5 |
| const int chip::kManualSetupShortCodeCharLength = 10 |
| const int chip::kManualSetupVendorIdCharLength = 5 |
|
static |
| const uint16_t chip::kMaxDiscriminatorValue = 0xFFF |
|
staticconstexpr |
|
constexpr |
| const int chip::kPaddingFieldLengthInBits = 5 |
| const int chip::kPayloadDiscriminatorFieldLengthInBits = 12 |
| const int chip::kProductIDFieldLengthInBits = 16 |
| const char* const chip::kQRCodePrefix = "CH:" |
| const int chip::kRawVendorTagLengthInBits = 7 |
| const int chip::kRendezvousInfoFieldLengthInBits = 8 |
| const uint8_t chip::kSerialNumberTag = 128 |
| const int chip::kSetupPINCodeFieldLengthInBits = 27 |
|
constexpr |
|
constexpr |
| const size_t chip::kTestSuitesMax = 64 |
| const int chip::kTotalPayloadDataSizeInBits |
| const int chip::kTotalPayloadDataSizeInBytes = kTotalPayloadDataSizeInBits / 8 |
|
constexpr |
|
staticconstexpr |
| const int chip::kVendorIDFieldLengthInBits = 16 |
| const int chip::kVersionFieldLengthInBits = 3 |
|
static |
Linked-list of error formatter functions.
|
static |
Static buffer to store the formatted error string.


ABOUT US
OUR MISSION
Contact Us
2-6-497/2,kota colony. nagole,rajasthan-324005.
<EMAIL_ADDRESS>:+91<PHONE_NUMBER>
: www.facebook.com
: 123456789
Monday: 10am to 8pm
Tuesday: 10am to 8pm
Wednesday: 10am to 8pm
Thrusday: 10am to 8pm
Friday: 10am to 8pm
Saturday: 10am to 8pm


Node scoring¶
Warning
Do not manually instantiate this class using the class constructor. Instantiate the class using the method noesis.Noesis.create_node_scorer()
.
-
class
noesis.nodes.
NodeScorer
(scorer, *args)¶ This class implements the interface for node scorers. These algorithms compute a score for each node according to certain specific rules.
Parameters: - scorer (string) – Technique used to compute node scores. Currently supported techniques are ‘AdjustedBetweenness’, ‘AdjustedCloseness’, ‘AveragePathLength’, ‘Betweenness’, ‘BetweennessScore’, ‘Closeness’, ‘ClusteringCoefficient’, ‘ConnectedComponents’, ‘Decay’, ‘Degree’, ‘DegreeAssortativity’, ‘DiffusionCentrality’, ‘Eccentricity’, ‘EigenvectorCentrality’, ‘FreemanBetweenness’, ‘HITS’, ‘InDegree’, ‘KatzCentrality’, ‘LinkBetweenness’, ‘LinkBetweennessScore’, ‘LinkEmbeddedness’, ‘LinkNeighborhoodOverlap’, ‘LinkNeighborhoodSize’, ‘LinkRays’, ‘NormalizedBetweenness’, ‘NormalizedDecay’, ‘NormalizedDegree’, ‘NormalizedInDegree’, ‘NormalizedOutDegree’, ‘OutDegree’, ‘PageRank’, ‘PathLength’, and ‘UnbiasedDegreeAssortativity’.
- args (parameters) – Parameters for the node scorer. These parameters are specific for each node scorer and more details are provided in NOESIS documentation.


fMRINormalization.Rd
This function leverages structural image processing based on ANTs cortical thickness to implement standard functional image processing recommendations. The function will crop out the first k time frames, do motion correction and produce a variety of nuisance regressors. It will also do spatial and temporal filtering as well as interpolation between time frames that exceed a given framewise displacement. Finally, we return maps to the common coordinate system. Output may be trimmed in the future but currently provides access at different stages: merging versus filtering and normalized, fused BOLD images in both subject and template space.
fMRINormalization( img, steadyT = 20, fdthresh = Inf, repeatMotionEst = 2, freqLimits = c(0.01, 0.1), nCompCor = 0, polydegree = NA, structuralImage = NULL, structuralSeg = NULL, structuralNodes = NULL, templateMap = NULL, templateImage = NULL, smoothingSigmas = NA, extraRuns = list(), verbose = FALSE )
| img | input time series antsImage. |
|---|---|
| steadyT | number of seconds for steady state (used to remove initial volumes) |
| fdthresh | threshold for framewise displacement. determines what time frames should be interpolated. Set typically between 0.1 and 0.5 or Inf. |
| repeatMotionEst | number of times to repeat motion estimation. We recommend the value 2, in general. The first run improves the template estimate such that the 2nd run gives a more accurate correction. |
| freqLimits | pair defining bandwidth of interest from low to high. |
| nCompCor | number of compcor components to use in CSF plus WM mask. |
| polydegree | eg 4 for polynomial nuisance variables. |
| structuralImage | the structural antsImage of the brain. |
| structuralSeg | a 3 or greater class tissue segmentation of the structural image. |
| structuralNodes | regions of interest for network analysis, in the structural image space. |
| templateMap | antsRegistration output mapping template space (as moving) to struturalImage (fixed). |
| templateImage | template reference space to which we map the BOLD image. |
| smoothingSigmas | 4-vector defining amount of smoothing in FWHM units. |
| extraRuns | a list containing additional BOLD images (runs) to be merged with the first image. |
| verbose | enables visualization as well as commentary. |
outputs a list containing:
fusedImg: runs fused into one image and corrected if polydegree set
fusedImgFilt: runs fused into one image and filtered
seg2bold: strutural segmentation in BOLD space.
nodes2bold: strutural nodes in BOLD space.
boldToTemplate: BOLD fusedImg mapped to template space.
mapsToTemplate: invertible maps from BOLD to template space.
runID: Identifies which run over time series.
boldMat: Matrix of filtered BOLD data.
boldMask: BOLD mask.
motionCorr: Motion corrected data.
polyNuis: Polynomial nuisance variables.
timevals: Temporal variables.
nuisance: Nuisance variables.
FD: mean framewise displacement.
badtimes: time frames that are above FD threshold.
dmnAtBOLDres: Default mode network at BOLD resolution in MNI space.
seg2template: Segmentation in BOLD resolution MNI space.
networkPriors2Bold: WIP: standard network priors in BOLD space.
powersLabels: Powers nodes in BOLD space i.e. fusedImg.
powersPoints: Powers points in BOLD space i.e. fusedImg.
connMatNodes: User provided nodal system connectivity matrix.
connMatNodesPartialCorr: TUser provided nodal system partial correlation matrix.
# this example is long-running ( perhaps 10 minutes on an OSX laptop 2016 ) if (FALSE) { exrun = fMRINormalization( verbose = TRUE ) # will download ex data myid = "BBAvants" # some MRI data pre = paste("~/rsfTest/",sep='') fn = list.files( pre, full.names = TRUE, recursive = TRUE, pattern = glob2rx( paste( myid, "*rsfMRI0.nii.gz", sep='') ) ) img = antsImageRead( fn ) sfn = list.files( pre, full.names = TRUE, recursive = TRUE, pattern = glob2rx( paste( myid, "*BrainSegmentation.nii.gz", sep='') ) ) seg = antsImageRead( sfn ) t1fn = list.files( pre, full.names = TRUE, recursive = TRUE, pattern = glob2rx( paste( myid, "*BrainSegmentation0N4.nii.gz", sep='') ) ) t1 = antsImageRead( t1fn ) tt = fMRINormalization( img, repeatMotionEst=1, structuralImage=t1, structuralSeg=seg, verbose= TRUE ) # bold to template antsApplyTransforms( mni, getAverageOfTimeSeries( img ), transformlist=tt$mapsToTemplate$toTemplate, whichtoinvert=tt$mapsToTemplate$toTemplateInversion ) # template to bold antsApplyTransforms( getAverageOfTimeSeries( img ), mni, transformlist=tt$mapsToTemplate$toBold, whichtoinvert=tt$mapsToTemplate$toBoldInversion ) }


Next: prog1, Previous: nth-value, Up: Data and Control Flow Dictionary
prog
({var |
(var [init-form])}*)
{declaration}*
{tag | statement}*
⇒ {result}*
prog*
({var |
(var [init-form])}*)
{declaration}*
{tag | statement}*
⇒ {result}*
var—variable name.
init-form—a form.
declaration—a declare expression; not evaluated.
tag—a go tag; not evaluated.
statement—a compound form; evaluated as described below.
results—nil if a normal return occurs, or else, if an explicit return occurs, the values that were transferred.
Three distinct operations are performed by prog and prog*: they bind local variables, they permit use of the return statement, and they permit use of the go statement. A typical prog looks like this:
(prog (var1 var2 (var3 init-form-3) var4 (var5 init-form-5)) {declaration}* statement1 tag1 statement2 statement3 statement4 tag2 statement5 ... )
For prog, init-forms are evaluated first, in the order in which they are supplied. The vars are then bound to the corresponding values in parallel. If no init-form is supplied for a given var, that var is bound to nil.
The body of prog is executed as if it were a tagbody form; the go statement can be used to transfer control to a tag. Tags label statements.
prog implicitly establishes a block named nil around the entire prog form, so that return can be used at any time to exit from the prog form.
The difference between prog* and prog is that in prog* the binding and initialization of the vars is done sequentially, so that the init-form for each one can use the values of previous ones.
(prog* ((y z) (x (car y))) (return x))
returns the car of the value of z.
(setq a 1) ⇒ 1 (prog ((a 2) (b a)) (return (if (= a b) '= '/=))) ⇒ /= (prog* ((a 2) (b a)) (return (if (= a b) '= '/=))) ⇒ = (prog () 'no-return-value) ⇒ NIL
(defun king-of-confusion (w) "Take a cons of two lists and make a list of conses. Think of this function as being like a zipper." (prog (x y z) ;Initialize x, y, z to NIL (setq y (car w) z (cdr w)) loop (cond ((null y) (return x)) ((null z) (go err))) rejoin (setq x (cons (cons (car y) (car z)) x)) (setq y (cdr y) z (cdr z)) (go loop) err (cerror "Will self-pair extraneous items" "Mismatch - gleep! ~S" y) (setq z y) (go rejoin))) ⇒ KING-OF-CONFUSION
This can be accomplished more perspicuously as follows:
(defun prince-of-clarity (w) "Take a cons of two lists and make a list of conses. Think of this function as being like a zipper." (do ((y (car w) (cdr y)) (z (cdr w) (cdr z)) (x '() (cons (cons (car y) (car z)) x))) ((null y) x) (when (null z) (cerror "Will self-pair extraneous items" "Mismatch - gleep! ~S" y) (setq z y)))) ⇒ PRINCE-OF-CLARITY
block, let; let*, tagbody, go, return, Evaluation
prog can be explained in terms of block, let, and tagbody as follows:
(prog variable-list declaration . body) ≡ (block nil (let variable-list declaration (tagbody . body)))
Next: prog1, Previous: nth-value, Up: Data and Control Flow Dictionary


Open the network panel and view the image resources for this page.
You should see that the image is not loaded yet because it's not in viewport
Just Keep Scrolling
Now the image is loaded!


Cursor
Cursor style functional classes.
evo-cursor

Design Made Simple

Create a container for your text such as a

tag or

tag, and apply a text-size-[number]
class such as text-size-1
(smallest size) or text-size-15
(largest size).
You may see legacy classes that begin with text-size-[number] such as text-size-15
. These have been temporarily deprecated, but in the future may be used by mixins or feature opinionated styles for tracking, leading, etc.
cursor-[style]

Design Made Simple

Create a container for your text such as a

tag or

tag, and apply a text-size-[number]
class such as text-size-1
(smallest size) or text-size-15
(largest size).
You may see legacy classes that begin with text-size-[number] such as text-size-15
. These have been temporarily deprecated, but in the future may be used by mixins or feature opinionated styles for tracking, leading, etc.