## The Google Sheets data table can not create a graph accurately?

I'm trying to convert some data into a cloud of points using Google sheets. But 2 problems:

1) `when i try to classify x and y so that the graph has x data on x and y on y, it's the inverse. Can this be related to the fact that the data of the y-axis have smaller values? 1.4-3.5 instead of 44k ect.?`

2) `if the solution is simply to change x and y from the editor instead of changing the data side, how to proceed?`

The data:

I would like GDP per capita to be on the x and the height to be on the y

## plot – Smooth Plot of roughly spaced table values

In a simpler first case, I drew reasonably spaced contours (stability) by selecting a sequence of k values, {. 0001, .025, .055, .1, .15, .2, .25, .3, .35,. 4, .5, .6, .7, .8, 1., 1.4, 1.8, 2.2, 2.6, 3, 4, 6, 8, 16} by calculating an analytical function for those k with a matched color sequence.

Now, in a more complicated case to compare with the original at k values ​​and identical colors, the analytic function is replaced by numerical integration and asymptotic expansion. I've generated a table of new function at these k values, but ListLinePlot of these entries vs k draws disjointed line segments between the points of the table. I just want a smooth curve without creases. I've tried ListCurvePathPlot and Interpolation Order, but they still left the issues at the last data points, albeit rude.

I would be very grateful for any suggestions of other simple things that I could try at the plot stage, as I am now stuck for several hours on this simple problem. Thank you

## fluent api – Table relating to itself Entity Framework

I'm stuck in the definition of a table for account catalogs, these can be control o auxiliary it is, if it is control is a parent account, which means that it will have sub-accounts that would be daughter accounts and type accounts auxiliary they will not have a daughter account.

For example:

``````1 - Assets.//control
1.0 - Current Assets.//control
1.0.1 - Species and species. // control
1.0.1.1 - General Box.//appropriate
``````

This is an example of the hierarchy of account catalogs. The fact is, I'd like to have access to only the parent account of an account and the list of daughter accounts in an account. But I do not know how to structure the model.

I have tried this way:

## Model:

``````Public category CatalogoCuenta
{
[Key]
public int NumeroCuenta {get; together; }
[Required]
public string AccountName {get; together; }
[Required]
public FuenteCuenta Fuente {get; together; }
[Required]
public GrupoCuenta Grupo {get; together; }
[Required]
retention of public ISR {get; together; }
[Required]
public TipoCuenta TipoCuenta {get; together; }
[Required]
public TypeIncome TypeIncome {get; together; }

public int? ParentAdd {get; together; }
public list Happy accounts {get; together; }
}
public class RelacionCuentaHijo
{
[Key]
public int RelacionId {get; together; }
public int CuentaHijoId {get; together; }
Public Catalog Account AccountHijo {get; together; }
}
{
[Key]
public int RelacionId {get; together; }
public int CuentaPadreId {get; together; }
Public Catalog Account Parent Account {get; together; }
}
``````

But I realized that this model does not do better, I would need a model with dual relationship, that is to say with the account identifier and the account ID with which it relates. For example:

``````public class RelacionCuentaHijo
{
[Key]
public int RelacionId {get; together; }
public int CuentaHijoId {get; together; }
Public Catalog Account AccountHijo {get; together; }
public int CuentaId {get; together; }
Public Catalog Account Account {get; together; }
}
``````

But I do not know how to do this work and that in `CuentaHijoId` the daughter account ID is registered and `AccountId` the identifier of the account that has him as a parent.

I also have a doubt if I should create these two tables to make this relationship or a rough relationship.
J & # 39; uses api fluently configure the relationships presented in the model.

## c ++ – Reflective hash table based on use

I want to write a hash table that keeps the usage statistics and, depending on its usage, will use different implementations at runtime. For example, use a certain implementation for the small hash tables and another for the large ones (or tweek settings to maximize the occurrences in the cache).

How can I do such a thing in C ++?

I am open to the use of experimental reflection implementations as it is an educational project for me and not a production code.

## Why does dataGridView2.Rows.Add () remove the previous cell from my table?

You see, I have a DtaGridView in a form, this form already has cells and columns written, and I want it to add more rows during the run, for what I do:

``````dataGridView2.Rows.Add (cell1, cell2, cell3, cell4);
``````

this line of code does not fail, but I want it to do it in a new line, but instead, write about the last line of the DGV file.

How can I add this data without modifying the table?
Thank you, hello!!!

## How to make table contents appear in a DIV in HTML when I select a certain option?

``````

\$ value):
\$ channelname = \$ value['categoria'][\$key]['category_name'];
?>

``````

HD Globe
Watch now:
New

``````

## mysql – Why the value of the NUMERIC_SCALE column of the INFORMATION_SCHEMA.COLUMNS table for DATA_TYPE = "double" NULL?

I've created a column whose data type is DOUBLE.

``````alter table my_table add column my_column double;
``````

I found that the numeric_scale for this column is NO?

``````select DATA_TYPE,
numeric_precision,
numeric_scale

of information_schema.columns

where table_schema = & # 39; my_schema & # 39;
and table_name = & # 39; my_table & # 39;
and column_name = my_column & # 39;

+ ----------- + ------------------- + --------------- +
| DATA_TYPE | NUMERIC_PRECISION | NUMERIC_SCALE |
+ ----------- + ------------------- + --------------- +
| double | 22 | NULL |
+ ----------- + ------------------- + --------------- +
``````

