Version control is the practice of recording and saving all the different versions of a project that might be created over the course of development. It is important to use version control so that we a) don't lose our shit, and have something to revert back to in case of stupidity; b) can see all the poor decisions that led us to our current state of being; c) can properly blame those responsible for f-ing up. Or, you know, the opposite, if you're feeling positive. We can a) go back to more streamlined versions of our product, if we decide retrospectively that certain features were 'not conducive to our product vision'; b) inspire everyone with our progress, and impress them with the number of commits we've made to get to our glorious present state; and c) heartily congratulate those who have contributed such spectacularly clean and beautiful code to our mother-load (or perhaps destroyed some heinous bug that was severely impacting our performance capabilities).
git - as a #1 a-ok version control system invented by the genius Linus Torvalds (after whom Linux is named) - can help us do all of these things.  AND, speaking of places to which we push code (or you know, blog posts), GitHub is a polished, popular, well-supported open-source project that can house all of your 'code in the clouds.' And since we like polished, popular, open-source stuff, we shall use it!
I find it easiest to understand the inner workings of the git system through understanding the commands, so here are my notes on what git does:
file tracked
When you create a new file, you need to 'git add' for changes to be tracked. Once you have added the file, changes are constantly tracked even if you haven't added them to the staging environment yet.
file modified
Modifications are changes in tracked files that have not yet been added to the stage.
git add
Once you add files to the staging environment, they are pre-packaged to be in your next commit unless removed. To remove, type 'git reset HEAD'.
git commit
When you make a commit, you are essentially saying, "Ok, these changes are substantial and/or polished enough to be a new version of this project." Commits are synonymous with versions. They are local to the branch you are working on - i.e. you are creating a new version of your local branch. They must be manually merged up the chain (or down as we shall see).
git fetch
If you are working on a team, it is quite possible that someone else has been working on the same thing and has submitted work upstream. Thus, it is important to make sure that you have the most recent version of a branch before you begin working. Fetching a branch means, "Give me all the updates that have been made to this branch since I last looked at it."
git merge
Following from fetch, merge means "Now merge all these updates into my local copy so mine is completely up to date."
Coincidentally, merge is also used to get changes downstream. So, you could be in your local master copy and say, "git merge downstream_branch," and thereby retrieve changes made a level below you. For example, say you're working on a new feature, and after much work, it is done and you have a 'final' commit. You then want to merge that feature up into your main (or master) branch. Too bad! It doesn't work that way. Sort of counter-intuitively, you have to merge down, not up. So, you make sure your feature branch is all clean and tidy, and then you go into master. From master, you say 'git merge feature-branch.' This then pulls your new feature code up into the master.
git pull
'git pull' basically combines fetch and merge into one step. Instead of saying, "Let me see these updates upstream and then merge then, let's do it all at once."
This also makes sense when you think about pull requests. Say you're the administrator for THE master code branch of some software. As we learned above, your devs are not allowed to just merge their code up into your master branch. What if it was buggy and caused a big problem? You have to grab their changes below and merge them in once you're sure it works properly. It's top down, buddy; no messing around without proper review!  Hence pull requests.
Note: When you're working locally on your own computer, you have control of both the local 'master' and the downstream branches. Thus, you can act as your own admin and dev.
git rebase
Rebase is essentially another way - besides merge - to put two different commits together. While merge takes branches and squishes them together, rebase has a slightly more elegant approach. For example, you have been working on a feature intensely, and you haven't checked the master branch in a while. When you do fetch those updates, you see the master branch has progressed quite a bit. So, you can choose to merge those updates into your local version, sort of squishing them down on top - the old master, then all your changes/commits, then all the new stuff - and then creating a brand new commit with all three. OR, you can rebase (literally, re - base: as in, put your changes on a new code base) your feature. When you rebase, instead of squishing all these versions together, git is picking up all your commits off the old code base, copying them (yes, they're NEW now), and putting them down on top of the new code base - to make a fancy new updated feature branch.
The upside to rebasing is that it keeps your project history nice and linear. The downside is that you can't rebase commits that have already been pushed into a public repository. Git is getting rid of those old commits and making new ones, so it would look like part of your project history vanished.
git push
Pushing means you are leaving your local environment and pushing your work into a public repository, like those on Github.
HEAD
A HEAD is a commit. Just HEAD means the current commit - the one you're working on. HEAD^ means the last one, that you just made. HEAD-n means the nth head ago. These prior commits are sometimes called 'parents.'
.
The dot. Also called source. It means the current location or starting right here, where you are. '. .' means up to your parent location - where you are and then were you were before that. Hence, 'cd ..' . Also, './continue/on/this/path' means starting here, continue along this path.
Semi-confusingly, if you put a shell script after . it means 'execute this script, please.' So, there you go.
---As I am just figuring out all of this stuff, please don't be too harsh if I got something wrong - but please do let me know. Living in ignorance is no good.
Awesome resource: https://www.atlassian.com/git/tutorials


GREATWALL HOME SERVICES SERVES KITCHENER, WATERLOO, CAMBRIDGE, GUELPH
Specialties, Brands, Products & Services of Greatwall Home Services
Plumbing Specialties
Blocked Sewer, Drain cleaning, Faucet repair, Faucet replacement, Toilet repair, Toilet replacement, Waterline leaks, Drain leaks, Water softeners, Water treatment/reverse osmosis, Dishwasher installations.
Brands Offered
Moen, Mirolin, Mansfield, Krohler, Kindred, Rehau, Nova, Greenway, Can Save Cabinetry
Products Offered
Faucets, Tubs & Showers, Toilets, Water Softeners, R.O.drinking water system, Hot Water Heaters, Kitchen Sinks, Pex pipe, VanitiesServices Offered
Blocked Sewer, Drain cleaning, Faucet repair/replacement, Toilet repair/replacement, Waterline leaks, Drain leaks, Hot water heaters, Water softeners, Water treatment /reverse osmosis, Dishwasher installations.
Medora
The MedoraTM faucet's stunning design is matched only by its efficient functionality. Combining the best of all worlds with easy-to-use pullout functionality and a striking design, Medora creates a one-of-a-kind visual impact in the kitchen.
- chrome finish
- high-arc spout provides more clearance
- pulldown
- one-handle lever design for ease of use
- aerated stream; powerful rinse; patented pause function
- conventional deck mount design
- ADA compliant
- limited lifetime warranty
Extensa
- chrome finish
- low-arc spout design for conventional styling
- pullout spout
- one-handle lever design for ease of use
- powerful rinse; aerated stream
- conventional deck mount design
- ADA compliant
- limited lifetime warranty


For more complicated problems you might want to change the output more
drastically. In this case you have to write and use your own
visualizers, which could naturally be problem specific, not like
fdbg_show/2
and fdbg_label_show/3
. As we described
earlier, currently there are two types of visualizers:
MyGlobalVisualizer([+Arg1, +Arg2, ...] +Constraint, +Actions)
This visualizer is passed in the constraint_hook
option. It must
have at least two arguments, these are the following:
Other arguments can be used for any purpose, for example to select the verbosity level of the visualizer. This way you don't have to modify your code if you would like to see less or more information. Note however, that the two obligatory arguments must appear at the end of the argument list.
When passing as an option to fdbg_on/1
, only the optional
arguments have to be specified; the two mandatory arguments
should be omitted. See FDBG Debugging Global Constraints, for an
example.
MyLabelingVisualizer([+Arg1, +Arg2, ...] +Event, +ID, +Var)
This visualizer is passed in the labeling_hook
option. It must
have at least three arguments, these are the following:
library(clpfd)
's labeling
predicates (in this case, simply print it—FDBG will know how to
handle it) or by you; see FDBG Annotation.
The failure of a visualizer is ignored and multiple choices are cut by FDBG. Exceptions, on the other hand, are not caught.
FDBG provides several predicates to ease the work of the visualizer writers. These predicates are the following:
fdbg_annotate(
+Term0,
-Term,
-Variables)
fdbg_annotate(
+Term0,
+Actions,
-Term,
-Variables)
fdvar(Name, Var, FDSet)
fdbg_legend(
+Vars)
fdvar/3
compound terms returned by fdbg_annotate/[3,4]
.
fdbg_legend(
+Vars,
+Actions)


HtmlEncode[[City_1]]
HtmlEncode[[Address]]
HtmlEncode[[Address_1]]
;
HtmlEncode[[Password]]
HtmlEncode[[PhoneNumber]]
HtmlEncode[[Employee.Name]]
HtmlEncode[[Gender]]
Female
Male
HtmlEncode[[OfficeNumber]]
HtmlEncode[[1001]]
HtmlEncode[[1002]]


WITNESS LIST Economic Development Committee April 27, 1999-9:00A SB 168 FOR: Rose, Mark (LCRA), Austin SB 215 Registering, but not testifying: For: Martinez, Joseph (United Way of Texas), Austin SB 1214 Registering, but not testifying: For: Yawn, Larry (Houston I.S.D.), Houston SB 1269 FOR: Risk, Raymond (Texas Construction Association), Austin Registering, but not testifying: For: Bruns, Richard (Texas State Wall & Ceiling Association), Sugarland Cochren, Joel (National Electrical Contractors Association), Austin Jones, Nancy (Texas Air Conditioning Contractors Association), Austin McFarland, Kathy (Texas Masonry Council), Austin Reynolds, Jim (Mechanical Contractors Association of Texas), Austin Against: Bowen, Floyd (Exxon Corporation), Austin SB 1274 Registering, but not testifying: For: Cochren, Joel (National Electric Contractors Association), Austin Jones, Nancy (Texas Air Conditioning Contractors Association), Austin Looney, Stacy (Independent Electrical Contractors of Texas), Austin McFarland, Kathy (Texas Masonry Council), Austin Reynolds, Jim (Mechanical Contractors Association of Texas), Austin Risk, Raymond (Texas Construction Association), Austin SB 1792 Registering, but not testifying: For: Schneider, Rob (Consumers Union), Austin Against: Geiger, Richard (Association of Fire & Casualty Companies in Texas), Dallas Huxel, Bob (Farmers Insurance Group), Austin Simpson, Robert (State Farm Insurance Companies), Austin On: Bordelon, Rod (Office of Public Insurance Counsel), Austin Durden, David (Texas Department of Insurance), Austin SB 1884 ON: Jacks, Tommy (Texas Trial Lawyers Association), Austin Myron, Rhonda (Texas Department of Insurance), Austin Registering, but not testifying: For: Leiferman, Cynthia (Advocacy, Inc.), Austin


You should use
MSG_META_GCN_LIST_REMOVE
to remove an object from an application GCN list. You must pass the routine the notification ID (
yourCompanyName
AppGCNListTypes
and Manufacturer ID) and the optr of the object to remove. Note that the optr of the object in question will only be removed from the list of the particular change specified. If the optr is on several GCN lists, those other lists will remain unchanged.
An object or process in the course of dying must remove itself from all GCN lists that it is currently on, both from the system and from an application. You should therefore keep track of all GCN lists you add a particular object to. It is usually convenient for a process to remove itself from these lists within its
MSG_GEN_PROCESS_CLOSE_APPLICATION
message handler or for an object to remove itself at
MSG_META_DETACH
time.
Code Display 9-8 Removing from an Application GCN List
@method MyProcessClass, MSG_GEN_PROCESS_CLOSE_APPLICATION {
@send MyApplication::MSG_META_GCN_LIST_REMOVE( MyObject, /* optr to remove from list. */ yourCompanyName_NT_CUSTOM_LIST_ONE, /* list to remove object from. */ /* Manufacturer ID of list to remove object from. */ MANUFACTURER_ID_yourCompanyName);
@callsuper; }


