lensowiki - User contributions [en]

Priceline Rewards credit cards

2025-05-17T21:45:47Z

Lensovet: it was good while it lasted

Barclays issued a priceline rewards credit card at least as far back as 2017, though it's impossible to find info on it now. Its earnings structure was quite simple:

* 5 points per dollar on Priceline purchases
* 1 point per dollar on everything else

Things got more interesting, however, once you started to redeem those points, because the redemption values were ''also'' different between priceline purchases vs. everything else:

* 1.5% dollar value for points redeemed against priceline purchases
* 1% dollar value for points redeemed against all other purchases
* 10% point redemption refund on all redemptions

This meant that the effective cash back rate on priceline purchases when redeemed against priceline purchases was 5 × 1.5 / 0.9 = 8.33%. If that sounds too good to be true, just do the math on a hypothetical $1000 priceline purchase: you earn 5000 points, which corresponds to a $75 redemption against that purchase, but when you go to use the redemption, only 4500 points are used. The remaining 500 points are worth $7.50 when redeemed against a pricelline purchase, so you effectively get $82.50 worth of rewards against a $1000 purchase (though those points would only "cost" 450, since you'd get another 10% back on that redemption, and on and on).

Note that you could also "cross-redeem", i.e. take points from a regular purchase and redeem them against a priceline purchase and vice versa. This gave you an effective rate of 1.67% for regular purchases redeemed against priceline ones and 5.5% for priceline purchases redeemed against regular ones.

Someone at Barclays probably eventually realized this was too good to be true too, and so in 2022 they introduced the new Priceline VIP Rewards credit card. The earning structure, on paper, got better, because in addition to the earnings with the original card, gas and restaurant purchases would now earn 2 points per dollar spent. They added a rather dubious VIP Gold status as a "perk", as well as reimbursement of TSA PreCheck or Global Entry application fees once your annual spend exceeds $10,000. But all of the redemption bonuses went away — all purchases now redeemed at 1% and there was no redemption refund. So even non-priceline purchases got a worse redemption rate on this card than the old one!

Of course, the old card is no longer available. However, the reason this matters is because for those who still have the old card, Barclays will tempt you to "upgrade" with this brilliant wording:

{{quote|Update your account to the Priceline VIP Rewards™ Visa® Card and enjoy extraordinary new benefits and services.}}

The touted "benefits" are as follows:

* Reduction of effective priceline redemption rate by 40%
* Reduction of effective other purchase redemption rate by 10%
* Increase of effective redemption rate for gas and restaurant purchases by 80%
* An additional 1% discount for the GE fee once every 5 years (since GE costs $100 and you have to put at least $10,000 of spend on the card to get it)

Given the huge devaluation in priceline redemptions and the multitude of other cards that give a straight 2% cash back on all purchases, there is absolutely no reason for anyone with the older card to "upgrade" to the new one.

On April 30, 2025, Barclays sent an email to existing cardholders stating that their card will be automatically converted on July 2, 2025. The earning structure would change on that date; however, redemption values against Priceline charges would remain unchanged until September 2, 2025. The 10% rebate on redemptions, however, would be terminated on July 2.

LG 4922W5A057G dimensions

2024-11-18T04:51:40Z

Lensovet: power hole updates

I purchased an open-box LG microwave oven which did not include the upper or wall mounting templates. It seemed silly to spend $20 for a piece of paper, so thanks to a [https://www.youtube.com/watch?v=V7G6Na-7F0w YouTube video I found of someone else installing theirs], I was able to extract the necessary measurements.

Holes J and K for the bolts to attach the microwave to the bottom of the cabinet over it are 10⅜" from the back wall. J (left side) is 11⅞" from the centerline; K (right side) is 13 7/16" from the centerline. Both of these holes should be ⅜" (technically the bolts you use are ¼", so depending on how good your tolerances are, you might be able to get away with a ¼" hole).

The power supply hole (M) is 5⅛" from the wall and 6⅛" from the centerline. It is 2" in diameter. In my experience, the wall distance was closer to 5½" and a 1 3/16" hole was more than sufficient (I had a hole saw in that size already and used it).

The roof vent opening (L) is 6½" on either side of the centerline and 4½" for a recessed cabinet (at least ¾" recess) or 5¾" for a flush cabinet.

The wall vent opening (F) is ¼" below the bottom of the cabinet and has dimensions of 4" tall and 12" wide, 6" on either side of the centerline. The centerline should go through the ▽ symbol on the bottom mounting bracket.

Hope this helps someone!

LG 4922W5A057G dimensions

2024-11-17T22:25:46Z

Lensovet: use fraction symbols where possible

I purchased an open-box LG microwave oven which did not include the upper or wall mounting templates. It seemed silly to spend $20 for a piece of paper, so thanks to a [https://www.youtube.com/watch?v=V7G6Na-7F0w YouTube video I found of someone else installing theirs], I was able to extract the necessary measurements.

Holes J and K for the bolts to attach the microwave to the bottom of the cabinet over it are 10⅜" from the back wall. J (left side) is 11⅞" from the centerline; K (right side) is 13 7/16" from the centerline. Both of these holes should be ⅜" (technically the bolts you use are ¼", so depending on how good your tolerances are, you might be able to get away with a ¼" hole).

The power supply hole (M) is 5⅛" from the wall and 6⅛" from the centerline. It is 2" in diameter.

The roof vent opening (L) is 6½" on either side of the centerline and 4½" for a recessed cabinet (at least ¾" recess) or 5¾" for a flush cabinet.

The wall vent opening (F) is ¼" below the bottom of the cabinet and has dimensions of 4" tall and 12" wide, 6" on either side of the centerline. The centerline should go through the ▽ symbol on the bottom mounting bracket.

Hope this helps someone!

LG 4922W5A057G dimensions

2024-11-17T22:23:34Z

Lensovet: Created page with "I purchased an open-box LG microwave oven which did not include the upper or wall mounting templates. It seemed silly to spend $20 for a piece of paper, so thanks to a [https:..."

I purchased an open-box LG microwave oven which did not include the upper or wall mounting templates. It seemed silly to spend $20 for a piece of paper, so thanks to a [https://www.youtube.com/watch?v=V7G6Na-7F0w YouTube video I found of someone else installing theirs], I was able to extract the necessary measurements.

Holes J and K for the bolts to attach the microwave to the bottom of the cabinet over it are 10 3/8" from the back wall. J (left side) is 11 7/8" from the centerline; K (right side) is 13 7/16" from the centerline. Both of these holes should be 3/8" (technically the bolts you use are 1/4", so depending on how good your tolerances are, you might be able to get away with a 1/4" hole).

The power supply hole (M) is 5 1/8" from the wall and 6 1/8" from the centerline. It is 2" in diameter.

The roof vent opening (L) is 6.5" on either side of the centerline and 4.5" for a recessed cabinet (at least 3/4" recess) or 5 3/4" for a flush cabinet.

The wall vent opening (F) is 1/4" below the bottom of the cabinet and has dimensions of 4" tall and 12" wide, 6" on either side of the centerline. The centerline should go through the ▽ symbol on the bottom mounting bracket.

Hope this helps someone!

Home improvement

2024-11-17T22:11:54Z

Lensovet: + lg template

Random tidbits through doing home projects.

* [[Home products made in the USA]]
* [[LG 4922W5A057G dimensions]]

== Connecting Siemens SPDs to a load center ==
Siemens SPDs ([https://amzn.to/3ICxhhp FS060/FS60], [https://amzn.to/3lQnBXG FS100], [https://amzn.to/3xyFxZh FS140]) come with an NPT thread on the end, which prevents it from being directly connected into a load center knockout as none of those connectors have NPT thread patterns on them. Siemens support was utterly useless, basically saying "well you should go find what you need". The solution I ended up arriving at was to use a [https://www.homedepot.com/p/3-4-in-Flexible-Elbow-R6441102/202043366 Cantex 3/4 in. Flexible Elbow], which comes with NPT fittings on both ends, and replace the fitting on one end with an [https://www.homedepot.com/p/3-4-in-90-NMLT-Push-Connector-1-Pack-NMLT907-1/202284600 Arlington 3/4 in. 90° SNAP2IT Non-Metallic Push-On Connector] (also [https://amzn.to/3SayYFY available on Amazon], [http://www.aifittings.com/catalog/liquid-tight/90-degree-snap2it-non-metallic-connectors/NMLT907 Arlington spec page]). If you don't need the 90-degree bend, Arlington makes [http://www.aifittings.com/catalog/liquid-tight/snap2it-non-metallic-connectors/NMLT7 a straight variant] too, which you can get [https://amzn.to/3EoJRy7 on Amazon] or [https://www.homedepot.com/p/SNAP2IT-3-4-in-Non-Metallic-NM-Liquid-Tight-Connector-1-pack-NMLT7-1/202284603 HD] (HD for some reason shows 1/2" in the pictures for the 3/4" product).

The Arlington connectors referenced above are made in the US.

== HVAC registers that aren't made in China or Vietnam ==
Pretty much every HVAC register at your big box store will come from Vietnam or China. If you're looking for something more local, you have a few options:

* [https://www.imperialgroup.ca Imperial Group's] metal registers are made in Canada. They are trivial to get at [https://www.lowes.ca/product/sidewall-ceiling-registers/imperial-10-in-x-6-in-sideceiling-register-2-way-4871464 Lowe's in Canada], but are a bit more challenging to obtain here in the US. Buying them online is an option, but I had a really hard time ordering these from Amazon and having them arrive without damage. One literally was broken in pieces by the time it was at my doorstep. TrueValue carries some of the fancier floor register models (like the wood and satin metal) in some of their stores in New Jersey, but for some reason not the plain vanilla sidewall ones. Note that some of their products are made in China.
* [https://decorgrates.com Decor Grates] is another Canadian manufacturer, who appears to make all of their products in Canada, unlike Imperial. However, their [https://amzn.to/3YKOs5R wood floor register] did not look as polished to my eyes and had a very flimsy damper mechanism. Their site is also a giant mess, with "No products were found matching your selection" regularly showing up while navigating it.
* [https://www.ameriflowregisters.com/residential-grds/sidewall-ceiling-registers-grilles AmeriFlow], aka [https://www.hartandcooley.com/grilles-registers-and-diffusers-grd/residential-grds/sidewall-ceiling-register-grilles Hart & Cooley], makes registers in Mexico and can be found in TrueValue stores as well as e.g. [https://www.supplyhouse.com SupplyHouse]. They seem to be the only ones that make registers that are [https://www.hartandcooley.com/products/681-a681/steel-aluminum-1-way-register-ms-damper-1-2-fin-spacing uni-directional], which is unfortunate as it makes no sense to install a two-way (or straight) register at a vent that's in the corner of a room. Ultimately, I did not buy theirs because the lever has a plastic piece, and the registers we had in our house had those plastic pieces break.
* [https://www.shoemakermfg.com Shoemaker Manufacturing] makes registers in the US. They are impossible to find in brick and mortar stores (except in Washington?). Online you can find them on some websites with absolutely astronomical prices and unrealistic return policies. I did end up ordering [https://amzn.to/3kbF6RK one register] on Amazon (and took the hit for return shipping) just to see what it looked like, but the styling didn't really work in a residential setting. The spacing of the fins was also too wide.
* [https://www.continentalindustries.com Continental] makes registers in the US, though finding them in stores is a challenge as well. They also make one-way registers. [http://www.hepsales.com HEP Sales] quoted a price of $50.35 for 21RW1006 if buying together with something that they stock. The 2-ways are easier to find online.

== Pulling dryer terminal block screws out of Samsung dryers ==
I had the pleasure of dropping not one but two terminal screws in our electric Samsung dryer "into" the dryer. Unlike other manufacturers, Samsung makes the housing of the dryer completely enclosed, so you can't simply "roll" the screw to the front like with other dryers and then just pull it out. There is, however, a way to get them out without fully disassembling the thing. Ironically, it relies on another questionable design decision — leveling legs that come all the way out.

The dryer's leveling legs have two curious features — they are made entirely out of plastic (so excessive force will crack or break them) and they can be completely removed from the dryer if you raise them high enough. This latter property allows us to use the holes to fish out the screws.

Tilt the dryer to the side and back to make sure that your fallen screw is in the rear left corner if looking at the front of the dryer. Then, slightly tilt up the dryer at the rear left corner and use a very strong magnet to reach through the hole and grab the screw. Depending on how strong your magnet is, you might need to reach in with your finger first to bring the screw a little closer to the hole.

A final note: if the dryer is mounted on top of the matching pedestal, you will need to screw the legs onto the pedestal when tilting to get the screw into the corner and then unscrew them when tilting to get the screw out.

Priceline Rewards credit cards

2024-05-15T01:42:36Z

Lensovet:

Home improvement

2024-04-05T18:08:46Z

Lensovet: /* HVAC registers that aren't made in China or Vietnam */

Random tidbits through doing home projects.

* [[Home products made in the USA]]

== Connecting Siemens SPDs to a load center ==
Siemens SPDs ([https://amzn.to/3ICxhhp FS060/FS60], [https://amzn.to/3lQnBXG FS100], [https://amzn.to/3xyFxZh FS140]) come with an NPT thread on the end, which prevents it from being directly connected into a load center knockout as none of those connectors have NPT thread patterns on them. Siemens support was utterly useless, basically saying "well you should go find what you need". The solution I ended up arriving at was to use a [https://www.homedepot.com/p/3-4-in-Flexible-Elbow-R6441102/202043366 Cantex 3/4 in. Flexible Elbow], which comes with NPT fittings on both ends, and replace the fitting on one end with an [https://www.homedepot.com/p/3-4-in-90-NMLT-Push-Connector-1-Pack-NMLT907-1/202284600 Arlington 3/4 in. 90° SNAP2IT Non-Metallic Push-On Connector] (also [https://amzn.to/3SayYFY available on Amazon], [http://www.aifittings.com/catalog/liquid-tight/90-degree-snap2it-non-metallic-connectors/NMLT907 Arlington spec page]). If you don't need the 90-degree bend, Arlington makes [http://www.aifittings.com/catalog/liquid-tight/snap2it-non-metallic-connectors/NMLT7 a straight variant] too, which you can get [https://amzn.to/3EoJRy7 on Amazon] or [https://www.homedepot.com/p/SNAP2IT-3-4-in-Non-Metallic-NM-Liquid-Tight-Connector-1-pack-NMLT7-1/202284603 HD] (HD for some reason shows 1/2" in the pictures for the 3/4" product).

The Arlington connectors referenced above are made in the US.

== HVAC registers that aren't made in China or Vietnam ==
Pretty much every HVAC register at your big box store will come from Vietnam or China. If you're looking for something more local, you have a few options:

* [https://www.imperialgroup.ca Imperial Group's] metal registers are made in Canada. They are trivial to get at [https://www.lowes.ca/product/sidewall-ceiling-registers/imperial-10-in-x-6-in-sideceiling-register-2-way-4871464 Lowe's in Canada], but are a bit more challenging to obtain here in the US. Buying them online is an option, but I had a really hard time ordering these from Amazon and having them arrive without damage. One literally was broken in pieces by the time it was at my doorstep. TrueValue carries some of the fancier floor register models (like the wood and satin metal) in some of their stores in New Jersey, but for some reason not the plain vanilla sidewall ones. Note that some of their products are made in China.
* [https://decorgrates.com Decor Grates] is another Canadian manufacturer, who appears to make all of their products in Canada, unlike Imperial. However, their [https://amzn.to/3YKOs5R wood floor register] did not look as polished to my eyes and had a very flimsy damper mechanism. Their site is also a giant mess, with "No products were found matching your selection" regularly showing up while navigating it.
* [https://www.ameriflowregisters.com/residential-grds/sidewall-ceiling-registers-grilles AmeriFlow], aka [https://www.hartandcooley.com/grilles-registers-and-diffusers-grd/residential-grds/sidewall-ceiling-register-grilles Hart & Cooley], makes registers in Mexico and can be found in TrueValue stores as well as e.g. [https://www.supplyhouse.com SupplyHouse]. They seem to be the only ones that make registers that are [https://www.hartandcooley.com/products/681-a681/steel-aluminum-1-way-register-ms-damper-1-2-fin-spacing uni-directional], which is unfortunate as it makes no sense to install a two-way (or straight) register at a vent that's in the corner of a room. Ultimately, I did not buy theirs because the lever has a plastic piece, and the registers we had in our house had those plastic pieces break.
* [https://www.shoemakermfg.com Shoemaker Manufacturing] makes registers in the US. They are impossible to find in brick and mortar stores (except in Washington?). Online you can find them on some websites with absolutely astronomical prices and unrealistic return policies. I did end up ordering [https://amzn.to/3kbF6RK one register] on Amazon (and took the hit for return shipping) just to see what it looked like, but the styling didn't really work in a residential setting. The spacing of the fins was also too wide.
* [https://www.continentalindustries.com Continental] makes registers in the US, though finding them in stores is a challenge as well. They also make one-way registers. [http://www.hepsales.com HEP Sales] quoted a price of $50.35 for 21RW1006 if buying together with something that they stock. The 2-ways are easier to find online.

== Pulling dryer terminal block screws out of Samsung dryers ==
I had the pleasure of dropping not one but two terminal screws in our electric Samsung dryer "into" the dryer. Unlike other manufacturers, Samsung makes the housing of the dryer completely enclosed, so you can't simply "roll" the screw to the front like with other dryers and then just pull it out. There is, however, a way to get them out without fully disassembling the thing. Ironically, it relies on another questionable design decision — leveling legs that come all the way out.

The dryer's leveling legs have two curious features — they are made entirely out of plastic (so excessive force will crack or break them) and they can be completely removed from the dryer if you raise them high enough. This latter property allows us to use the holes to fish out the screws.

Tilt the dryer to the side and back to make sure that your fallen screw is in the rear left corner if looking at the front of the dryer. Then, slightly tilt up the dryer at the rear left corner and use a very strong magnet to reach through the hole and grab the screw. Depending on how strong your magnet is, you might need to reach in with your finger first to bring the screw a little closer to the hole.

A final note: if the dryer is mounted on top of the matching pedestal, you will need to screw the legs onto the pedestal when tilting to get the screw into the corner and then unscrew them when tilting to get the screw out.

Home products made in the USA

2023-06-10T06:33:32Z

Lensovet: /* HVAC */ +registers

== Plumbing ==
* Most '''Keeney''' plastic tubular sold at Lowe's is made in the US. It is PVC.
* Home Depot will randomly have '''Oatey''' PP tubular at some locations. For whatever reason, it comes in generic-looking packaging with black and white markings instead of normal-looking branded packaging.
* Some '''PlumbPak''' plastic tubular (PP) sold on Amazon is made in the US as well, but the product pages can't be relied on for determining this.

== Fasteners ==
* SPAX screws are made in the US or Germany and sold at both HD and Lowe's. Lowe's tends to have lower prices though their boxes don't include the screw bit in them.

== Electrical ==
* [https://mulberrymetal.com Mulberry] ''metal'' products are generally made in the US. A limited assortment of their white painted wall plates are sold at HD, but beyond that, you'll have to go to a local electric supply store to find them.
* Leviton's [https://amzn.to/3nuIybw 15A "plain" tamper-resistant Decora outlets] and [https://amzn.to/3lKrcXG midsize nylon wall plates] are made in the US. Their website generally has reliable information about country of origin.

== HVAC ==
* [https://buildersbest.com/where-to-buy/ Builder's Best] for venting solutions. Good luck finding their products anywhere though.
* See [[Home improvement#HVAC registers that aren't made in China or Vietnam|Home improvement]] for some register options (Shoemaker, Continental)

Home improvement

2023-06-10T06:32:29Z

Lensovet: /* HVAC registers that aren't made in China or Vietnam */ + continental

Random tidbits through doing home projects.

* [[Home products made in the USA]]

== Connecting Siemens SPDs to a load center ==
Siemens SPDs ([https://amzn.to/3ICxhhp FS060/FS60], [https://amzn.to/3lQnBXG FS100], [https://amzn.to/3xyFxZh FS140]) come with an NPT thread on the end, which prevents it from being directly connected into a load center knockout as none of those connectors have NPT thread patterns on them. Siemens support was utterly useless, basically saying "well you should go find what you need". The solution I ended up arriving at was to use a [https://www.homedepot.com/p/3-4-in-Flexible-Elbow-R6441102/202043366 Cantex 3/4 in. Flexible Elbow], which comes with NPT fittings on both ends, and replace the fitting on one end with an [https://www.homedepot.com/p/3-4-in-90-NMLT-Push-Connector-1-Pack-NMLT907-1/202284600 Arlington 3/4 in. 90° SNAP2IT Non-Metallic Push-On Connector] (also [https://amzn.to/3SayYFY available on Amazon], [http://www.aifittings.com/catalog/liquid-tight/90-degree-snap2it-non-metallic-connectors/NMLT907 Arlington spec page]). If you don't need the 90-degree bend, Arlington makes [http://www.aifittings.com/catalog/liquid-tight/snap2it-non-metallic-connectors/NMLT7 a straight variant] too, which you can get [https://amzn.to/3EoJRy7 on Amazon] or [https://www.homedepot.com/p/SNAP2IT-3-4-in-Non-Metallic-NM-Liquid-Tight-Connector-1-pack-NMLT7-1/202284603 HD] (HD for some reason shows 1/2" in the pictures for the 3/4" product).

The Arlington connectors referenced above are made in the US.

== HVAC registers that aren't made in China or Vietnam ==
Pretty much every HVAC register at your big box store will come from Vietnam or China. If you're looking for something more local, you have a few options:

* [https://www.imperialgroup.ca Imperial Group's] metal registers are made in Canada. They are trivial to get at [https://www.lowes.ca/product/sidewall-ceiling-registers/imperial-10-in-x-6-in-sideceiling-register-2-way-4871464 Lowe's in Canada], but are a bit more challenging to obtain here in the US. Buying them online is an option, but I had a really hard time ordering these from Amazon and having them arrive without damage. One literally was broken in pieces by the time it was at my doorstep. TrueValue carries some of the fancier floor register models (like the wood and satin metal) in some of their stores in New Jersey, but for some reason not the plain vanilla sidewall ones. Note that some of their products are made in China.
* [https://decorgrates.com Decor Grates] is another Canadian manufacturer, who appears to make all of their products in Canada, unlike Imperial. However, their [https://amzn.to/3YKOs5R wood floor register] did not look as polished to my eyes and had a very flimsy damper mechanism. Their site is also a giant mess, with "No products were found matching your selection" regularly showing up while navigating it.
* [https://www.ameriflowregisters.com/residential-grds/sidewall-ceiling-registers-grilles AmeriFlow], aka [https://www.hartandcooley.com/grilles-registers-and-diffusers-grd/residential-grds/sidewall-ceiling-register-grilles Hart & Cooley], makes registers in Mexico and can be found in TrueValue stores as well as e.g. [https://www.supplyhouse.com SupplyHouse]. They seem to be the only ones that make registers that are [https://www.hartandcooley.com/products/681-a681/steel-aluminum-1-way-register-ms-damper-1-2-fin-spacing uni-directional], which is unfortunate as it makes no sense to install a two-way (or straight) register at a vent that's in the corner of a room.
* [https://www.shoemakermfg.com Shoemaker Manufacturing] appear to be the only manufacturer of registers in the US. They are impossible to find in brick and mortar stores (except in Washington?). Online you can find them on some websites with absolutely astronomical prices and unrealistic return policies. I did end up ordering [https://amzn.to/3kbF6RK one register] on Amazon (and took the hit for return shipping) just to see what it looked like, but the styling didn't really work in a residential setting. The spacing of the fins was also too wide.
* [https://www.continentalindustries.com Continental] makes registers in the US, though finding them in stores is a challenge as well. They also make one-way registers. [http://www.hepsales.com HEP Sales] quoted a price of $50.35 for 21RW1006 if buying together with something that they stock.

== Pulling dryer terminal block screws out of Samsung dryers ==
I had the pleasure of dropping not one but two terminal screws in our electric Samsung dryer "into" the dryer. Unlike other manufacturers, Samsung makes the housing of the dryer completely enclosed, so you can't simply "roll" the screw to the front like with other dryers and then just pull it out. There is, however, a way to get them out without fully disassembling the thing. Ironically, it relies on another questionable design decision — leveling legs that come all the way out.

The dryer's leveling legs have two curious features — they are made entirely out of plastic (so excessive force will crack or break them) and they can be completely removed from the dryer if you raise them high enough. This latter property allows us to use the holes to fish out the screws.

Tilt the dryer to the side and back to make sure that your fallen screw is in the rear left corner if looking at the front of the dryer. Then, slightly tilt up the dryer at the rear left corner and use a very strong magnet to reach through the hole and grab the screw. Depending on how strong your magnet is, you might need to reach in with your finger first to bring the screw a little closer to the hole.

A final note: if the dryer is mounted on top of the matching pedestal, you will need to screw the legs onto the pedestal when tilting to get the screw into the corner and then unscrew them when tilting to get the screw out.

Home products made in the USA

2023-03-30T03:13:02Z

Lensovet: sections

Home products made in the USA

2023-03-30T02:53:57Z

Lensovet: Created page with "== Plumbing == * Most '''Keeney''' plastic tubular sold at Lowe's is made in the US. It is PVC. * Home Depot will randomly have '''Oatey''' PP tubular at some locations. For..."

== Plumbing ==

* Most '''Keeney''' plastic tubular sold at Lowe's is made in the US. It is PVC.
* Home Depot will randomly have '''Oatey''' PP tubular at some locations. For whatever reason, it comes in generic-looking packaging with black and white markings instead of normal-looking branded packaging.
* Some '''PlumbPak''' plastic tubular (PP) sold on Amazon is made in the US as well, but the product pages can't be relied on for determining this.
* [https://mulberrymetal.com Mulberry] ''metal'' products are generally made in the US. A limited assortment of their white painted wall plates are sold at HD, but beyond that, you'll have to go to a local electric supply store to find them.
* SPAX screws are made in the US or Germany and sold at both HD and Lowe's. Lowe's tends to have lower prices though their boxes don't include the screw bit in them.
* Leviton's [https://amzn.to/3nuIybw 15A "plain" tamper-resistant Decora outlets] and [https://amzn.to/3lKrcXG midsize nylon wall plates] are made in the US. Their website generally has reliable information about country of origin.
* [https://buildersbest.com/where-to-buy/ Builder's Best] for venting solutions. Good luck finding their products anywhere though.

Home improvement

2023-03-30T02:34:59Z

Lensovet:

Random tidbits through doing home projects.

* [[Home products made in the USA]]

== Connecting Siemens SPDs to a load center ==
Siemens SPDs ([https://amzn.to/3ICxhhp FS060/FS60], [https://amzn.to/3lQnBXG FS100], [https://amzn.to/3xyFxZh FS140]) come with an NPT thread on the end, which prevents it from being directly connected into a load center knockout as none of those connectors have NPT thread patterns on them. Siemens support was utterly useless, basically saying "well you should go find what you need". The solution I ended up arriving at was to use a [https://www.homedepot.com/p/3-4-in-Flexible-Elbow-R6441102/202043366 Cantex 3/4 in. Flexible Elbow], which comes with NPT fittings on both ends, and replace the fitting on one end with an [https://www.homedepot.com/p/3-4-in-90-NMLT-Push-Connector-1-Pack-NMLT907-1/202284600 Arlington 3/4 in. 90° SNAP2IT Non-Metallic Push-On Connector] (also [https://amzn.to/3SayYFY available on Amazon], [http://www.aifittings.com/catalog/liquid-tight/90-degree-snap2it-non-metallic-connectors/NMLT907 Arlington spec page]). If you don't need the 90-degree bend, Arlington makes [http://www.aifittings.com/catalog/liquid-tight/snap2it-non-metallic-connectors/NMLT7 a straight variant] too, which you can get [https://amzn.to/3EoJRy7 on Amazon] or [https://www.homedepot.com/p/SNAP2IT-3-4-in-Non-Metallic-NM-Liquid-Tight-Connector-1-pack-NMLT7-1/202284603 HD] (HD for some reason shows 1/2" in the pictures for the 3/4" product).

The Arlington connectors referenced above are made in the US.

== HVAC registers that aren't made in China or Vietnam ==
Pretty much every HVAC register at your big box store will come from Vietnam or China. If you're looking for something more local, you have a few options:

* [https://www.imperialgroup.ca Imperial Group's] metal registers are made in Canada. They are trivial to get at [https://www.lowes.ca/product/sidewall-ceiling-registers/imperial-10-in-x-6-in-sideceiling-register-2-way-4871464 Lowe's in Canada], but are a bit more challenging to obtain here in the US. Buying them online is an option, but I had a really hard time ordering these from Amazon and having them arrive without damage. One literally was broken in pieces by the time it was at my doorstep. TrueValue carries some of the fancier floor register models (like the wood and satin metal) in some of their stores in New Jersey, but for some reason not the plain vanilla sidewall ones. Note that some of their products are made in China.
* [https://decorgrates.com Decor Grates] is another Canadian manufacturer, who appears to make all of their products in Canada, unlike Imperial. However, their [https://amzn.to/3YKOs5R wood floor register] did not look as polished to my eyes and had a very flimsy damper mechanism. Their site is also a giant mess, with "No products were found matching your selection" regularly showing up while navigating it.
* [https://www.ameriflowregisters.com/residential-grds/sidewall-ceiling-registers-grilles AmeriFlow], aka [https://www.hartandcooley.com/grilles-registers-and-diffusers-grd/residential-grds/sidewall-ceiling-register-grilles Hart & Cooley], makes registers in Mexico and can be found in TrueValue stores as well as e.g. [https://www.supplyhouse.com SupplyHouse]. They seem to be the only ones that make registers that are [https://www.hartandcooley.com/products/681-a681/steel-aluminum-1-way-register-ms-damper-1-2-fin-spacing uni-directional], which is unfortunate as it makes no sense to install a two-way (or straight) register at a vent that's in the corner of a room.
* [https://www.shoemakermfg.com Shoemaker Manufacturing] appear to be the only manufacturer of registers in the US. They are impossible to find in brick and mortar stores (except in Washington?). Online you can find them on some websites with absolutely astronomical prices and unrealistic return policies. I did end up ordering [https://amzn.to/3kbF6RK one register] on Amazon (and took the hit for return shipping) just to see what it looked like, but the styling didn't really work in a residential setting. The spacing of the fins was also too wide.

== Pulling dryer terminal block screws out of Samsung dryers ==
I had the pleasure of dropping not one but two terminal screws in our electric Samsung dryer "into" the dryer. Unlike other manufacturers, Samsung makes the housing of the dryer completely enclosed, so you can't simply "roll" the screw to the front like with other dryers and then just pull it out. There is, however, a way to get them out without fully disassembling the thing. Ironically, it relies on another questionable design decision — leveling legs that come all the way out.

The dryer's leveling legs have two curious features — they are made entirely out of plastic (so excessive force will crack or break them) and they can be completely removed from the dryer if you raise them high enough. This latter property allows us to use the holes to fish out the screws.

Tilt the dryer to the side and back to make sure that your fallen screw is in the rear left corner if looking at the front of the dryer. Then, slightly tilt up the dryer at the rear left corner and use a very strong magnet to reach through the hole and grab the screw. Depending on how strong your magnet is, you might need to reach in with your finger first to bring the screw a little closer to the hole.

A final note: if the dryer is mounted on top of the matching pedestal, you will need to screw the legs onto the pedestal when tilting to get the screw into the corner and then unscrew them when tilting to get the screw out.

Home improvement

2023-03-21T15:49:11Z

Lensovet: +dryer screws

Random tidbits through doing home projects.

== Connecting Siemens SPDs to a load center ==
Siemens SPDs ([https://amzn.to/3ICxhhp FS060/FS60], [https://amzn.to/3lQnBXG FS100], [https://amzn.to/3xyFxZh FS140]) come with an NPT thread on the end, which prevents it from being directly connected into a load center knockout as none of those connectors have NPT thread patterns on them. Siemens support was utterly useless, basically saying "well you should go find what you need". The solution I ended up arriving at was to use a [https://www.homedepot.com/p/3-4-in-Flexible-Elbow-R6441102/202043366 Cantex 3/4 in. Flexible Elbow], which comes with NPT fittings on both ends, and replace the fitting on one end with an [https://www.homedepot.com/p/3-4-in-90-NMLT-Push-Connector-1-Pack-NMLT907-1/202284600 Arlington 3/4 in. 90° SNAP2IT Non-Metallic Push-On Connector] (also [https://amzn.to/3SayYFY available on Amazon], [http://www.aifittings.com/catalog/liquid-tight/90-degree-snap2it-non-metallic-connectors/NMLT907 Arlington spec page]). If you don't need the 90-degree bend, Arlington makes [http://www.aifittings.com/catalog/liquid-tight/snap2it-non-metallic-connectors/NMLT7 a straight variant] too, which you can get [https://amzn.to/3EoJRy7 on Amazon] or [https://www.homedepot.com/p/SNAP2IT-3-4-in-Non-Metallic-NM-Liquid-Tight-Connector-1-pack-NMLT7-1/202284603 HD] (HD for some reason shows 1/2" in the pictures for the 3/4" product).

The Arlington connectors referenced above are made in the US.

== HVAC registers that aren't made in China or Vietnam ==
Pretty much every HVAC register at your big box store will come from Vietnam or China. If you're looking for something more local, you have a few options:

* [https://www.imperialgroup.ca Imperial Group's] metal registers are made in Canada. They are trivial to get at [https://www.lowes.ca/product/sidewall-ceiling-registers/imperial-10-in-x-6-in-sideceiling-register-2-way-4871464 Lowe's in Canada], but are a bit more challenging to obtain here in the US. Buying them online is an option, but I had a really hard time ordering these from Amazon and having them arrive without damage. One literally was broken in pieces by the time it was at my doorstep. TrueValue carries some of the fancier floor register models (like the wood and satin metal) in some of their stores in New Jersey, but for some reason not the plain vanilla sidewall ones. Note that some of their products are made in China.
* [https://decorgrates.com Decor Grates] is another Canadian manufacturer, who appears to make all of their products in Canada, unlike Imperial. However, their [https://amzn.to/3YKOs5R wood floor register] did not look as polished to my eyes and had a very flimsy damper mechanism. Their site is also a giant mess, with "No products were found matching your selection" regularly showing up while navigating it.
* [https://www.ameriflowregisters.com/residential-grds/sidewall-ceiling-registers-grilles AmeriFlow], aka [https://www.hartandcooley.com/grilles-registers-and-diffusers-grd/residential-grds/sidewall-ceiling-register-grilles Hart & Cooley], makes registers in Mexico and can be found in TrueValue stores as well as e.g. [https://www.supplyhouse.com SupplyHouse]. They seem to be the only ones that make registers that are [https://www.hartandcooley.com/products/681-a681/steel-aluminum-1-way-register-ms-damper-1-2-fin-spacing uni-directional], which is unfortunate as it makes no sense to install a two-way (or straight) register at a vent that's in the corner of a room.
* [https://www.shoemakermfg.com Shoemaker Manufacturing] appear to be the only manufacturer of registers in the US. They are impossible to find in brick and mortar stores (except in Washington?). Online you can find them on some websites with absolutely astronomical prices and unrealistic return policies. I did end up ordering [https://amzn.to/3kbF6RK one register] on Amazon (and took the hit for return shipping) just to see what it looked like, but the styling didn't really work in a residential setting. The spacing of the fins was also too wide.

== Pulling dryer terminal block screws out of Samsung dryers ==
I had the pleasure of dropping not one but two terminal screws in our electric Samsung dryer "into" the dryer. Unlike other manufacturers, Samsung makes the housing of the dryer completely enclosed, so you can't simply "roll" the screw to the front like with other dryers and then just pull it out. There is, however, a way to get them out without fully disassembling the thing. Ironically, it relies on another questionable design decision — leveling legs that come all the way out.

The dryer's leveling legs have two curious features — they are made entirely out of plastic (so excessive force will crack or break them) and they can be completely removed from the dryer if you raise them high enough. This latter property allows us to use the holes to fish out the screws.

Tilt the dryer to the side and back to make sure that your fallen screw is in the rear left corner if looking at the front of the dryer. Then, slightly tilt up the dryer at the rear left corner and use a very strong magnet to reach through the hole and grab the screw. Depending on how strong your magnet is, you might need to reach in with your finger first to bring the screw a little closer to the hole.

A final note: if the dryer is mounted on top of the matching pedestal, you will need to screw the legs onto the pedestal when tilting to get the screw into the corner and then unscrew them when tilting to get the screw out.

Priceline Rewards credit cards

2023-03-04T04:06:16Z

Lensovet: a few more redemption rate maths

Barclays issued a priceline rewards credit card at least as far back as 2017, though it's impossible to find info on it now. Its earnings structure was quite simple:

* 5 points per dollar on Priceline purchases
* 1 point per dollar on everything else

Things got more interesting, however, once you started to redeem those points, because the redemption values were ''also'' different between priceline purchases vs. everything else:

* 1.5% dollar value for points redeemed against priceline purchases
* 1% dollar value for points redeemed against all other purchases
* 10% point redemption refund on all redemptions

This meant that the effective cash back rate on priceline purchases when redeemed against priceline purchases was 5 × 1.5 / 0.9 = 8.33%. If that sounds too good to be true, just do the math on a hypothetical $1000 priceline purchase: you earn 5000 points, which corresponds to a $75 redemption against that purchase, but when you go to use the redemption, only 4500 points are used. The remaining 500 points are worth $7.50 when redeemed against a pricelline purchase, so you effectively get $82.50 worth of rewards against a $1000 purchase (though those points would only "cost" 450, since you'd get another 10% back on that redemption, and on and on).

Note that you could also "cross-redeem", i.e. take points from a regular purchase and redeem them against a priceline purchase and vice versa. This gave you an effective rate of 1.67% for regular purchases redeemed against priceline ones and 5.5% for priceline purchases redeemed against regular ones.

Someone at Barclays probably eventually realized this was too good to be true too, and so in 2022 they introduced the new Priceline VIP Rewards credit card. The earning structure, on paper, got better, because in addition to the earnings with the original card, gas and restaurant purchases would now earn 2 points per dollar spent. They added a rather dubious VIP Gold status as a "perk", as well as reimbursement of TSA PreCheck or Global Entry application fees once your annual spend exceeds $10,000. But the all of the redemption bonuses went away — all purchases now redeemed at 1% and there was no redemption refund. So even non-priceline purchases got a worse redemption rate on this card than the old one!

Of course, the old card is no longer available. However, the reason this matters is because for those who still have the old card, Barclays will tempt you to "upgrade" with this brilliant wording:

{{quote|Update your account to the Priceline VIP Rewards™ Visa® Card and enjoy extraordinary new benefits and services.}}

The touted "benefits" are as follows:

* Reduction of effective priceline redemption rate by 40%
* Reduction of effective other purchase redemption rate by 10%
* Increase of effective redemption rate for gas and restaurant purchases by 80%
* An additional 1% discount for the GE fee once every 5 years (since GE costs $100 and you have to put at least $10,000 of spend on the card to get it)

Given the huge devaluation in priceline redemptions and the multitude of other cards that give a straight 2% cash back on all purchases, there is absolutely no reason for anyone with the older card to "upgrade" to the new one.

Priceline Rewards credit cards

2023-03-04T04:02:04Z

Lensovet:

Barclays issued a priceline rewards credit card at least as far back as 2017, though it's impossible to find info on it now. Its earnings structure was quite simple:

* 5 points per dollar on Priceline purchases
* 1 point per dollar on everything else

Things got more interesting, however, once you started to redeem those points, because the redemption values were ''also'' different between priceline purchases vs. everything else:

* 1.5% dollar value for points redeemed against priceline purchases
* 1% dollar value for points redeemed against all other purchases
* 10% point redemption refund on all redemptions

This meant that the effective cash back rate on priceline purchases when redeemed against priceline purchases was 5 × 1.5 / 0.9 = 8.33%. If that sounds too good to be true, just do the math on a hypothetical $1000 priceline purchase: you earn 5000 points, which corresponds to a $75 redemption against that purchase, but when you go to use the redemption, only 4500 points are used. The remaining 500 points are worth $7.50 when redeemed against a pricelline purchase, so you effectively get $82.50 worth of rewards against a $1000 purchase (though those points would only "cost" 450, since you'd get another 10% back on that redemption, and on and on).

Someone at Barclays probably eventually realized this too, and so in 2022 they introduced the new Priceline VIP Rewards credit card. The earning structure, on paper, got better, because in addition to the earnings with the original card, gas and restaurant purchases would now earn 2 points per dollar spent. They added a rather dubious VIP Gold status as a "perk", as well as reimbursement of TSA PreCheck or Global Entry application fees once your annual spend exceeds $10,000. But the all of the redemption bonuses went away — all purchases now redeemed at 1% and there was no redemption refund. So even non-priceline purchases got a worse redemption rate on this card than the old one!

Of course, the old card is no longer available. However, the reason this matters is because for those who still have the old card, Barclays will tempt you to "upgrade" with this brilliant wording:

{{quote|Update your account to the Priceline VIP Rewards™ Visa® Card and enjoy extraordinary new benefits and services.}}

The touted "benefits" are as follows:

* Reduction of effective priceline redemption rate by 40%
* Reduction of effective other purchase redemption rate by 10%
* Increase of effective redemption rate for gas and restaurant purchases by 80%
* An additional 1% discount for the GE fee once every 5 years (since GE costs $100 and you have to put at least $10,000 of spend on the card to get it)

Given the huge devaluation in priceline redemptions and the multitude of other cards that give a straight 2% cash back on all purchases, there is absolutely no reason for anyone with the older card to "upgrade" to the new one.

Priceline Rewards credit cards

2023-03-04T04:01:06Z

Lensovet: formatting

Barclays issued a priceline rewards credit card at least as far back as 2017, though it's impossible to find info on it now. Its earnings structure was quite simple:

* 5 points per dollar on Priceline purchases
* 1 point per dollar on everything else

Things got more interesting, however, once you started to redeem those points, because the redemption values were ''also'' different between priceline purchases vs. everything else:

* 1.5% dollar value for points redeemed against priceline purchases
* 1% dollar value for points redeemed against all other purchases
* 10% point redemption refund on all redemptions

This meant that the effective cash back rate on priceline purchases when redeemed against priceline purchases was 5 × 1.5 / 0.9 = 8.33%. If that sounds too good to be true, just do the math on a hypothetical $1000 priceline purchase: you earn 5000 points, which corresponds to a $75 redemption against that purchase, but when you go to use the redemption, only 4500 points are used. The remaining 500 points are worth $7.50 when redeemed against a pricelline purchase, so you effectively get $82.50 worth of rewards against a $1000 purchase.

Someone at Barclays probably eventually realized this too, and so in 2022 they introduced the new Priceline VIP Rewards credit card. The earning structure, on paper, got better, because in addition to the earnings with the original card, gas and restaurant purchases would now earn 2 points per dollar spent. They added a rather dubious VIP Gold status as a "perk", as well as reimbursement of TSA PreCheck or Global Entry application fees once your annual spend exceeds $10,000. But the all of the redemption bonuses went away — all purchases now redeemed at 1% and there was no redemption refund. So even non-priceline purchases got a worse redemption rate on this card than the old one!

Of course, the old card is no longer available. However, the reason this matters is because for those who still have the old card, Barclays will tempt you to "upgrade" with this brilliant wording:

{{quote|Update your account to the Priceline VIP Rewards™ Visa® Card and enjoy extraordinary new benefits and services.}}

The touted "benefits" are as follows:

* Reduction of effective priceline redemption rate by 40%
* Reduction of effective other purchase redemption rate by 10%
* Increase of effective redemption rate for gas and restaurant purchases by 80%
* An additional 1% discount for the GE fee once every 5 years (since GE costs $100 and you have to put at least $10,000 of spend on the card to get it)

Given the huge devaluation in priceline redemptions and the multitude of other cards that give a straight 2% cash back on all purchases, there is absolutely no reason for anyone with the older card to "upgrade" to the new one.

Priceline Rewards credit cards

2023-03-04T04:00:35Z

Lensovet: Created page with "Barclays issued a priceline rewards credit card at least as far back as 2017, though it's impossible to find info on it now. Its earnings structure was quite simple: * 5 poin..."

Barclays issued a priceline rewards credit card at least as far back as 2017, though it's impossible to find info on it now. Its earnings structure was quite simple:

* 5 points per dollar on Priceline purchases
* 1 point per dollar on everything else

Things got more interesting, however, once you started to redeem those points, because the redemption values were 'also' different between priceline purchases vs. everything else:

* 1.5% dollar value for points redeemed against priceline purchases
* 1% dollar value for points redeemed against all other purchases
* 10% point redemption refund on all redemptions

This meant that the effective cash back rate on priceline purchases when redeemed against priceline purchases was 5 × 1.5 / 0.9 = 8.33%. If that sounds too good to be true, just do the math on a hypothetical $1000 priceline purchase: you earn 5000 points, which corresponds to a $75 redemption against that purchase, but when you go to use the redemption, only 4500 points are used. The remaining 500 points are worth $7.50 when redeemed against a pricelline purchase, so you effectively get $82.50 worth of rewards against a $1000 purchase.

Someone at Barclays probably eventually realized this too, and so in 2022 they introduced the new Priceline VIP Rewards credit card. The earning structure, on paper, got better, because in addition to the earnings with the original card, gas and restaurant purchases would now earn 2 points per dollar spent. They added a rather dubious VIP Gold status as a "perk", as well as reimbursement of TSA PreCheck or Global Entry application fees once your annual spend exceeds $10,000. But the all of the redemption bonuses went away — all purchases now redeemed at 1% and there was no redemption refund. So even non-priceline purchases got a worse redemption rate on this card than the old one!

Of course, the old card is no longer available. However, the reason this matters is because for those who still have the old card, Barclays will tempt you to "upgrade" with this brilliant wording:

{{quote|Update your account to the Priceline VIP Rewards™ Visa® Card and enjoy extraordinary new benefits and services.}}

The touted "benefits" are as follows:

* Reduction of effective priceline redemption rate by 40%
* Reduction of effective other purchase redemption rate by 10%
* Increase of effective redemption rate for gas and restaurant purchases by 80%
* An additional 1% discount for the GE fee once every 5 years (since GE costs $100 and you have to put at least $10,000 of spend on the card to get it)

Given the huge devaluation in priceline redemptions and the multitude of other cards that give a straight 2% cash back on all purchases, there is absolutely no reason for anyone with the older card to "upgrade" to the new one.

lensowiki:Community Portal

2023-03-04T03:31:23Z

Lensovet: /* Personal records */ +priceline

Welcome to the '''Community Portal'''! For more information about the lensowiki project, see the [[lensowiki:About|About]] page.

New articles will be announced and listed here, listed by subject.

==Computer Science/IT==
*[[CS]] ''list of various CS projects, including personal projects and classwork''
*[[DC|DC++]] ''config instructions for Cal hub''
*[[lensowiki:Installation caveats|Installation caveats]] ''details the problems inherent in a MediaWiki installation with a UTF-8 encoding for the database tables and functional workarounds''
*[[Sony Clie on Mac OS X]] ''provides instructions for syncing Sony Clie handhelds on Mac OS X without Missing Sync''

==History==
*[[History of Alsace and Lorraine]] ''in French''

==Home Improvement==
*[[Home improvement]]

==Personal records==
*[[Caltrain]] ''a nasty incident on Caltrain in which I was forced off a train after paying my fare with Translink''
*[[Photo shoots]] ''photo-shooting locations and notes''
*[[Swimming]] ''includes swimming workouts''
*[[Class schedule]] ''class schedules for past and current semesters''
*[[Academic plans]] ''4-year plans for graduation''
*[[Priceline Rewards credit cards]] ''a comparison that exists nowhere else on the internet''

FMenu/flash

2023-02-21T09:53:28Z

Lensovet:

<div style="margin: auto 5em; border: red medium solid; padding: 0.5em; background: #f9f9f9;">
''FMenu version 3.1 was released on January 17, 2010 and includes stability improvements, UI changes to keep up with site updates, and full Snow Leopard compatibility. Note that there are now separate downloads for users of 10.4 and everyone else.''

''It is now 2023 and Facebook's API has changed significantly such that this app no longer works. The way that people use Facebook has changed dramatically as well. Growl no longer exists. Perhaps one day this app will come back — or not.''</div>

FMenu

2023-02-21T09:52:09Z

Lensovet:

{{/flash}}
[[Image:FMenu-main.png|thumb|400px|Screenshot of FMenu]]
[[Image:Fmenu-prefs.png|thumb|400px|Screenshot of FMenu prefs window]]
'''FMenu''' was a program for [[w:Mac OS X|Mac OS X]] and [[w:Facebook|Facebook]] that sits in the menu bar (near the clock) and provides notifications about various events. In addition, it provides a menu to easily access common Facebook pages and keeps a count of your messages, pokes, events, friend requests, wall posts, and photo comments. It also features a "Quicklaunch" box which gives you immediate access to your friends' profiles, groups, and events, as well as Facebook searches (type a phrase and press enter). Notifications are issued using [[w:Growl|Growl]] and can be customized to the user's liking (including turning on/off and customizing display style). They are:
*A friend updated his profile
*A friend changed his status
*A friend wrote a new note
*Someone wrote on your wall
*You have new messages
*You have new pokes
*You have new friend requests
FMenu checks for updates by default every 7 seconds (or at whatever interval you set), but checks for each kind of notification (friend details, friend requests, wall, messages/pokes, events) separately. Consequently each particular type of notification is refreshed once every 42 seconds.

'''Please note:''' this application will work with most of your friends. However, if you are not getting notifications for some friends, it probably means that they have opted out of releasing their info to applications using the Facebook API. Tell your friends to go to [http://www.facebook.com/settings/?tab=privacy&section=applications&field=friends_share Facebook's Applications & Websites privacy settings] and make sure that the checkbox labeled ''Status updates'' is '''checked'''. Otherwise, FMenu has absolutely no way of retrieving that user's profile.

==Download==
{{/buttons}}
The latest version is {{/version}}. It is a [[w:Universal Binary|Universal Binary]] and requires Mac OS X 10.4 or better. Note that since version 3.1, there are separate downloads for users of Mac OS X 10.4 and 10.5 and above, due to 64-bit loading issues with Growl. However, there is no functional difference between the versions. The 10.5 and above binary is 64-bit and fully compatible with Snow Leopard.
*FMenu for users of [{{/latestversion/10.4}} 10.4 only] and [{{/latestversion/10.5}} 10.5 and above] who ''already have Growl installed on their system'' (.zip file)
*[{{/3.0/Growl}} FMenu for all other users] – if you do not have Growl installed, FMenu will prompt you to install it automatically with no additional downloads required (.zip file). Note that this is version 3.0; after installation of Growl, check for updates in the menu to update to the latest version.
FMenu is released under the [http://www.gnu.org/licenses/gpl.html GNU General Public License]. Source code can be found inside the application package by going to <tt>FMenu.app/Contents/Resources/Source</tt> or checked out using [[w:Subversion (software)|SVN]] [http://sourceforge.net/svn/?group_id=188286 from SourceForge].

Older versions can be obtained below; however, they are unsupported, generally inferior, and only provided for archival purposes.

==Installation==
Simply download the appropriate file above, then double-click it. FMenu.app will appear in the same folder as the .zip file you just downloaded. Move FMenu.app to your Applications and double-click it to open. You might also want to add it to your startup items by going to System Preferences→Accounts, selecting your account on the left, then clicking on the '''Login items''' tab. Click the '''+''' button and choose FMenu from the window that appears.

As of version 2.5, you can have your Facebook credentials saved by checking the according checkbox on the login page. Note that FMenu does not store your actual password and that this procedure does '''not''' compromise the security of your Facebook account in any way.

==Acknowledgments==
This application completely relies on [http://pointlesscrap.net/mkabefook/ MKAbeFook framework] written by Mike Kinney to communicate with the [http://developers.facebook.com/documentation.php Facebook API]. In addition, the first version of the app was written by Logan Rockmore of [http://www.burgundylogan.com Logan Design].

==Known issues==
*If you put your computer to sleep for an extended period of time, FMenu will obviously give a large number of notifications that happened during the time that your computer was turned off the first time it updates. Make sure that the number of "sticky" notifications is not very high, because otherwise you will spend a lot of time dismissing all of them (Workaround: Alt-click on any growl notifications's close (X) button to dismiss all the messages on-screen).
*If you remove a friend while FMenu is running (or a friend disables their account, etc), you will get a notice saying they changed their profile and published a note.
*If you change your Facebook password, you will stop receiving notifications. Choose Log out… from the menu and then log back in to resume receiving notifications.

There is also a [[/FAQ|FAQ]] of common questions and problems. If you have other questions or problems, please follow the instructions on the [[Talk:{{PAGENAME}}|discussion page]].

==Version history==
{{/changelog}}

{{cs projects}}

Class schedule

2023-02-21T08:11:08Z

Lensovet: /* Spring 08 */

Class schedules, in their various iterations, will be placed here, in reverse chronological order (last semester first).
To put a pretty table taken from [http://www.ocf.berkeley.edu/~amanb/makeSched/ Aman's schedule maker] here, copy the HTML and then perform the following search/replace functions in SubEthaEdit:
<nowiki><a\sclass=subtle\stitle="CCN:\s\d\d\d\d\d\"\shref=\"javascript:ccn$\'\d\d\d\d\d\'$"></nowiki> ''[[w:regexp|regexp]]''
<nowiki><a\sclass=del\shref="javascript:del$\'\d\d\d\d\d\'$"></nowiki> ''[[w:regexp|regexp]]''
<nowiki></A></nowiki>
<nowiki><img border=0 src="../x.gif"></nowiki>

==Spring 08==
CS:160-LEC TuTh 330-5P 306 SODA CCN=26479
CS:160-DIS-:102 Tu 2-3P 310 SODA CCN=26485
STAT:131A-LEC TuTh 1230-2P 155 KROEBER CCN=87444
STAT:131A-LAB-:101 MW 11-12P 332 EVANS CCN=87447
SLAL:46-LEC MWF 12-1P 174 BARROWS CCN=79754
CAEE:155-LEC TuTh 10-11A 3106 ETCHEVERRY CCN=14044
CAEE:155-LAB-:101 F 12-3P 502 DAVIS CCN=14047
PE:4-LAB MW 3-4P HEARST POOL CCN=68264
ES,-P,-AM:102D-LEC TuTh 11-1230P 150 GSPP CCN=29265
ES,-P,-AM:102D-DIS-:102 W 1-2P 321 HAVILAND CCN=29271

==Spring 07==
===Pre-planning stages===
Here I'm undecided about which of Math 55 and CS 70 to take. I'm also waiting on a music class to find out when it meets. apart from that this schedule is set.
<TABLE class=stbl cellpadding=5>
<TR><TD class=shead>SCHEDULE</TD><TD class=shead colspan=1>Mon</TD><TD class=shead colspan=1>Tue</TD><TD class=shead colspan=1>Wed</TD><TD class=shead colspan=1>Thu</TD><TD class=shead colspan=2>Fri</TD><TD class=sempty></TD></TR>

<TR><TD nowrap class=shead>1000</TD><TD class=sdata rowspan=2 style='background:#cfcfc4'>MUS:51 LEC 135 MORRISON </TD><TD class=sempty rowspan=4></TD><TD class=sdata rowspan=2 style='background:#cfcfc4'>MUS:51 LEC 135 MORRISON </TD><TD class=sempty rowspan=4></TD><TD class=sdata rowspan=2 style='background:#cfcfc4'>MUS:51 LEC 135 MORRISON </TD><TD class=sempty1 rowspan=8></TD><TD nowrap class=shead>1000</TD></TR>
<TR><TD nowrap class=shead>1030</TD><TD nowrap class=shead>1030</TD></TR>

<TR><TD nowrap class=shead>1100</TD><TD class=sdata rowspan=2 style='background:#fec2c7'>SLAL:105B LEC 258 DWINELLE </TD><TD class=sdata rowspan=2 style='background:#fec2c7'>SLAL:105B LEC 258 DWINELLE </TD><TD class=sdata rowspan=2 style='background:#fec2c7'>SLAL:105B LEC 258 DWINELLE </TD><TD nowrap class=shead>1100</TD></TR>
<TR><TD nowrap class=shead>1130</TD><TD nowrap class=shead>1130</TD></TR>

<TR><TD nowrap class=shead>1200</TD><TD class=sdata rowspan=2 style='background:#fbd1d0'>IS:4 LEC 2030 VALLEY LSB </TD><TD class=sdata rowspan=2 style='background:#fbd1d0'>IS:4 LEC 2030 VALLEY LSB </TD><TD class=sdata rowspan=2 style='background:#fbd1d0'>IS:4 LEC 2030 VALLEY LSB </TD><TD class=sdata rowspan=2 style='background:#fbd1d0'>IS:4 LEC 2030 VALLEY LSB </TD><TD class=sdata rowspan=2 style='background:#fbd1d0'>IS:4 LEC 2030 VALLEY LSB </TD><TD nowrap class=shead>1200</TD></TR>

<TR><TD nowrap class=shead>1230</TD><TD nowrap class=shead>1230</TD></TR>
<TR><TD nowrap class=shead>1300</TD><TD class=sdata rowspan=2 style='background:#f0fbef'>CS:61C LEC 2050 VALLEY LSB </TD><TD class=sempty rowspan=5></TD><TD class=sdata rowspan=2 style='background:#f0fbef'>CS:61C LEC 2050 VALLEY LSB </TD><TD class=sempty rowspan=5></TD><TD class=sdata rowspan=2 style='background:#f0fbef'>CS:61C LEC 2050 VALLEY LSB </TD><TD nowrap class=shead>1300</TD></TR>

<TR><TD nowrap class=shead>1330</TD><TD nowrap class=shead>1330</TD></TR>
<TR><TD nowrap class=shead>1400</TD><TD class=sdata rowspan=2 style='background:#dde9d7'>MATH:55 LEC 277 CORY </TD><TD class=sdata rowspan=2 style='background:#dde9d7'>MATH:55 LEC 277 CORY </TD><TD class=sdata rowspan=2 style='background:#f5d4cd'>CS:70 DIS :103 85 EVANS </TD><TD class=sdata rowspan=2 style='background:#dde9d7'>MATH:55 LEC 277 CORY </TD><TD nowrap class=shead>1400</TD></TR>

<TR><TD nowrap class=shead>1430</TD><TD nowrap class=shead>1430</TD></TR>
<TR><TD nowrap class=shead>1500</TD><TD class=sempty1 rowspan=4></TD><TD class=sempty1 rowspan=4></TD><TD class=sempty1 rowspan=4></TD><TD class=sempty1 rowspan=4></TD><TD nowrap class=shead>1500</TD></TR>
<TR><TD nowrap class=shead>1530</TD><TD class=sdata rowspan=3 style='background:#f5d4cd'>CS:70 LEC 2 LECONTE </TD><TD class=sdata rowspan=3 style='background:#f5d4cd'>CS:70 LEC 2 LECONTE </TD><TD nowrap class=shead>1530</TD></TR>

<TR><TD nowrap class=shead>1600</TD><TD nowrap class=shead>1600</TD></TR>
<TR><TD nowrap class=shead>1630</TD><TD nowrap class=shead>1630</TD></TR>
</TABLE>
==Fall 06==
===As of Sep 8===
<TABLE class=stbl cellpadding=5 style="text-align:center;">
<TR><TD class=shead>SCHEDULE</TD><TD class=shead colspan=1>Mon</TD><TD class=shead colspan=1>Tue</TD><TD class=shead colspan=1>Wed</TD><TD class=shead colspan=1>Thu</TD><TD class=shead colspan=1>Fri</TD><TD class=sempty></TD></TR>

<TR><TD nowrap class=shead>800</TD><TD class=sempty1 rowspan=4></TD><TD class=sdata rowspan=3 style='background:#cfcfc4'>MATH:54 DIS :101 61 EVANS </TD><TD class=sempty1 rowspan=4></TD><TD class=sdata rowspan=3 style='background:#cfcfc4'>MATH:54 DIS :101 61 EVANS </TD><TD class=sempty1 rowspan=4></TD><TD nowrap class=shead>800</TD></TR>
<TR><TD nowrap class=shead>830</TD><TD nowrap class=shead>830</TD></TR>
<TR><TD nowrap class=shead>900</TD><TD nowrap class=shead>900</TD></TR>

<TR><TD nowrap class=shead>930</TD><TD class=sdata rowspan=3 style='background:#fec2c7'>FRENCH:102 LEC:002 B4 DWINELLE </TD><TD class=sdata rowspan=3 style='background:#fec2c7'>FRENCH:102 LEC:002 B4 DWINELLE </TD><TD nowrap class=shead>930</TD></TR>
<TR><TD nowrap class=shead>1000</TD><TD class=sdata rowspan=2 style='background:#fbd1d0'>MUS:50 LEC 124 MORRISON </TD><TD class=sdata rowspan=2 style='background:#fbd1d0'>MUS:50 LEC 124 MORRISON </TD><TD class=sdata rowspan=2 style='background:#fbd1d0'>MUS:50 LEC 124 MORRISON </TD><TD nowrap class=shead>1000</TD></TR>

<TR><TD nowrap class=shead>1030</TD><TD nowrap class=shead>1030</TD></TR>
<TR><TD nowrap class=shead>1100</TD><TD class=sdata rowspan=2 style='background:#f0fbef'>SLAL:105A LEC 205 DWINELLE </TD><TD class=sempty rowspan=2></TD><TD class=sdata rowspan=2 style='background:#f0fbef'>SLAL:105A LEC 205 DWINELLE </TD><TD class=sdata rowspan=2 style='background:#dde9d7'>SLAL:114 SLF 205 DWINELLE </TD><TD class=sdata rowspan=2 style='background:#f0fbef'>SLAL:105A LEC 205 DWINELLE </TD><TD nowrap class=shead>1100</TD></TR>

<TR><TD nowrap class=shead>1130</TD><TD nowrap class=shead>1130</TD></TR>
<TR><TD nowrap class=shead>1200</TD><TD class=sdata rowspan=2 style='background:#f5d4cd'>IS:3 LEC:003 283 DWINELLE </TD><TD class=sdata rowspan=2 style='background:#f5d4cd'>IS:3 LEC:003 283 DWINELLE </TD><TD class=sdata rowspan=2 style='background:#f5d4cd'>IS:3 LEC:003 283 DWINELLE </TD><TD class=sdata rowspan=2 style='background:#f5d4cd'>IS:3 LEC:003 283 DWINELLE </TD><TD class=sdata rowspan=2 style='background:#f5d4cd'>IS:3 LEC:003 283 DWINELLE </TD><TD nowrap class=shead>1200</TD></TR>

<TR><TD nowrap class=shead>1230</TD><TD nowrap class=shead>1230</TD></TR>
<TR><TD nowrap class=shead>1300</TD><TD class=sdata rowspan=2 style='background:#d2e3c7'>MUS:61 LEC 117 MORRISON </TD><TD class=sdata rowspan=4 style='background:#c9e5cb'>CS:61B LAB :013 277 SODA </TD><TD class=sdata rowspan=2 style='background:#d2e3c7'>MUS:61 LEC 117 MORRISON </TD><TD class=sempty rowspan=2></TD><TD class=sdata rowspan=2 style='background:#d2e3c7'>MUS:61 LEC 117 MORRISON </TD><TD nowrap class=shead>1300</TD></TR>

<TR><TD nowrap class=shead>1330</TD><TD nowrap class=shead>1330</TD></TR>
<TR><TD nowrap class=shead>1400</TD><TD class=sempty1 rowspan=2></TD><TD class=sempty1 rowspan=2></TD><TD class=sdata rowspan=2 style='background:#c9e5cb'>CS:61B DIS :113 101 BARROWS </TD><TD class=sempty1 rowspan=2></TD><TD nowrap class=shead>1400</TD></TR>
<TR><TD nowrap class=shead>1430</TD><TD nowrap class=shead>1430</TD></TR>
<TR><TD nowrap class=shead>1500</TD><TD class=sdata rowspan=2 style='background:#cfcfc4'>MATH:54 LEC 155 DWINELLE </TD><TD class=sdata rowspan=2 style='background:#edd5f8'>PE:4 LAB:003 HEARST POOL </TD><TD class=sdata rowspan=2 style='background:#cfcfc4'>MATH:54 LEC 155 DWINELLE </TD><TD class=sdata rowspan=2 style='background:#edd5f8'>PE:4 LAB:003 HEARST POOL </TD><TD class=sdata rowspan=2 style='background:#cfcfc4'>MATH:54 LEC 155 DWINELLE </TD><TD nowrap class=shead>1500</TD></TR>

<TR><TD nowrap class=shead>1530</TD><TD nowrap class=shead>1530</TD></TR>
<TR><TD nowrap class=shead>1600</TD><TD class=sdata rowspan=2 style='background:#c9e5cb'>CS:61B LEC 145 DWINELLE </TD><TD class=sempty rowspan=2></TD><TD class=sdata rowspan=2 style='background:#c9e5cb'>CS:61B LEC 145 DWINELLE </TD><TD class=sempty rowspan=2></TD><TD class=sdata rowspan=2 style='background:#c9e5cb'>CS:61B LEC 145 DWINELLE </TD><TD nowrap class=shead>1600</TD></TR>

<TR><TD nowrap class=shead>1630</TD><TD nowrap class=shead>1630</TD></TR>
</TABLE>

===Before the start of classes (Aug 28)===
<TABLE class=stbl cellpadding=5 cellspacing=0 border=0 style="text-align: center;">
<TR><TD class=shead>SCHEDULE</TD><TD class=shead colspan=1>Mon</TD><TD class=shead colspan=1>Tue</TD><TD class=shead colspan=1>Wed</TD><TD class=shead colspan=1>Thu</TD><TD class=shead colspan=1>Fri</TD><TD class=sempty></TD></TR>

<TR><TD nowrap class=shead>800</TD><TD class=sempty1 rowspan=4></TD><TD class=sdata rowspan=3 style='background:#cfcfc4'>MATH:54 DIS :101 61 EVANS </TD><TD class=sempty1 rowspan=4></TD><TD class=sdata rowspan=3 style='background:#cfcfc4'>MATH:54 DIS :101 61 EVANS </TD><TD class=sempty1 rowspan=4></TD><TD nowrap class=shead>800</TD></TR>
<TR><TD nowrap class=shead>830</TD><TD nowrap class=shead>830</TD></TR>
<TR><TD nowrap class=shead>900</TD><TD nowrap class=shead>900</TD></TR>

<TR><TD nowrap class=shead>930</TD><TD class=sdata rowspan=3 style='background:#fec2c7'>FRENCH:102 LEC:002 B4 DWINELLE </TD><TD class=sdata rowspan=3 style='background:#fec2c7'>FRENCH:102 LEC:002 B4 DWINELLE </TD><TD nowrap class=shead>930</TD></TR>
<TR><TD nowrap class=shead>1000</TD><TD class=sdata rowspan=2 style='background:#fbd1d0'>MUS:50 LEC 124 MORRISON </TD><TD class=sdata rowspan=2 style='background:#fbd1d0'>MUS:50 LEC 124 MORRISON </TD><TD class=sdata rowspan=2 style='background:#fbd1d0'>MUS:50 LEC 124 MORRISON </TD><TD nowrap class=shead>1000</TD></TR>

<TR><TD nowrap class=shead>1030</TD><TD nowrap class=shead>1030</TD></TR>
<TR><TD nowrap class=shead>1100</TD><TD class=sdata rowspan=2 style='background:#f0fbef'>MUS:61 LEC:002 128 MORRISON </TD><TD class=sempty rowspan=2></TD><TD class=sdata rowspan=2 style='background:#f0fbef'>MUS:61 LEC:002 128 MORRISON </TD><TD class=sempty rowspan=2></TD><TD class=sdata rowspan=2 style='background:#f0fbef'>MUS:61 LEC:002 128 MORRISON </TD><TD nowrap class=shead>1100</TD></TR>

<TR><TD nowrap class=shead>1130</TD><TD nowrap class=shead>1130</TD></TR>
<TR><TD nowrap class=shead>1200</TD><TD class=sdata rowspan=2 style='background:#dde9d7'>IS:3 LEC:003 C320 CHEIT </TD><TD class=sdata rowspan=2 style='background:#dde9d7'>IS:3 LEC:003 C320 CHEIT </TD><TD class=sdata rowspan=2 style='background:#dde9d7'>IS:3 LEC:003 C320 CHEIT </TD><TD class=sdata rowspan=2 style='background:#dde9d7'>IS:3 LEC:003 C320 CHEIT </TD><TD class=sdata rowspan=2 style='background:#dde9d7'>IS:3 LEC:003 C320 CHEIT </TD><TD nowrap class=shead>1200</TD></TR>

<TR><TD nowrap class=shead>1230</TD><TD nowrap class=shead>1230</TD></TR>
<TR><TD nowrap class=shead>1300</TD><TD class=sdata rowspan=4 style='background:#f5d4cd'>PE:1 LAB:007 234 HEARST GYM </TD><TD class=sdata rowspan=4 style='background:#d2e3c7'>CS:61B LAB :013 277 SODA </TD><TD class=sempty1 rowspan=4></TD><TD class=sempty rowspan=2></TD><TD class=sempty1 rowspan=4></TD><TD nowrap class=shead>1300</TD></TR>
<TR><TD nowrap class=shead>1330</TD><TD nowrap class=shead>1330</TD></TR>

<TR><TD nowrap class=shead>1400</TD><TD class=sdata rowspan=2 style='background:#d2e3c7'>CS:61B DIS :113 78 BARROWS </TD><TD nowrap class=shead>1400</TD></TR>
<TR><TD nowrap class=shead>1430</TD><TD nowrap class=shead>1430</TD></TR>
<TR><TD nowrap class=shead>1500</TD><TD class=sdata rowspan=2 style='background:#cfcfc4'>MATH:54 LEC 155 DWINELLE </TD><TD class=sdata rowspan=2 style='background:#c9e5cb'>PE:4 LAB:003 HEARST POOL </TD><TD class=sdata rowspan=2 style='background:#cfcfc4'>MATH:54 LEC 155 DWINELLE </TD><TD class=sdata rowspan=2 style='background:#c9e5cb'>PE:4 LAB:003 HEARST POOL </TD><TD class=sdata rowspan=2 style='background:#cfcfc4'>MATH:54 LEC 155 DWINELLE </TD><TD nowrap class=shead>1500</TD></TR>

<TR><TD nowrap class=shead>1530</TD><TD nowrap class=shead>1530</TD></TR>
<TR><TD nowrap class=shead>1600</TD><TD class=sdata rowspan=2 style='background:#d2e3c7'>CS:61B LEC 145 DWINELLE </TD><TD class=sempty rowspan=2></TD><TD class=sdata rowspan=2 style='background:#d2e3c7'>CS:61B LEC 145 DWINELLE </TD><TD class=sempty rowspan=2></TD><TD class=sdata rowspan=2 style='background:#d2e3c7'>CS:61B LEC 145 DWINELLE </TD><TD nowrap class=shead>1600</TD></TR>

<TR><TD nowrap class=shead>1630</TD><TD nowrap class=shead>1630</TD></TR>
</TABLE>
There’s also another class that doesn’t have a scheduled meeting time, Slavic 114.

==Spring 06==

==Fall 05==

Main Page

2023-02-20T03:57:02Z

Lensovet: Changed redirect target from lensowiki:Community portal to lensowiki:Community Portal

#redirect[[lensowiki:Community Portal]]

Main Page

2023-02-20T03:56:47Z

Lensovet: Redirected page to lensowiki:Community portal

#redirect[[lensowiki:Community portal]]

lensowiki:Community Portal

2023-02-20T03:55:49Z

Lensovet: good times

Computer Science/61b/Projects/Ocean/SimText.java

2023-02-20T03:51:37Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean/SimText.java to Computer Science/61b/Projects/Ocean/SimText.java

:''The author of this file is Jonathan Shewchuk; consequently, I cannot make it freely available.''

CS/61b/Projects/Ocean/SimText.java

2023-02-20T03:51:37Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean/SimText.java to Computer Science/61b/Projects/Ocean/SimText.java

#REDIRECT [[Computer Science/61b/Projects/Ocean/SimText.java]]

Computer Science/61b/Projects/Ocean/Simulation.java

2023-02-20T03:51:37Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean/Simulation.java to Computer Science/61b/Projects/Ocean/Simulation.java

:''The author of this file is Jonathan Shewchuk; consequently, I cannot make it freely available.''

CS/61b/Projects/Ocean/Simulation.java

2023-02-20T03:51:37Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean/Simulation.java to Computer Science/61b/Projects/Ocean/Simulation.java

#REDIRECT [[Computer Science/61b/Projects/Ocean/Simulation.java]]

Computer Science/61b/Projects/Ocean/Test4.java

2023-02-20T03:51:37Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean/Test4.java to Computer Science/61b/Projects/Ocean/Test4.java

{{code}}
/* Test4.java */

public class Test4 {
public static int empty;
public static int shark;
public static int fish;

public static void init() {
empty = Ocean.EMPTY;
shark = Ocean.SHARK;
fish = Ocean.FISH;
}
}

CS/61b/Projects/Ocean/Test4.java

2023-02-20T03:51:37Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean/Test4.java to Computer Science/61b/Projects/Ocean/Test4.java

#REDIRECT [[Computer Science/61b/Projects/Ocean/Test4.java]]

Computer Science/61b/Projects/Ocean/TypeAndSize.java

2023-02-20T03:51:37Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean/TypeAndSize.java to Computer Science/61b/Projects/Ocean/TypeAndSize.java

:''The author of this file is Jonathan Shewchuk; consequently, I cannot make it freely available.''

CS/61b/Projects/Ocean/TypeAndSize.java

2023-02-20T03:51:37Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean/TypeAndSize.java to Computer Science/61b/Projects/Ocean/TypeAndSize.java

#REDIRECT [[Computer Science/61b/Projects/Ocean/TypeAndSize.java]]

Computer Science/61c

2023-02-20T03:51:37Z

Lensovet: Lensovet moved page CS/61c to Computer Science/61c

*[[/Projects]]
*[[/Homework]]

==External links==
*[http://inst.eecs.berkeley.edu/~cs61c/sp07/ Class website]

CS/61c

2023-02-20T03:51:37Z

Lensovet: Lensovet moved page CS/61c to Computer Science/61c

#REDIRECT [[Computer Science/61c]]

CS/61b/Projects/Network/player/Gameboard.java

2023-02-20T03:51:36Z

Lensovet: Lensovet moved page CS/61b/Projects/Network/player/Gameboard.java to Computer Science/61b/Projects/Network/player/Gameboard.java

#REDIRECT [[Computer Science/61b/Projects/Network/player/Gameboard.java]]

Computer Science/61b/Projects/Network/player/MachinePlayer.java

2023-02-20T03:51:36Z

Lensovet: Lensovet moved page CS/61b/Projects/Network/player/MachinePlayer.java to Computer Science/61b/Projects/Network/player/MachinePlayer.java

{{code}}
/* MachinePlayer.java */

package player;

/**
* An implementation of an automatic Network player. Keeps track of moves
* made by both players. Can select a move for itself.
*/
public class MachinePlayer extends Player {

private int color;
private int opponent;
private int depth;
private Gameboard board;

public static final int SDEPTH = 2;

// Creates a machine player with the given color. Color is either 0 (black)
// or 1 (white). (White has the first move.)
public MachinePlayer(int color) {
this(color, SDEPTH);
}

// Creates a machine player with the given color and search depth. Color is
// either 0 (black) or 1 (white). (White has the first move.)
public MachinePlayer(int color, int searchDepth) {
this.color = color;
opponent = Gameboard.generateOpponent(color);
depth = searchDepth;
board = new Gameboard();
}

// Returns a new move by "this" player. Internally records the move (updates
// the internal game board) as a move by "this" player.
public Move chooseMove() {
Move winningmove = board.evalTree(color, depth);
board.performMove(color, winningmove);
return winningmove;
}

// If the Move m is legal, records the move as a move by the opponent
// (updates the internal game board) and returns true. If the move is
// illegal, returns false without modifying the internal state of "this"
// player. This method allows your opponents to inform you of their moves.
public boolean opponentMove(Move m) {
return board.performMove(opponent, m);
}

// If the Move m is legal, records the move as a move by "this" player
// (updates the internal game board) and returns true. If the move is
// illegal, returns false without modifying the internal state of "this"
// player. This method is used to help set up "Network problems" for your
// player to solve.
public boolean forceMove(Move m) {
return board.performMove(color, m);
}

public int boardScore() {
return board.winner();
}
}

CS/61b/Projects/Network/player/MachinePlayer.java

2023-02-20T03:51:36Z

Lensovet: Lensovet moved page CS/61b/Projects/Network/player/MachinePlayer.java to Computer Science/61b/Projects/Network/player/MachinePlayer.java

#REDIRECT [[Computer Science/61b/Projects/Network/player/MachinePlayer.java]]

Computer Science/61b/Projects/Network/player/Move.java

2023-02-20T03:51:36Z

Lensovet: Lensovet moved page CS/61b/Projects/Network/player/Move.java to Computer Science/61b/Projects/Network/player/Move.java

/* Move.java */

package player;

/**
* A public class for holding all the fields in a move. This class is a
* container for data, not an ADT; hence, all fields are public.
*
* The moveKind field stores the type of move. The x-coordinates index the
* horizontal direction (left to right) and the y-coordinates index the
* vertical direction (top to bottom). x- and y-coordinates start at zero.
*
* DO NOT CHANGE THIS FILE.
*/
public class Move {

{{notmine|Jonathan Shewchuk}}

CS/61b/Projects/Network/player/Move.java

2023-02-20T03:51:36Z

Lensovet: Lensovet moved page CS/61b/Projects/Network/player/Move.java to Computer Science/61b/Projects/Network/player/Move.java

#REDIRECT [[Computer Science/61b/Projects/Network/player/Move.java]]

Computer Science/61b/Projects/Network/player/Player.java

2023-02-20T03:51:36Z

Lensovet: Lensovet moved page CS/61b/Projects/Network/player/Player.java to Computer Science/61b/Projects/Network/player/Player.java

{{code}}
/* Player.java */

package player;

/**
* A class that is extended by all Network players (human and machine).
*
* DO NOT CHANGE THIS FILE.
*/
public abstract class Player {
// This player's name as recognized by the game Network.
public String myName;

// Returns a new move by "this" player. Internally records the move (updates
// the internal game board) as a move by "this" player.
public abstract Move chooseMove();

// If the Move m is legal, records the move as a move by the opponent
// (updates the internal game board) and returns true. If the move is
// illegal, returns false without modifying the internal state of "this"
// player. This method allows your opponents to inform you of their moves.
public abstract boolean opponentMove(Move m);

// If the Move m is legal, records the move as a move by "this" player
// (updates the internal game board) and returns true. If the move is
// illegal, returns false without modifying the internal state of "this"
// player. This method is used to help set up "Network problems" for your
// player to solve.
public abstract boolean forceMove(Move m);

}

CS/61b/Projects/Network/player/Player.java

2023-02-20T03:51:36Z

Lensovet: Lensovet moved page CS/61b/Projects/Network/player/Player.java to Computer Science/61b/Projects/Network/player/Player.java

#REDIRECT [[Computer Science/61b/Projects/Network/player/Player.java]]

Computer Science/61b/Projects/Ocean

2023-02-20T03:51:36Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean to Computer Science/61b/Projects/Ocean

==Files==
===Main Ocean files===
*[[/Ocean.java]]
*[[/RunLengthEncoding.java]]
===Helper linked-list ADT===
*[[/DList.java]]
*[[/DListNode.java]]
===Testing files===
*[[/SimText.java]]
*[[/Simulation.java]]
*[[/Test4.java]]
*[[/TypeAndSize.java]]

==Grade==
20/20

==Description==
CS 61B Project 1
Sharks and Fish
Due 4pm Friday, September 29, 2006

Warning: This project is time-consuming. Start early.

This is an individual assignment; you may not share code with other students.

Getting started: You will find the code for this assignment in $master/hw/pj1/.
Start by copying it into your own pj1 directory.

In this project you will implement a simulation of an ocean containing sharks
and fish. You will also write code to convert an ocean into a run-length
encoding and back. The ocean is rectangular, but the edges are connected
together in a topological donut or torus. This means that the top (North) and
bottom (South) edges are considered adjacent, so if you start at the top edge
and go up, you'll be at the bottom edge (just like in the video game
Asteroids). Similarly, the East and West edges are connected (just like in
Pac Man). The ocean is divided into square cells, which are indexed as follows
(for a 4x3 ocean):

------> x

| -----------------------------
| | 0, 0 | 1, 0 | 2, 0 | 3, 0 |
y | -----------------------------
| | 0, 1 | 1, 1 | 2, 1 | 3, 1 |
v -----------------------------
| 0, 2 | 1, 2 | 2, 2 | 3, 2 |
-----------------------------

Note that the origin is in the upper left; the x-coordinate increases as you
move right, and the y-coordinate increases as you go down. (This conforms to
Java's graphics commands, though you won't need to use them directly in this
project.) You can also refer to locations such as (4, 0) or (-4, 3), which are
both the same as (0, 0) in a 4x3 ocean. (More generally, the coordinates in
an ixj ocean are taken modulo i for the x-coordinate, which is horizontal, and
modulo j for the y-coordinate, which is vertical.) Any pair of integers will
give you a valid position in the grid by "wrapping around" at the edges.

(Hint: programming will be a lot easier if you write helper functions that do
the wrapping around for you, and use them in all your methods, so you don't
have to think about it again.)

There are two kinds of entities in this ocean: sharks and fish. The sharks
and fish breed, eat, and die in the ocean. Each cell of the grid can be
occupied by a single shark or fish, or it can be empty.

===Part I: Simulating Sharks and Fish===

This part is worth 40% of your total score. (8 points out of 20).

An ocean is described by its size and the initial placement of sharks and fish
in the ocean. It is also described by a parameter called the "starveTime" for
a shark. This is the number of simulation timesteps that a shark can live
through without eating.

The simulation proceeds in timesteps. A "timestep" is a ''transition'' from one
ocean to the next. (Don't confuse timesteps with oceans; every timestep starts
with one ocean and ends with another.) The rules for how the ocean looks at
the end of a timestep depend only on the occupants of the cells at the
beginning of the timestep. Therefore, to obtain correct behavior, you will
often be working with two copies of the ocean simultaneously; one representing
the ocean at the beginning of the timestep, and the other representing the
ocean at the end of the timestep. (If you are foolish enough to try to
implement a timestep using just a single Ocean object, you will modify the
values of cells whose old values are still needed to compute the new values for
other cells, and thus you will compute the wrong answer.)

The contents of any particular cell at the end of a timestep depend only on the
contents of that cell and its eight neighbors at the beginning of the timestep.
The "neighbors" are the eight adjacent cells: the cells immediately to the
north, south, east, and west, as well as the four diagonal neighbors. Here are
the rules:

# If a cell contains a shark, and any of its neighbors is a fish, then the shark eats during the timestep, and it remains in the cell at the end of the timestep. (We may have multiple sharks sharing the same fish. This is fine; they all get enough to eat.)
# If a cell contains a shark, and none of its neighbors is a fish, it gets hungrier during the timestep. If this timestep is the (starveTime + 1)th timestep the shark has gone through without eating, then the shark dies (disappears). Otherwise, it remains in the cell. An example demonstrating this rule appears below.
# If a cell contains a fish, and all of its neighbors are either empty or are other fish, then the fish stays where it is.
# If a cell contains a fish, and one of its neighbors is a shark, then the fish is eaten by a shark, and therefore disappears.
# If a cell contains a fish, and two or more of its neighbors are sharks, then a new shark is born in that cell. Sharks are well-fed at birth; ''after'' they are born, they can survive an additional starveTime timesteps without eating. (But they will die at the end of starveTime + 1 consecutive timesteps without eating.)
# If a cell is empty, and fewer than two of its neighbors are fish, then the cell remains empty.
# If a cell is empty, at least two of its neighbors are fish, and at most one of its neighbors is a shark, then a new fish is born in that cell.
# If a cell is empty, at least two of its neighbors are fish, and at least two of its neighbors are sharks, then a new shark is born in that cell. (The new shark is well-fed at birth, even though it hasn't eaten a fish yet.)

====starveTime Examples====
The following example demonstrates exactly when sharks die. Suppose the
starveTime is 3. Suppose the initial ocean, Ocean 0, contains a well-fed
shark (A). If that shark never gets to eat, it will survive three timesteps
without food, making it to Ocean 3; but it will be dead by Ocean 4. Another
shark is born in Ocean 1, and is fed during the transition from Ocean 2 to
Ocean 3, but is never fed again. It survives to Ocean 6, but it is dead by
Ocean 7.

Ocean 0 shark A (well-fed) [empty cell]
timestep shark B born
Ocean 1 shark A shark B (well-fed)
timestep
Ocean 2 shark A shark B
timestep shark B eats a fish (born last timestep)
Ocean 3 shark A shark B (well-fed)
timestep shark A dies
Ocean 4 [empty cell] shark B
timestep
Ocean 5 shark B
timestep
Ocean 6 shark B
timestep shark B dies
Ocean 7 [empty cell]

====Your task====
Fill in the implementation of the Ocean class. We have already provided you
with the public method definitions you will need. You are required to provide
implementations of all the methods whose prototypes appear in Ocean.java.
Among these methods is a constructor that takes three integers as input,
representing the size of the ocean and the starveTime of the sharks, and
returns an ocean of the specified size. For example, the statement

Ocean sea = new Ocean(i, j, starveTime);

should create an ixj Ocean object. In your implementation, you may define any
fields, additional methods, additional classes, or other .java files you wish,
but you cannot change the prototypes in Ocean.java. We will test your code by
calling your methods directly, so it is important that you follow this rule.
You should read Ocean.java carefully for an explanation of what methods you
must write. The most important of these is timeStep(), the method that
performs your simulation.

Your Ocean class should represent the ocean as one or more simple two-
dimensional arrays. It is up to you decide how to represent each element of
the array (in particular, whether it is empty or contains a shark or fish, and
if it's a shark, how long ago it last ate). Your internal representation is
not required to use the constants EMPTY, SHARK, and FISH, which are part of the
public interface, but it can if you want. However, the cellContents() method
must return these constants--you cannot change this part of the interface.

We have provided Java classes to help you debug your implementation and animate
your ocean, in these files:

Simulation.java
SimText.java

The Simulation and SimText classes (which consist primarily of a simulation
driver called main) generate random input to initialize the ocean, and animate
the sequence of oceans returned by the timeStep method of your Ocean class. So
that they can initialize your Ocean and monitor the fish and sharks in your
Ocean during the simulation, you must implement the methods addFish, addShark,
cellContents, width, and height.

The Simulation and SimText programs take up to three command-line parameters.
The first two specify the width and height of the ocean. The third parameter
specifies the value of starveTime. For example, if you run

java Simulation 25 30 1

then Simulation will animate a 25x30 ocean with a starveTime of 1. If you run
"java Simulation" with no parameters, by default Simulation will animate a
80x80 ocean with a starveTime of 3. (SimText animates a 50x25 ocean using text
on your terminal.) With some choices of parameters, the ocean quickly dies
out; with others, it teems forever.

In the animation produced by Simulation, sharks are red squares and fish are
green squares. In the animation produced by SimText, sharks are 'S' characters
and fish are '~' characters. Simulation is more fun to watch, but SimText may
be easier to use for debugging and remote access.

===Part II: Converting a Run-Length Encoding to an Ocean===

This part is worth 25% of your total score. (5 points out of 20).

For a large ocean, an Ocean object can consume quite a bit of memory or disk
space. For long-term storage, we can store an Ocean more efficiently if we
represent it as a "run-length encoding." Imagine taking all the rows of cells
in the ocean, and connecting them into one long strip. Think of the cells as
being numbered thusly:

-----------------------------
| 0 | 1 | 2 | 3 |
-----------------------------
| 4 | 5 | 6 | 7 |
-----------------------------
| 8 | 9 | 10 | 11 |
-----------------------------

Typically, many regions of this strip are "runs" of many empty cells in a row,
or many fish in a row, or many equally-hungry sharks in a row. Run-length
encoding is a technique in which a sequence of identical consecutive cells are
represented as a single record or object. For instance, the following strip of
fish (F), sharks fed two timesteps ago (S2), and empty cells (.):

------------------------------------------------------
| F | F | F | S2 | S2 | S2 | S2 | S2 | . | . | . | . |
------------------------------------------------------

could be represented with just three records, each representing one "run":

------------------
| F3 | S2,5 | .4 |
------------------

"F3" means that there are three consecutive fish, followed by "S2,5", meaning
five consecutive sharks fed two timesteps ago, and then ".4": four empty
cells. With this encoding, a huge ocean with just a few fish or sharks can be
stored in a tiny amount of memory. (Note, however, that a shark that just ate
cannot be represented together with a shark that hasn't eaten in the last
timestep. For a correct encoding, you must separate sharks based on their
hunger!) If you are familiar with .GIF image files (often encountered on the
Web), you might be interested to know that they use run-length encoding to
reduce their sizes.

Your task is to implement a RunLengthEncoding class, which represents a
run-length encoding as a linked list of "run" objects. It is up to you whether
to use a singly- or doubly-linked list, but a doubly-linked list may make Part
IV easier.

Because this is a data structures course, please use your own list class(es) or
ones you have learned in class. In future courses, it will sometimes make more
sense for you to use a linked list class written by somebody else, such as
java.util.LinkedList. However, in CS 61B this is forbidden, because I want you
to be always aware of exactly how your data structures work. Likewise, you may
not use java.util.Vector or other built-in data structures.

====Part II(a)====
Implement two constructors for RunLengthEncodings. One constructs
a run-length encoding of an empty ocean, and the other constructs a run-length
encoding based on two arrays provided as parameters to the constructor. These
arrays represent the runs that your run-length coding should contain, so you
are simply converting arrays to a linked list. (See the prototype in
RunLengthEncoding.java.)

====Part II(b)====
Your run-length encodings will only be useful if other classes
have the ability to read them after you create them. Therefore, implement the
nextRun() and restartRuns() methods. These two methods work together to return
all the runs in a run-length encoding to an outside application, one by one.
Each time nextRun() is invoked, it returns a different run--represented as a
TypeAndSize object--until every run has been returned. The first time
nextRun() is invoked, it returns the first run in the encoding, which contains
cell (0, 0). After every run has been returned, nextRun() returns null, which
lets the calling program know that there are no more runs in the encoding.

The restartRuns() method resets the enumeration, so that nextRun() will once
again return the first run as if it were being called for the first time.
Warning: the test code will not necessarily call restartRuns() before the
first time nextRun() is called.

IMPORTANT NOTE on nextRun() and restartRuns(): your methods in the
RunLengthEncoding class should never call these methods. The nextRun() and
restartRuns() methods are provided so that ''other'' classes (specifically, the
Test program that autogrades your project) can read the contents of a
run-length encoding. If your RunLengthEncoding methods call them, they will
mess up the position of the internal pointer for the other classes.

IMPORTANT NOTE on TypeAndSize: The Java "return" keyword only allows you to
return one value from a method call. But the nextRun() method needs to return
two values--the length of a run, and the type of object it contains. How can
it do this? Answer: by returning a "TypeAndSize" object. A TypeAndSize
object is nothing more than a way to return two integers at once. That's it.
Each time nextRun() is called, it creates a TypeAndSize object (or it will once
you've coded it to do so), fills in the values, and returns it to the calling
routine, which then throws it away. The TypeAndSize object is part of the
predefined interface of your RunLengthEncoding class, so you CANNOT change it,
because the calling programs (including the autograder) are relying on you to
return TypeAndSize objects according to spec. TypeAndSize objects are NOT
suitable as a way to represent a run in your run-length encoding, because they
do not encode a shark's hunger.

====Part II(c)====
Implement a toOcean() method in the RunLengthEncoding class, which
converts a run-length encoding to an Ocean object. To accomplish this, you
will need to implement a new addShark() method in the Ocean class, so that you
can specify the hunger of each shark you add to the ocean. This way, you can
convert an Ocean to a run-length encoding and back again without forgetting how
hungry each shark was.

Read RunLengthEncoding.java carefully for an explanation of what methods you
must write. The fields of the Ocean class MUST be private, and the
RunLengthEncoding class cannot manipulate these fields directly. Hence, the
toOcean() method will rely upon the Ocean constructor and the addFish() and
addShark() methods.

You cannot change any of the prototypes in RunLengthEncoding.java, and you
cannot change the file TypeAndSize.java. Again, we will test your code by
calling your methods directly.

===Part III: Converting an Ocean to a Run-Length Encoding===

This part is worth 25% of your total score. (5 points out of 20).

Next, write a RunLengthEncoding constructor that takes an Ocean object as its
sole parameter and converts it into a run-length encoding of the Ocean. To
accomplish this, you will need to implement a sharkFeeding() method in the
Ocean class, which tells you how hungry a given shark is. Read Ocean.java and
RunLengthEncoding.java carefully for an explanation of what methods you must
write.

The fields of the Ocean class MUST be private, so the RunLengthEncoding
constructor will rely upon the width(), height(), starveTime(), cellContents(),
and sharkFeeding() methods.

====Testing====
This is worth 1 point out of the 5, but should probably be done as soon as you
can during Part III.

Your RunLengthEncoding implementation is required to have a check() method,
which walks through the run-length encoding and checks its validity.
Specifically, it should print a warning message if any of the following
problems are found:
* If two consecutive runs have exactly the same type of contents. For instance, an "F12" run followed by an "F8" run is illegal, because they should have been consolidated into a single run. (Don't forget, though, that sharks are divided based on how recently they've eaten.)
* If the sum of all run lengths doesn't equal the size (in cells) of the Ocean; i.e. its width times its height.

You may find that the check() method is very useful in helping to debug your
RunLengthEncoding constructors and addFish() and addShark() in Part IV.

===Part IV: Adding a Fish or Shark to a Run-Length Encoding===

The last part is the hardest, but it is only worth 10% of the total score
(2 points out of 20), so don't panic if you can't finish it.

Implement the addFish() and addShark() methods of the RunLengthEncoding class,
which are similar to the addFish() and addShark() methods of the Ocean class.
However, this code is much trickier to write. Observe that addFish() and
addShark() can lengthen, or even shorten, an existing run-length encoding. To
add a shark or fish to a run-length encoded ocean, you will need to find the
right run in the linked list, and perhaps break it apart into two or three
runs. If the new shark or fish is adjacent to other sharks or fish, you should
consolidate runs to keep memory use down. (Your check() method ensures that
your encoding is as compact as possible.)

Your addFish() and addShark() routines should run in time proportional to the
number of runs in the encoding. Therefore, you may not convert the run-length
encoding to an Ocean object, add the fish or shark to the Ocean, and then
convert back to a run-length encoding; that is much too slow.

CS/61b/Projects/Ocean

2023-02-20T03:51:36Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean to Computer Science/61b/Projects/Ocean

#REDIRECT [[Computer Science/61b/Projects/Ocean]]

Computer Science/61b/Projects/Ocean/DList.java

2023-02-20T03:51:36Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean/DList.java to Computer Science/61b/Projects/Ocean/DList.java

{{code}}
/* DList.java */

/**
* The DList class is a doubly-linked implementation of the linked list
* abstraction. DLists are mutable data structures, which can grow at either
* end.
*
* This class is incomplete and only includes the methods necessary for the Oceans project
**/

public class DList {
private DListNode head;
// we have to make this non-private so that we can manipulate size directly when we call addShark() and addFish() on a RLE
// (at least it makes those manipulations easier)
int size;
// Ocean-specific fields
int dimx;
int dimy;
int starvetime;

/**
* DList() constructs an empty list.
**/

public DList() {
size = 0;
head = new DListNode();
head.next = head;
head.prev = head;
}

/**
* Ocean-specific: constructs a new list representing an i by j ocean where sharks die according to starve
* set size, dimx, and dimy appropriately; set starvetime to starve param
**/

public DList(int i, int j, int starve) {
size = 0;
head = new DListNode();
head.next = head;
head.prev = head;
dimx = i;
dimy = j;
starvetime = starve;
}

/**
* isEmpty() indicates whether the list is empty.
* @return true if the list is empty, false otherwise.
**/

public boolean isEmpty() {
return size == 0;
}

/**
* length() returns the length of this list.
* @return the length of this list.
**/

public int length() {
return size;
}

/**
* insertFront() inserts a block of cells at the beginning of this list.
* @param type the type of cell to be inserted.
* @param frequency the number of consecutive cells of this type
**/

public void insertFront(int type, int frequency, int hunger) {
DListNode item = new DListNode(type);
head.next.prev = item;
item.next = head.next;
item.prev = head;
head.next = item;
item.consecs = frequency;
item.hunger = hunger;
size++;
}

/**
* insertEnd() inserts item "obj" at the end of this list.
* @param type the type of cell to be inserted.
* @param frequency the number of consecutive cells of this type
**/

public void insertEnd(int type, int frequency, int hunger) {
DListNode item = new DListNode(type);
head.prev.next = item;
item.next = head;
item.prev = head.prev;
head.prev = item;
item.consecs = frequency;
item.hunger = hunger;
size++;
}

public void insertEnd(int type, int frequency) {
insertEnd(type, frequency, 0);
}

public void insertFront(int type, int frequency) {
insertFront(type, frequency, 0);
}

/**
* nth() returns the NODE at the specified position. If position < 1 or
* position > this.length(), null is returned. Otherwise, the item at
* position "position" is returned. The list does not change.
* @param position the desired position, from 1 to length(), in the list.
* @return the NODE at the given position in the list - this allows us to call .next and .prev on the returned value
**/

public DListNode nth(int position) {
DListNode currentNode;
if ((position < 1) || (head.next == head)) {
return null;
} else {
currentNode = head.next;
while (position > 1) {
currentNode = currentNode.next;
if (currentNode == head) {
return null;
}
position--;
}
return currentNode;
}
}
}

CS/61b/Projects/Ocean/DList.java

2023-02-20T03:51:36Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean/DList.java to Computer Science/61b/Projects/Ocean/DList.java

#REDIRECT [[Computer Science/61b/Projects/Ocean/DList.java]]

Computer Science/61b/Projects/Ocean/DListNode.java

2023-02-20T03:51:36Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean/DListNode.java to Computer Science/61b/Projects/Ocean/DListNode.java

{{code}}
/* DListNode.java */

/**
* DListNode is a class used internally by the DList class. A DList object
* is a doubly-linked list, and a DListNode is a node of a doubly-linked
* list. Each DListNode normally has three references: one to an object, one to
* the next node in the list, and another to the previous node in the list.
*
* However, for purposes of the Ocean project this is changed as follows:
* The item field is actually named type to better reflect the data that it holds
* Consequently, the types are all ints and not objects
* The number of fields is FIVE and not three - an additional field is added for the number of consecutive
* cells of the given type and another for the shark's current hunger
*
*/

class DListNode {
int type;
int hunger;
int consecs;
DListNode next;
DListNode prev;

/**
* DListNode() (with two parameters) constructs a list node referencing the
* item "obj", whose next list node is to be "next".
*/

DListNode(int type, int hunger, DListNode next) {
this.type = type;
this.hunger = hunger;
this.next = next;
}

DListNode(int type, DListNode next) {
this(type, 0, next);
}

DListNode(int type, int hunger) {
this(type, hunger, null);
}

/**
* DListNode() (with one parameter) constructs a list node referencing the
* item "obj".
**/

DListNode(int type) {
this(type, null);
}

DListNode() {
this(Ocean.EMPTY, null);
}
}

CS/61b/Projects/Ocean/DListNode.java

2023-02-20T03:51:36Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean/DListNode.java to Computer Science/61b/Projects/Ocean/DListNode.java

#REDIRECT [[Computer Science/61b/Projects/Ocean/DListNode.java]]

Computer Science/61b/Projects/Ocean/Ocean.java

2023-02-20T03:51:36Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean/Ocean.java to Computer Science/61b/Projects/Ocean/Ocean.java

{{code}}
/* Ocean.java */

/**
* The Ocean class defines an object that models an ocean full of sharks and
* fish. Descriptions of the methods you must implement appear below. They
* include a constructor of the form
*
* public Ocean(int i, int j, int starveTime);
*
* that creates an empty ocean having width i and height j, in which sharks
* starve after starveTime timesteps.
*
* See the README file accompanying this project for additional details.
*/

public class Ocean {

/**
* Do not rename these constants. WARNING: if you change the numbers, you
* will need to recompile Test4.java. Failure to do so will give you a very
* hard-to-find bug.
*/

public final static int EMPTY = 0;
public final static int SHARK = 1;
public final static int FISH = 2;

/**
* Define any variables associated with an Ocean object here. These
* variables MUST be private.
*/

private int x;
private int y;
private int starvetime;
private int[] cells;
private int[] hunger;

/**
* The following methods are required for Part I.
*/

/**
* Given an x & y coordinate, returns the cell's index in an ocean array
* if either coordinate is out of bounds due to the ocean's size, convert it accordingly
* @param x is the x-coord; @param y is the y-coord of the cell
* @return the index in the array
**/
public int cellind(int x, int y) {
x = x%this.x; // Math.abs(x)%this.x; gives incorrect values
y = y%this.y;
if (x < 0) { x = x+this.x; }
if (y < 0) { y = y+this.y; }
int ind = this.x*y+x;
return ind;
}

/** @param pos is the index in the ocean array
the methods below convert an array index into an x and y coordinate, respectively **/

public int coordx(int pos) {
int i = pos%x;
return i; }

public int coordy(int pos) {
int j = pos/x;
return j; }

/**
* Ocean() is a constructor that creates an empty ocean having width i and
* height j, in which sharks starve after starveTime timesteps.
* @param i is the width of the ocean.
* @param j is the height of the ocean.
* @param starveTime is the number of timesteps sharks survive without food.
*/

public Ocean(int i, int j, int starveTime) {
x = i;
y = j;
starvetime = starveTime;
cells = new int[i*j];
for (int ic=0; ic<cells.length; ic++) { cells[ic] = EMPTY; } // all cells EMPTY by default
hunger = new int[i*j];
for (int ih=0; ih<hunger.length; ih++) { hunger[ih] = 0; } // hunger of all cells 0 by default
}

/**
* width() returns the width of an Ocean object.
* @return the width of the ocean.
*/

public int width() {
return x;
}

/**
* height() returns the height of an Ocean object.
* @return the height of the ocean.
*/

public int height() {
return y;
}

/**
* starveTime() returns the number of timesteps sharks survive without food.
* @return the number of timesteps sharks survive without food.
*/

public int starveTime() {
return starvetime;
}

/**
* addFish() places a fish in cell (x, y) if the cell is empty. If the
* cell is already occupied, leave the cell as it is.
* @param x is the x-coordinate of the cell to place a fish in.
* @param y is the y-coordinate of the cell to place a fish in.
*/

public void addFish(int x, int y) {
if (cells[this.cellind(x,y)] == EMPTY) {
cells[this.cellind(x,y)] = FISH;
}
}

/**
* addShark() (with two parameters) places a newborn shark in cell (x, y) if
* the cell is empty. A "newborn" shark is equivalent to a shark that has
* just eaten. If the cell is already occupied, leave the cell as it is.
* @param x is the x-coordinate of the cell to place a shark in.
* @param y is the y-coordinate of the cell to place a shark in.
*/

public void addShark(int x, int y) {
int curpos = this.cellind(x,y);
if (cells[curpos] == EMPTY) {
cells[curpos] = SHARK;
hunger[curpos] = starvetime;
}
}

/**
* cellContents() returns EMPTY if cell (x, y) is empty, FISH if it contains
* a fish, and SHARK if it contains a shark.
* @param x is the x-coordinate of the cell whose contents are queried.
* @param y is the y-coordinate of the cell whose contents are queried.
*/

public int cellContents(int x, int y) {
return cells[this.cellind(x,y)]; // simply return the contents at the given index
}

/**
* timeStep() performs a simulation timestep as described in README.
* @return an ocean representing the elapse of one timestep.
* required actions:
* 1) If a cell contains a shark, and any of its neighbors is a fish, then the
* shark eats during the timestep, and it remains in the cell at the end of the
* timestep. (We may have multiple sharks sharing the same fish. This is fine;
* they all get enough to eat.)
*
* 2) If a cell contains a shark, and none of its neighbors is a fish, it gets
* hungrier during the timestep. If this timestep is the (starveTime + 1)th
* timestep the shark has gone through without eating, then the shark dies
* (disappears). Otherwise, it remains in the cell. An example demonstrating
* this rule appears below.
*
* 3) If a cell contains a fish, and all of its neighbors are either empty or are
* other fish, then the fish stays where it is.
*
* 4) If a cell contains a fish, and one of its neighbors is a shark, then the
* fish is eaten by a shark, and therefore disappears.
*
* 5) If a cell contains a fish, and two or more of its neighbors are sharks, then
* a new shark is born in that cell. Sharks are well-fed at birth; _after_ they
* are born, they can survive an additional starveTime timesteps without eating.
* (But they will die at the end of starveTime + 1 consecutive timesteps without
* eating.)
*
* 6) If a cell is empty, and fewer than two of its neighbors are fish, then the
* cell remains empty.
*
* 7) If a cell is empty, at least two of its neighbors are fish, and at most one
* of its neighbors is a shark, then a new fish is born in that cell.
*
* 8) If a cell is empty, at least two of its neighbors are fish, and at least two
* of its neighbors are sharks, then a new shark is born in that cell. (The new
* shark is well-fed at birth, even though it hasn't eaten a fish yet.)
*/

/** @return an array of neighbors around a given position **/
public int[] neighborarray(int pos) {
int[] array = new int[8];
int x = coordx(pos);
int y = coordy(pos);
array[0] = cellContents(x-1, y-1); // nw
array[1] = cellContents(x, y-1); // n
array[2] = cellContents(x+1, y-1); // ne
array[3] = cellContents(x+1, y); // e
array[4] = cellContents(x+1, y+1); // se
array[5] = cellContents(x, y+1); // s
array[6] = cellContents(x-1, y+1); // sw
array[7] = cellContents(x-1, y); // w
return array; }

/** @return the number of neighbors of a given type around a given position **/
public int neighbor(int type, int pos) {
int[] array = neighborarray(pos);
int number = 0;
for (int i=0; i<array.length; i++) {
if (array[i] == type) { number++; } }
return number; }

/** @return true if the method name's condition is satisfied around for a given position **/
public boolean caneat(int pos) { // 1 - If a cell contains a shark, and any of its neighbors is a fish
if (cells[pos] == SHARK && neighbor(FISH, pos)>0) {
return true;
} else { return false; } }

public boolean dangerous(int pos) { // 4 - If a cell contains a fish, and one of its neighbors is a shark
if (cells[pos] == FISH && neighbor(SHARK, pos)==1) {
return true;
} else { return false; } }

public boolean givesbirth(int pos) { /* 5 - If a cell contains a fish, and two or more of its neighbors are sharks
8 - If a cell is empty, at least two of its neighbors are fish, and at least two of its neighbors are sharks */
if (cells[pos] == FISH && neighbor(SHARK, pos)>1) {
return true;
} else if (cells[pos] == EMPTY && neighbor(FISH, pos)>1 && neighbor(SHARK, pos)>1) {
return true;
} else { return false; } }

public boolean spawnsfish(int pos) { // 7 - If a cell is empty, at least two of its neighbors are fish, and at most one of its neighbors is a shark
if (cells[pos] == EMPTY && neighbor(FISH, pos)>1 && neighbor(SHARK, pos)<2) {
return true;
} else { return false; } }

public Ocean timeStep() {
Ocean newocean = new Ocean(x, y, starvetime); // create new Ocean to hold the state after timeStep
/** Important notes: this new ocean is initially "blank". What this means here:
* If someone "dies" below, we don't need to do anything, because the cell in the new ocean is already EMPTY
* If any other values (i.e. hunger) change, they need to be written to the new ocean
* If the value of a given cell does not change, it MUST be copied to the new ocean
**/
for (int pos=0; pos<cells.length; pos++) {
if (caneat(pos)) { // the shark eats during the timestep, and it remains in the cell at the end of the timestep
newocean.cells[pos] = SHARK;
newocean.hunger[pos] = starvetime; }
else if (caneat(pos) != true && cells[pos]==SHARK) {
if (hunger[pos] == 0) { /* If this timestep is the (starveTime + 1)th timestep
the shark has gone through without eating
then the shark dies (disappears), so we do nothing since value is EMPTY by default */
} else { // otherwise decrease its turns to die by 1
newocean.cells[pos] = SHARK;
newocean.hunger[pos] = hunger[pos] - 1;
}
} else if (dangerous(pos)) { /* the fish is eaten by a shark and disappears, so do nothing */
} else if (givesbirth(pos)) { // a new shark is born in that cell; (sharks are well-fed at birth)
newocean.cells[pos] = SHARK;
newocean.hunger[pos] = starvetime;
} else if (spawnsfish(pos)) { newocean.cells[pos] = FISH; // a new fish is born in that cell
} else { newocean.cells[pos] = cells[pos]; } // in all other cases, just copy the existing value - CRUCIAL!
/** 3 - If a cell contains a fish, and all of its neighbors are either empty or are other fish, then the fish stays where it is.
if (pos.boring) { }
6 - If a cell is empty, and fewer than two of its neighbors are fish, then the cell remains empty.
if (pos.fishy) { }
**/
}
return newocean; // return the newly-created and modified ocean
}

/**
* The following method is required for Part II.
*/

/**
* addShark() (with three parameters) places a shark in cell (x, y) if the
* cell is empty. The shark's hunger is represented by the third parameter.
* If the cell is already occupied, leave the cell as it is. You will need
* this method to help convert run-length encodings to Oceans.
* @param x is the x-coordinate of the cell to place a shark in.
* @param y is the y-coordinate of the cell to place a shark in.
* @param feeding is an integer that indicates the shark's hunger. You may
* encode it any way you want; for instance, "feeding" may be the
* last timestep the shark was fed, or the amount of time that has
* passed since the shark was last fed, or the amount of time left
* before the shark will starve. It's up to you, but be consistent.
*/

public void addShark(int x, int y, int feeding) {
int curpos = this.cellind(x,y);
if (cells[curpos] == EMPTY) {
cells[curpos] = SHARK;
hunger[curpos] = feeding;
}
}

/**
* The following method is required for Part III.
*/

/**
* sharkFeeding() returns an integer that indicates the hunger of the shark
* in cell (x, y), using the same "feeding" representation as the parameter
* to addShark() described above. If cell (x, y) does not contain a shark,
* then its return value is undefined--that is, anything you want.
* Normally, this method should not be called if cell (x, y) does not
* contain a shark. You will need this method to help convert Oceans to
* run-length encodings.
* @param x is the x-coordinate of the cell whose contents are queried.
* @param y is the y-coordinate of the cell whose contents are queried.
*/

public int sharkFeeding(int x, int y) {
return hunger[this.cellind(x,y)];
}

/* The method below does the same thing as above, but takes an array position instead of (x,y) coords */

public int sharkFeeding(int pos) {
return sharkFeeding(coordx(pos), coordy(pos));
}

}

CS/61b/Projects/Ocean/Ocean.java

2023-02-20T03:51:36Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean/Ocean.java to Computer Science/61b/Projects/Ocean/Ocean.java

#REDIRECT [[Computer Science/61b/Projects/Ocean/Ocean.java]]

Computer Science/61b/Projects/Ocean/RunLengthEncoding.java

2023-02-20T03:51:36Z

Lensovet: Lensovet moved page CS/61b/Projects/Ocean/RunLengthEncoding.java to Computer Science/61b/Projects/Ocean/RunLengthEncoding.java

{{code}}
/* RunLengthEncoding.java */

/**
* The RunLengthEncoding class defines an object that run-length encodes an
* Ocean object. Descriptions of the methods you must implement appear below.
* They include constructors of the form
*
* public RunLengthEncoding(int i, int j, int starveTime);
* public RunLengthEncoding(int i, int j, int starveTime,
* int[] runTypes, int[] runLengths) {
* public RunLengthEncoding(Ocean ocean) {
*
* that create a run-length encoding of an Ocean having width i and height j,
* in which sharks starve after starveTime timesteps.
*
* The first constructor creates a run-length encoding of an Ocean in which
* every cell is empty. The second constructor creates a run-length encoding
* for which the runs are provided as parameters. The third constructor
* converts an Ocean object into a run-length encoding of that object.
*
* See the README file accompanying this project for additional details.
**/

public class RunLengthEncoding {

/**
* Define any variables associated with a RunLengthEncoding object here.
* These variables MUST be private.
**/

// since this uses a separate doubly-linked list class, most fields are already defined there
private int runsleft;
private DList rle;

/**
* The following methods are required for Part II.
**/

/**
* RunLengthEncoding() (with three parameters) is a constructor that creates
* a run-length encoding of an empty ocean having width i and height j,
* in which sharks starve after starveTime timesteps.
* @param i is the width of the ocean.
* @param j is the height of the ocean.
* @param starveTime is the number of timesteps sharks survive without food.
**/

public RunLengthEncoding(int i, int j, int starveTime) {
rle = new DList(i, j, starveTime);
rle.insertFront(Ocean.EMPTY, i*j);
runsleft = 1;
}

/**
* RunLengthEncoding() (with five parameters) is a constructor that creates
* a run-length encoding of an ocean having width i and height j, in which
* sharks starve after starveTime timesteps. The runs of the run-length
* encoding are taken from two input arrays. Run i has length runLengths[i]
* and species runTypes[i].
* @param i is the width of the ocean.
* @param j is the height of the ocean.
* @param starveTime is the number of timesteps sharks survive without food.
* @param runTypes is an array that represents the species represented by
* each run. Each element of runTypes is Ocean.EMPTY, Ocean.FISH,
* or Ocean.SHARK. Any run of sharks is treated as a run of newborn
* sharks (which are equivalent to sharks that have just eaten).
* @param runLengths is an array that represents the length of each run.
* The sum of all elements of the runLengths array should be i * j.
*/

public RunLengthEncoding(int i, int j, int starveTime,
int[] runTypes, int[] runLengths) {
rle = new DList(i, j, starveTime);
if (runTypes.length != runLengths.length) { System.out.println("INCOMPATIBLE ARRAYS");
} else {
for (int ii = runTypes.length-1; ii>=0; ii--) {
if (runTypes[ii] == Ocean.SHARK) {
rle.insertFront(runTypes[ii], runLengths[ii], starveTime);
} else {
rle.insertFront(runTypes[ii], runLengths[ii]);
}
}
runsleft = runTypes.length;
}
}

/**
* restartRuns() and nextRun() are two methods that work together to return
* all the runs in the run-length encoding, one by one. Each time
* nextRun() is invoked, it returns a different run (represented as a
* TypeAndSize object), until every run has been returned. The first time
* nextRun() is invoked, it returns the first run in the encoding, which
* contains cell (0, 0). After every run has been returned, nextRun()
* returns null, which lets the calling program know that there are no more
* runs in the encoding.
*
* The restartRuns() method resets the enumeration, so that nextRun() will
* once again enumerate all the runs as if nextRun() were being invoked for
* the first time.
*
* (Note: Don't worry about what might happen if nextRun() is interleaved
* with addFish() or addShark(); it won't happen.)
*/

/**
* restartRuns() resets the enumeration as described above, so that
* nextRun() will enumerate all the runs from the beginning.
*/

public void restartRuns() {
runsleft = rle.length();
}

/**
* nextRun() returns the next run in the enumeration, as described above.
* If the runs have been exhausted, it returns null. The return value is
* a TypeAndSize object, which is nothing more than a way to return two
* integers at once.
* @return the next run in the enumeration, represented by a TypeAndSize object.
*/

public TypeAndSize nextRun() {
if (runsleft == 0) { return null; }
else {
int curindex = rle.length()-runsleft+1;
DListNode curnode = rle.nth(curindex);
int tip = curnode.type;
int freq = curnode.consecs;
runsleft--;
return new TypeAndSize(tip, freq); }
}

/**
* toOcean() converts a run-length encoding of an ocean into an Ocean
* object. You will need to implement the three-parameter addShark method
* in the Ocean class for this method's use.
* @return the Ocean represented by a run-length encoding.
*/

public Ocean toOcean() {
int index = 0;
Ocean newocean = new Ocean(rle.dimx, rle.dimy, rle.starvetime);
for (int il = 1; il<=rle.length(); il++) { // walks through each node in the rle list
DListNode curnode = rle.nth(il);
int tip = curnode.type;
int freq = curnode.consecs;
int hunger = curnode.hunger;
int ia = index;
for (; ia < index+freq; ia++) {
if (tip == Ocean.SHARK) {
newocean.addShark(newocean.coordx(ia), newocean.coordy(ia), hunger);
} else if (tip == Ocean.FISH) {
newocean.addFish(newocean.coordx(ia), newocean.coordy(ia));
} else { } // do nothing, the cell is already EMPTY
}
index = ia;
}
return newocean;
}

/**
* The following method is required for Part III.
*/

/**
* RunLengthEncoding() (with one parameter) is a constructor that creates
* a run-length encoding of an input Ocean. You will need to implement
* the sharkFeeding method in the Ocean class for this constructor's use.
* @param sea is the ocean to encode.
*/

public RunLengthEncoding(Ocean sea) {
int is=0;
int ir=1;
int seasize = sea.width()*sea.height();
rle = new DList(sea.width(), sea.height(), sea.starveTime());
while (is<seasize) {
int tip = sea.cellContents(sea.coordx(is), sea.coordy(is));
int hunger = sea.sharkFeeding(is);
rle.insertEnd(tip, 1, hunger);
is++;
for (; sea.cellContents(sea.coordx(is), sea.coordy(is)) == tip && sea.sharkFeeding(is) == hunger && is<seasize; is++) {
rle.nth(ir).type = tip;
rle.nth(ir).consecs++;
rle.nth(ir).hunger = hunger;
}
ir++;
}
runsleft = ir-1;
check();
}

/**
* The following methods are required for Part IV.
*/

/**
* addFish() places a fish in cell (x, y) if the cell is empty. If the
* cell is already occupied, leave the cell as it is. The final run-length
* encoding should be compressed as much as possible; there should not be
* two consecutive runs of sharks with the same degree of hunger.
* @param x is the x-coordinate of the cell to place a fish in.
* @param y is the y-coordinate of the cell to place a fish in.
*/

// This helper helps us convert (x,y) into a single-digit position but is slightly modified from the version in Ocean.java to work with RLEs
public int itempos(int x, int y) {
x = x%rle.dimx;
y = y%rle.dimy;
if (x < 0) { x = x+rle.dimx; }
if (y < 0) { y = y+rle.dimy; }
int ind = (rle.dimx*y+x) + 1;
return ind;
}

public void addFish(int x, int y) {
int index = itempos(x, y);
int rlepos = 1;
int i = 1;
for (; i<rle.length(); i++) {
rlepos = rlepos + rle.nth(i).consecs;
if (rlepos > index) {
rlepos = rlepos - rle.nth(i).consecs - 1;
break; }
}
if (i>=rle.length()) { System.out.println("Something terribly wrong happened, sorry..."); }
else if (rle.nth(i).type != Ocean.EMPTY) { System.out.println("Destination cell is not empty"); }
else actualinsertion: {
DListNode removednode = rle.nth(i);
int after = removednode.consecs - (index - rlepos);
int before = removednode.consecs - after - 1;
DListNode insertionnode = new DListNode(Ocean.FISH);
insertionnode.consecs = 1;
DListNode beforenode;
DListNode afternode;
boolean nodeisgone = false;
if (after==0 && removednode.next.type==Ocean.FISH && removednode.prev.type!=Ocean.FISH) { // there are no empty spaces, following block is a fish, and previous block is NOT a fish
removednode.next.consecs++;
nodeisgone = true;
} if (before==0 && removednode.prev.type==Ocean.FISH && removednode.next.type!=Ocean.FISH) { // there are no empty spaces, previous block is fish, and following block is NOT fish
removednode.prev.consecs++;
nodeisgone = true;
} if (after==0 && before==0 && removednode.prev.type!=Ocean.FISH && removednode.next.type!=Ocean.FISH) { // this cell is nestled between two blocks neither of which is a fish
insertionnode.next = removednode.next;
insertionnode.next.prev = insertionnode;
insertionnode.prev = removednode.prev;
insertionnode.prev.next = insertionnode;
// we're done here
break actualinsertion;
} if (removednode.next.type==Ocean.FISH && removednode.prev.type==Ocean.FISH) { // both previous and next blocks contain fish, so we need to combine three blocks into one
int combination = removednode.next.consecs + removednode.prev.consecs + 1;
DListNode overhaul = new DListNode(Ocean.FISH);
overhaul.consecs = combination;
overhaul.next = removednode.next.next;
overhaul.next.prev = overhaul;
overhaul.prev = removednode.prev.prev;
overhaul.prev.next = overhaul;
rle.size = rle.size -2;
runsleft = rle.length();
// we're done here
break actualinsertion;
} if (nodeisgone) { // if as a result of the previous testcases, our initially created node is no longer needed (nodeisgone == true), we need to combine the before and after frequencies, make a single new node, and link it to the list appropriately
int combined = after + before;
if (combined > 0) {
DListNode superduper = new DListNode(Ocean.EMPTY);
superduper.consecs = combined;
superduper.next = removednode.next;
superduper.prev = removednode.prev;
superduper.prev.next = superduper;
superduper.next.prev = superduper;
} else {
removednode.prev.next = removednode.next;
removednode.next.prev = removednode.prev;
rle.size--;
}
} else if (before>0 || after>0) {
if (before > 0) { // there are still some empty spaces before this fish
beforenode = new DListNode(Ocean.EMPTY);
beforenode.consecs = before;
beforenode.prev = removednode.prev;
removednode.prev.next = beforenode;
beforenode.next = insertionnode;
insertionnode.prev = beforenode;
if (after == 0) {
insertionnode.next = removednode.next;
insertionnode.next.prev = insertionnode; }
rle.size++;
runsleft = rle.length();
} if (after > 0) { // there are still some empty spaces after this fish
afternode = new DListNode(Ocean.EMPTY);
afternode.consecs = after;
afternode.next = removednode.next;
afternode.next.prev = afternode;
insertionnode.next = afternode;
if (before == 0) {
insertionnode.prev = removednode.prev;
insertionnode.prev.next = insertionnode; }
afternode.prev = insertionnode;
rle.size++;
runsleft = rle.length();
}
}
}
check();
}

/**
* addShark() (with two parameters) places a newborn shark in cell (x, y) if
* the cell is empty. A "newborn" shark is equivalent to a shark that has
* just eaten. If the cell is already occupied, leave the cell as it is.
* The final run-length encoding should be compressed as much as possible;
* there should not be two consecutive runs of sharks with the same degree
* of hunger.
* @param x is the x-coordinate of the cell to place a shark in.
* @param y is the y-coordinate of the cell to place a shark in.
*/

public void addShark(int x, int y) {
int index = itempos(x, y);
int rlepos = 1;
int i = 1;
for (; i<rle.length(); i++) {
rlepos = rlepos + rle.nth(i).consecs;
if (rlepos > index) {
rlepos = rlepos - rle.nth(i).consecs - 1;
break; }
}
if (i>=rle.length()) { System.out.println("Something terribly wrong happened, sorry..."); }
else if (rle.nth(i).type != Ocean.EMPTY) { System.out.println("Destination cell is not empty"); }
else actualinsertion: {
DListNode removednode = rle.nth(i);
int destinationhunger = rle.starvetime;
int after = removednode.consecs - (index - rlepos);
int before = removednode.consecs - after - 1;
DListNode insertionnode = new DListNode(Ocean.SHARK, destinationhunger);
insertionnode.consecs = 1;
DListNode beforenode;
DListNode afternode;
boolean nodeisgone = false;
if (after==0 && removednode.next.type==Ocean.SHARK && removednode.next.hunger==destinationhunger && removednode.prev.hunger!=destinationhunger) { // there are no empty spaces, following block is a shark with the same hunger, and previous block is NOT a shark with the same hunger
removednode.next.consecs++;
nodeisgone = true;
} if (before==0 && removednode.prev.type==Ocean.SHARK && removednode.prev.hunger==destinationhunger && removednode.next.hunger!=destinationhunger) { // there are no empty spaces, previous block is a shark with the same hunger, and following block is NOT a shark with the same hunger
removednode.prev.consecs++;
nodeisgone = true;
} if (after==0 && before==0 && removednode.prev.hunger!=destinationhunger && removednode.next.hunger!=destinationhunger) { // this cell is nestled between two blocks that differ from the shark we're inserting.
insertionnode.next = removednode.next;
insertionnode.next.prev = insertionnode;
insertionnode.prev = removednode.prev;
insertionnode.prev.next = insertionnode;
// we're done here
break actualinsertion;
} if (after==0 && before==0 && removednode.next.type==Ocean.SHARK && removednode.prev.type==Ocean.SHARK && removednode.next.hunger==destinationhunger && removednode.prev.hunger==destinationhunger) { // we're inserting into a cell surrounded by blocks of sharks both of which have the same hunger levels, so we need to combine three blocks into one
int combination = removednode.next.consecs + removednode.prev.consecs + 1;
DListNode overhaul = new DListNode(Ocean.SHARK, destinationhunger);
overhaul.consecs = combination;
overhaul.next = removednode.next.next;
overhaul.next.prev = overhaul;
overhaul.prev = removednode.prev.prev;
overhaul.prev.next = overhaul;
rle.size = rle.size -2;
runsleft = rle.length();
// we're done here
break actualinsertion;
} if (nodeisgone) { // if as a result of the previous testcases, our initially created node is no longer needed (nodeisgone == true), we need to combine the before and after frequencies, make a single new node, and link it to the list appropriately
int combined = after + before;
if (combined > 0) {
DListNode superduper = new DListNode(Ocean.EMPTY);
superduper.consecs = combined;
superduper.next = removednode.next;
superduper.prev = removednode.prev;
superduper.prev.next = superduper;
superduper.next.prev = superduper;
} else {
removednode.prev.next = removednode.next;
removednode.next.prev = removednode.prev;
rle.size--;
}
} else if (before>0 || after>0) {
if (before > 0) { // there are still some empty spaces before this shark or there are sharks but with different hunger levels
beforenode = new DListNode(Ocean.EMPTY);
beforenode.consecs = before;
beforenode.prev = removednode.prev;
removednode.prev.next = beforenode;
beforenode.next = insertionnode;
insertionnode.prev = beforenode;
if (after == 0) {
insertionnode.next = removednode.next;
insertionnode.next.prev = insertionnode; }
rle.size++;
runsleft = rle.length();
} if (after > 0) { // there are still some empty spaces after this shark or there are sharks but with different hunger levels
afternode = new DListNode(Ocean.EMPTY);
afternode.consecs = after;
afternode.next = removednode.next;
afternode.next.prev = afternode;
insertionnode.next = afternode;
if (before == 0) {
insertionnode.prev = removednode.prev;
insertionnode.prev.next = insertionnode; }
afternode.prev = insertionnode;
rle.size++;
runsleft = rle.length();
}
}
}
check();
}

/**
* check() walks through the run-length encoding and prints an error message
* if two consecutive runs have the same contents, or if the sum of all run
* lengths does not equal the number of cells in the ocean.
*/

public void check() {
int ti = 0;
for (int i=1; i<rle.length(); i++) {
if (rle.nth(i).type == rle.nth(i+1).type && rle.nth(i).hunger == rle.nth(i+1).hunger) {
System.out.print("I've found a bug! You have the same type of cells in two consecutive RLE nodes! Problem is at nodes " + i + " and " + (i+1) + "\n");
}
}
for (int ii=1; ii<=rle.length(); ii++) {
ti = ti + rle.nth(ii).consecs;
}
if (ti != rle.dimx*rle.dimy) {
System.out.print("I've found a bug! The sum of run lengths is NOT equal to the Ocean's size - runlengths is " + ti + " vs Ocean size of " + (rle.dimx*rle.dimy) + "\n");
}
}

}