The Four Million
by O. Henry
"The Skylight Room"
Additional Information
- Year Published: 1906
- Language: English
- Country of Origin: United States of America
- Source: O. Henry, The Four Million (Doubleday, Page & Company; New York: 1906) Henry, O. (1906). The Four Million. Doubleday, Page & Company; New York.
-
Readability:
- Flesch–Kincaid Level: 5.2
- Word Count: 2,519
- Genre: Realism
- Keywords: fate, fiction, short story
- ✎ Cite This
Downloads
First Mrs. Parker would show you the double parlours. You would not dare to interrupt her description of their advantages and of the merits of the gentleman who had occupied them for eight years. Then you would manage to stammer forth the confession that you were neither a doctor nor a dentist. Mrs. Parker's manner of receiving the admission was such that you could never afterward entertain the same feeling toward your parents, who had neglected to train you up in one of the professions that fitted Mrs. Parker's parlours.
Next you ascended one flight of stairs and looked at the second–floor–back at $8. Convinced by her second–floor manner that it was worth the $12 that Mr. Toosenberry always paid for it until he left to take charge of his brother's orange plantation in Florida near Palm Beach, where Mrs. McIntyre always spent the winters that had the double front room with private bath, you managed to babble that you wanted something still cheaper.
If you survived Mrs. Parker's scorn, you were taken to look at Mr. Skidder's large hall room on the third floor. Mr. Skidder's room was not vacant. He wrote plays and smoked cigarettes in it all day long. But every room–hunter was made to visit his room to admire the lambrequins. After each visit, Mr. Skidder, from the fright caused by possible eviction, would pay something on his rent.
Then—oh, then—if you still stood on one foot, with your hot hand clutching the three moist dollars in your pocket, and hoarsely proclaimed your hideous and culpable poverty, nevermore would Mrs. Parker be cicerone of yours. She would honk loudly the word "Clara," she would show you her back, and march downstairs. Then Clara, the coloured maid, would escort you up the carpeted ladder that served for the fourth flight, and show you the Skylight Room. It occupied 7×8 feet of floor space at the middle of the hall. On each side of it was a dark lumber closet or storeroom.
In it was an iron cot, a washstand and a chair. A shelf was the dresser. Its four bare walls seemed to close in upon you like the sides of a coffin.  Through the glass of the little skylight you saw a square of blue infinity.
"Two dollars, suh," Clara would say in her half–contemptuous, half–Tuskegeenial tones.
One day Miss Leeson came hunting for a room. She carried a typewriter made to be lugged around by a much larger lady. She was a very little girl, with eyes and hair that had kept on growing after she had stopped and that always looked as if they were saying: "Goodness me! Why didn't you keep up with us?"
Mrs. Parker showed her the double parlours. "In this closet," she said, "one could keep a skeleton or anaesthetic or coal—"
"But I am neither a doctor nor a dentist," said Miss Leeson, with a shiver.
Mrs. Parker gave her the incredulous, pitying, sneering, icy stare that she kept for those who failed to qualify as doctors or dentists, and led the way to the second floor back.
"Eight dollars?" said Miss Leeson. "Dear me! I'm not Hetty if I do look green. I'm just a poor little working girl. Show me something higher and lower."
Mr. Skidder jumped and strewed the floor with cigarette stubs at the rap on his door.
"Excuse me, Mr. Skidder," said Mrs. Parker, with her demon's smile at his pale looks. "I didn't know you were in. I asked the lady to have a look at your lambrequins."
"They're too lovely for anything," said Miss Leeson, smiling in exactly the way the angels do.
After they had gone Mr. Skidder got very busy erasing the tall, black–haired heroine from his latest (unproduced) play and inserting a small, roguish one with heavy, bright hair and vivacious features.
"Anna Held'll jump at it," said Mr. Skidder to himself, putting his feet up against the lambrequins and disappearing in a cloud of smoke like an aerial cuttlefish.
Presently the tocsin call of "Clara!" sounded to the world the state of Miss Leeson's purse. A dark goblin seized her, mounted a Stygian stairway, thrust her into a vault with a glimmer of light in its top and muttered the menacing and cabalistic words "Two dollars!"
"I'll take it!" sighed Miss Leeson, sinking down upon the squeaky iron bed.
Every day Miss Leeson went out to work. At night she brought home papers with handwriting on them and made copies with her typewriter. Sometimes she had no work at night, and then she would sit on the steps of the high stoop with the other roomers. Miss Leeson was not intended for a sky–light room when the plans were drawn for her creation.  Once she let Mr. Skidder read to her three acts of his great (unpublished) comedy, "It's No Kid; or, The Heir of the Subway."
There was rejoicing among the gentlemen roomers whenever Miss Leeson had time to sit on the steps for an hour or two. But Miss Longnecker, the tall blonde who taught in a public school and said, "Well, really!" to everything you said, sat on the top step and sniffed. And Miss Dorn, who shot at the moving ducks at Coney every Sunday and worked in a department store, sat on the bottom step and sniffed. Miss Leeson sat on the middle step and the men would quickly group around her.
Especially Mr. Skidder, who had cast her in his mind for the star part in a private, romantic (unspoken) drama in real life. And especially Mr. Hoover, who was forty–five, fat, flush and foolish. And especially very young Mr. Evans, who set up a hollow cough to induce her to ask him to leave off cigarettes. The men voted her "the funniest and jolliest ever," but the sniffs on the top step and the lower step were implacable.
* * * * * * *
I pray you let the drama halt while Chorus stalks to the footlights and drops an epicedian tear upon the fatness of Mr. Hoover. Tune the pipes to the tragedy of tallow, the bane of bulk, the calamity of corpulence. Tried out, Falstaff might have rendered more romance to the ton than would have Romeo's rickety ribs to the ounce. A lover may sigh, but he must not puff. To the train of Momus are the fat men remanded. In vain beats the faithfullest heart above a 52–inch belt. Avaunt, Hoover!  There was never a chance for you, Hoover.
 I can see him from down here, too."
All looked up—some at the windows of skyscrapers, some casting about for an airship, Jackson–guided.
"It's that star," explained Miss Leeson, pointing with a tiny finger. "Not the big one that twinkles—the steady blue one near it. I can see it every night through my skylight. I named it Billy Jackson."
"Well, really!" said Miss Longnecker. "I didn't know you were an astronomer, Miss Leeson."
"Oh, yes," said the small star gazer, "I know as much as any of them about the style of sleeves they're going to wear next fall in Mars."
"Well, really!" said Miss Longnecker. "The star you refer to is Gamma, of the constellation Cassiopeia. It is nearly of the second magnitude, and its meridian passage is—"
"Oh," said the very young Mr. Evans, "I think Billy Jackson is a much better name for it."
"Same here," said Mr. Hoover, loudly breathing defiance to Miss Longnecker. "I think Miss Leeson has just as much right to name stars as any of those old astrologers had."
"Well, really!" said Miss Longnecker.
"I wonder whether it's a shooting star," remarked Miss Dorn. "I hit nine ducks and a rabbit out of ten in the gallery at Coney Sunday."
"He doesn't show up very well from down here," said Miss Leeson. "You ought to see him from my room. You know you can see stars even in the daytime from the bottom of a well. At night my room is like the shaft of a coal mine, and it makes Billy Jackson look like the big diamond pin that Night fastens her kimono with."
There came a time after that when Miss Leeson brought no formidable papers home to copy. And when she went out in the morning, instead of working, she went from office to office and let her heart melt away in the drip of cold refusals transmitted through insolent office boys. This went on.
There came an evening when she wearily climbed Mrs. Parker's stoop at the hour when she always returned from her dinner at the restaurant. But she had had no dinner.
As she stepped into the hall Mr. Hoover met her and seized his chance. He asked her to marry him, and his fatness hovered above her like an avalanche. She dodged, and caught the balustrade. He tried for her hand, and she raised it and smote him weakly in the face. Step by step she went up, dragging herself by the railing. She passed Mr. Skidder's door as he was red–inking a stage direction for Myrtle Delorme (Miss Leeson) in his (unaccepted) comedy, to "pirouette across stage from L to the side of the Count." Up the carpeted ladder she crawled at last and opened the door of the skylight room.
She was too weak to light the lamp or to undress. She fell upon the iron cot, her fragile body scarcely hollowing the worn springs. And in that Erebus of the skylight room, she slowly raised her heavy eyelids, and smiled.
For Billy Jackson was shining down on her, calm and bright and constant through the skylight. There was no world about her. She was sunk in a pit of blackness, with but that small square of pallid light framing the star that she had so whimsically and oh, so ineffectually named. Miss Longnecker must be right; it was Gamma, of the constellation Cassiopeia, and not Billy Jackson. And yet she could not let it be Gamma.
As she lay on her back she tried twice to raise her arm. The third time she got two thin fingers to her lips and blew a kiss out of the black pit to Billy Jackson. Her arm fell back limply.
"Good–bye, Billy," she murmured faintly. "You're millions of miles away and you won't even twinkle once. But you kept where I could see you most of the time up there when there wasn't anything else but darkness to look at, didn't you? . . . Millions of miles . . . Good–bye, Billy Jackson."
Clara, the coloured maid, found the door locked at 10 the next day, and they forced it open. Vinegar, and the slapping of wrists and burnt feathers proving of no avail, some one ran to 'phone for an ambulance.