Can any one explain this behavior?

## linear algebra – fill in the table – non-isomorphic groups – permutation.

I am a computer student – first year. I am studying Linear Linear Algebra 2 – Linear Algebra Course 1. – In some institutions, university studies teach courses together / teach in another way.

I've solved the question – but it's rather weird – without permutation.

"Let us consider the groups ({e, a, b, c},) – that is to say the groups of 4 elements.
two of these non-isomorphic groups (i.e. essentially different). Here are the partially
multiplication tables filled for them:

1)
$$begin {array} {c | lcr} * & e & a & b & c \ hline e & e & a & b & c \ a & a & \ b & b && \ c & c c {end}$$
2)
$$begin {array} {c | lr} * & e & a & b & c \ hline e & e & a & b & c \ a & b & \ b & b && \ c & c c {end}$$

Fill in the contents so that both groups are non-isomorphic groups.
"

I fill the table and I have:

1)
$$begin {array} {c | * & e & a & b & c \ hline e & e & a & b & c & b & b & b & b & b & b & b & c & a c & b & e end {end}$$

I have rejected the possibilities that, in my opinion, do not exist – for example:
bb = a – other option not possible.
bb can not be the theorem of e-lagrange, nor c / b, because I can get 2 same elements in the same row / column.

2)
$$begin {array} {c | * & e & a & b & c \ hline e & e & a & b & c & a & b & b & b & b & c & e & c c & e & a & b end {array}$$

fill like a sudoko.

I have not solved algebraically – I think – is there another way to solve these issues?

## C ++ Table of pointers on an abstract class

I have this duty for my OOP course that I hope someone can check for me:

Make an abstract course ElementOnMap which contains a unique identifier (int), a type (char array) and a static variable #ofElements. What to create a Map class with the dimensions of the map and a matrix of pointers to class objects Element. It should have the following functions:

a copy builder!

Then make an Island subclass and a Ship subclass that will inherit the Element class, which redefines the abstract method from Element, …

So, that's Element.h

``````class element
{
protected:
static int numEl;
int id;
type of tank[16];

public:
char * type ()
{
char * p = type;
return p;
}
virtual virtual footprint () = 0;
};

Island class: public element
{
Character name[16];
int numPeople;
public:
Island();
Island (char *, int);
empty print ();
};
``````

This is my Element.cpp:

``````#include "Element.h"
#understand
#understand
using namespace std;

int Element :: numEl = 0;

Island :: Island ()
{
id = numEl;
numEl ++;
}

Island :: Island (char * naz, int a): numPeople (a)
{
strcpy_s (name, naz);

type[0] = & # 39; I;
type[1] = & # 39; s;
type[2] = & # 39;
type[3] = & # 39; a;
type[4] = & Nbsp;
type[5] = & # 39;
type[6] = & # 39;  0 & # 39 ;;

id = numEl;
numEl ++;
}

void Island :: print ()
{
cost << "ID elementa:" << id << "Tip elementa:" << type;
cost << "Ime ostrva:" << name << "Broj stanovnika:" << numPeople << endl;
}
``````

and finally, Map.h:

``````Mapa class
{
int m, n;
Element *** matrix;
public:
Mapa (int, int);
Mapa (const Mapa & M);
~ Mapa ();
};

Map :: Map (int, int, b): m (a), n (b)
{
Matrix = new element **[m];
for (int i = 0; i < m; i++)
Matrix[i] = new Element*[n];
}

Mapa::Mapa(const Mapa & M)
{
this->m = M.m;
this-> n = M.n;

Matrix = new element **[m];
for (int i = 0; i <m; i ++)
Matrix[i] = new element *[n];

for (int i = 0; i <m; i ++)
for (int j = 0; j <n; j ++)
{
*Matrix[i][j]    = * (Mr. Matrix[i][j])
}
}

Mapa :: ~ Mapa ()
{
wipe off[] Matrix;
}
``````

Do I declare the pointer array correctly and my copy constructor is it good? I understand that I need a deep copy because I'm working with pointers, but this pointer creation really makes me feel silly. Plus, do I need a constructor for the Element abstract class since it can not be instantiated?

## postgresql – Foreign keys with ON DELETE SET NULL are always deleted when TRUNCATE CASCADE is called on foreign table in Postgres

Maybe I miss something here:

``````CREATE TABLE public.example_table (
whole id UNIQUE
)

CREATE TABLE public.foreign_table (
whole id,
example_table_id integer,
CONSTRAINT fk_example_table_id
FOREIGN KEY (example_table_id)
REFERENCES public.example_table (id)
ON DELETE SET NULL
)

INSERT INTO public.example_table (id) VALUES
(1);

INTEGER INTO public.foreign_table (id, example_table_id) VALUES
(1, 1),
(2, zero);
``````

If I run `CASCADE TRUNCATE`, the two tables are erased, which is not what I expected.

``````TRUNCATE example_table CASCADE;

SELECT COUNT (*) FROM public.foreign_table;

0
``````

What I would expect is that `foreign_table` would change to:

``````(1, null)
(2, none)
``````

Do not I understand what SET NULL is supposed to accomplish?

Is it possible to use TRUNCATE CASCADE without removing it from the other table? I'm using Laravel where I can call `Model :: truncate ();` and it will automatically truncate the table and reset my indexes, hoping to call that on the `exemple_table` and reset it all the lines in `foreign_table` at `no` instead of just deleting the entire table.