yeah, it’s either do the tarps or ya gets the foam….
Attachment 374573
fact.
Printable View
yeah, it’s either do the tarps or ya gets the foam….
Attachment 374573
fact.
I'm not sure how that could be fixed to the siding.Quote:
Originally Posted by PNWbrit
Reminds me of the Foamlords, Eugene, OR circa 1980 rock band.
Adhesive backed Velcro tape.Quote:
Originally Posted by Buster Highmen
Nails and staples are removable; I have reservations about the adhesive on the siding.
Staple it to the siding and stick it to the mylar?
Looks like both tape components are sticky sided. The vendor claims the adhesive is easy to remove, but I have reservations.Quote:
Originally Posted by PNWbrit
https://images-na.ssl-images-amazon....L._SL1500_.jpg
I'm still thinking the nails with clamps is the best solution so far.
Leave the peel off backing on it when stapling.Quote:
Originally Posted by Buster Highmen
Lengths of tape stuck along the edges of the mylar would be a big help in preventing it from tearing?
I was thinking of the handy mans secret weapon, duct tape, for that. I have a thing for RedGreen.Quote:
Originally Posted by PNWbrit
Think of the COGs as well: 4 nails + 4 clamps versus supporting some poisonous Chinese conglomerate. Win-Win.
I’m trying to figure why you are attaching mylar to your house?
What is this stuff exactly? Just mylar? What's the function?Quote:
Originally Posted by Buster Highmen
Good question.Quote:
Originally Posted by ::: :::
We get pretty good afternoon and early evening light on the house, but the garden next to the house has shade.
If I mount mylar, not only will it decrease the heat generated (dark brown paint on the siding), but it will reflect a little more light onto the garden.
Plus, it will make the very few people who see that side of the house wonder.
With polyethylene or even blue tarps, usually the membrane is wrapped around a stick (1x or 2x, whatever) neatly and the stick is then nailed off to the substrate
That's one of the ideas. But I think clamps are more elegant and easier to manage in the fall when I'll take it down. We don't get a lot of wind here.Quote:
Originally Posted by ::: :::
Besides, what you do with your Aunt Ethyl is your business.
Plus when you're giving directions to the place you can just say the place covered in foil. Pretty much eliminates people going to the wrong house.
Can't see our house from the road, despite that particular advantage.Quote:
Originally Posted by Timberridge
I could be a Cristo Moderne!
How come companies still make pants that are 100% cotton when everyone knows a blend that includes a touch of spandex or whatever for stretch is just plain better?
Hehe.Quote:
Originally Posted by KQ
Definitely not a gorilla grip. But the seal is there. The rubber is super soft compared to what I’ve been used to on others.
Off to YouTube to see if there is any possible fix.
This sounds so dirty lol
No one likes a flacid seal.Quote:
Originally Posted by Buzzworthy
Am I the only one who misreads the title of the "Justify Atheism" thread and has to fight the urge to start a "Justify Autism" thread?
https://www.tetongravity.com/forums/...t=#post5390148Quote:
Originally Posted by riser3
Great minds, I guess. Almost 3 years apart.
I keep thinking it says "Justify Ageism".
What exactly is meant by someone singing that they will "dust my broom"? How can you dust a broom? Don't you dust with a broom? Is he dusting a broom with another broom?
Ask Robert JohnsonQuote:
Originally Posted by Benny Profane
Sent from my SM-G935P using TGR Forums mobile app
And Elmore James, ZZ Top, and Johnny Winter.Quote:
Originally Posted by JimmyCarter
https://en.wikipedia.org/wiki/Dust_My_Broom
Heh
Bunny’s never had his broom dusted
Vibes
You'll never get airtight.Quote:
Originally Posted by KQ
Airtight? how many seals are we talking about here?Quote:
Originally Posted by Beaver
Ork Ork Ork Ork!Quote:
Originally Posted by JimmyCarter
I appreciate the microwave for heating leftovers and liquids up. But why can't they produce a reverse contraption that can cool a glass of beer in under a minute?
Put the can or bottle on ice, continuously spin it with your hand for about 60-90 seconds. Will take a warm beer and make it cold.Quote:
Originally Posted by BCMtnHound
Sent from my iPhone using TGR Forums
Ya, I know the ice bath method. But that takes making the ice bath, manually spinning the container, then dealing with the bath afterwards. I just want to push a damn button and make my beverage off the shelf cold. Civilization has come up short!Quote:
Originally Posted by dtown
Oh the technology certainly exists, the packaging needs a little work tho. Mrs Noonan not on board w this appliance just yet:Quote:
Originally Posted by BCMtnHound
https://youtu.be/p2VfwaC1ugU
Every kitchen needs one of those champagne chillers they have at the wine store.Quote:
Originally Posted by BCMtnHound
Always on 24/7
Ready for you.
Who is richer? Timberridge or bmills Skier? And who is more old money dynasty?
Are a shitload of people actually painting shitbox cars or is Maaco a front for some money laundering or child pornography ring?
If Timberridge was actually rich I doubt he'd have founded some fly-by-night preaching operation in the hinterlands designed to shake the money from the pockets of poor backwards country folk.Quote:
Originally Posted by subtle plague
Has he now? I had the slightest feeling that his old rich east coaster persona is wrong. I still like that persona.Quote:
Originally Posted by ötzi
Especially his man card revoking posts in the car threads sound so unrich and mundane that they made me wonder.
But I want to believe.
Stil, these things have me wondering about all those cryptowhales on tgr and benny's Pension Fund.
I mean most people on here are well off because skiing in the US is so absurdly expensive. But I'd like to know who is just trustfunding his way through life.
#include<bits/stdc++.h>
using namespace std;
class Node {
public:
int data;
Node *left;
Node *right;
Node(int d) {
data = d;
left = NULL;
right = NULL;
}
};
class Solution {
public:
Node* insert(Node* root, int data) {
if(root == NULL) {
return new Node(data);
} else {
Node* cur;
if(data <= root->data) {
cur = insert(root->left, data);
root->left = cur;
} else {
cur = insert(root->right, data);
root->right = cur;
}
return root;
}
}
/*
class Node {
public:
int data;
Node *left;
Node *right;
Node(int d) {
data = d;
left = NULL;
right = NULL;
}
};
*/
/////////////////////////////////////////////////////////////////////////////////////////////////
// Each node in the binary tree has a unique level(height) and column. The goal is to print out the data
// for each column at the lowest level. These are the "visible" nodes if the tree is viewed from the top.
//
// The idea is to walk the tree and store the following information.
// Whenever for a given column, the level (height) is less, overwrite the fields at that
// column index.
//
typedef struct __NODE_INFO {
int m_NodeData;
int m_NodeColumn;
int m_NodeLevel;
} NODE_INFO, *PNODE_INFO;
#define NUMBER_OF_DATA_NODES 1002
#define MIDDLE_OF_DATA_NODES (NUMBER_OF_DATA_NODES/2)
NODE_INFO gDataNodes[NUMBER_OF_DATA_NODES];
// These makes for nice optimizations when dumping the resulting array.
//
int gLeftMostColumn = 0;
int gRightMostColumn = 0;
// Do an Inorder walk of the tree, conditionally filling gDataNodes and
// keeping track of the levels and columns of each node in the tree.
//
void
topViewLevel(
Node * node,
int level,
int column
)
{
++level;
if (node->left)
{
// Keep track of the column in the recursion
//
--column;
// Store the leftMostcolumn to optimize search later.
//
if (column < gLeftMostColumn)
{
gLeftMostColumn = column;
}
topViewLevel(node->left, level, column);
// Recover the column from recursion.
//
++column;
}
// The arrays m_NodeLevels are initialized to a max level of 500.
// If for a given column, the current level is less than the one stored in the array,
// overwrite the level and data in the array.
//
if (gDataNodes[MIDDLE_OF_DATA_NODES + column].m_NodeLevel > level )
{
gDataNodes[MIDDLE_OF_DATA_NODES + column].m_NodeLevel = level;
gDataNodes[MIDDLE_OF_DATA_NODES + column].m_NodeData = node->data;
}
if (node->right)
{
// Track the column for the recursion.
//
++column;
// Optimize the search.
//
if (column > gRightMostColumn)
{
gRightMostColumn = column;
}
// Recurse right.
//
topViewLevel(node->right, level, column);
}
}
void
DumpNodeInfo(
PNODE_INFO NodeInfo
)
{
int i;
for (i = gLeftMostColumn + MIDDLE_OF_DATA_NODES ;
i <= gRightMostColumn + MIDDLE_OF_DATA_NODES;
++i)
{
if (0 != NodeInfo[i].m_NodeData)
{
printf("%d ", NodeInfo[i].m_NodeData);
}
}
}
void
topView(
Node * root
)
{
int i;
// Initialize the array of NODE_INFOs
//
memset(gDataNodes, 0, sizeof(NODE_INFO)*NUMBER_OF_DATA_NODES);
for (i = 0; i < NUMBER_OF_DATA_NODES;++i)
{
gDataNodes[i].m_NodeLevel = 500;
}
// Walk the tree filling gDataNodes.
//
if (NULL != root)
{
topViewLevel(root, 0, 0);
}
// Output the nontrivial contents of gDataInfo.
//
DumpNodeInfo(gDataNodes);
}
}; //End of Solution