"Ambulance call to 49," he said briefly. "What's the trouble?"
"Oh, yes, doctor," sniffed Mrs. Parker, as though her trouble that there should be trouble in the house was the greater. "I can't think what can be the matter with her. Nothing we could do would bring her to. It's a young woman, a Miss Elsie—yes, a Miss Elsie Leeson. Never before in my house—"
"What room?" cried the doctor in a terrible voice, to which Mrs. Parker was a stranger.
"The skylight room. It—"
Evidently the ambulance doctor was familiar with the location of skylight rooms. He was gone up the stairs, four at a time. Mrs. Parker followed slowly, as her dignity demanded.
On the first landing she met him coming back bearing the astronomer in his arms. He stopped and let loose the practised scalpel of his tongue, not loudly. Gradually Mrs. Parker crumpled as a stiff garment that slips down from a nail. Ever afterward there remained crumples in her mind and body. Sometimes her curious roomers would ask her what the doctor said to her.
"Let that be," she would answer. "If I can get forgiveness for having heard it I will be satisfied."
The ambulance physician strode with his burden through the pack of hounds that follow the curiosity chase, and even they fell back along the sidewalk abashed, for his face was that of one who bears his own dead.
They noticed that he did not lay down upon the bed prepared for it in the ambulance the form that he carried, and all that he said was: "Drive like h––––l, Wilson," to the driver.
That is all. Is it a story? In the next morning's paper I saw a little news item, and the last sentence of it may help you (as it helped me) to weld the incidents together.
It recounted the reception into Bellevue Hospital of a young woman who had been removed from No. 49 East –––– street, suffering from debility induced by starvation. It concluded with these words:
"Dr. William Jackson, the ambulance physician who attended the case, says the patient will recover."


Namespace SadRogue.Primitives
Classes
AdjacencyRule
Structure representing a method for determining which coordinates are adjacent to a given coordinate, and which directions those neighbors are in. Cannot be instantiated -- pre-made static instances are provided.
AdjacencyRule.Types
Enum representing AdjacencyRule types. Each AdjacencyRule instance has a Type field which contains the corresponding value from this enum. Useful for easy mapping of AdjacencyRule types to a primitive type (for cases like a switch statement).
Area
Represents an arbitrarily-shaped 2D area. Stores and provides access to a list of each unique position in the area.
BisectionResult
Structure representing the result of a rectangle bisection.
BisectionResultEnumerator
A custom enumerator used to iterate over all rectangles in the given bisection result efficiently. Generally, you should simply use a BisectionResult in a foreach loop, rather than creating one of these manually.
BoundedRectangle
This class defines a 2D rectangular area, whose area is automatically "locked" to being inside a rectangular bounding box as it is changed. A typical use might be keeping track of a camera's view area.
BresenhamEnumerator
A custom enumerator used to iterate over all positions on the on a line using the Bresenham line algorithm efficiently.
Generally, you should use GetBresenhamLine(Point, Point) to get an instance of this, rather than creating one yourself.
ChebyshevDistance
Represents chebyshev distance (equivalent to 8-way movement with no extra cost for diagonals).
CirclePositionsEnumerator
A custom enumerator used to iterate over all positions on the outside of a circle efficiently.
Generally, you should use GetCircle(Point, Int32) to get an instance of this, rather than creating one yourself.
Color
Describes a 32-bit packed color.
ColorExtensions
Contains set of operators that match ones defined by other packages for interoperability, so syntax may be uniform. Functionality is similar to the corresponding actual operators for Color.
DDAEnumerator
A custom enumerator used to iterate over all positions on the on a line using the DDA line algorithm efficiently.
Generally, you should use GetDDALine(Point, Point) to get an instance of this, rather than creating one yourself.
Direction
Structure representing the concept of a "direction" on a grid, and "defines" the coordinate plane via the YIncreasesUpward flag. Interacts with Point to allow easy translation of positions in a direction, and contains numerous helper functions for retrieving directions in various orders, getting direction closest to a line, etc.
Direction.Types
Enum representing Direction types. Each Direction instance has a Type field which contains the corresponding value from this enum. Useful for easy mapping of Direction types to a primitive type (for cases like a switch statement).
Distance
Class representing methods of calculating distance on a grid. You cannot create instances of this class using a constructor -- instead this class contains static instances representing the various distance calculations.
Distance.Types
Enum representing Distance types. Each Distance instance has a Type field which contains the corresponding value from this enum. Useful for easy mapping of Distance types to a primitive type (for cases like a switch statement).
EllipsePositionsEnumerator
A custom enumerator used to iterate over all positions on the outside of an ellipse efficiently.
Generally, you should use GetEllipse(Point, Point) to get an instance of this, rather than creating one yourself.
EuclideanDistance
Represents euclidean distance (equivalent to 8-way movement with ~1.41 movement cost for diagonals).
Gradient
Represents a gradient with multiple color stops.
GradientStop
A gradient stop. Defines a color and where it is located within the gradient.
IDGenerator
Class designed as a helper for situations where you need to generate and assign a unique integer to each instance of a class, eg. for a class implementing IHasID.
Lines
Provides implementations of various line-drawing algorithms which are useful for generating lines on a 2D integer grid.
Lines.Algorithm
Various supported line-drawing algorithms.
ListEnumerator<T>
A custom enumerator that simply iterates over a List. It differs from C#'s built-in iterator in that it also implements IEnumerable, and so can be used as a substitute for IEnumerable<T>.
ManhattanDistance
Represents manhattan distance (equivalent to 4-way, cardinal-only movement).
MathHelpers
Static class consisting of mathematical "helper" functions and constants that can be useful for performing operations on a 2D grid.
OrthogonalEnumerator
A custom enumerator used to iterate over all positions on the on a line using the Orthogonal line algorithm efficiently.
Generally, you should use GetOrthogonalLine(Point, Point) to get an instance of this, rather than creating one yourself.
Palette
A palette of colors.
Point
A structure that represents a standard 2D point. Provides numerous functions and operators that enable common grid/position-related math and operations.
PointExtensions
Contains set of operators that match ones defined by other packages for interoperability, so syntax may be uniform. Functionality is similar to the corresponding actual operators for Point.
PolarCoordinate
A Polar Coordinate.
PropertyChangedEventHelpers
Helper functions useful for implementing events using ValueChangedEventArgs<TProperty> as their parameter.
Radius
Structure representing different shapes that define the concept of a radius on a grid. You cannot create instances of this class using a constructor -- instead, this class contains static instances representing the various radius shapes.
Radius.Types
Enum representing Radius types. Each Radius instance has a Type field which contains the corresponding value from this enum. Useful for easy mapping of Radius types to a primitive type (for cases like a switch statement).
RadiusLocationContext
A context representing information necessary to get all the positions in a radius via functions like PositionsInRadius(RadiusLocationContext). Storing a context and re-using it may be more performant in cases where you're getting the positions in a radius of the same size many times, even if the location center point or shape of the radius is changing.
ReadOnlyAreaExtensions
Extension methods for IReadOnlyArea.
ReadOnlyAreaPositionsEnumerator
A custom enumerator used to iterate over all positions within an area with a foreach loop efficiently.
ReadOnlyListEnumerator<T>
A structure similar to ListEnumerator<T>, but for IReadOnlyList<T>. It is not quite as fast as ListEnumerator<T>, but is still faster than using the typical Enumerable implementation for IReadOnlyList. You should only use this if you can't use ListEnumerator<T> due to the type you're working with; they share the same characteristics otherwise.
Rectangle
Represents a 2D rectangle. Provides numerous static functions that enable creation and common operations involving rectangles.
RectangleExtensions
Contains set of operators that match ones defined by other packages for interoperability, so syntax may be uniform. Functionality is similar to the corresponding actual operators for Color.
RectanglePerimeterPositionsEnumerator
A custom enumerator used to iterate over all positions on the outside edges of a rectangle efficiently.
Generally, you should use PerimeterPositions() to get an instance of this, rather than creating one yourself.
RectanglePositionsEnumerator
A custom enumerator used to iterate over all positions within a rectangle efficiently.
Shapes
Provides implementations of various shape algorithms which are useful for for generating points representing shapes on a 2D integer grid.
ToStringExtensions
Static class containing extension extension methods for printing various built-in C# classes (as well as some grid views) as strings neatly.
Useful for debugging, and within the primitives library for ToString implementations.
ValueChangedEventArgs<TProperty>
Event arguments for an event fired when an object's properties are changed. Often used with SafelySetProperty<TObject, TProperty>(TObject, ref TProperty, TProperty, EventHandler<ValueChangedEventArgs<TProperty>>) and other overloads of that function.
Interfaces
IHasID
Interface for a class that has an integer ID value, typically used for items in a spatial map, or generally for purposes of hashing.
IHasLayer
Interface for objects that reside on a "Z-index" or "layer".
IMatchable<T>
Interface implemented to define a form of checking value equality, without guarantees that it corresponds to GetHashCode.
IPositionable
An interface describing an object which has a position on a grid and can move around.
IReadOnlyArea
Read-only interface for an arbitrary 2D area.


