Random Unthreadworthy Questions

[dtown]

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.


Sent from my iPhone using TGR Forums

[BCMtnHound]

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.


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!

[dannynoonan]

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!

Oh the technology certainly exists, the packaging needs a little work tho. Mrs Noonan not on board w this appliance just yet:

https://youtu.be/p2VfwaC1ugU

[Buster Highmen]

https://www.tetongravity.com/forums/...67#post6330267

[Core Shot]

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?

Every kitchen needs one of those champagne chillers they have at the wine store.
Always on 24/7
Ready for you.

[subtle plague]

Who is richer? Timberridge or bmills Skier? And who is more old money dynasty?

[ötzi]

Are a shitload of people actually painting shitbox cars or is Maaco a front for some money laundering or child pornography ring?

[ötzi]

Who is richer? Timberridge or bmills Skier? And who is more old money dynasty?

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.

[subtle plague]

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.

Has he now? I had the slightest feeling that his old rich east coaster persona is wrong. I still like that persona.

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.

[Buster Highmen]

#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

[subtle plague]

#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

You like big bits and you cannot lie?

[Rideski]

Do you visit graves of your dead peeps?

[Buster Highmen]

My dead peeps are under my desk.
Older only brother, Mom and Dad.
I have no relatives other than my kids, wife and inlaws and no close friends.
Once the summer is over, I'll take them to their chosen graves in Indiana.

[MakersTeleMark]

I only have one living relative on this planet (besides her offspring I suppose), and she is my twin. Have no idea what she did with the ashes of Mom and Dad. Don't really care actually.

[old goat]

The only time I visit them is when another one dies. Dad, the little brother, then Mom. Not likely I'll get back to Detroit to see them unless it's for another funeral. I don't put much significance in a grave anyway. I missed the last funeral--my 90 something uncle--because I kept in touch with him through my cousin and it turned out she died--probably suicide--the year before with no one left on that side of the family to tell me. That uncle outlived his wife and all 3 kids. Rough way to end a life.

[Meathelmet]

//
// The idea is to walk the tree
//

I found your problem. See, one can walk the dog to the well but trees, not so much. Well, unless they are Ents.

Never mind.

[schindlerpiste]

It is going to be HOT today in the Wasatch. I have a new pair of skis that I will hot wax this morning. I am thinking of placing the waxed skis in the sun for the day. Will this have an effect similar to a hot box?

I know stupid.

[El Chupacabra]

It is going to be HOT today in the Wasatch. I have a new pair of skis that I will hot wax this morning. I am thinking of placing the waxed skis in the sun for the day. Will this have an effect similar to a hot box?

I know stupid.

I think that actually does work pretty well. I've done it. I haven't left them all day long though - the bases get quite hot in 90* temp and direct sun.

Downside is that any bugs that land on the wax get stuck. So you get to scrape buggy wax later in the fall.

[detrusor]

I’ve hot boxed in a car (insert joke) and it works really well


Sent from my iPhone using TGR Forums

[dan_pdx]

Re: skis in sun, accepted wisdom on a snowboard forum I hang out on is what Chupacabra said: giving your planks a sunbath does work as a poor man's hotbox, but don't let them get too hot.

I asked here awhile back about replacing brushes on a blender motor. I took it apart to check it out, and the brushes were hot glued into the motor So we chucked it and bought a new one which works 10x better, apparently blenders have actually improved in the last 10 years.

[TBS]

Do you visit graves of your dead peeps?

Ashes of mother, father and brother were scattered along upper McKenzie River, so i essentially visit their graves whenever I ride the MRT or fish there - so maybe 4x/year

My daughter is buried about 175 miles away. Visit whenever I'm in PDX

[Timberridge]

If a local business charges your Amex card and then later tells you they will refund you, how long should the refund take to hit your account assuming they inputted the refund after they called you?

[Supermoon]

2-3 days

[Timberridge]

Ok thanks. It's been 5. I think I will call again.

[riser4]

Do you visit graves of your dead peeps?

Not often but I have. Dad (and his Mom, Dad, and brothers) are in a really cool spot overlooking the Ogunquit River, the dunes, and the ocean. It's prime real estate so I like that it's a village cemetery.