deployed
by None at 2022-12-14 11:30:07.referenced
by Christina Chortaria at 2022-12-14 11:31:47.merged
by Christina Chortaria at 2022-12-14 11:31:47.closed
by Christina Chortaria at 2022-12-14 11:31:47.head_ref_deleted
by Christina Chortaria at 2022-12-14 11:31:48.referenced
by Christina Chortaria at 2022-12-14 11:32:09.merged
by Christina Chortaria at 2022-12-14 11:32:09.closed
by Christina Chortaria at 2022-12-14 11:32:09.head_ref_deleted
by Christina Chortaria at 2022-12-14 11:32:10.head_ref_deleted
by Jane Sandberg at 2022-12-14 18:22:24.deployed
by None at 2022-12-14 19:14:29.referenced
by Christina Chortaria at 2022-12-14 22:38:51.merged
by Christina Chortaria at 2022-12-14 22:38:51.closed
by Christina Chortaria at 2022-12-14 22:38:51.head_ref_deleted
by Christina Chortaria at 2022-12-14 22:38:52.labeled
by None at 2022-12-14 05:23:51.labeled
by None at 2022-12-14 05:23:51.labeled
by None at 2022-12-14 14:46:11.labeled
by None at 2022-12-14 14:46:11.head_ref_force_pushed
by Jane Sandberg at 2022-12-13 23:03:32.deployed
by None at 2022-12-13 23:03:53.head_ref_force_pushed
by Jane Sandberg at 2022-12-13 23:14:51.head_ref_force_pushed
by Jane Sandberg at 2022-12-13 23:16:30.deployed
by None at 2022-12-14 11:37:19.referenced
by Christina Chortaria at 2022-12-14 11:47:26.merged
by Christina Chortaria at 2022-12-14 11:47:26.closed
by Christina Chortaria at 2022-12-14 11:47:26.head_ref_deleted
by Christina Chortaria at 2022-12-14 11:47:27.closed
by Christina Chortaria at 2022-12-14 11:47:27.@dependabot rebase
Looks like this PR is already up-to-date with main! If you'd still like to recreate it from scratch, overwriting any edits, you can request @dependabot recreate
.
labeled
by None at 2022-12-14 14:41:03.labeled
by None at 2022-12-14 14:41:03.mentioned
by Dependabot at 2022-12-14 22:41:05.deployed
by None at 2022-12-14 22:46:47.referenced
by Christina Chortaria at 2022-12-14 22:49:40.merged
by Christina Chortaria at 2022-12-14 22:49:40.closed
by Christina Chortaria at 2022-12-14 22:49:40.head_ref_deleted
by Christina Chortaria at 2022-12-14 22:49:41.@dependabot rebase
Looks like loofah is up-to-date now, so this is no longer needed.
mentioned
by Dependabot at 2022-12-14 11:47:44.head_ref_force_pushed
by None at 2022-12-14 11:48:19.closed
by None at 2022-12-14 22:50:17.head_ref_deleted
by None at 2022-12-14 22:50:19.labeled
by None at 2022-12-14 15:00:26.closed
by None at 2022-12-14 16:53:19.assigned
by None at 2022-12-14 16:54:35.labeled
by None at 2022-12-14 18:33:36.closed
by None at 2022-12-14 18:33:44.deployed
by None at 2022-12-14 18:11:16.referenced
by Jane Sandberg at 2022-12-14 18:13:09.merged
by Jane Sandberg at 2022-12-14 18:13:09.closed
by Jane Sandberg at 2022-12-14 18:13:09.head_ref_deleted
by Jane Sandberg at 2022-12-14 18:13:10.head_ref_force_pushed
by None at 2022-12-14 18:14:15.referenced
by Christina Chortaria at 2022-12-14 22:52:04.merged
by Christina Chortaria at 2022-12-14 22:52:04.closed
by Christina Chortaria at 2022-12-14 22:52:04.head_ref_deleted
by Christina Chortaria at 2022-12-14 22:52:05.@dependabot rebase
labeled
by None at 2022-12-14 18:14:43.mentioned
by Dependabot at 2022-12-14 22:52:20.head_ref_force_pushed
by None at 2022-12-14 22:52:55.referenced
by Christina Chortaria at 2022-12-14 23:59:22.merged
by Christina Chortaria at 2022-12-14 23:59:22.closed
by Christina Chortaria at 2022-12-14 23:59:22.head_ref_deleted
by Christina Chortaria at 2022-12-14 23:59:23.deployed
by None at 2022-12-14 20:47:12.referenced
by Trey Pendragon at 2022-12-14 21:20:47.merged
by Trey Pendragon at 2022-12-14 21:20:47.closed
by Trey Pendragon at 2022-12-14 21:20:47.head_ref_deleted
by Trey Pendragon at 2022-12-14 21:20:48.referenced
by None at 2022-12-14 16:09:36.merged
by None at 2022-12-14 16:09:37.closed
by None at 2022-12-14 16:09:37.head_ref_deleted
by None at 2022-12-14 16:09:41.labeled
by None at 2022-12-14 14:46:10.labeled
by None at 2022-12-14 14:46:10.renamed
by Kim Leaman at 2022-12-14 13:55:24.labeled
by Kim Leaman at 2022-12-14 14:01:40.labeled
by Kim Leaman at 2022-12-14 15:46:45.referenced
by None at 2022-12-14 21:56:05.merged
by None at 2022-12-14 21:56:05.closed
by None at 2022-12-14 21:56:05.head_ref_deleted
by None at 2022-12-14 21:56:06.assigned
by Trey Pendragon at 2022-12-14 21:08:08.referenced
by Trey Pendragon at 2022-12-14 21:13:52.closed
by None at 2022-12-14 21:56:06.This has been confirmed as resolved by Digital Science.
closed
by James R. Griffin III at 2022-12-14 16:28:45.Display properties of cloud vs local version.
What properties need to be compared? The fixity status and last fixity event?
For the first part of this ticket, here's an idea. Thoughts?
I was looking for our Preservation Policy, to make sure that it's reflected in this design as per the goals of this ticket, but I can't find it. Do we have a Preservation Policy? I was particularly interested in whether the Local and Cloud fixity are run simultaneously for a resource, or if they are independent and randomized (i.e., cloud fixity is run, but local may not be checked for quite some time or at all, and vice-versa).
I'm not sure about a Preservation Policy. But the checks are run independently. For cloud fixity we run a random selection of resources per day. For local fixity we (plan to) run the least-recently-checked file sets as continuously as we can.
For this design, I like that it adds more language to explain what the numbers mean. I also like that the icons give a more wholistic sense of the status. I like the addition of the link to repair. I'm not entirely sure about the use of the word "originals" here. And from both an implementation and a user standpoint, I don't know exactly what this date means, since the files may have been checked on different dates. It may help to have what you called a Preservation Policy, or just user-facing documentation of how we check fixity.
assigned
by Shaun Ellis at 2022-12-14 14:32:55.labeled
by None at 2022-12-14 16:25:03.assigned
by Eliot Jordan at 2022-12-14 17:56:06.referenced
by None at 2022-12-14 19:21:01.merged
by None at 2022-12-14 19:21:01.closed
by None at 2022-12-14 19:21:01.head_ref_deleted
by None at 2022-12-14 19:21:02.assigned
by Trey Pendragon at 2022-12-14 18:13:58.closed
by None at 2022-12-14 19:21:02.referenced
by Trey Pendragon at 2022-12-14 19:30:24.merged
by Trey Pendragon at 2022-12-14 19:30:24.closed
by Trey Pendragon at 2022-12-14 19:30:24.head_ref_deleted
by Trey Pendragon at 2022-12-14 19:30:25.closed
by Trey Pendragon at 2022-12-14 19:30:25.renamed
by Trey Pendragon at 2022-12-14 19:40:59.What are non-primary files? The UI should probably indicate that we are intentionally not preserving them, right? And how do I get to this screen? I can't seem to figure out where it exists.
There's one primary file per file set, determined by the following algorithm: https://github.com/pulibrary/figgy/blob/7d4a77a9e94c88e58bc4f9915b53bb770f73a816/app/models/file_set.rb#L94-L102
Any other file on that file set is non-primary. Yes, I agree we should make it clear that they're intentionally not preserved.
To get to a file set show page from any resource, click on "file manager" and then select one of the edit / popout icons on one of the files in the list (top right corner of each file card).
assigned
by Shaun Ellis at 2022-12-14 20:29:45.Try moving fallback logic from wayfinder into the custom query. Use a right outer join to get both the current event and the value of the primary file's fixity status. then select the right row conditionally (the event if it exists, otherwise the other one) and count them.
This will be blocked on #5589
labeled
by Christina Chortaria at 2022-12-14 12:09:29.labeled
by None at 2022-12-14 14:47:19.labeled
by None at 2022-12-14 14:46:06.assigned
by Trey Pendragon at 2022-12-14 21:25:59.referenced
by Trey Pendragon at 2022-12-14 22:13:57.deployed
by None at 2022-12-14 22:15:30.From the logs (see https://lib-jobs.princeton.edu/data_sets/5026), it looks like an attempt is being made to process the renewals, but the items aren't found. Perhaps code is pointing to the Alma sandbox?
It looks like I also need to update the URL in the partner parameters to be https://lib-jobs.princeton.edu/ncip-renew.
The issue seems to be not involving SCSB, since the renewals are for items that are in Alma (partner items get put into Alma). It's possible the URL doesn't actually do anything, but it's a value that is in the Alma UI for resource sharing partners.
But lib-jobs uses the NCIP protocol to process renewals that are captured by Alma Analytics. So I'm wondering what endpoint lib-jobs is using for those NCIP messages.
I believe it has been using https://princeton.alma.exlibrisgroup.com/view/NCIPServlet as the endpoint.
I believe the response from the endpoint for each of the non-renewed items is just "Unknown Item". I've looked for the barcodes in Alma and they appear to be present as Location: "Borrowing Resource Sharing Requests" (see, e.g., barcode CU56955006; barcode<PHONE_NUMBER>9956)
Between the working and non-working runs of this rake task (12/4 - 12/5), the headers on the CSV built by Alma changed from Barcode,Patron Group,Expiry Date,Primary Identifier
to Barcode,Patron Group,Expiry Date,User Primary Identifier
, meaning that all the user_id's were not set.
I have updated the headers for the CSV, so we will see if that makes it work when this runs the next time. If it does, will it work if I manually modify all the files generated since 12/4 to fix the header and then remove .processed
from each filename?
I have updated the headers for the CSV, so we will see if that makes it work when this runs the next time. If it does, will it work if I manually modify all the files generated since 12/4 to fix the header and then remove
.processed
from each filename?
Yes, I believe if you modified those files to correct the header and remove the .processed
, then they would be processed correctly the next time the rake task was run, either by the cron job, or by a developer.
mentioned
by Christina Chortaria at 2022-12-14 18:01:37.subscribed
by Christina Chortaria at 2022-12-14 18:01:37.assigned
by Max Kadel at 2022-12-14 19:53:24.labeled
by Max Kadel at 2022-12-14 19:53:36.referenced
by Christina Chortaria at 2022-12-14 22:50:46.merged
by Christina Chortaria at 2022-12-14 22:50:46.closed
by Christina Chortaria at 2022-12-14 22:50:46.head_ref_deleted
by Christina Chortaria at 2022-12-14 22:50:48.@dependabot rebase
labeled
by None at 2022-12-14 14:39:18.labeled
by None at 2022-12-14 14:39:18.mentioned
by Dependabot at 2022-12-14 22:51:12.head_ref_force_pushed
by None at 2022-12-14 22:51:41.referenced
by Christina Chortaria at 2022-12-14 22:56:32.merged
by Christina Chortaria at 2022-12-14 22:56:32.closed
by Christina Chortaria at 2022-12-14 22:56:32.head_ref_deleted
by Christina Chortaria at 2022-12-14 22:56:33.labeled
by None at 2022-12-14 14:46:07.labeled
by None at 2022-12-14 14:46:07.assigned
by Jane Sandberg at 2022-12-14 19:21:03.deployed
by None at 2022-12-14 19:23:02.referenced
by Jane Sandberg at 2022-12-14 19:24:27.merged
by Jane Sandberg at 2022-12-14 19:24:27.closed
by Jane Sandberg at 2022-12-14 19:24:27.head_ref_deleted
by Jane Sandberg at 2022-12-14 19:24:28.labeled
by None at 2022-12-14 14:47:20.deployed
by None at 2022-12-14 19:25:06.referenced
by Jane Sandberg at 2022-12-14 19:26:03.merged
by Jane Sandberg at 2022-12-14 19:26:03.closed
by Jane Sandberg at 2022-12-14 19:26:03.head_ref_deleted
by Jane Sandberg at 2022-12-14 19:26:04.deployed
by None at 2022-12-14 20:24:45.deployed
by None at 2022-12-14 20:30:45.referenced
by Christina Chortaria at 2022-12-14 22:39:47.merged
by Christina Chortaria at 2022-12-14 22:39:47.closed
by Christina Chortaria at 2022-12-14 22:39:47.head_ref_deleted
by Christina Chortaria at 2022-12-14 22:39:48.labeled
by None at 2022-12-14 08:55:04.labeled
by None at 2022-12-14 08:55:04.labeled
by None at 2022-12-14 13:36:21.labeled
by None at 2022-12-14 13:36:21.Superseded by #91.
closed
by None at 2022-12-14 13:36:24.head_ref_deleted
by None at 2022-12-14 13:36:25.labeled
by None at 2022-12-14 14:31:54.labeled
by None at 2022-12-14 14:31:54.Coverage increased (+0.02%) to 94.515% when pulling 151dd4da9faff41babfc2ee47b417f0aacbace2e on update-ruby-3.1 into eb61d60e7c4f67c49489176e31c569c125202ab3 on main.
Draft pr until ansible work is done.
When approved please don't merge until the maintenance window where we will do the switch.
head_ref_force_pushed
by Christina Chortaria at 2022-12-13 23:25:13.head_ref_force_pushed
by Christina Chortaria at 2022-12-14 02:54:51.head_ref_force_pushed
by Christina Chortaria at 2022-12-14 02:57:40.deployed
by None at 2022-12-14 21:30:02.ready_for_review
by Christina Chortaria at 2022-12-14 21:35:36.labeled
by None at 2022-12-14 06:04:16.labeled
by None at 2022-12-14 10:31:21.Superseded by #44.
closed
by None at 2022-12-14 10:31:23.head_ref_deleted
by None at 2022-12-14 10:31:24.Looks great!
referenced
by Bess Sadler at 2022-12-13 22:18:25.merged
by Bess Sadler at 2022-12-13 22:18:25.closed
by Bess Sadler at 2022-12-13 22:18:25.head_ref_deleted
by Bess Sadler at 2022-12-13 22:18:26.referenced
by Bess Sadler at 2022-12-13 22:18:57.merged
by Bess Sadler at 2022-12-13 22:18:57.closed
by Bess Sadler at 2022-12-13 22:18:57.head_ref_deleted
by Bess Sadler at 2022-12-13 22:18:58.referenced
by Bess Sadler at 2022-12-13 22:19:53.merged
by Bess Sadler at 2022-12-13 22:19:53.closed
by Bess Sadler at 2022-12-13 22:19:53.head_ref_deleted
by Bess Sadler at 2022-12-13 22:19:53.referenced
by Bess Sadler at 2022-12-13 22:20:55.merged
by Bess Sadler at 2022-12-13 22:20:55.closed
by Bess Sadler at 2022-12-13 22:20:55.head_ref_deleted
by Bess Sadler at 2022-12-13 22:20:56.closed
by Bess Sadler at 2022-12-13 22:20:56.referenced
by Bess Sadler at 2022-12-14 00:45:03.merged
by Bess Sadler at 2022-12-14 00:45:03.closed
by Bess Sadler at 2022-12-14 00:45:03.head_ref_deleted
by Bess Sadler at 2022-12-14 00:45:04.closed
by Bess Sadler at 2022-12-14 00:45:04.referenced
by Bess Sadler at 2022-12-14 13:02:41.merged
by Bess Sadler at 2022-12-14 13:02:41.closed
by Bess Sadler at 2022-12-14 13:02:41.head_ref_deleted
by Bess Sadler at 2022-12-14 13:02:42.closed
by Bess Sadler at 2022-12-14 13:02:42.referenced
by Bess Sadler at 2022-12-14 13:05:52.merged
by Bess Sadler at 2022-12-14 13:05:52.closed
by Bess Sadler at 2022-12-14 13:05:52.head_ref_deleted
by Bess Sadler at 2022-12-14 13:05:53.referenced
by Bess Sadler at 2022-12-14 13:10:20.merged
by Bess Sadler at 2022-12-14 13:10:20.closed
by Bess Sadler at 2022-12-14 13:10:20.head_ref_deleted
by Bess Sadler at 2022-12-14 13:10:21.closed
by Bess Sadler at 2022-12-14 13:10:22.assigned
by None at 2022-12-14 14:19:57.referenced
by None at 2022-12-14 14:47:56.referenced
by None at 2022-12-14 14:51:12.referenced
by Bess Sadler at 2022-12-14 16:33:42.referenced
by None at 2022-12-14 21:26:43.labeled
by None at 2022-12-14 15:35:21.renamed
by None at 2022-12-14 15:35:54.referenced
by Chuck McCallum at 2022-12-14 15:48:16.merged
by Chuck McCallum at 2022-12-14 15:48:16.closed
by Chuck McCallum at 2022-12-14 15:48:16.head_ref_deleted
by Chuck McCallum at 2022-12-14 15:48:17.assigned
by Hector Correa at 2022-12-14 14:47:55.closed
by Chuck McCallum at 2022-12-14 15:48:17.mentioned
by Hannah H at 2022-12-14 15:50:51.subscribed
by Hannah H at 2022-12-14 15:50:51.referenced
by Chuck McCallum at 2022-12-14 15:53:49.merged
by Chuck McCallum at 2022-12-14 15:53:49.closed
by Chuck McCallum at 2022-12-14 15:53:49.head_ref_deleted
by Chuck McCallum at 2022-12-14 15:53:50.assigned
by Hector Correa at 2022-12-14 14:49:39.closed
by Chuck McCallum at 2022-12-14 15:53:50.I tested that this is working in version 0.37.0. Follow up for improved UX: https://github.com/pulibrary/pdc_describe/issues/740
Closing the ticket.
closed
by Bess Sadler at 2022-12-14 15:57:18.renamed
by None at 2022-12-14 16:26:24.closed
by None at 2022-12-14 16:30:42.mentioned
by James R. Griffin III at 2022-12-14 13:06:46.subscribed
by James R. Griffin III at 2022-12-14 13:06:46.referenced
by Bess Sadler at 2022-12-14 16:33:01.merged
by Bess Sadler at 2022-12-14 16:33:01.closed
by Bess Sadler at 2022-12-14 16:33:02.head_ref_deleted
by Bess Sadler at 2022-12-14 16:33:03.head_ref_force_pushed
by None at 2022-12-14 14:51:12.deployed
by None at 2022-12-14 15:02:31.ready_for_review
by None at 2022-12-14 15:55:07.referenced
by Bess Sadler at 2022-12-14 16:33:40.merged
by Bess Sadler at 2022-12-14 16:33:40.closed
by Bess Sadler at 2022-12-14 16:33:40.head_ref_deleted
by Bess Sadler at 2022-12-14 16:33:41.convert_to_draft
by Chuck McCallum at 2022-12-14 18:26:52.assigned
by Hector Correa at 2022-12-14 18:58:42.For context, this comment is in edit_work_utils.js
:
This is an interim solution: My sense is that jQuery doesn't work well with Vite and Turbolinks.
The standard approach would be - vitejavascripttag, - active on every page of the application, - and hooks that don't assume the element is already on the page.
We considered running this for every page of the application, but it causes test failures: some of the jQuery hooks interfere with the operation of other pages.
Turbolinks means that we don't get the expected page-load event, so the hooks aren't registered on successive visits to the page.
Vite wraps it as an ESM, and there doesn't seem to be a way to specify an export that we can call as-needed.
Never mind... This only happens in the console
ready_for_review
by None at 2022-12-14 21:27:32.deployed
by None at 2022-12-14 21:28:15.closed
by None at 2022-12-14 21:55:31.unassigned
by Bess Sadler at 2022-12-14 16:37:02.head_ref_force_pushed
by Francis Kayiwa at 2022-12-13 22:15:35.Closed by #3509
closed
by Alicia Cozine at 2022-12-13 23:22:50.closed
by Jane Sandberg at 2022-12-14 16:40:19.referenced
by Jane Sandberg at 2022-12-14 16:42:19.merged
by Jane Sandberg at 2022-12-14 16:42:19.closed
by Jane Sandberg at 2022-12-14 16:42:19.head_ref_deleted
by Jane Sandberg at 2022-12-14 16:42:20.ready_for_review
by Jane Sandberg at 2022-12-14 16:55:03.ready_for_review
by Max Kadel at 2022-12-14 16:45:00.head_ref_force_pushed
by Max Kadel at 2022-12-14 16:47:19.referenced
by Jane Sandberg at 2022-12-14 18:15:33.merged
by Jane Sandberg at 2022-12-14 18:15:33.closed
by Jane Sandberg at 2022-12-14 18:15:33.head_ref_deleted
by Jane Sandberg at 2022-12-14 18:15:34.I rebased this branch, with the goal of getting b09d44a9c9ee9850e940368273bd86d6779d9456 into this branch so the ojs tests would pass.
head_ref_force_pushed
by Jane Sandberg at 2022-12-14 20:55:13.referenced
by Jane Sandberg at 2022-12-14 21:43:47.merged
by Jane Sandberg at 2022-12-14 21:43:47.closed
by Jane Sandberg at 2022-12-14 21:43:47.head_ref_deleted
by Jane Sandberg at 2022-12-14 21:43:48.closed
by Jane Sandberg at 2022-12-14 21:43:48.ready_for_review
by Jane Sandberg at 2022-12-14 19:17:36.head_ref_force_pushed
by Jane Sandberg at 2022-12-14 20:42:43.head_ref_force_pushed
by Jane Sandberg at 2022-12-14 20:43:39.review_requested
by Jane Sandberg at 2022-12-14 20:44:16.referenced
by Christina Chortaria at 2022-12-14 22:12:52.merged
by Christina Chortaria at 2022-12-14 22:12:52.closed
by Christina Chortaria at 2022-12-14 22:12:52.head_ref_deleted
by Christina Chortaria at 2022-12-14 22:12:53.head_ref_force_pushed
by Jane Sandberg at 2022-12-14 20:14:25.ready_for_review
by Jane Sandberg at 2022-12-14 20:31:49.referenced
by Christina Chortaria at 2022-12-14 22:14:40.merged
by Christina Chortaria at 2022-12-14 22:14:40.closed
by Christina Chortaria at 2022-12-14 22:14:40.head_ref_deleted
by Christina Chortaria at 2022-12-14 22:14:41.catalog-staging is on ruby 3.1 :mushroom:
ready_for_review
by Christina Chortaria at 2022-12-14 21:34:59.head_ref_force_pushed
by Christina Chortaria at 2022-12-14 22:17:22.review_requested
by Christina Chortaria at 2022-12-14 22:18:10.mentioned
by None at 2022-12-15 00:11:01.subscribed
by None at 2022-12-15 00:11:01.review_requested
by Christina Chortaria at 2022-12-14 23:35:09.referenced
by Francis Kayiwa at 2022-12-15 00:28:09.merged
by Francis Kayiwa at 2022-12-15 00:28:09.closed
by Francis Kayiwa at 2022-12-15 00:28:09.head_ref_deleted
by Francis Kayiwa at 2022-12-15 00:28:10.mentioned
by None at 2022-12-15 00:28:16.subscribed
by None at 2022-12-15 00:28:16.labeled
by None at 2022-12-14 14:46:07.labeled
by None at 2022-12-14 14:46:07.head_ref_force_pushed
by Jane Sandberg at 2022-12-13 23:47:15.head_ref_force_pushed
by Jane Sandberg at 2022-12-13 23:50:10.ready_for_review
by Jane Sandberg at 2022-12-13 23:50:38.referenced
by Christina Chortaria at 2022-12-14 02:12:41.merged
by Christina Chortaria at 2022-12-14 02:12:41.closed
by Christina Chortaria at 2022-12-14 02:12:41.head_ref_deleted
by Christina Chortaria at 2022-12-14 02:12:42.deployed
by None at 2022-12-13 23:54:28.deployed
by None at 2022-12-13 23:57:03.head_ref_force_pushed
by Jane Sandberg at 2022-12-13 23:57:51.deployed
by None at 2022-12-13 23:57:57.ready_for_review
by Jane Sandberg at 2022-12-14 00:00:24.deployed
by None at 2022-12-14 11:33:23.referenced
by Christina Chortaria at 2022-12-14 11:35:09.merged
by Christina Chortaria at 2022-12-14 11:35:09.closed
by Christina Chortaria at 2022-12-14 11:35:09.head_ref_deleted
by Christina Chortaria at 2022-12-14 11:35:09.labeled
by None at 2022-12-14 04:48:50.labeled
by None at 2022-12-14 04:48:50.We are closing this because the Spike ended
closed
by None at 2022-12-14 16:29:57.


ODA
(Organisational Development Africa) is a privately
owned strategy and change management consultancy specialising in
complex, large-scale institutional and social change processes. ODA
requested that I firstly conceptulize a logo and then required a
full Identity guidline that would be applied to all areas of their
internal stationery and if required any future branding -be that
promotional leaflets to signage requirements. A logo mood board was
applied so that the client could verify that the correct visual
treatment was given.
Once the client was happy with the direction of the logo. The identity guidelines were conceptualised and applied to a grid system that was created and used so that the guideline, once constructed kept true to the brands look and feel. This would maintain consistency through-out on all branding.
ODA was given a sharp modern yet minimalistic look and feel and the identity grid could then be implemented on all types of collateral print and media.


Stop active tracking when card moves
Other power-up settings exists for administrators on the power-up settings page


Lorem ipsum dolor sit amet consectetur adipisicing elit. Similique laborum, tenetur id cum reprehenderit provident possimus molestias omnis soluta ullam.
Coming soonWith supporting text below as a natural lead-in to additional content.
Learn MoreWith supporting text below as a natural lead-in to additional content.
Learn MoreWith supporting text below as a natural lead-in to additional content.
Learn MoreWith supporting text below as a natural lead-in to additional content.
Learn MoreLorem ipsum dolor sit amet consectetur adipisicing elit. Sapiente dolorum ducimus alias nemo adipisci consequatur ipsam accusamus culpa eaque laborum? Some quick example text to build on the card title and make up the bulk of the card's content.
Learn MoreSome quick example text to build on the card title and make up the bulk of the card's content.
Learn MoreSome quick example text to build on the card title and make up the bulk of the card's content.
Learn MoreSome quick example text to build on the card title and make up the bulk of the card's content.
Learn More


Size of Array :
Time Range :
Generate New Array
Bubble Sort
Selection Sort
Insertion Sort
Heap Sort
Merge Sort
Quick Sort


{% extends "base.html" %} {% import "bootstrap/wtf.html" as wtf %} {% import "_macros.html" as macros %} {% block title %}Islandr{% endblock %} {% block searchbar %}
Creativity
Activity
Service
Social
Others


SIS 0.8 Release notes
Summary
An important feature of Apache SIS 0.8 is the replacement of the deprecated JSR-275 dependency by
JSR-363 — Units of Measurement API
(this implies an upgrade from GeoAPI 3.0.0 to GeoAPI 3.0.1).
Users are encouraged to upgrade to Apache SIS 0.8 for resolving this dependency issue.
Some other changes are listed below (non-exhaustive list):
New features
- [SIS-128] - Implement the JSR-363 javax.measure interfaces
- [SIS-341] - Support "crs-compound" in URLs
- [SIS-352] - Support spatial referencing by geographic identifiers (ISO 19112)
- [SIS-232] - Albers Equal Area (EPSG:9822)
- [SIS-230] - Lambert Cylindrical Equal Area (EPSG:9835)
- [SIS-231] - Lambert Cylindrical Equal Area (Spherical) (EPSG:9834)
- [SIS-220] - Transverse Mercator Zoned Grid System (EPSG:9824)
- [SIS-354] - Military Grid Reference System (MGRS)
- [SIS-284] - Geographic2D with Height Offsets (EPSG:9618)
- [SIS-343] - Axis order reversal (EPSG:9843)
- [SIS-337] - Package EPSG Derby DB in sis-epsg jar, eliminating the need for external SIS_DATA dir
- [SIS-355] - Provide a "deep copy" operation on ISO 19115 metadata
- [SIS-373] - Create JNI wrapper for GDAL/Proj.4
- [SIS-374] - Add-in for OpenOffice / LibreOffice
Improvements
- [SIS-344] - Update EPSG geodetic dataset to version 9.0
- [SIS-353] - UTM should take in account Norway and Svalbard special cases
- [SIS-368] - When a coordinate operation change the longitude axis range from [-180 … +180]° to [0 … 360]°, the Envelopes.transform(…) result should be normalized accordingly
- [SIS-390] - When datum shift information are missing, still apply ellipsoid change
- [SIS-330] - Missing EPSG identifiers for Molodensky parameters
- [SIS-335] - CRS.findOperation(…) sometime slow
- [SIS-327] - Defer loading of datum shift grid files
- [SIS-298] - Simplification in MetadataTreeFormat output
- [SIS-171] - Upgrade NetCDF to ISO-19115 mapping
- [SIS-314] - NetCDF: read method with subsampling and area parameters
- [SIS-367] - IntegerList: Comodification check / primitive Stream
Bug fixes
- [SIS-328] - EPSG factory on PostgreSQL fails because of missing cast
- [SIS-329] - Transformation of envelope from UTM to WGS84 sometime wrongly expanded to the ±180° longitude range
- [SIS-333] - In GML, the second defining parameter of spheres should be <gml:isSphere>true</gml:isSphere>
- [SIS-346] - MetadataStandard.asValueMap(…) / asTreeTable(…) do not work if the argument implements more than one metadata interface
- [SIS-347] - Extents.area(GeographicBoundingBox) returns 0 if the longitude range is 360° large.
- [SIS-348] - CompoundFormat.parse(CharSequence text, ParsePosition pos) javadoc is inconsistent with implementation
- [SIS-349] - Dead-lock between ContextualParameters and WeakHashSet
- [SIS-364] - OperationNotFoundException thrown for some pairs of CRS when the EPSG database is not available
Tasks
- [SIS-372] - Upgrade to GeoAPI 3.0.1
- [SIS-334] - Replace JSR-275 dependency by JSR-363
- [SIS-332] - Upgrade Java platform requirement from JDK6 to JDK7
- [SIS-47] - Add maven configurations for SIS GUI
- [SIS-303] - Do not allow instantion of CompoudCRS with Geographic2D + ellipsoidal height


Transport Automation System
Name
Department
Select
Computer Science and Engineering
Chemistry
Physics
English
Bangla
Mathematics
Statistics
Hall
Select
Mir Mosharrof Hossain Hall
Kamaluddin Hall
Shahed Rafiq Jobbar Hall
Rabindranath Hall
Mawlana Bhashani Hall
Shahed Salam Barkat Hall
Al Biruni Hall
Session
Registration Number
Mobile Number
Submit


Genome-wide association studies (GWAS) have been widely used for identifying common variants associated with complex diseases. Due to the small effect sizes of common variants, the power to detect individual risk variants is generally low. Complementary to SNP-level analysis, a variety of gene-based association tests have been proposed. However, the power of existing gene-based tests is often dependent on the underlying genetic models, and it is not known a priori which test is optimal. Here we proposed COMBined Association Test (COMBAT) to incorporate strengths from multiple existing gene-based tests, including VEGAS, GATES and simpleM. Compared to individual tests, COMBAT shows higher overall performance and robustness across a wide range of genetic models. The algorithm behind this method is described in Wang et al (2017) <doi:10.1534/genetics.117.300257>.
| Version: | 0.0.4 |
| Depends: | mvtnorm, corpcor, R (≥ 3.2.0) |
| Suggests: | parallel |
| Published: | 2018-01-14 |
| Author: | Minghui Wang, Yiyuan Liu, Shizhong Han |
| Maintainer: | Minghui Wang <m.h.wang at live.com> |
| License: | GPL-2 |
| NeedsCompilation: | no |
| CRAN checks: | COMBAT results |
| Reference manual: | COMBAT.pdf |
| Package source: | COMBAT_0.0.4.tar.gz |
| Windows binaries: | r-devel: COMBAT_0.0.4.zip, r-release: COMBAT_0.0.4.zip, r-oldrel: COMBAT_0.0.4.zip |
| OS X binaries: | r-release: COMBAT_0.0.4.tgz, r-oldrel: COMBAT_0.0.4.tgz |
| Old sources: | COMBAT archive |
Please use the canonical form https://CRAN.R-project.org/package=COMBAT to link to this page.


This page shows the various workloads to help with local development. The runner should open only one of them.


{% extends '_base.html' %} {% block content %}
One day I was wondering about being able to predict when areas to study in my university are free so I came up with this website and shared it with a number of friends to see if I could get enough data.
{% endblock %}


Mission maker
Demo mission
Modules
veafAssets
veafGrass
veafCarrierOperations
veafCarrierOperations
veafUnits
veafSpawn
Third party
CTLD
References
Groups list
Units list
Mission programmer
More
VEAF home
Built with
from
Grav
and
Hugo
VEAF Mission Creation Tools
> Tags
Tags


In computer graphics, Ray Tracing is an algorithm for generating 3D images by tracing the path of light through pixels in an image plane and simulating the effects of its encounters with virtual objects, like reflections, refractions, shadows. The algorithm produce a very high degree of visual realism.
The algorithm
for each pixel from image
create an infinte ray with the camera position and this pixel
for each object in the scene
if the ray intersects with the object
if the intersection is infront and the nearest to the camera
paint the pixel with the color at the intersection point
else
paint the pixel with the background color
Obviously this is a very simplified version of the algorithm, but already helps us to understand how it works.
As we want to create an image from scratch, we have to loop through each pixel of the image and calculate the color with which will have to paint. To calculate the color for each pixel, we create an infinite ray from the camera position to the pixel, wich will cross the scene intersecting with the elements of the scene, after obtaining all intersections of the ray with the elements of the scene, will save the nearest intersection and is in front the camera (the calculations can give intersections that are behind the camera, if there are elements behind it).
Once we have the intersection point, we should paint the pixel with the information about the color that we can obtain from the element surface, else if the ray does not intersect with any element then the pixel will be paint with the background color. At this moment we have two problems, find if the ray intersects with the element of the scene, and what color is the element surface. For now let's assume that the element surface is red, and see how calculate if a ray intersects some primitive elements.
Ray
Knowing the line equation:
\( \vec{r}(t)=p_0 + t \cdot \hat{v} \)
Where:
\( t \) is the distance from \( p_0 \)
\( p_0 \) is a point of the line
\( \hat{v} \) is the direction of the line
Since \(\vec{r} \) is a vector, we can decompose like:
\( r_x(t)= (p_0)_{x} + t \cdot v_{x} \)
\(r_y(t)= (p_0)_{y} + t \cdot v_{y} \)
\( r_z(t)= (p_0)_{z} + t \cdot v_{z} \)
Now that we know this, we can check if our ray intersects some element of our scene. Also, if we want to calculate some features like reflections, refractions and shadows we will need to know the normal of the intersected element.
Ray vs Plane
An infinite plane is for sure the most simple element that we can intersect with a ray. The plane will give a sense of depth to our image creating the horizon.
The equation from a plane is given by a point \( p \) and 2 vectors \( \vec{u} \) and \( \vec{v} \) But in our case we don't know any point of our infinite plane, but we define it with its normal \( \hat{N} \) and the distance \( d \) from the camera, so we will use:
\( \vec{p} \cdot \hat{N} = d \)
Where \( \vec{p} \) is the ray. Using the line equation we can say that:
\( (p_0 + t \cdot \hat{v}) \cdot \hat{N} = d \)
\( p_0 \cdot \hat{N} + t \cdot \hat{v} \cdot \hat{N} = d \)
With every element from the scene we want to isolate the \( t \) variable because is the distance from the origin of the ray to the element if it intersects.
\( t = \dfrac {d - p_0 \cdot \hat{N}}{\hat{v} \cdot \hat{N}} \)
This \( t \) for every element that we calculate can be:
- Negative: it means that the ray intersects from behind the origin of the element, so it will return a false value and has to be ignored.
- Positive: it means that the ray intersects with the element, so it will return a valid value.
- Zero: this means that the ray is tangent to the element, so it means that the ray only intersects at one point with the element. This is a valid value except for the plane, which will have infinite points, so it will be ignored.
We only need the smaller positive value, so from every \( t \) valid value that we get, we only save the smaller one.
Ray vs Sphere
Now we have a reference to put the elements. We start with the sphere, which is the simplest of geometric figures.
The equation of the sphere centered at the origin of radius R:
\( x^2 + y^2 + z^2 = R^2 \)
Using the line equation we can say that:
\( ((p_0)_{x} + t \cdot v_{x})^2 + ((p_0)_{y} + t \cdot v_{y})^2 + ((p_0)_{z} + t \cdot v_{z})^2=R^2 \)
\( ((p_0)_{x}^2 + t^2v_{x}^2 + 2t(p_0)_{x}v_{x}) + ((p_0)_{y}^2 + t^2v_{y}^2 + 2t(p_0)_{y}v_{y}) + ((p_0)_{z}^2 + t^2v_{z}^2 + 2t(p_0)_{z}v_{z}) = R^2 \)
\( t^2(v_{x}^2+v_{y}^2+v_{z}^2) + t(2(p_0)_{x}v_{x} + 2(p_0)_{y}v_{y} + 2(p_0)_{z}v_{z}) + ((p_0)_{x}^2 + (p_0)_{y}^2 + (p_0)_{z}^2 - R^2) = 0 \)
This can be a little confusing, but we can simplify to a known formula that we can solve:
\( at^2 + bt + c = 0 \)
Now we have to solve what we have simplified:
\( a = v_{x}^2+v_{y}^2+v_{z}^2 = 1 \) if \( v \) is normalized.
\( b = 2(2(p_0)_{x}v_{x} + 2(p_0)_{y}v_{y} + 2(p_0)_{z}v_{z}) = 2p_0 \cdot \hat{v} \)
\( c = (p_0)_{x}^2 + (p_0)_{y}^2 + (p_0)_{z}^2 - R^2 = p_0 \cdot p_0 - R^2 \)
Once we have this solved, we can solve the quadratic equation:
\( t = \dfrac{-b \pm \sqrt{b^2-4ac}}{2a} \)
If first we try to solve the root, we can see 3 cases, where \( D = b^2 - 4ac \):
- \( D < 0 \Rightarrow \) It doesn't have intersection
- \( D = 0 \Rightarrow t = \dfrac{-b}{2a} \)
- \( D > 0 \Rightarrow \) We pick the smaller positive from:
- \( t_0 = \dfrac {-b + D}{2a} \)
- \( t_0 = \dfrac {-b - D}{2a} \)
The sphere normal at the point of intersection is the normalized vector between the point and the center of the sphere.
Illumination
Now that we know how to calculate if our ray intersects with any element of the scene, and get the point from the element where intersects and its normal at this point if it's true, we should paint the pixel with the element material color. But like in real life, if something it's not illuminated by a point of light this won't be visible, whatever the color of its surface.
As we see in the image, the vector \( \vec{E_1} \) comes from the camera and intersects with the red ball at the point \( P_1 \), this point defines a new vector \( \vec{L_1} \) with the light in the scene, the same happens with the vector \( \vec{E_2} \) but in this case \( \vec{L_2} \) intersects with the sphere so this pixel has to be painted as a shadow and not like the first one as the element material color.
Indeed to know exactly how to paint the element surface we have to take in count some parameters. First a material color is defined by 3 coefficients (Ambient, Diffuse and Specular), also has a level of reflectance, refractance and glossines (the way it shines with a direct light source). The light source also has a color and potential properties.
In this image we see how the reflectance is calculated and how the light is reflected on a surface, knowing that \( ray \) is the ray from the camera to the scene, and \( light \) is the data from a light source in the scene:
\( \hat{E} = -ray.dir \)
\( \hat{L} = P - light.loc \)
\( \hat{E_r} = -\hat{E} + 2*\hat{N} \cdot \hat{E} * \hat{N} \)
\( \hat{L_r} = -\hat{L} + 2*\hat{N} \cdot \hat{L} * \hat{N} \)
With this calculations done, we can solve the equation that we will use for the final color of the pixel. \( C_r = getColor(\hat{E_r}) \) where \( C_r \) is the color of the reflection on the surface.
\( C_l = \displaystyle\sum_{i=0}^n (\hat{N} \cdot \hat{L_i} \cdot K_d + (\hat{L} \cdot \hat{E_r})^g \cdot K_s)*C_i \) where \( C_l \) is the color based on all lights from the scene.
As we said before if \( L_i \) intersects with an element in the scene we only add to \( C_l \) the ambient coefficient \( K_a \). And at the end: \( C_f = C_r + C_l \) where \( C_f \) is the final color on the pixel.
This is how the Ray Tracing should look with some reflections, shadows and different materials. The next image is a level 4 fractal that represents a snowflake made of spheres as the featured image of this post that is a level 2 fractal snowflake.
Here is the source code: SRC


C# (pronounced see sharp, like the musical note C♯, but written with the number sign)[b] is a general-purpose, multi-paradigm programming language encompassing strong typing, lexically scoped, imperative, declarative, functional, generic, object-oriented (class-based), and component-oriented programming disciplines.[17] It was developed around 2000 by Microsoft as part of its .NET initiative and later approved as an international standard by Ecma (ECMA-334) in 2002 and ISO (ISO/IEC 23270) in 2003. Mono is the name of the free and open-source project to develop a compiler and runtime for the language. C# is one of the programming languages designed for the Common Language Infrastructure (CLI).
C# was designed by Anders Hejlsberg, and its development team is currently led by Mads Torgersen. The most recent version is 8.0, which was released in 2019 alongside Visual Studio 2019 version 16.3.[18]
-------------------------------------------------infromation taken from Wikipedia------------------------------------------------------------


Publications
Buy award-winning author Jean Kummerow’s books and training materials.
General MBTI® Resources
|
LIFETypes
Description:
A highly acclaimed introduction to personality type based on the popular Myers-Briggs Type Indicator® instrument. Learn how type affects people’s lives– including how they work, learn, love and lose out!
Buy now from Amazon.com
Buy now from Barnes & Noble |
| |
|
|
Verifying Your Type Preferences: Worksheet and Leader's Guide
Description:
This worksheet guides your clients through a step-by-step process to understand and verify their “best-fit” MBTI Type. It can be used with individuals and groups. The Leader’s guide suggests different ways to encourage type exploration.
Download a sample (pdf)
Buy now from CAPT |
| |
|
|
Talking in Type: Worksheet and Leader's Guide
Description:
This simple explanation of the differences in how the eight MBTI® preferences affect communication is an efficient tool to use with individuals, couples, and groups. A leader’s guide with suggested activities is included.
Download a sample (pdf)
Buy now from CAPT |
| |
|
|
Your Pet’s Personality: Type Indicator for Pets
Description:
This light-hearted publication is a chance to apply type to understanding your pet’s unique personality. It includes a questionnaire and scoring key along with the implications of various results. You’ll have fun administering it to your pet!
Buy now from CAPT |
| |
|
|
Valuing All the Preferences in the Workplace
Description:
This exercise helps participants identify the strengths of their own preferences as well as the assets of others in their workplace. The aim is “the constructive use of differences.” A leader’s guide is included.
Buy now from CAPT |
| |
|
|
Type Dynamics: Another Level of Type
Description:
This moves beyond the basics of the MBTI® preferences to the type dynamics level with clear pictures (literally and figuratively) of how type dynamics work and enrich our lives. A section on stress reactions is included to help people understand what happens when they’re not at their best.
Buy now from CAPT |
|
Team Tendencies
Description:
Type expert Jean Kummerow presents a highly understandable model for revealing key team behaviors, including dealing with the change process, understanding the focus of work, and individual decision-making styles. Your clients or team will relate to the first-person statements that are included within each section of the handout.
Contact Jean Kummerow |
Organizational Applications of Type
|
Introduction to Myers-Briggs Type® in Organizations (4th ed.)
Description:
This popular “introduction to type” booklet provides a thorough introduction to MBTI® results in organizational settings with descriptions of all 16 personality types and their leadership and work styles. Preferred work environments, problem-solving approaches, learning styles, potential pitfalls and suggestions for development are also included.
Buy now from CPP
|
| |
|
|
WORKTypes
Description:
This book, written by three MBTI experts, takes the popular MBTI® assessment and shows how to apply results to many work-related activities such as creating better meetings, managing time more effectively, handling change, working through stress, and being a more effective leader.
Buy now from Amazon.com
Buy now from Barnes & Noble |
| |
|
|
Developing Leaders
Description:
This edited book provides many chapters on using the MBTI® assessment in developing leadership and management capabilities.
See Dr. Kummerow’s chapter on Using the MBTI Step II with Leaders and Managers.
(Out of print) |
MBTI® Step II™ Instrument
|
MBTI® Step II User's Guide: Practitioner’s Tool for Making the Most of Step II™ Interpretations
Description:
This new MBTI Step II resource offers practical insights into administering and interpreting the MBTI Form Q for maximum results. The 120-page guide provides useful facts, new perspectives on personality type and the Step II approach, and detailed practical advice that will enhance your work with clients.
Buy now from CPP |
| |
|
|
Understanding Your MBTI® Step II Results
Description:
This 32-page booklet helps individuals gain more understanding of their MBTI Step II facet results and is a perfect supplement when presenting MBTI Step II Form Q results.
Buy now from CPP |
| |
|
|
Working with MBTI® Step II Results
Description:
This is an essential publication for anyone presenting Step II results to groups. It includes four training modules with Powerpoint slides, activities, scripts, and handouts. It will guide a trainer through presenting an introductory Step II workshop as well as more advanced applications in leadership development, team building and career management.
(Out of print) |
| |
|
|
Facet Sayings and Songs
Description:
Another way to understand Step II results is presented in this handout with its unique and delightful style in illustrating the subtleties of the 20 MBTI Step II facets. Through literary quotations and musical song titles, you’ll learn much about personality differences described by the MBTI Step II instrument.
Download a sample (pdf)
Buy now from CAPT |
| |
|
|
MBTI Step II Interpretive Report — Form Q
Description:
The 18-page Step II Interpretive Report contains individualized results on the Step II facets as well as ways in which results can be applied to communication, decision-making, conflict and change management.
Contact a certified MBTI professional to administer and interpret these reports.
Buy now from CPP |
| |
|
Careers
|
New Directions in Career Planning and the Workplace: Practical Strategies for Career Management Professionals (second edition)
Description:
Named an Outstanding Academic Title, this publication is an invaluable career planning resource for any professionals in the career development area. It offers current thinking and practice from experts on topics such as work-life balance, values clarification, multicultural career counseling and using the MBTI® instrument and the Strong Interest Inventory® assessment together.
(Out of print) |
| |
|
|
Strong and MBTI® Career Development Guide
Description:
For those using the 1994 Strong, this guide provides research and strategies for combining it with the MBTI® instrument. Reproducible masters are included to illustrate various combinations of the instruments.
(Out of print) |
| |
|
|
Strong and MBTI® Career Development Workbook
Description:
This workbook for clients helps them combine the MBTI and the 1994 Strong inventories to identify career goals, to develop a career development plan and to understand the challenges in a job search.
(Out of print) |
| |
|
|
MBTI Manual: A Guide to the Development and Use of the Myers-Briggs Type Indicator® (3rd edition)
Description:
This Manual is essential for any practitioner using the MBTI Step I instrument. Both technical information and practical applications are included.
Dr. Kummerow wrote the chapter on “Uses of Type in Career Counseling.”
Buy now from CPP |
Nutrition (with Fred A. Kummerow, Ph.D.)
|
Cholesterol is Not the Culprit: A Guide to Preventing Heart Disease
by Fred. A. Kummerow Ph.D. with Jean M. Kummerow Ph.D.
Description:
You will find a lot in this book related to diet and heart disease; it is the number one cause of death in the U.S. and throughout much of the world and also the focus of the majority of my career. To me, researching diet and heart disease is like being the detective in a good mystery book who follows clue after clue and finally comes up with an unexpected answer. The detective is always trying to find out who and what killed the person. Some detectives view cholesterol as the killer in heart disease, but I show you why that's not so. I hope in reading this book, you'll not only learn what is healthy to eat, but also why it is healthy to do so. How the body uses food to make what we need to keep going is an incredible, almost magical, process. We, as well as all animals and plants, are not programmed to live forever, but we can certainly increase the number of high quality years of life.
--Fred A. Kummerow
Buy now from Amazon |
| |
|
|
Cholesterol Won’t Kill You but Trans Fat Could
by Fred. A. Kummerow with Jean M. Kummerow
Description:
This book identifies scientific facts and nutritional myths and provides research evidence as to why some myths should not be the cornerstone of nutritional advice. It explains how some food fictions arose, their basis in flawed and incomplete research studies and what's wrong with these studies by examining the basics-the basic biochemical processes in the body, how food fuels those processes, and how those processes fit together.
(Out of print) |


|
Halide
|
A Realization is a vector of references to existing Buffer objects. More...
#include <Tuple.h>
Public Member Functions | |
| size_t | size () const |
| The number of images in the Realization. More... | |
| const Buffer & | operator[] (size_t x) const |
| Get a const reference to one of the images. More... | |
| Buffer & | operator[] (size_t x) |
| Get a reference to one of the images. More... | |
| template<typename T > | |
| operator Buffer< T > () const | |
| Single-element realizations are implicitly castable to Buffers. More... | |
| template<typename T , typename... Args, typename = typename std::enable_if<Internal::all_are_convertible<Buffer<>, Args...>::value>::type> | |
| Realization (Buffer< T > &a, Args &&...args) | |
| Construct a Realization that acts as a reference to some existing Buffers. More... | |
| Realization (std::vector< Buffer<>> &e) | |
| Construct a Realization that refers to the buffers in an existing vector of Buffer<> More... | |
| int | device_sync (void *ctx=nullptr) |
| Call device_sync() for all Buffers in the Realization. More... | |
A Realization is a vector of references to existing Buffer objects.
Funcs with Tuple values return multiple images when you realize them, and they return them as a Realization. Tuples are to Exprs as Realizations are to Buffers.
|
inline |
Construct a Realization that acts as a reference to some existing Buffers.
The element type of the Buffers may not be const.
Definition at line 99 of file Tuple.h.
References Halide::Runtime::Internal::a.
|
inlineexplicit |
Construct a Realization that refers to the buffers in an existing vector of Buffer<>
Definition at line 105 of file Tuple.h.
References user_assert.
|
inline |
The number of images in the Realization.
Get a const reference to one of the images.
Definition at line 76 of file Tuple.h.
References user_assert.
Get a reference to one of the images.
Definition at line 82 of file Tuple.h.
References user_assert.
|
inline |
|
inline |
Call device_sync() for all Buffers in the Realization.
If one of the calls returns an error, subsequent Buffers won't have device_sync called; thus callers should consider a nonzero return code to mean that potentially all of the Buffers are in an indeterminate state of sync. Calling this explicitly should rarely be necessary, except for profiling.
Definition at line 115 of file Tuple.h.
References Halide::Runtime::Internal::b.


DescriptorMatcher Creates a descriptor matcher by name.
matcher = cv.DescriptorMatcher(type)
matcher = cv.DescriptorMatcher(type, 'OptionName',optionValue, ...)
Input
type In the first variant, it creates a descriptor matcher
of a given type with the default parameters (using default
constructor). The following types are recognized:
- 'BruteForce' (default) L2 distance
- 'BruteForce-SL2' L2SQR distance
- 'BruteForce-L1' L1 distance
- 'BruteForce-Hamming', 'BruteForce-HammingLUT'
- 'BruteForce-Hamming(2)'
- 'FlannBased' Flann-based indexing
In the second variant, it creates a matcher of the given
type using the specified parameters. The following
descriptor matcher types are supported:
- 'BFMatcher' Brute-force descriptor matcher. For each
descriptor in the first set, this matcher finds the
closest descriptor in the second set by trying each
one. This descriptor matcher supports masking
permissible matches of descriptor sets.
- 'FlannBasedMatcher' Flann-based descriptor matcher.
This matcher trains
flann::Index_
on a train
descriptor collection and calls its nearest search
methods to find the best matches. So, this matcher
may be faster when matching a large train collection
than the brute force matcher. FlannBasedMatcher
does not support masking permissible matches of
descriptor sets because flann::Index
does not
support this.
Options
The Brute-force matcher constructor (BFMatcher
) accepts the
following options:
- NormType One of 'L1', 'L2' (default), 'Hamming', or
'Hamming2'. See cv.DescriptorExtractor.defaultNorm.
- CrossCheck If it is false, this is will be default
BFMatcher
behaviour when it finds the k
nearest
neighbors for each query descriptor. If CrossCheck==true
,
then the cv.DescriptorMatcher.knnMatch() method with k=1
will only return pairs (i,j)
such that for i-th query
descriptor the j-th descriptor in the matcher's collection
is the nearest and vice versa, i.e. the BFMatcher
will
only return consistent pairs. Such technique usually
produces best results with minimal number of outliers when
there are enough matches. This is alternative to the ratio
test, used by D. Lowe in SIFT paper. default false
The Flann-based matcher constructor (FlannBasedMatcher
) takes
the following optional arguments:
Index Type of indexer, default 'KDTree'. One of the below.
Each index type takes optional arguments (see IndexParams
options below). You can specify the indexer by a cell
array that starts from the type name followed by option
arguments: {'Type', 'OptionName',optionValue, ...}
.
- 'Linear' Brute-force matching, linear search
- 'KDTree' Randomized kd-trees, parallel search
- 'KMeans' Hierarchical k-means tree
- 'HierarchicalClustering' Hierarchical index
- 'Composite' Combination of KDTree and KMeans
- 'LSH' multi-probe LSH
- 'Autotuned' Automatic tuning to one of the above
(
Linear
, KDTree
, KMeans
)
- 'Saved' Load saved index from a file
Search Option in matching operation. Takes a cell
array of option pairs:
- Checks The number of times the tree(s) in the index
should be recursively traversed. A higher value for
this parameter would give better search precision, but
also take more time. If automatic configuration was
used when the index was created, the number of checks
required to achieve the specified precision was also
computed, in which case this parameter is ignored.
-1 for unlimited. default 32
- EPS search for eps-approximate neighbours. default 0
- Sorted only for radius search, require neighbours
sorted by distance. default true
IndexParams Options for FlannBasedMatcher
The following are the options for FLANN indexers
(Fast Library for Approximate Nearest Neighbors):
Linear
Linear index takes no options.
Saved
Saved index takes only one argument specifying the filename.
KDTree
and Composite
- Trees The number of parallel kd-trees to use. Good values
are in the range [1..16]. default 4
KMeans
and Composite
- Branching The branching factor to use for the hierarchical
k-means tree. default 32
- Iterations The maximum number of iterations to use in the
k-means clustering stage when building the k-means tree.
A value of -1 used here means that the k-means clustering
should be iterated until convergence. default 11
- CentersInit The algorithm to use for selecting the initial
centers when performing a k-means clustering step. The
possible values are (default is 'Random'):
- 'Random' picks the initial cluster centers randomly
- 'Gonzales' picks the initial centers using Gonzales
algorithm
- 'KMeansPP' picks the initial centers using the
algorithm suggested in [ArthurKmeansPP2007]
- 'Groupwise' chooses the initial centers in a way
inspired by Gonzales (by Pierre-Emmanuel Viel).
- CBIndex This parameter (cluster boundary index) influences
the way exploration is performed in the hierarchical
kmeans tree. When
CBIndex
is zero the next kmeans domain
to be explored is choosen to be the one with the closest
center. A value greater then zero also takes into account
the size of the domain. default 0.2
HierarchicalClustering
- Branching same as above.
- CentersInit same as above.
- Trees same as above.
- LeafSize maximum leaf size. default 100
LSH
- TableNumber The number of hash tables to use (usually
between 10 and 30). default 20
- KeySize The length of the key in the hash tables (usually
between 10 and 20). default 15
- MultiProbeLevel Number of levels to use in multi-probe
(0 is regular LSH, 2 is recommended). default 0
Autotuned
- TargetPrecision Is a number between 0 and 1 specifying the
percentage of the approximate nearest-neighbor searches
that return the exact nearest-neighbor. Using a higher
value for this parameter gives more accurate results, but
the search takes longer. The optimum value usually depends
on the application. default 0.8
- BuildWeight Specifies the importance of the index build
time raported to the nearest-neighbor search time. In some
applications it is acceptable for the index build step to
take a long time if the subsequent searches in the index
can be performed very fast. In other applications it is
required that the index be build as fast as possible even
if that leads to slightly longer search times. default 0.01
- MemoryWeight Is used to specify the tradeoff between time
(index build time and search time) and memory used by the
index. A value less than 1 gives more importance to the
time spent and a value greater than 1 gives more
importance to the memory usage. default 0
- SampleFraction Is a number between 0 and 1 indicating what
fraction of the dataset to use in the automatic parameter
configuration algorithm. Running the algorithm on the full
dataset gives the most accurate results, but for very
large datasets can take longer than desired. In such case
using just a fraction of the data helps speeding up this
algorithm while still giving good approximations of the
optimum parameters. default 0.1
Example
For example, KDTree
with tree size = 4 is specified by:
matcher = cv.DescriptorMatcher('FlannBasedMatcher', ...
'Index', {'KDTree', 'Trees', 4}, ...
'Search', {'Sorted', true})
Here is an example for loading a saved index:
matcher = cv.DescriptorMatcher('FlannBasedMatcher', ...
'Index', {'Saved', '/path/to/saved/index.xml'})
References:
[ArthurKmeansPP2007]:
Arthur and S. Vassilvitskii
"k-means++: the advantages of careful seeding",
Proceedings of the eighteenth annual ACM-SIAM symposium
on Discrete algorithms, 2007
[LSH]:
Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search
by Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li.,
Proceedings of the 33rd International Conference on
Very Large Data Bases (VLDB). Vienna, Austria. September 2007


{% extends 'block/base.html' %}
{% load i18n %}
{% block content %}
GENDER WISE REPORT - DISTRICT LEVEL
Directorate of School Education
{{district.district_name}}
| Management |
I |
II |
III |
IV |
V |
VI |
VII |
VIII |
IX |
X |
XI |
XII |
TOTAL |
| B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
|
Government
|
{{dl_ds_g_c1_b}} | {{dl_ds_g_c1_g}} | {{dl_ds_g_c1_t}} | {{dl_ds_g_c1}} |
{{dl_ds_g_c2_b}} | {{dl_ds_g_c2_g}} | {{dl_ds_g_c2_t}} | {{dl_ds_g_c2}} |
{{dl_ds_g_c3_b}} | {{dl_ds_g_c3_g}} | {{dl_ds_g_c3_t}} | {{dl_ds_g_c3}} |
{{dl_ds_g_c4_b}} | {{dl_ds_g_c4_g}} | {{dl_ds_g_c4_t}} | {{dl_ds_g_c4}} |
{{dl_ds_g_c5_b}} | {{dl_ds_g_c5_g}} | {{dl_ds_g_c5_t}} | {{dl_ds_g_c5}} |
{{dl_ds_g_c6_b}} | {{dl_ds_g_c6_g}} | {{dl_ds_g_c6_t}} | {{dl_ds_g_c6}} |
{{dl_ds_g_c7_b}} | {{dl_ds_g_c7_g}} | {{dl_ds_g_c7_t}} | {{dl_ds_g_c7}} |
{{dl_ds_g_c8_b}} | {{dl_ds_g_c8_g}} | {{dl_ds_g_c8_t}} | {{dl_ds_g_c8}} |
{{dl_ds_g_c9_b}} | {{dl_ds_g_c9_g}} | {{dl_ds_g_c9_t}} | {{dl_ds_g_c9}} |
{{dl_ds_g_c10_b}} | {{dl_ds_g_c10_g}} | {{dl_ds_g_c10_t}} | {{dl_ds_g_c10}} |
{{dl_ds_g_c11_b}} | {{dl_ds_g_c11_g}} | {{dl_ds_g_c11_t}} | {{dl_ds_g_c11}} |
{{dl_ds_g_c12_b}} | {{dl_ds_g_c12_g}} | {{dl_ds_g_c12_t}} | {{dl_ds_g_c12}} |
{{dl_ds_g_c_total_b}} | {{dl_ds_g_c_total_g}} | {{dl_ds_g_c_total_t}} | {{dl_ds_g_c_total}} |
| Pvt Aided |
{{dl_ds_pa_c1_b}} | {{dl_ds_pa_c1_g}} | {{dl_ds_pa_c1_t}} | {{dl_ds_pa_c1}} |
{{dl_ds_pa_c2_b}} | {{dl_ds_pa_c2_g}} | {{dl_ds_pa_c2_t}} | {{dl_ds_pa_c2}} |
{{dl_ds_pa_c3_b}} | {{dl_ds_pa_c3_g}} | {{dl_ds_pa_c3_t}} | {{dl_ds_pa_c3}} |
{{dl_ds_pa_c4_b}} | {{dl_ds_pa_c4_g}} | {{dl_ds_pa_c4_t}} | {{dl_ds_pa_c4}} |
{{dl_ds_pa_c5_b}} | {{dl_ds_pa_c5_g}} | {{dl_ds_pa_c5_t}} | {{dl_ds_pa_c5}} |
{{dl_ds_pa_c6_b}} | {{dl_ds_pa_c6_g}} | {{dl_ds_pa_c6_t}} | {{dl_ds_pa_c6}} |
{{dl_ds_pa_c7_b}} | {{dl_ds_pa_c7_g}} | {{dl_ds_pa_c7_t}} | {{dl_ds_pa_c7}} |
{{dl_ds_pa_c8_b}} | {{dl_ds_pa_c8_g}} | {{dl_ds_pa_c8_t}} | {{dl_ds_pa_c8}} |
{{dl_ds_pa_c9_b}} | {{dl_ds_pa_c9_g}} | {{dl_ds_pa_c9_t}} | {{dl_ds_pa_c9}} |
{{dl_ds_pa_c10_b}} | {{dl_ds_pa_c10_g}} | {{dl_ds_pa_c10_t}} | {{dl_ds_pa_c10}} |
{{dl_ds_pa_c11_b}} | {{dl_ds_pa_c11_g}} | {{dl_ds_pa_c11_t}} | {{dl_ds_pa_c11}} |
{{dl_ds_pa_c12_b}} | {{dl_ds_pa_c12_g}} | {{dl_ds_pa_c12_t}} | {{dl_ds_pa_c12}} |
{{dl_ds_pa_c_total_b}} | {{dl_ds_pa_c_total_g}} | {{dl_ds_pa_c_total_t}} | {{dl_ds_pa_c_total}} |
| Pvt Unaided |
{{dl_ds_pua_c1_b}} | {{dl_ds_pua_c1_g}} | {{dl_ds_pua_c1_t}} | {{dl_ds_pua_c1}} |
{{dl_ds_pua_c2_b}} | {{dl_ds_pua_c2_g}} | {{dl_ds_pua_c2_t}} | {{dl_ds_pua_c2}} |
{{dl_ds_pua_c3_b}} | {{dl_ds_pua_c3_g}} | {{dl_ds_pua_c3_t}} | {{dl_ds_pua_c3}} |
{{dl_ds_pua_c4_b}} | {{dl_ds_pua_c4_g}} | {{dl_ds_pua_c4_t}} | {{dl_ds_pua_c4}} |
{{dl_ds_pua_c5_b}} | {{dl_ds_pua_c5_g}} | {{dl_ds_pua_c5_t}} | {{dl_ds_pua_c5}} |
{{dl_ds_pua_c6_b}} | {{dl_ds_pua_c6_g}} | {{dl_ds_pua_c6_t}} | {{dl_ds_pua_c6}} |
{{dl_ds_pua_c7_b}} | {{dl_ds_pua_c7_g}} | {{dl_ds_pua_c7_t}} | {{dl_ds_pua_c7}} |
{{dl_ds_pua_c8_b}} | {{dl_ds_pua_c8_g}} | {{dl_ds_pua_c8_t}} | {{dl_ds_pua_c8}} |
{{dl_ds_pua_c9_b}} | {{dl_ds_pua_c9_g}} | {{dl_ds_pua_c9_t}} | {{dl_ds_pua_c9}} |
{{dl_ds_pua_c10_b}} | {{dl_ds_pua_c10_g}} | {{dl_ds_pua_c10_t}} | {{dl_ds_pua_c10}} |
{{dl_ds_pua_c11_b}} | {{dl_ds_pua_c11_g}} | {{dl_ds_pua_c11_t}} | {{dl_ds_pua_c11}} |
{{dl_ds_pua_c12_b}} | {{dl_ds_pua_c12_g}} | {{dl_ds_pua_c12_t}} | {{dl_ds_pua_c12}} |
{{dl_ds_pua_c_total_b}} | {{dl_ds_pua_c_total_g}} | {{dl_ds_pua_c_total_t}} | {{dl_ds_pua_c_total}} |
| CBSE / ICSE |
{{dl_cbse_c1_b}} | {{dl_cbse_c1_g}} | {{dl_cbse_c1_t}} | {{dl_cbse_c1}} |
{{dl_cbse_c2_b}} | {{dl_cbse_c2_g}} | {{dl_cbse_c2_t}} | {{dl_cbse_c2}} |
{{dl_cbse_c3_b}} | {{dl_cbse_c3_g}} | {{dl_cbse_c3_t}} | {{dl_cbse_c3}} |
{{dl_cbse_c4_b}} | {{dl_cbse_c4_g}} | {{dl_cbse_c4_t}} | {{dl_cbse_c4}} |
{{dl_cbse_c5_b}} | {{dl_cbse_c5_g}} | {{dl_cbse_c5_t}} | {{dl_cbse_c5}} |
{{dl_cbse_c6_b}} | {{dl_cbse_c6_g}} | {{dl_cbse_c6_t}} | {{dl_cbse_c6}} |
{{dl_cbse_c7_b}} | {{dl_cbse_c7_g}} | {{dl_cbse_c7_t}} | {{dl_cbse_c7}} |
{{dl_cbse_c8_b}} | {{dl_cbse_c8_g}} | {{dl_cbse_c8_t}} | {{dl_cbse_c8}} |
{{dl_cbse_c9_b}} | {{dl_cbse_c9_g}} | {{dl_cbse_c9_t}} | {{dl_cbse_c9}} |
{{dl_cbse_c10_b}} | {{dl_cbse_c10_g}} | {{dl_cbse_c10_t}} | {{dl_cbse_c10}} |
{{dl_cbse_c11_b}} | {{dl_cbse_c11_g}} | {{dl_cbse_c11_t}} | {{dl_cbse_c11}} |
{{dl_cbse_c12_b}} | {{dl_cbse_c12_g}} | {{dl_cbse_c12_t}} | {{dl_cbse_c12}} |
{{dl_cbse_c_total_b}} | {{dl_cbse_c_total_g}} | {{dl_cbse_c_total_t}} | {{dl_cbse_c_total}} |
Directorate of Elementary Education
| Management |
I |
II |
III |
IV |
V |
VI |
VII |
VIII |
IX |
X |
XI |
XII |
TOTAL |
| B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
| Government |
{{dl_dee_g_c1_b}} | {{dl_dee_g_c1_g}} | {{dl_dee_g_c1_t}} | {{dl_dee_g_c1}} |
{{dl_dee_g_c2_b}} | {{dl_dee_g_c2_g}} | {{dl_dee_g_c2_t}} | {{dl_dee_g_c2}} |
{{dl_dee_g_c3_b}} | {{dl_dee_g_c3_g}} | {{dl_dee_g_c3_t}} | {{dl_dee_g_c3}} |
{{dl_dee_g_c4_b}} | {{dl_dee_g_c4_g}} | {{dl_dee_g_c4_t}} | {{dl_dee_g_c4}} |
{{dl_dee_g_c5_b}} | {{dl_dee_g_c5_g}} | {{dl_dee_g_c5_t}} | {{dl_dee_g_c5}} |
{{dl_dee_g_c6_b}} | {{dl_dee_g_c6_g}} | {{dl_dee_g_c6_t}} | {{dl_dee_g_c6}} |
{{dl_dee_g_c7_b}} | {{dl_dee_g_c7_g}} | {{dl_dee_g_c7_t}} | {{dl_dee_g_c7}} |
{{dl_dee_g_c8_b}} | {{dl_dee_g_c8_g}} | {{dl_dee_g_c8_t}} | {{dl_dee_g_c8}} |
{{dl_dee_g_c9_b}} | {{dl_dee_g_c9_g}} | {{dl_dee_g_c9_t}} | {{dl_dee_g_c9}} |
{{dl_dee_g_c10_b}} | {{dl_dee_g_c10_g}} | {{dl_dee_g_c10_t}} | {{dl_dee_g_c10}} |
{{dl_dee_g_c11_b}} | {{dl_dee_g_c11_g}} | {{dl_dee_g_c11_t}} | {{dl_dee_g_c11}} |
{{dl_dee_g_c12_b}} | {{dl_dee_g_c12_g}} | {{dl_dee_g_c12_t}} | {{dl_dee_g_c12}} |
{{dl_dee_g_c_total_b}} | {{dl_dee_g_c_total_g}} | {{dl_dee_g_c_total_t}} | {{dl_dee_g_c_total}} |
| Pvt Aided |
{{dl_dee_pa_c1_b}} | {{dl_dee_pa_c1_g}} | {{dl_dee_pa_c1_t}} | {{dl_dee_pa_c1}} |
{{dl_dee_pa_c2_b}} | {{dl_dee_pa_c2_g}} | {{dl_dee_pa_c2_t}} | {{dl_dee_pa_c2}} |
{{dl_dee_pa_c3_b}} | {{dl_dee_pa_c3_g}} | {{dl_dee_pa_c3_t}} | {{dl_dee_pa_c3}} |
{{dl_dee_pa_c4_b}} | {{dl_dee_pa_c4_g}} | {{dl_dee_pa_c4_t}} | {{dl_dee_pa_c4}} |
{{dl_dee_pa_c5_b}} | {{dl_dee_pa_c5_g}} | {{dl_dee_pa_c5_t}} | {{dl_dee_pa_c5}} |
{{dl_dee_pa_c6_b}} | {{dl_dee_pa_c6_g}} | {{dl_dee_pa_c6_t}} | {{dl_dee_pa_c6}} |
{{dl_dee_pa_c7_b}} | {{dl_dee_pa_c7_g}} | {{dl_dee_pa_c7_t}} | {{dl_dee_pa_c7}} |
{{dl_dee_pa_c8_b}} | {{dl_dee_pa_c8_g}} | {{dl_dee_pa_c8_t}} | {{dl_dee_pa_c8}} |
{{dl_dee_pa_c9_b}} | {{dl_dee_pa_c9_g}} | {{dl_dee_pa_c9_t}} | {{dl_dee_pa_c9}} |
{{dl_dee_pa_c10_b}} | {{dl_dee_pa_c10_g}} | {{dl_dee_pa_c10_t}} | {{dl_dee_pa_c10}} |
{{dl_dee_pa_c11_b}} | {{dl_dee_pa_c11_g}} | {{dl_dee_pa_c11_t}} | {{dl_dee_pa_c11}} |
{{dl_dee_pa_c12_b}} | {{dl_dee_pa_c12_g}} | {{dl_dee_pa_c12_t}} | {{dl_dee_pa_c12}} |
{{dl_dee_pa_c_total_b}} | {{dl_dee_pa_c_total_g}} | {{dl_dee_pa_c_total_t}} | {{dl_dee_pa_c_total}} |
| Pvt UnAided |
{{dl_dee_pua_c1_b}} | {{dl_dee_pua_c1_g}} | {{dl_dee_pua_c1_t}} | {{dl_dee_pua_c1}} |
{{dl_dee_pua_c2_b}} | {{dl_dee_pua_c2_g}} | {{dl_dee_pua_c2_t}} | {{dl_dee_pua_c2}} |
{{dl_dee_pua_c3_b}} | {{dl_dee_pua_c3_g}} | {{dl_dee_pua_c3_t}} | {{dl_dee_pua_c3}} |
{{dl_dee_pua_c4_b}} | {{dl_dee_pua_c4_g}} | {{dl_dee_pua_c4_t}} | {{dl_dee_pua_c4}} |
{{dl_dee_pua_c5_b}} | {{dl_dee_pua_c5_g}} | {{dl_dee_pua_c5_t}} | {{dl_dee_pua_c5}} |
{{dl_dee_pua_c6_b}} | {{dl_dee_pua_c6_g}} | {{dl_dee_pua_c6_t}} | {{dl_dee_pua_c6}} |
{{dl_dee_pua_c7_b}} | {{dl_dee_pua_c7_g}} | {{dl_dee_pua_c7_t}} | {{dl_dee_pua_c7}} |
{{dl_dee_pua_c8_b}} | {{dl_dee_pua_c8_g}} | {{dl_dee_pua_c8_t}} | {{dl_dee_pua_c8}} |
{{dl_dee_pua_c9_b}} | {{dl_dee_pua_c9_g}} | {{dl_dee_pua_c9_t}} | {{dl_dee_pua_c9}} |
{{dl_dee_pua_c10_b}} | {{dl_dee_pua_c10_g}} | {{dl_dee_pua_c10_t}} | {{dl_dee_pua_c10}} |
{{dl_dee_pua_c11_b}} | {{dl_dee_pua_c11_g}} | {{dl_dee_pua_c11_t}} | {{dl_dee_pua_c11}} |
{{dl_dee_pua_c12_b}} | {{dl_dee_pua_c12_g}} | {{dl_dee_pua_c12_t}} | {{dl_dee_pua_c12}} |
{{dl_dee_pua_c_total_b}} | {{dl_dee_pua_c_total_g}} | {{dl_dee_pua_c_total_t}} | {{dl_dee_pua_c_total}} |
Directorate of Matriculation
| Management |
I |
II |
III |
IV |
V |
VI |
VII |
VIII |
IX |
X |
XI |
XII |
TOTAL |
| B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
B | G | T | Total |
| Matric |
{{dl_m_c1_b}} | {{dl_m_c1_g}} | {{dl_m_c1_t}} | {{dl_m_c1}} |
{{dl_m_c2_b}} | {{dl_m_c2_g}} | {{dl_m_c2_t}} | {{dl_m_c2}} |
{{dl_m_c3_b}} | {{dl_m_c3_g}} | {{dl_m_c3_t}} | {{dl_m_c3}} |
{{dl_m_c4_b}} | {{dl_m_c4_g}} | {{dl_m_c4_t}} | {{dl_m_c4}} |
{{dl_m_c5_b}} | {{dl_m_c5_g}} | {{dl_m_c5_t}} | {{dl_m_c5}} |
{{dl_m_c6_b}} | {{dl_m_c6_g}} | {{dl_m_c6_t}} | {{dl_m_c6}} |
{{dl_m_c7_b}} | {{dl_m_c7_g}} | {{dl_m_c7_t}} | {{dl_m_c7}} |
{{dl_m_c8_b}} | {{dl_m_c8_g}} | {{dl_m_c8_t}} | {{dl_m_c8}} |
{{dl_m_c9_b}} | {{dl_m_c9_g}} | {{dl_m_c9_t}} | {{dl_m_c9}} |
{{dl_m_c10_b}} | {{dl_m_c10_g}} | {{dl_m_c10_t}} | {{dl_m_c10}} |
{{dl_m_c11_b}} | {{dl_m_c11_g}} | {{dl_m_c11_t}} | {{dl_m_c11}} |
{{dl_m_c12_b}} | {{dl_m_c12_g}} | {{dl_m_c12_t}} | {{dl_m_c12}} |
{{dl_m_c_total_b}} | {{dl_m_c_total_g}} | {{dl_m_c_total_t}} | {{dl_m_c_total}} |
* B - Boys, G - Girls, T - Transgender
{% endblock %}


boost::integral_constant< T, val > Struct Template Reference
List of all members.
Public Types |
|
typedef integral_constant< T, val > | type |
|
typedef T | value_type |
Static Public Attributes |
|
static const T | value = val |
template<class T, T val>
struct boost::integral_constant< T, val >
The documentation for this struct was generated from the following file:
- /home/cutting/src/avro/branch-1.3/lang/c++/api/Boost.hh


Preference Settings
To change the preference settings for the puzzle solver, select Window > Preferences and then Sudoku.
At the top of the page is a link to Sudoku color and font preferences.
You can also access these by selecting General > Appearance > Colors and Fonts in the Preferences
dialog.
Copyright 2006 by John
Kellerman


Methods
Public Instance methods
Quotes the column value to help prevent SQL injection attacks.
[ show source ]
# File vendor/rails/activerecord/lib/active_record/connection_adapters/abstract/quoting.rb, line 6 6: def quote(value, column = nil) 7: case value 8: when String 9: if column && column.type == :binary && column.class.respond_to?(:string_to_binary) 10: "'#{quote_string(column.class.string_to_binary(value))}'" # ' (for ruby-mode) 11: elsif column && [:integer, :float].include?(column.type) 12: value.to_s 13: else 14: "'#{quote_string(value)}'" # ' (for ruby-mode) 15: end 16: when NilClass then "NULL" 17: when TrueClass then (column && column.type == :integer ? '1' : quoted_true) 18: when FalseClass then (column && column.type == :integer ? '0' : quoted_false) 19: when Float, Fixnum, Bignum then value.to_s 20: when Date then "'#{value.to_s}'" 21: when Time, DateTime then "'#{quoted_date(value)}'" 22: else "'#{quote_string(value.to_yaml)}'" 23: end 24: end
Returns a quoted form of the column name. This is highly adapter specific.
[ show source ]
# File vendor/rails/activerecord/lib/active_record/connection_adapters/abstract/quoting.rb, line 34 34: def quote_column_name(name) 35: name 36: end
Quotes a string, escaping any ’ (single quote) and \ (backslash) characters.
[ show source ]
# File vendor/rails/activerecord/lib/active_record/connection_adapters/abstract/quoting.rb, line 28 28: def quote_string(s) 29: s.gsub(/\\/, '\&\&').gsub(/'/, "''") # ' (for ruby-mode) 30: end
[ show source ]
# File vendor/rails/activerecord/lib/active_record/connection_adapters/abstract/quoting.rb, line 46 46: def quoted_date(value) 47: value.strftime("%Y-%m-%d %H:%M:%S") 48: end
[ show source ]
# File vendor/rails/activerecord/lib/active_record/connection_adapters/abstract/quoting.rb, line 42 42: def quoted_false 43: "'f'" 44: end
[ show source ]
# File vendor/rails/activerecord/lib/active_record/connection_adapters/abstract/quoting.rb, line 38 38: def quoted_true 39: "'t'" 40: end


|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface Saver
A saver knows how to save part (or all) of a pojo to a datastore entity. Any given Saver will be responsible for all sub-parts; at the top you have a Saver for a root entity and it will be composed of savers for all of its parts.
Keep in mind that Savers are NOT a parallel hierarchy to Setters. They work completely differently.
| Method Summary | |
|---|---|
void
|
save(java.lang.Object pojo,
com.google.appengine.api.datastore.Entity entity, Path path,
boolean index)
Saves the part of a pojo that we are responsible for to an entity. |
| Method Detail |
|---|
void save(java.lang.Object pojo, com.google.appengine.api.datastore.Entity entity, Path path, boolean index)
pojo
- might be a root pojo or it might be an embedded class.
path
- is the entity path to this class, ie "field1.field2" for an
embedded field1 containing a field2 of the type of this class. The
root pathPrefix is null.
index
- whether or not the parent thinks this value should be indexed
when saved.
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


Upload first image
This image will be actually hiding another one
The images will be cropped so they are the same size (minimum of widths and heights), then the first will hide the second using steganography. The reverse process can be done below as well.
This image will be actually hiding another one
This image will be hidden inside the first.
This will return an image almost identical to the first, but with the secret message. To download, left click on the image that just appeared below to the left and 'Save Image As...'
Upload an image to check if it hides anything.
Let's unhide to see if there's a secret.


The requested page is currently unavailable. Our team is working quickly to resolve the issue.
Go back to the Home Page


Microsoft identity platform
Sign in
Sign out
Electron sample app calling MS Graph API using MSAL Node
Please sign-in to see your profile and read your mails
See Profile
Read Mails


Pagerank
The pagerank of a webpage is defined to be the limit of the following process.
Suppose each webpage start with a unit of credit.
At each time unit, each webpage sends all its credit along its outgoing links, equally divided.
After many simulation steps, we will reach a fixed-point: a webpage gives all its credit, but receives back on its incoming links exactly how much it gave.
To be able to do this, we assume that each webpage has at least one outgoing link.
That's not true in practice.
The original Pagerank fixes this problem in a way that we leave as an exercise.
Instead, we use the following simple scheme:
- add a dummy webpage
- add a link from each page (dummy or not) to the dummy
- add a link from the dummy to each non-dummy
Input/Output
Input:
The first line contains an integer $n$ which gives the number of pages.
We will identify pages by numbers $1,\ldots,n$.
The next $n$ lines each contain a list of integers:
on line $i+1$ we have a list of pages to which page $i$ has links;
this list is terminated by a dummy $0$.
It is possible to have multiple links to the same destination,
and it is possible to have loops.
Output:
$n+1$ real numbers that add up to $n+1$.
The first is the pagerank of the dummy node; the following ones are the pageranks of pages $1,\ldots,n$.
Exercises
-
Our scheme is vulnerable to spammer spider traps.
These are configurations of $1+n$ webpages $x,y_1,\ldots,y_n$
with links $x \leftrightarrow y_k$ for all $k$.
Because the dummy page has links to all of $y_1,\ldots,y_n$
and they all link only to $x$, the latter ends up with a high pagerank.
A solution is to add links from the dummy only to a subset of trusted nondummies.
Implement this!
And, by the way, the same idea is used to bias the search towards results from a certain topic.
-
The original pagerank uses a different fix for the problem of draining credit.
Let $t_{ij}$ be the fraction of $i$'s links that go to $j$,
and write $T$ for the matrix with entries $t_{ij}$.
Then, the simple version (with no fix), is asking for an $x$ such that $x=xT$.
This can be solve by iterating, $x_{n+1}:=x_nT $.
The original pagerank changes this to two steps:
$y_n := x_n T$ and then $x_{n+1} := \alpha [1/n \ldots 1/n] + (1-\alpha) y_n$.
Here, $\alpha\approx0.15$.
So, the credit is first moved according to original links (with possible draininig),
and then the credit of each page is shifted towards $1/n$.
Try it!


Bill Gates again world's richest person; Amazon's Bezos is No. 2
LONDON – Microsoft co-founder Bill Gates overtook Amazon’s Jeff Bezos as the world’s richest person on Friday, reclaiming the top ranking for the first time in more than two years.
Gates may have been helped in part by the Pentagon’s surprise decision announced Oct. 25 to award a $10 billion cloud-computing contract to Microsoft over Amazon. Shares of Microsoft have since climbed 4 percent, giving Gates a $110 billion fortune, according to the Bloomberg Billionaires Index. Amazon’s stock is down about 2 percent since the announcement, putting Bezos’ net worth at $108.7 billion.
Gates, 64, had briefly topped Bezos, 55, on an intraday basis last month after Amazon posted its first profit drop in two years, but shares of the world’s biggest online retailer pared the decline. The index, which tracks the wealth of the richest 500 people, is updated each trading day after U.S. markets close. Europe’s richest person, Bernard Arnault, is third with $102.7 billion.
Microsoft has surged 48 percent this year, boosting the value of Gates’ 1 percent stake. The rest of his wealth is derived from share sales and investments made over the years by his family office, Cascade.
Bezos would be far richer if he and MacKenzie Bezos hadn’t divorced. The pair announced their split in January, with MacKenzie, 49, receiving a quarter of their Amazon holdings in July. Her net worth dipped to $35 billion on Friday. Gates, on the other hand, may have never relinquished the top spot were it not for his philanthropy. He has donated more than $35 billion to the Bill & Melinda Gates Foundation since 1994.
Gates recently shared his thoughts on the wealth tax that’s been proposed by some Democratic presidential candidates, including Elizabeth Warren, saying he has already paid more than $10 billion in taxes.
“If I’d had to pay $20 billion, it’s fine,’ he said. But when you say I should pay $100 billion, then I’m starting to do a little math about what I have left over.”
As of today, that would be $10 billion.
GET THE BEST OF THE JAPAN TIMES
IN FIVE EASY PIECES WITH TAKE 5
JOIN THE CONVERSATION


|
fop 1.1 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object org.apache.fop.fo.flow.table.EffRow
public class EffRow
This class represents an effective row in a table and holds a list of grid units occupying the row as well as some additional values.
| Field Summary | |
|---|---|
static int |
FIRST_IN_PART
Indicates that the row is the first in a table-body |
static int |
LAST_IN_PART
Indicates that the row is the last in a table-body |
| Constructor Summary | |
|---|---|
EffRow(int index,
int bodyType,
java.util.List gridUnits)
Creates a new effective row instance. |
| Method Summary | |
|---|---|
int |
getBodyType()
|
int |
getBreakAfter()
Returns the break class for this row. |
int |
getBreakBefore()
Returns the break class for this row. |
MinOptMax |
getExplicitHeight()
|
boolean |
getFlag(int which)
Returns a flag for this effective row. |
GridUnit |
getGridUnit(int column)
Returns the grid unit at a given position. |
java.util.List |
getGridUnits()
|
MinOptMax |
getHeight()
Returns the calculated height for this EffRow, including the cells' bpds/paddings/borders, and the table's border-separation. |
int |
getIndex()
|
Keep |
getKeepTogether()
Returns the keep-together strength for this element. |
Keep |
getKeepWithNext()
Returns the strength of the keep constraint if the enclosing (if any) fo:table-row element of this row, or if any of the cells ending on this row, have keep-with-next set. |
Keep |
getKeepWithPrevious()
Returns the strength of the keep constraint if the enclosing (if any) fo:table-row element of this row, or if any of the cells starting on this row, have keep-with-previous set. |
TableRow |
getTableRow()
|
GridUnit |
safelyGetGridUnit(int column)
Returns the grid unit at a given position. |
void |
setExplicitHeight(MinOptMax mom)
Sets the height for this row that resulted from the explicit height properties specified by the user. |
void |
setHeight(MinOptMax mom)
Sets the calculated height for this EffRow, including everything (cells' bpds, paddings, borders, and border-separation). |
java.lang.String |
toString()
|
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Field Detail |
|---|
public static final int FIRST_IN_PART
public static final int LAST_IN_PART
| Constructor Detail |
|---|
public EffRow(int index, int bodyType, java.util.List gridUnits)
index
- index of the rowbodyType
- type of body (one of HEADER, FOOTER, BODY as found on TableRowIterator)gridUnits
- the grid units this row is made of| Method Detail |
|---|
public int getIndex()
public int getBodyType()
public TableRow getTableRow()
public MinOptMax getHeight()
public void setHeight(MinOptMax mom)
mom
- the calculated heightpublic MinOptMax getExplicitHeight()
public void setExplicitHeight(MinOptMax mom)
mom
- the heightpublic java.util.List getGridUnits()
public GridUnit getGridUnit(int column)
column
- index of the grid unit in the row (zero based)
public GridUnit safelyGetGridUnit(int column)
column
- index of the grid unit in the row (zero based)
public boolean getFlag(int which)
which
- the requested flag (one of FIRST_IN_PART
or LAST_IN_PART
)
public Keep getKeepWithPrevious()
public Keep getKeepWithNext()
public Keep getKeepTogether()
public int getBreakBefore()
Note: this method doesn't take into account break-before set on the enclosing fo:table-row element, if any, as it must be ignored if the row belongs to a group of spanned rows (see XSL-FO 1.1, 7.20.2).
Note: this works only after getNextKuthElements on the corresponding TableCellLM have been called!
Constants.EN_AUTO
, Constants.EN_COLUMN
, Constants.EN_PAGE
, Constants.EN_EVEN_PAGE
, Constants.EN_ODD_PAGE
public int getBreakAfter()
Note: this method doesn't take into account break-after set on the enclosing fo:table-row element, if any, as it must be ignored if the row belongs to a group of spanned rows (see XSL-FO 1.1, 7.20.1).
Note: this works only after getNextKuthElements on the corresponding TableCellLM have been called!
Constants.EN_AUTO
, Constants.EN_COLUMN
, Constants.EN_PAGE
, Constants.EN_EVEN_PAGE
, Constants.EN_ODD_PAGE
public java.lang.String toString()
toString
in class java.lang.Object
|
fop 1.1 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


I am a web developer, based in the Inner Sunset neighborhood of San Francisco. I love potato pizza (don't call it weird until you try it), spending extended amounts of time in nature, and playing with code. Coffee gets me out of bed in the morning, but I'm most energized and inspired by great ideas.
Before I began coding, I was working as a farm intern, harvesting vegetables for a CSA program in Denver, CO. I loved getting my hands dirty and experiencing first hand the life-cycle of the farm, the early morning dew on the zucchini plant leaves, the taste of a freshly picked cherry tomato, the smell of cilantro as you walked past the herb section.
Farming to coding... the logical next step, right? It's true, there are lifestyle differences. My computer doesn't make my hands smell like tomatoes and my jeans aren't consistently covered in soil, but I'd argue that farming and coding have more in common than you might think. Both rely heavily on effective problem solving, the mixture of analytical and creative thinking that I crave most in my every day.


Sometimes he crawls out of his pokeball without the knowledge of Misty. In every possible way he tries to prove his usefulness, but this rarely comes out of him.


Click here to place a new order
This is an order for the following tier(s):
Tier 3 -
$10490
The following rings have been removed: (already subtracted from the tier cost above)
The following rings have been added:
C8F1321/CF14KY
polish
273
C8F4SEG/CF
polish
159
C9F14/CF
polish
129
ZC9FGEW2UMIL15-SILVERCF
polish
199
C9REF14/CFDIA.03B
POLISH
169
The following other items have been added:
DISPLAY CASE WB
WHITE/BLUE
0
RING SIZER FREE
0
THE KNOT - 1YR
1500
The following custom items have been added:
D8DDD 1.5
- $
493
Z8DDDD
- $
345
Custom 5 ring display
- $
50
Your sub-total is:
$13807
New Partner
Date: 2015-03-27
Store Name: susies
Last Name: bench
First Name: park
Address: sldkfjii
City/State: dfius9d
Phone: sdfknkd
e-mail: ljlkji
Terms: 30
Notes:
Sales Rep: Charles Nielson
Sales Rep e-mail<EMAIL_ADDRESS>Your shipping costs are $75
Order Total: $13882


A minimalist writing zone, where you can block out all distractions and get to what's important. The writing!
To get started, all you need to do is delete this text (seriously, just highlight it and hit delete), and fill the page with your own fantastic words.
You can use bold, italics or both just by highlighting the text and selecting them from the tiny options box that appears above it.
Quotes are easy to add too!
Then save and share your writings... everything is passed via url, so none of your information is stored.
Questions/Comments? Click that little question mark at the bottom left of the screen.
Happy Typing! ~ Tim Holman (@twholman)


iPXE> dhcp iPXE> chain http://netboot.cz/index.ipxeThis URL can be also used as DHCP filename, for instance with QEMU:
$ qemu … -net user,bootfile=http://netboot.cz/index.ipxe
There are also preconfigured binaries of iPXE for netboot.cz:
Source code of this site is published on GitHub. Feel free to submit Pull Requests to support your favourite distro or update to current release.