--- layout: post date: 2012-02-15 time: "09:00:00" authors: ["Greg Wilson"] title: Analyzing Next-Generation Sequencing Data tags: ["Noticed"] ---
Analyzing Next-Generation Sequencing Data
http://bioinformatics.msu.edu/ngs-summer-course-2012
June 4th — June 15th, 2012
Kellogg Biological Station, MSU
Course sponsor: NIH.
Instructors: Dr. C. Titus Brown, Dr. Ian Dworkin, and Dr. Istvan Albert.
Board of advisors: Dr. Kevin White; Dr. Paul Sternberg; Dr. Rich Lenski; Dr. Robin Buell; Dr. Jim Tiedje; Dr. Lincoln Stein
Applications are being accepted through March 1st (midnight Pacific)!
Course Description
This intensive two week summer course will introduce attendees with a strong biology background to the practice of analyzing short-read sequencing data from Roche 454, Illumina GA2, ABI SOLiD, Pacific Biosciences, and other next-gen platforms. The first week will introduce students to computational thinking and large-scale data analysis on UNIX platforms. The second week will focus on mapping, assembly, and analysis of short-read data for resequencing, ChIP-seq, and RNAseq.
No prior programming experience is required, although familiarity with some programming concepts is helpful, and bravery in the face of the unknown is necessary. 2 years or more of graduate school in a biological science is strongly suggested. Faculty, postdocs, and research staff are more than welcome!
Students will gain practical experience in:
Materials from last year's course are available at http://ged.msu.edu/angus/tutorials-2011 under a Creative Commons/use+reuse license.
You can read a blog post about last year's course at http://ivory.idyll.org/blog/jun-11/ngs-2011.


Work Timer
A pomodoro clock by
Pius Wong
Work Time (min)
−
25
+
Break Time (min)
−
5
+
25
:
00
minutes remaining
to work
Your browser does not support the HTML5 canvas


This is a fork of the Date Range Picker for Bootstrap by Dan Grossman. While initially being used as a sandbox to try out new features/improvements for the picker, I've made some minor code updates and added an option to the api showRangeInputsOnCustomRangeOnly: false
that will turn off the range inputs (apply,cancel,to,from) unless the custom range selector is triggered.


Volvo XC40 T4 petrol SUV to launch in India at Rs 39.9 lakh, will be BSVI compliant
by Team ODVolvo Cars India will launch a new engine option for its XC40 SUV in India soon at Rs 39.9 lakh, ex-showroom. The new model is termed the Volvo XC40 T4 and will come with a BSVI compliant 2.0-litre petrol motor. This engine option will be available in the mid-spec R-Design trim level.
The 1,969cc petrol motor puts out 190PS and 300Nm. It comes paired with an Aisin eight-speed torque convertor automatic and is only available in a front-wheel drive configuration. The XC40, equipped as such, is capable of getting from 0 to 100kmph in 8.4s and on to a 210kmph top speed. The R-Design trim level will be available in this version, and adds unique design touches. These come in the form of gloss black bits on the front grille, the roof and the door mirrors. There is also a charcoal entire trim option with aluminium highlights, R-Design seats, gear shifter and steering wheel, and an option of contrasting carpeting to go with the Nappa leather/Nubuck textile upholstery.
The XC40 will also soon be available as an EV.
The XC40 is currently available in India with the D4 2.0-litre 4-cylinder diesel motor with 190PS and 400Nm. Two trims are available; the Momentum at Rs 39.9 lakh and the Inscription at Rs 43.9 lakh. The R-Design trims sits between these two.


Step 3: Searching for a Patient
{{#markdown}}
The first functionality we will add to the application is the ability to search for a particular patient in the FHIR database. We will keep this simple, and look patients up by their last name, allowing a user to then select a patient from the search result list.
Let's being by adding a title and some styling to our web page. Open the main.html
file located in the patient-todo/client
directory. Delete the Meteor starter HTML, so that the file now looks like this:
```html
patient-todo
```
This will be our blank HTML slate to build upon. I have left place holder comments in the code, so you need to do is copy the tutorial code and replace the ≺!-- Step x HTML code goes HERE -->
markers at each step. Add the following HTML into the body
section of the client/main.html
file.
Step 3.1 HTML Code
```html
Patient Task Manager
```
If you run Meteor from the command line in the project directory (/patient-todo/meteor
) and then open a web browser window to localhost:3000
then you should see the following:
Next let's add the search input box and button to initite the patient search. Much of the following code, particularly the class=""
delcarations, are components of Bootstrap used to make the page look pretty. Don't feel overwhelmed if you don't quite understand all the details of what we are doing in the HTML. The important points here are the input
and button
elements. This code snippit should also be added to the client/main.html
file, just below the code we added above.
Step 3.2 HTML Code
```html
```
With Meteor still running from the command line, you should be able to simply reload the webpage in the browser and now see something like this:
You can type in a name and press enter in the box (or press the search button). At this point the visual elements of the search are present, but entering a name and clicking the search button doesn't do anything. To make these pieces work, we need to add some JavaScipt code to the client/main.js
file. Find and open that file in your project patient-todo/
directory, and delete the Meteor starter code so our blank JavaScript slate only contains 2 lines of code and looks like this:
Step 3.3 JavaScript Code
```js
import { Template } from 'meteor/templating'
import './main.html'
```
These two lines tell our application to load the Meteor Templating engine and then tie this JavaScript file to the main.html
webpage. Let's add two snippits of code beneath the import './main.html'
line.
The first piece of code we will add will listen for a user to click (or press enter) on the "Search for Patient" button that we created on the webpage. To do this we add a code section called events
. Copy and paste the code below into the main.js
file.
Step 3.4 JavaScript Code
```
Template.body.events({
'click #patientSearch' : function(event) {
event.preventDefault()
let name = $('#patientName').val()
Meteor.call('FHIRpatientSearch', name, function(err, res) {
Session.set('patientSearchList', res.entry)
})
},
//Insert Step 5.3 Code Here
//Insert Step 6.3 Code Here
//Insert Step 7.2 Code Here
//Insert Step 7.4 Code Here
})
//Insert Step 4.1 Code Here
```
This code tells the webpage to listen for a click on the HTML element with an id
of patientSearch
. If you look back at the HTML we added above, you will see that the button we created has that id
. So everytime the "Search" button is clicked the webpage will execute the code within this 'click #patientSearch'
function. The function itself retrieves the text that we entered into the input
box and sends that information to our web app server in order to make a call via FHIR.
In order to make this function work, we need to add the server side code that sends the search query to the FHIR server. Let's do that now by editing the main.js
file in the patient-todo/server
directory. To the bottom of the main.js
file, add the following code snippit:
Step 3.5 JavaScript Code
import { HTTP } from 'meteor/http'
Meteor.methods({
FHIRpatientSearch : function (searchString) {
let result = HTTP.call('GET', "http://learnfhir.aidbox.io/fhir/Patient?family=" + searchString)
return JSON.parse(result.content)
},
// Step 5.4 Code Goes HERE
// Step 6.4 Code Goes HERE
// Step 7.5 Code Goes HERE
// Step 8.3 Code Goes HERE
})
This code makes a request of the remote FHIR server (in this case "learnfhir.aidbox.io"). The request is to retrieve all Patient
resources with a family
name equal to the value of the input box from our web client. So when a user enters a name into the box and presses enter, that name is sent to the application server, which then performs a request of the FHIR sevrver to find all Patient records with that name and return the results. We then pass those results back to the user's web client.
To view those results in the webpage proceed to Step 4...
{{/markdown}}


A Fully Customizable Textbook for Introductory Statistics/Data Science - USCOTS Workshop
Hello USCOTS participants, thank you for registering for the “A Fully Customizable Textbook for Introductory Statistics/Data Science Courses” workshop on Wednesday, May 17th and Thursday, May 18th.
In preparation, please:
- If don’t have a GitHub account already, please create one.
- Ensure you have R version 3.3.0 or later & RStudio version 1.0.0 or later
- Install/update these R packages: tidyverse, bookdown, mosaic, knitr, rmarkdown, fivethirtyeight, nycflights13, okcupiddata, ggplot2movies, gapminder
- Complete this intro survey as we’d love to get a sense of your backgrounds and needs.
- Look over this webpage that will be updated with further details and materials in the days to come.
- The Resources page provides links to our course webpages and other useful materials.
- The Schedule page provides an outline of what we will cover during the workshop.
Please don't hesitate to contact us via email beforehand.
- Albert & Chester


verify the new distance weighting using ground truth examples.
implement the alternative optimization process to generate desired results.
add a bias into both energy terms, because for most of the curves, the laplacian and bi-laplacian may not be exactly 0. (i.e. we may not really want zero in our results)
also, verify this from some ground truth examples, i.e. for each vertex, compute both laplacian and bi-laplacian.
and in the end we can learn this bias as learning the prior (also, we can think about whether to keep the weights or not, because it is also kind of prior…)


BUILD WITH US
We work for you to give end to end worth service
A platform for construction professionals to build their portfolio.
A platform for users to explore the portfolios of professionals for their construction.
connecting a professional and customer.


(2021-11-06 06:49:18 UTC)
# Packages matching: installed # Name # Installed # Synopsis base-bigarray base base-threads base base-unix base conf-findutils 1 Virtual package relying on findutils conf-gmp 3 Virtual package relying on a GMP lib system installation coq dev Formal proof management system dune 2.9.1 Fast, portable, and opinionated build system ocaml 4.13.1 The OCaml compiler (virtual package) ocaml-base-compiler 4.13.1 Official release 4.13.1 ocaml-config 2 OCaml Switch Configuration ocaml-options-vanilla 1 Ensure that OCaml is compiled with no special options enabled ocamlfind 1.9.1 A library manager for OCaml zarith 1.12 Implements arithmetic and logical operations over arbitrary-precision integers # opam file: opam-version: "2.0" maintainer: "Li-yao Xia<EMAIL_ADDRESS>synopsis: "A Library for Representing Recursive and Impure Programs in Coq" homepage: "https://github.com/DeepSpec/InteractionTrees" dev-repo: "git+https://github.com/DeepSpec/InteractionTrees" bug-reports: "https://github.com/DeepSpec/InteractionTrees/issues" license: "MIT" build: [ ["dune" "subst"] {pinned} ["dune" "build" "-p" name "-j" jobs] ["dune" "build" "--root=." "-j" jobs] {with-test} ["dune" "runtest" "--root=." "-j" jobs] {with-test} ] depends: [ "coq" {>= "8.10"} "coq-ext-lib" {>= "0.11.1" & < "0.12"} "coq-paco" {>= "4.0.1"} "dune" {>= "2.6"} ] authors: [ "Li-yao Xia<EMAIL_ADDRESS>"Yannick Zakowski<EMAIL_ADDRESS>"Paul He<EMAIL_ADDRESS>"Chung-Kil Hur<EMAIL_ADDRESS>"Gregory Malecha<EMAIL_ADDRESS>"Steve Zdancewic<EMAIL_ADDRESS>"Benjamin C. Pierce<EMAIL_ADDRESS>] tags: [ "org:deepspec" "logpath: ITree" "date: 2021-03-15" ] url { http: "https://github.com/DeepSpec/InteractionTrees/archive/4.0.0.tar.gz" checksum: "sha512=5474977a355de77a7775f70cc885164058f5b7ffa122c914fc53b43db08b238c354e0ef99cbcb53b1e9a24640357cd1902c0afe3ed512c24da3d1c8ce006e5b3" }
true
Dry install with the current Coq version:
opam install -y --show-action coq-itree.4.0.0 coq.dev
Dry install without Coq/switch base, to test if the problem was incompatibility with the current Coq/OCaml version:
true
opam list; echo; ulimit -Sv 4000000; timeout 4h opam install -y --deps-only coq-itree.4.0.0 coq.dev
opam list; echo; ulimit -Sv 16000000; timeout 4h opam install -y -v coq-itree.4.0.0 coq.dev
# Packages matching: installed # Name # Installed # Synopsis base-bigarray base base-threads base base-unix base conf-findutils 1 Virtual package relying on findutils conf-gmp 3 Virtual package relying on a GMP lib system installation coq dev Formal proof management system coq-ext-lib 0.11.5 A library of Coq definitions, theorems, and tactics coq-paco dev Coq library implementing parameterized coinduction dune 2.9.1 Fast, portable, and opinionated build system ocaml 4.13.1 The OCaml compiler (virtual package) ocaml-base-compiler 4.13.1 Official release 4.13.1 ocaml-config 2 OCaml Switch Configuration ocaml-options-vanilla 1 Ensure that OCaml is compiled with no special options enabled ocamlfind 1.9.1 A library manager for OCaml zarith 1.12 Implements arithmetic and logical operations over arbitrary-precision integers [NOTE] Package coq is already installed (current version is dev). The following actions will be performed: - install coq-itree 4.0.0 <><> Processing actions <><><><><><><><><><><><><><><><><><><><><><><><><><><><> Processing 1/3: [coq-itree.4.0.0: http] Processing 1/3: -> retrieved coq-itree.4.0.0 (https://github.com/DeepSpec/InteractionTrees/archive/4.0.0.tar.gz) Processing 2/3: [coq-itree: dune build] + /home/bench/.opam/opam-init/hooks/sandbox.sh "build" "dune" "build" "-p" "coq-itree" "-j" "4" (CWD=/home/bench/.opam/ocaml-base-compiler.4.13.1/.opam-switch/build/coq-itree.4.0.0) - coqc theories/Basics/.Basics.aux,theories/Basics/Basics.{glob,vo} - File "./theories/Basics/Basics.v", line 69, characters 0-162: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Basics/Basics.v", line 74, characters 0-188: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Basics/Basics.v", line 100, characters 0-372: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Basics/Basics.v", line 112, characters 0-361: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Basics/Basics.v", line 124, characters 0-166: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Basics/Basics.v", line 128, characters 0-325: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Basics/Basics.v", line 139, characters 0-330: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Basics/Basics.v", line 162, characters 0-81: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - coqc theories/Basics/.CategoryOps.aux,theories/Basics/CategoryOps.{glob,vo} - File "./theories/Basics/CategoryOps.v", line 88, characters 0-33: - Warning: Declaring a scope implicitly is deprecated; use in advance an - explicit "Declare Scope cat_scope.". [undeclared-scope,deprecated] - coqc theories/Core/.ITreeDefinition.aux,theories/Core/ITreeDefinition.{glob,vo} - File "./theories/Core/ITreeDefinition.v", line 66, characters 0-34: - Warning: Declaring a scope implicitly is deprecated; use in advance an - explicit "Declare Scope itree_scope.". [undeclared-scope,deprecated] - File "./theories/Core/ITreeDefinition.v", line 260, characters 0-75: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Core/ITreeDefinition.v", line 266, characters 0-178: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Core/ITreeDefinition.v", line 272, characters 0-101: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Core/ITreeDefinition.v", line 277, characters 0-78: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - coqc theories/Indexed/.Relation.aux,theories/Indexed/Relation.{glob,vo} - File "./theories/Indexed/Relation.v", line 29, characters 0-185: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality [...] truncated t-locality,deprecated] - File "./theories/Interp/TranslateFacts.v", line 198, characters 0-133: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - coqc theories/Interp/.InterpFacts.aux,theories/Interp/InterpFacts.{glob,vo} (exit 129) - (cd _build/default && /home/bench/.opam/ocaml-base-compiler.4.13.1/bin/coqc -q -R theories ITree theories/Interp/InterpFacts.v) - File "./theories/Interp/InterpFacts.v", line 39, characters 0-87: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Interp/InterpFacts.v", line 46, characters 0-91: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Interp/InterpFacts.v", line 106, characters 0-33: - Warning: The default value for rewriting hint locality is currently "local" - in a section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding rewriting hints outside of sections - without specifying an explicit locality attribute is therefore deprecated. It - is recommended to use "export" whenever possible. Use the attributes - #[local], #[global] and #[export] depending on your choice. For example: - "#[export] Hint Rewrite foo : bar." - [deprecated-hint-rewrite-without-locality,deprecated] - File "./theories/Interp/InterpFacts.v", line 107, characters 0-33: - Warning: The default value for rewriting hint locality is currently "local" - in a section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding rewriting hints outside of sections - without specifying an explicit locality attribute is therefore deprecated. It - is recommended to use "export" whenever possible. Use the attributes - #[local], #[global] and #[export] depending on your choice. For example: - "#[export] Hint Rewrite foo : bar." - [deprecated-hint-rewrite-without-locality,deprecated] - File "./theories/Interp/InterpFacts.v", line 108, characters 0-37: - Warning: The default value for rewriting hint locality is currently "local" - in a section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding rewriting hints outside of sections - without specifying an explicit locality attribute is therefore deprecated. It - is recommended to use "export" whenever possible. Use the attributes - #[local], #[global] and #[export] depending on your choice. For example: - "#[export] Hint Rewrite foo : bar." - [deprecated-hint-rewrite-without-locality,deprecated] - File "./theories/Interp/InterpFacts.v", line 111, characters 0-149: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Interp/InterpFacts.v", line 127, characters 0-109: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Interp/InterpFacts.v", line 135, characters 0-149: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Interp/InterpFacts.v", line 155, characters 0-232: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Interp/InterpFacts.v", line 177, characters 0-168: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Interp/InterpFacts.v", line 200, characters 0-153: - Warning: The default value for instance locality is currently "local" in a - section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding instances outside of sections without - specifying an explicit locality attribute is therefore deprecated. It is - recommended to use "export" whenever possible. Use the attributes #[local], - #[global] and #[export] depending on your choice. For example: "#[export] - Instance Foo : Bar := baz." [deprecated-instance-without-locality,deprecated] - File "./theories/Interp/InterpFacts.v", line 243, characters 0-34: - Warning: The default value for rewriting hint locality is currently "local" - in a section and "global" otherwise, but is scheduled to change in a future - release. For the time being, adding rewriting hints outside of sections - without specifying an explicit locality attribute is therefore deprecated. It - is recommended to use "export" whenever possible. Use the attributes - #[local], #[global] and #[export] depending on your choice. For example: - "#[export] Hint Rewrite foo : bar." - [deprecated-hint-rewrite-without-locality,deprecated] - File "./theories/Interp/InterpFacts.v", line 350, characters 0-163: - Error: Anomaly "Uncaught exception Not_found." - Please report at http://coq.inria.fr/bugs/. - [ERROR] The compilation of coq-itree.4.0.0 failed at "dune build -p coq-itree -j 4". #=== ERROR while compiling coq-itree.4.0.0 ====================================# # context 2.1.0 | linux/x86_64 | ocaml-base-compiler.4.13.1 | file:///home/bench/run/opam-coq-archive/released # path ~/.opam/ocaml-base-compiler.4.13.1/.opam-switch/build/coq-itree.4.0.0 # command ~/.opam/opam-init/hooks/sandbox.sh build dune build -p coq-itree -j 4 # exit-code 1 # env-file ~/.opam/log/coq-itree-17171-c09287.env # output-file ~/.opam/log/coq-itree-17171-c09287.out ### output ### # [...] # Warning: The default value for rewriting hint locality is currently "local" # in a section and "global" otherwise, but is scheduled to change in a future # release. For the time being, adding rewriting hints outside of sections # without specifying an explicit locality attribute is therefore deprecated. It # is recommended to use "export" whenever possible. Use the attributes # #[local], #[global] and #[export] depending on your choice. For example: # "#[export] Hint Rewrite foo : bar." # [deprecated-hint-rewrite-without-locality,deprecated] # File "./theories/Interp/InterpFacts.v", line 350, characters 0-163: # Error: Anomaly "Uncaught exception Not_found." # Please report at http://coq.inria.fr/bugs/. # <><> Error report <><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><> +- The following actions failed | - build coq-itree 4.0.0 +- - No changes have been performed # Run eval $(opam env) to update the current shell environment 'opam install -y -v coq-itree.4.0.0 coq.dev' failed. The middle of the output is truncated (maximum 20000 characters)
No files were installed.
true


## A Presentation on EMACS
##### *Hastily Prepared and Questionably Spel-Cheked*
Isn't this the VIM talk?
- It was supposed to be
- I'm sorry if that's what you're here for
- Blame the other Thomas
- I mean really, who would rather take an exam than sit around
talking about text editors?
- You can leave if you want
- But unless you already know you hate EMACS, stick around
What is EMACS?
Editor MACroS
YeaH I caN taLK likE THaT ToO!
No.
Okay, but really?
- Most commonly GNU Emacs
- Originally just macros for an editor called TECO
- Typically implemented using a Lisp
Aside: you can learn more about things like TECO if you read
"Hackers: Heroes of the Computer Revolution" by Steven Levy
I heard something about Lisp
Something like...
- "sexp"?
- Being better than everyone else?
- The formation of an unholy, psyche-shattering contract with Paren,
the great and terrible god of parentheses?
Well, you aren't wrong, but...
## Back to Reality
* You only need to know Lisp to write the config file
* Lisp isn't that hard to use, especially when editing with Emacs
* The entire editor *is* written mostly in Lisp, but you usually aren't aware of it
* **Many of you probably already know some Emacs commands, you just don't know it**
You fool.  You don't know me!
- We'll see about that
- Raise your hand if you use bash, zsh, or fish
- Keep them raised unless you've explicitly configured keyboard shortcuts in your shell
- Keep them raised if you know any commands to move around on the command line; ex:
- Beginning/end of line
- Forward/backward by character/word
- Delete a character without the delete key
- Suspend execution of a program
- Reverse search through history
## I hope there are hands still raised
* You all know some Emacs movement commands already!
* Why is it this way?
* GNU readline
* Wraps many text interfaces in GNU and other software
* Ex: Emacs, nano, bash, Python, etc.
## All your modifiers are mine
The absolute basic key combos you'll need:
* C-f and C-b: go forward and backward one character
* M-f and M-b: go forward and backward one word
* C-n and C-p: go down and up one line
* C-a and C-e: go to the beginning and end of a line
* M-> and M-<: go to the beginning and end of the buffer
* C-x u: undo
* C-SPC: begin/end selecting text
* C-w and M-w: cut and copy selection
* C-y: paste text
* C-k: kill a line
* C-h: open help
* C-s and C-r: forward and reverse search
* C-x C-f: open a file
* C-x C-s: save current buffer
* C-x s: save all buffers
* C-x C-c: quit
I'm bored now, stop talking about keys
- Okay
- Just remember to try these in your shell sometime
- I swear if I see one more person clear a shell with "clear" instead
of C-l, I'm going to insert my head into a wall.
- No more arrow keys either, just use C-n and C-l
- Serious: the whole idea is to keep your hands on the keyboard as much as
possible.
What else can we do?
- Useful things:
- org-mode for note-taking and document-writing
- magit for using git from within Emacs
- The GUD for debugging programs within Emacs
- eshell, where you can execute both shell commands and Lisp!
- The list goes on (read/send email, etc.)
- Silly things:
- Play tetris
- Tell the automated psychotherapist about your problems
- Etc...
## Even more
* You can use VIM keybindings in Emacs with things like Spacemacs and Evil mode
* You can write your own packages
* You can edit your config file to tune Emacs to your liking
* I can show you what Emacs looks like for me if you want
* Generally, anything you can program, Emacs can do!
## The End
* Thank you all for staying
* If you want to know more, you can try talking to me
* I would not consider myself an expert by any means though
* Unless you profess extreme zealotry for a different editor, I'd recommend
trying out Emacs for a few weeks sometime in the future


- capitalize(String) - Static method in class minestra.text.LetterCaseConverter
-
Converts a string to capital case.
- compare(double, double) - Method in interface minestra.collection.DoubleComparator
-
Compares A
and B
along the order of this instance.
- compare(int, int) - Method in interface minestra.collection.IntComparator
-
Compares A
and B
along the order of this instance.
- compare(long, long) - Method in interface minestra.collection.LongComparator
-
Compares A
and B
along the order of this instance.
- compareTo(Path) - Method in class minestra.file.PathString
-
- concat(DoubleImmArray, DoubleImmArray...) - Method in interface minestra.collection.DoubleImmArray
-
Returns the concatenated array of all specified arrays.
- concat(ImmArray<? extends T>, ImmArray<? extends T>...) - Method in interface minestra.collection.ImmArray
-
Returns the concatenated array of all specified arrays.
- concat(IntImmArray, IntImmArray...) - Method in interface minestra.collection.IntImmArray
-
Returns the concatenated array of all specified arrays.
- concat(LongImmArray, LongImmArray...) - Method in interface minestra.collection.LongImmArray
-
Returns the concatenated array of all specified arrays.
- contains(T) - Method in interface minestra.collection.ImmArray
-
Returns whether this array contains the element which is same as specified element.
- contains(int) - Method in interface minestra.collection.IntImmArray
-
Returns whether this array contains the element which is same as specified element.
- contains(long) - Method in interface minestra.collection.LongImmArray
-
Returns whether this array contains the element which is same as specified element.
- contains(String) - Method in interface minestra.resource.I18nResource
-
Deprecated.
Returns whether this resources contains the key.
- copy() - Method in class minestra.text.ResourceSheaf
-
Returns a copied instance.
- copyOf(Properties) - Static method in interface minestra.text.PropsRef
-
- copyOf(Map<String, String>) - Static method in interface minestra.text.PropsRef
-
- create(Locale...) - Static method in interface minestra.resource.I18nResource
-
Deprecated.
Returns an I18nResource.
- create(Class<?>, Locale...) - Static method in interface minestra.resource.I18nResource
-
Deprecated.
Returns an I18nResource.
- create(Package, Locale...) - Static method in interface minestra.resource.I18nResource
-
Deprecated.
Returns an I18nResource.
- create(String, Locale...) - Static method in interface minestra.resource.I18nResource
-
Deprecated.
Returns an I18nResource.
- create() - Static method in class minestra.text.ResourceSheaf
-
Returns an instance created with the default class loader.
- create(ClassLoader) - Static method in class minestra.text.ResourceSheaf
-
Returns an instance created with the specified class loader.
- create(Class<?>) - Static method in class minestra.text.ResourceSheaf
-
Returns an instance created with the specified class and its class loader.
- derive(String, Locale...) - Method in interface minestra.resource.I18nResource
-
Deprecated.
Returns the new I18nResource derived from this I18nResource.
- derive(Class<?>, Locale...) - Method in interface minestra.resource.I18nResource
-
Deprecated.
Returns the new I18nResource derived from this I18nResource.
- derive() - Method in class minestra.text.ResourceSheaf
-
Returns a new instance derived as a child.
- distinct() - Method in interface minestra.collection.DoubleImmArray
-
Returns a new array which consists with unique elements.
- distinct() - Method in interface minestra.collection.ImmArray
-
Returns a new array which consists with unique elements.
- distinct() - Method in interface minestra.collection.IntImmArray
-
Returns a new array which consists with unique elements.
- distinct() - Method in interface minestra.collection.LongImmArray
-
Returns a new array which consists with unique elements.
- DoubleComparator - Interface in minestra.collection
-
A comparator for natural ordering of primitive double
.
- DoubleImmArray - Interface in minestra.collection
-
An immutable array of primitive double
.
- drop(int) - Method in interface minestra.collection.DoubleImmArray
-
Returns the rest of the array that drops the specified number of elements in this array.
- drop(int) - Method in interface minestra.collection.ImmArray
-
Returns the rest of the array that drops the specified number of elements in this array.
- drop(int) - Method in interface minestra.collection.IntImmArray
-
Returns the rest of the array that drops the specified number of elements in this array.
- drop(int) - Method in interface minestra.collection.LongImmArray
-
Returns the rest of the array that drops the specified number of elements in this array.
- dropWhile(DoublePredicate) - Method in interface minestra.collection.DoubleImmArray
-
Returns the rest of the array that drops elements which the specified predicate matches in this array.
- dropWhile(Predicate<? super T>) - Method in interface minestra.collection.ImmArray
-
Returns the rest of the array that drops elements which the specified predicate matches in this array.
- dropWhile(IntPredicate) - Method in interface minestra.collection.IntImmArray
-
Returns the rest of the array that drops elements which the specified predicate matches in this array.
- dropWhile(LongPredicate) - Method in interface minestra.collection.LongImmArray
-
Returns the rest of the array that drops elements which the specified predicate matches in this array.
- filter(DoublePredicate) - Method in interface minestra.collection.DoubleImmArray
-
Returns the result of filtering the elements of this array by specified predicate.
- filter(Predicate<? super T>) - Method in interface minestra.collection.ImmArray
-
Returns the result of filtering the elements of this array by specified predicate.
- filter(IntPredicate) - Method in interface minestra.collection.IntImmArray
-
Returns the result of filtering the elements of this array by specified predicate.
- filter(LongPredicate) - Method in interface minestra.collection.LongImmArray
-
Returns the result of filtering the elements of this array by specified predicate.
- filterMap(Function<? super T, Optional<? extends R>>) - Method in interface minestra.collection.ImmArray
-
Returns an array created by applying a function to each of the filtered elements of this array.
- find(DoublePredicate) - Method in interface minestra.collection.DoubleImmArray
-
Returns an optional value which satisfies specified predicate from the beginning in this array.
- find(DoublePredicate, int) - Method in interface minestra.collection.DoubleImmArray
-
Returns an optional value which satisfies specified predicate after the specified index in this array.
- find(Predicate<? super T>) - Method in interface minestra.collection.ImmArray
-
Returns an optional value which satisfies specified predicate from the beginning in this array.
- find(Predicate<? super T>, int) - Method in interface minestra.collection.ImmArray
-
Returns an optional value which satisfies specified predicate after the specified index in this array.
- find(IntPredicate) - Method in interface minestra.collection.IntImmArray
-
Returns an optional value which satisfies specified predicate from the beginning in this array.
- find(IntPredicate, int) - Method in interface minestra.collection.IntImmArray
-
Returns an optional value which satisfies specified predicate after the specified index in this array.
- find(LongPredicate) - Method in interface minestra.collection.LongImmArray
-
Returns an optional value which satisfies specified predicate from the beginning in this array.
- find(LongPredicate, int) - Method in interface minestra.collection.LongImmArray
-
Returns an optional value which satisfies specified predicate after the specified index in this array.
- flatMap(Function<? super S, ? extends R>) - Method in interface minestra.collection.ImmArray
-
Returns an array created by applying a function to each of the elements of flatten this array.
- flatten() - Method in interface minestra.collection.ImmArray
-
Returns the array of elements to which flattened sub-level containers of this array.
- fold(double, DoubleBinaryOperator) - Method in interface minestra.collection.DoubleImmArray
-
Returns the result of folding the elements of this array by the specified operator.
- fold(T, BinaryOperator<T>) - Method in interface minestra.collection.ImmArray
-
Returns the result of folding the elements of this array by the specified operator.
- fold(int, IntBinaryOperator) - Method in interface minestra.collection.IntImmArray
-
Returns the result of folding the elements of this array by the specified operator.
- fold(long, LongBinaryOperator) - Method in interface minestra.collection.LongImmArray
-
Returns the result of folding the elements of this array by the specified operator.
- forEach(DoubleConsumer) - Method in interface minestra.collection.DoubleImmArray
-
Performs apply function as an action to each element of this array.
- forEach(Consumer<? super T>) - Method in interface minestra.collection.ImmArray
-
Performs apply function as an action to each element of this array.
- forEach(IntConsumer) - Method in interface minestra.collection.IntImmArray
-
Performs apply function as an action to each element of this array.
- forEach(LongConsumer) - Method in interface minestra.collection.LongImmArray
-
Performs apply function as an action to each element of this array.
- format(String, Object...) - Method in interface minestra.text.PropsRef
-
- formatOpt(String, Object...) - Method in interface minestra.text.PropsRef
-
- i(String) - Method in interface minestra.resource.I18nResource
-
Deprecated.
This is an alias of integer(String)
.
- i(String) - Method in interface minestra.text.PropsRef
-
This is an alias of integer(String)
.
- I18nResource - Interface in minestra.resource
-
Deprecated.
- ImmArray<T> - Interface in minestra.collection
-
An immutable array of T
.
- indexOf(T) - Method in interface minestra.collection.ImmArray
-
Returns the index of first element which is same as specified object in this array.
- indexOf(int) - Method in interface minestra.collection.IntImmArray
-
Returns the index of first element which is same as specified value in this array.
- indexOf(long) - Method in interface minestra.collection.LongImmArray
-
Returns the index of first element which is same as specified value in this array.
- indexWhere(DoublePredicate) - Method in interface minestra.collection.DoubleImmArray
-
Returns the index of element which is the first match of the specified predicate in this array.
- indexWhere(Predicate<? super T>) - Method in interface minestra.collection.ImmArray
-
Returns the index of element which is the first match of the specified predicate in this array.
- indexWhere(IntPredicate) - Method in interface minestra.collection.IntImmArray
-
Returns the index of element which is the first match of the specified predicate in this array.
- indexWhere(LongPredicate) - Method in interface minestra.collection.LongImmArray
-
Returns the index of element which is the first match of the specified predicate in this array.
- IntComparator - Interface in minestra.collection
-
A comparator for natural ordering of primitive int
.
- integer(String) - Method in interface minestra.resource.I18nResource
-
Deprecated.
Returns the int value of specified key.
- integer(String, int) - Method in interface minestra.resource.I18nResource
-
Deprecated.
Returns the int value of specified key.
- integer(String) - Method in interface minestra.text.PropsRef
-
Returns the int value of specified key.
- integer(String, int) - Method in interface minestra.text.PropsRef
-
Returns the int value of specified key.
- integerOpt(String) - Method in interface minestra.resource.I18nResource
-
Deprecated.
Returns the int of specified key.
- integerOpt(String) - Method in interface minestra.text.PropsRef
-
Returns the optional int value of specified key.
- integerOpt(String) - Method in class minestra.text.ResourceSheaf
-
Returns the int of specified key.
- IntImmArray - Interface in minestra.collection
-
An immutable array of primitive int
.
- isAbsolute() - Method in class minestra.file.PathString
-
- isEmpty() - Method in interface minestra.collection.DoubleImmArray
-
Returns whether this array is empty.
- isEmpty() - Method in interface minestra.collection.ImmArray
-
Returns whether this array is empty.
- isEmpty() - Method in interface minestra.collection.IntImmArray
-
Returns whether this array is empty.
- isEmpty() - Method in interface minestra.collection.LongImmArray
-
Returns whether this array is empty.
- isTrue(String) - Method in interface minestra.resource.I18nResource
-
Deprecated.
Returns boolean value of specified key.
- isTrue(String) - Method in interface minestra.text.PropsRef
-
Returns boolean value of specified key.
- iterator() - Method in class minestra.file.PathIterator
-
Returns an PathIterator as Iterator.
- iterator() - Method in class minestra.file.PathString
-
- map(DoubleUnaryOperator) - Method in interface minestra.collection.DoubleImmArray
-
Returns an array created by applying a function to each of the elements of this array.
- map(Function<? super T, ? extends R>) - Method in interface minestra.collection.ImmArray
-
Returns an array created by applying a function to each of the elements of this array.
- map(IntUnaryOperator) - Method in interface minestra.collection.IntImmArray
-
Returns an array created by applying a function to each of the elements of this array.
- map(LongUnaryOperator) - Method in interface minestra.collection.LongImmArray
-
Returns an array created by applying a function to each of the elements of this array.
- mapToDouble(ToDoubleFunction<? super T>) - Method in interface minestra.collection.ImmArray
-
Returns a mapped double array created by applying a function to each of the elements of this array.
- mapToDouble(IntToDoubleFunction) - Method in interface minestra.collection.IntImmArray
-
Returns a double array created by applying a function to each of the elements of this array.
- mapToDouble(LongToDoubleFunction) - Method in interface minestra.collection.LongImmArray
-
Returns a double array created by applying a function to each of the elements of this array.
- mapToInt(DoubleToIntFunction) - Method in interface minestra.collection.DoubleImmArray
-
Returns an int array created by applying a function to each of the elements of this array.
- mapToInt(ToIntFunction<? super T>) - Method in interface minestra.collection.ImmArray
-
Returns a mapped int array created by applying a function to each of the elements of this array.
- mapToInt(LongToIntFunction) - Method in interface minestra.collection.LongImmArray
-
Returns an int array created by applying a function to each of the elements of this array.
- mapToLong(DoubleToLongFunction) - Method in interface minestra.collection.DoubleImmArray
-
Returns a long array created by applying a function to each of the elements of this array.
- mapToLong(ToLongFunction<? super T>) - Method in interface minestra.collection.ImmArray
-
Returns a mapped long array created by applying a function to each of the elements of this array.
- mapToLong(IntToLongFunction) - Method in interface minestra.collection.IntImmArray
-
Returns a long array created by applying a function to each of the elements of this array.
- mapToObj(DoubleFunction<R>) - Method in interface minestra.collection.DoubleImmArray
-
Returns an object array created by applying a function to each of the elements of this array.
- mapToObj(IntFunction<R>) - Method in interface minestra.collection.IntImmArray
-
Returns an object array created by applying a function to each of the elements of this array.
- mapToObj(LongFunction<R>) - Method in interface minestra.collection.LongImmArray
-
Returns an object array created by applying a function to each of the elements of this array.
- max() - Method in interface minestra.collection.DoubleImmArray
-
Returns a maximum value as optional in this array.
- max() - Method in interface minestra.collection.IntImmArray
-
Returns a maximum value as optional in this array.
- max() - Method in interface minestra.collection.LongImmArray
-
Returns a maximum value as optional in this array.
- min() - Method in interface minestra.collection.DoubleImmArray
-
Returns a minimum value as optional in this array.
- min() - Method in interface minestra.collection.IntImmArray
-
Returns a minimum value as optional in this array.
- min() - Method in interface minestra.collection.LongImmArray
-
Returns a minimum value as optional in this array.
- minestra.collection - package minestra.collection
-
This package contains classes of collection.
- minestra.file - package minestra.file
-
This package contains classes of relating to files.
- minestra.resource - package minestra.resource
-
This package contains classes of relating to resources.
- minestra.text - package minestra.text
-
This package contains classes of relating to text.
- mtimeAfter(Instant) - Static method in class minestra.file.PathFilter
-
Returns a predicate that checks if the mtime of the file is after the specified time point.
- mtimeBefore(Instant) - Static method in class minestra.file.PathFilter
-
Returns a predicate that checks if the mtime of the file is before the specified time point.
- mtimeBetween(Instant, Instant) - Static method in class minestra.file.PathFilter
-
Returns a predicate that checks if the mtime of the file is between two specified time points.
- of(double...) - Static method in interface minestra.collection.DoubleImmArray
-
Returns a new array of the specified values.
- of(Collection<Double>) - Static method in interface minestra.collection.DoubleImmArray
-
Returns a new array of the specified values.
- of(DoubleStream) - Static method in interface minestra.collection.DoubleImmArray
-
Returns a new array of the specified values.
- of(T...) - Static method in interface minestra.collection.ImmArray
-
Returns a new ImmArray of the specified values.
- of(Collection<T>) - Static method in interface minestra.collection.ImmArray
-
Returns a new ImmArray of the specified collection.
- of(Stream<T>) - Static method in interface minestra.collection.ImmArray
-
Returns a new ImmArray of the specified stream.
- of(int...) - Static method in interface minestra.collection.IntImmArray
-
Returns a new array of the specified values.
- of(Collection<Integer>) - Static method in interface minestra.collection.IntImmArray
-
Returns a new array of the specified values.
- of(IntStream) - Static method in interface minestra.collection.IntImmArray
-
Returns a new array of the specified values.
- of(long...) - Static method in interface minestra.collection.LongImmArray
-
Returns a new array of the specified values.
- of(Collection<Long>) - Static method in interface minestra.collection.LongImmArray
-
Returns a new array of the specified values.
- of(LongStream) - Static method in interface minestra.collection.LongImmArray
-
Returns a new array of the specified values.
- of(Path) - Static method in class minestra.file.PathIterator
-
Returns a PathIterator.
- of(Path, int) - Static method in class minestra.file.PathIterator
-
Returns a PathIterator.
- of(Path) - Static method in class minestra.file.PathString
-
Returns an instance of PathString.
- of(String) - Static method in class minestra.file.PathString
-
Returns an instance of PathString.
- random(int, double, double) - Static method in interface minestra.collection.DoubleImmArray
-
Returns the array of values which are generated by
Random
.
- random(int, int, int) - Static method in interface minestra.collection.IntImmArray
-
Returns the array of values which are generated by
Random
.
- random(int, long, long) - Static method in interface minestra.collection.LongImmArray
-
Returns the array of values which are generated by
Random
.
- range(int, int) - Static method in interface minestra.collection.IntImmArray
-
Returns a new array of generating with the specified range.
- range(int, int, int) - Static method in interface minestra.collection.IntImmArray
-
Returns a new array of generating with the specified range and the specified step.
- reduce(DoubleBinaryOperator) - Method in interface minestra.collection.DoubleImmArray
-
Returns the result that reduce elements of this array with the specified binary operator.
- reduce(double, DoubleBinaryOperator) - Method in interface minestra.collection.DoubleImmArray
-
Returns the result that reduce elements of this array with the specified binary operator.
- reduce(BinaryOperator<T>) - Method in interface minestra.collection.ImmArray
-
Returns the result that reduce elements of this array with the specified binary operator.
- reduce(T, BinaryOperator<T>) - Method in interface minestra.collection.ImmArray
-
Returns the result that reduce elements of this array with the specified binary operator.
- reduce(IntBinaryOperator) - Method in interface minestra.collection.IntImmArray
-
Returns the result that reduce elements of this array with the specified binary operator.
- reduce(int, IntBinaryOperator) - Method in interface minestra.collection.IntImmArray
-
Returns the result that reduce elements of this array with the specified binary operator.
- reduce(LongBinaryOperator) - Method in interface minestra.collection.LongImmArray
-
Returns the result that reduce elements of this array with the specified binary operator.
- reduce(long, LongBinaryOperator) - Method in interface minestra.collection.LongImmArray
-
Returns the result that reduce elements of this array with the specified binary operator.
- register(WatchService, WatchEvent.Kind<?>...) - Method in class minestra.file.PathString
-
- register(WatchService, WatchEvent.Kind<?>[], WatchEvent.Modifier...) - Method in class minestra.file.PathString
-
- relativize(Path) - Method in class minestra.file.PathString
-
- replaceCodePoint(char, char) - Method in interface minestra.collection.IntImmArray
-
Returns new array as code points that this array is replaced by the replacement character.
- replaceCodePoint(String) - Method in interface minestra.collection.IntImmArray
-
Returns new array as code points that this array is replaced by the replacement character.
- resolve(Path) - Method in class minestra.file.PathString
-
- resolve(String) - Method in class minestra.file.PathString
-
- resolveSibling(Path) - Method in class minestra.file.PathString
-
- resolveSibling(String) - Method in class minestra.file.PathString
-
- ResourceSheaf - Class in minestra.text
-
ResourceSheaf
provides to build a sheaf of i18nized message resources.
- REVERSE - Static variable in interface minestra.collection.DoubleComparator
-
The instance of this comparator for the reversed ordering.
- reverse() - Method in interface minestra.collection.DoubleImmArray
-
Returns new array which is reversed the order of elements in this array.
- reverse() - Method in interface minestra.collection.ImmArray
-
Returns new array which is reversed the order of elements in this array.
- REVERSE - Static variable in interface minestra.collection.IntComparator
-
The instance of this comparator for the reversed ordering.
- reverse() - Method in interface minestra.collection.IntImmArray
-
Returns new array which is reversed the order of elements in this array.
- REVERSE - Static variable in interface minestra.collection.LongComparator
-
The instance of this comparator for the reversed ordering.
- reverse() - Method in interface minestra.collection.LongImmArray
-
Returns new array which is reversed the order of elements in this array.
- s(String) - Method in interface minestra.resource.I18nResource
-
Deprecated.
This is an alias of string(String)
.
- s(String) - Method in interface minestra.text.PropsRef
-
This is an alias of string(String)
.
- setErrorHandler(BiConsumer<Exception, Path>) - Method in class minestra.file.PathIterator
-
Set a BiConsumer
object as an error handler.
- setParent(I18nResource) - Method in interface minestra.resource.I18nResource
-
Deprecated.
Sets an I18nResource as its parent.
- size() - Method in interface minestra.collection.DoubleImmArray
-
Returns the number of elements in this array.
- size() - Method in interface minestra.collection.ImmArray
-
Returns the number of elements in this array.
- size() - Method in interface minestra.collection.IntImmArray
-
Returns the number of elements in this array.
- size() - Method in interface minestra.collection.LongImmArray
-
Returns the number of elements in this array.
- sizeBetween(long, long) - Static method in class minestra.file.PathFilter
-
Returns a predicate that checks if the file size is between two specified sizes.
- sizeEQ(long) - Static method in class minestra.file.PathFilter
-
Returns a predicate that checks if the file size equals the specified size.
- sizeGE(long) - Static method in class minestra.file.PathFilter
-
Returns a predicate that checks if the file size is greater than or equals the specified size.
- sizeGT(long) - Static method in class minestra.file.PathFilter
-
Returns a predicate that checks if the file size is greater than the specified size.
- sizeLE(long) - Static method in class minestra.file.PathFilter
-
Returns a predicate that checks if the file size is less than or equals the specified size.
- sizeLT(long) - Static method in class minestra.file.PathFilter
-
Returns a predicate that checks if the file size is less than the specified size.
- slice(int, int) - Method in interface minestra.collection.DoubleImmArray
-
Returns the slice of this array.
- slice(int, int) - Method in interface minestra.collection.ImmArray
-
Returns the slice of this array.
- slice(int, int) - Method in interface minestra.collection.IntImmArray
-
Returns the slice of this array.
- slice(int, int) - Method in interface minestra.collection.LongImmArray
-
Returns the slice of this array.
- sort() - Method in interface minestra.collection.DoubleImmArray
-
Returns new array which is sorted this array in natural order.
- sort() - Method in interface minestra.collection.ImmArray
-
Returns new array which is sorted this array in natural order.
- sort() - Method in interface minestra.collection.IntImmArray
-
Returns new array which is sorted this array in natural order.
- sort() - Method in interface minestra.collection.LongImmArray
-
Returns new array which is sorted this array in natural order.
- sortWith(DoubleComparator) - Method in interface minestra.collection.DoubleImmArray
-
Returns new array which is sorted this array with specified order.
- sortWith(int, int, DoubleComparator) - Method in interface minestra.collection.DoubleImmArray
-
Returns new array which is sorted this array with specified order.
- sortWith(Comparator<T>) - Method in interface minestra.collection.ImmArray
-
Returns new array which is sorted this array with specified order.
- sortWith(IntComparator) - Method in interface minestra.collection.IntImmArray
-
Returns new array which is sorted this array with specified order.
- sortWith(int, int, IntComparator) - Method in interface minestra.collection.IntImmArray
-
Returns new array which is sorted this array with specified order.
- sortWith(LongComparator) - Method in interface minestra.collection.LongImmArray
-
Returns new array which is sorted this array with specified order.
- sortWith(int, int, LongComparator) - Method in interface minestra.collection.LongImmArray
-
Returns new array which is sorted this array with specified order.
- splitWords(String) - Static method in class minestra.text.LetterCaseConverter
-
Splits a string by words.
- startsWith(Path) - Method in class minestra.file.PathString
-
- startsWith(String) - Method in class minestra.file.PathString
-
- stream() - Method in interface minestra.collection.DoubleImmArray
-
Returns the stream which consist same elements in this array.
- stream() - Method in interface minestra.collection.ImmArray
-
Returns the stream which consist same elements in this array.
- stream() - Method in interface minestra.collection.IntImmArray
-
Returns the stream which consist same elements in this array.
- stream() - Method in interface minestra.collection.LongImmArray
-
Returns the stream which consist same elements in this array.
- streamOf(Path) - Static method in class minestra.file.PathIterator
-
Returns a PathIterator as Stream.
- streamOf(Path, int) - Static method in class minestra.file.PathIterator
-
Returns a PathIterator as Stream.
- string(String) - Method in interface minestra.resource.I18nResource
-
Deprecated.
Returns the string of specified key.
- string(String, String) - Method in interface minestra.resource.I18nResource
-
Deprecated.
Returns the string of specified key.
- string(String) - Method in interface minestra.text.PropsRef
-
Returns the string of specified key.
- string(String, String) - Method in interface minestra.text.PropsRef
-
Returns the string of specified key.
- stringOpt(String) - Method in interface minestra.resource.I18nResource
-
Deprecated.
Returns the Optional string of specified key.
- stringOpt(String) - Method in interface minestra.text.PropsRef
-
Returns the Optional string of specified key.
- stringOpt(String) - Method in class minestra.text.ResourceSheaf
-
Returns the Optional string of specified key.
- subpath(int, int) - Method in class minestra.file.PathString
-
- sum() - Method in interface minestra.collection.DoubleImmArray
-
Returns the sum of elements in this array.
- sum() - Method in interface minestra.collection.IntImmArray
-
Returns the sum of elements in this array.
- sum() - Method in interface minestra.collection.LongImmArray
-
Returns the sum of elements in this array.
- tail() - Method in interface minestra.collection.DoubleImmArray
-
Returns the tail elements of this array if exists.
- tail() - Method in interface minestra.collection.ImmArray
-
Returns the tail elements of this array if exists.
- tail() - Method in interface minestra.collection.IntImmArray
-
Returns the tail elements of this array if exists.
- tail() - Method in interface minestra.collection.LongImmArray
-
Returns the tail elements of this array if exists.
- take(int) - Method in interface minestra.collection.DoubleImmArray
-
Returns a new array of elements that taken out the specified number of from the beginning of this array.
- take(int) - Method in interface minestra.collection.ImmArray
-
Returns a new array of elements that taken out as many as specified number from the beginning of this array.
- take(int) - Method in interface minestra.collection.IntImmArray
-
Returns a new array of elements that taken out the specified number of from the beginning of this array.
- take(int) - Method in interface minestra.collection.LongImmArray
-
Returns a new array of elements that taken out the specified number of from the beginning of this array.
- takeWhile(DoublePredicate) - Method in interface minestra.collection.DoubleImmArray
-
Returns a new array of elements that taken out while specified predicate matches from the beginning of this array.
- takeWhile(Predicate<? super T>) - Method in interface minestra.collection.ImmArray
-
Returns a new array of elements that taken out only while the specified predicate matches from the beginning of this array.
- takeWhile(IntPredicate) - Method in interface minestra.collection.IntImmArray
-
Returns a new array of elements that taken out while specified predicate matches from the beginning of this array.
- takeWhile(LongPredicate) - Method in interface minestra.collection.LongImmArray
-
Returns a new array of elements that taken out while specified predicate matches from the beginning of this array.
- toAbsolutePath() - Method in class minestra.file.PathString
-
- toArray() - Method in interface minestra.collection.DoubleImmArray
-
Returns this array as a native array.
- toArray() - Method in interface minestra.collection.ImmArray
-
Returns this array as a native array.
- toArray(IntFunction<T[]>) - Method in interface minestra.collection.ImmArray
-
Returns this array as a native array.
- toArray() - Method in interface minestra.collection.IntImmArray
-
Returns this array as a native array.
- toArray() - Method in interface minestra.collection.LongImmArray
-
Returns this array as a native array.
- toCamelCase(String) - Static method in class minestra.text.LetterCaseConverter
-
Converts a string to camel case.
- toChainCase(String) - Static method in class minestra.text.LetterCaseConverter
-
Converts a string to chain case.
- toFile() - Method in class minestra.file.PathString
-
- toList() - Method in interface minestra.collection.ImmArray
-
Returns the list which consists same elements in this array.
- toMapWithKey(Function<? super T, ? extends R>) - Method in interface minestra.collection.ImmArray
-
Returns the map that is created with each element as value and the key generated by specified generator.
- toMapWithValue(Function<? super T, ? extends R>) - Method in interface minestra.collection.ImmArray
-
Returns the map that is created with each element as key and the value generated by specified generator.
- toPascalCase(String) - Static method in class minestra.text.LetterCaseConverter
-
Converts a string to pascal case.
- toRealPath(LinkOption...) - Method in class minestra.file.PathString
-
- toResourceBundle() - Method in class minestra.text.ResourceSheaf
-
Returns an instance of ResourceBundle based on this instance.
- toResourceName(Class<?>) - Static method in interface minestra.resource.I18nResource
-
Deprecated.
Returns the resource name which converts from the specified Class.
- toResourceName(Package) - Static method in interface minestra.resource.I18nResource
-
Deprecated.
Returns the resource name which converts from the specified Package.
- toSet() - Method in interface minestra.collection.ImmArray
-
Returns the set which consists same elements in this array.
- toSnakeCase(String) - Static method in class minestra.text.LetterCaseConverter
-
Converts a string to snake case.
- toString() - Method in class minestra.file.PathString
-
- toString() - Method in class minestra.text.ResourceSheaf
-
- toStringArray() - Method in interface minestra.collection.ImmArray
-
Returns this array as a native string array.
- toStringAsCodePoints() - Method in interface minestra.collection.IntImmArray
-
Returns the result that this operation converts this array into string, as code points.
- toUri() - Method in class minestra.file.PathString
-


IEEE-VIT conducted a webinar on 'Quantum Computing' by Dr.Samir Yerpude on 6th of September 2020. The webinar was introduction to the field of Quantum Computing and applications related to it.The webinar emphasized information on what Quantum Computers can do, the basic
difference between Classical computer,Quantum Computer and a Supercomputer, the growth in the field, the opportunities in the field. Also, the webinar made the participants familiar with the terminologies related to the field. The event was a grand success with participation of more than a hundred candidates..
IEEE-VIT conducted a hands-on workshop on 'Gesture Controlled Gaming using OpenCV' on 20th of September 2020. The participants were taught the basics of python along with the basics needed for the workshop.At the end of the virtual session, the participants were able to develop a mini project in which , by using the concepts taught during the session the participants were able to control a virtual game with the help of gestures.The event received a great response and feedback from the participants..
IEEE-VIT in collaboration with IEEE SPIT and IEEE APSIT celebrated IEEE day on 18th of October 2020. The event was based on exciting game rounds filled with fun and technology. It was held on Google Meet platform and consisted of four rounds which included the basic quiz, Puzzle round, Treaure Hunt and lastly the programming round. The students across three colleges participated in a group of 3. There were cash prizes to the first three winning teams.