## command line: Do you quickly browse files and folders that are super nested like Russian Dolls and confusing?

I am working with a database, which needs to import data from several files with long names located in different folders with long names. The total number of different directories and folders on which this database is based, which is an Excel spreadsheet, is that I have a lot of headaches and a follow-up of all the folders to find what I want. I would like there to be indications in the command line or something that would allow me to organize all these folders in a less expensive way or simply search for the file I want to open without having to make a SQL server. The thing is that these folders are like Russian dolls, except they are not cylindrical but have the shape of a labyrinth of winds and turns and I am inside the Russian doll.

How do I manage all these files stored in disordered directories?

I have to disarm the Russian doll behind the Russian doll to find my stuff, and I do not know how to manage these files without placing them in endless folders of Russian dolls, which are growing subsets. Mind you, the growing subset is a joke that belongs to math.stackexchange.com.

Every time I went to look for a file that I have to scroll through the Amazon jungle of folders that remind me of infinitely large Russian dolls with endless layers, I do not know how to better organize my files.

I tried using "find" on Mac OS X but my titles are already long enough and there are too many matches to make it work.

## react natively: How to avoid line breaks in the router flow tabs?

I am creating an application using the flow tabs of the router, but when the application is loaded into a cell with a smaller screen, a line break occurs, as shown in the image

I would like to know how to make this tab of the router flow have a horizontal scroll, so that this line break does not occur

code:

``````

<Scene key = & # 39; services & # 39; hideDrawerButton tabBarLabel = { } hideNavBar>

<Scene key = & # 39; workouts & # 39; tabLabel = & # 39; test2 & # 39; hideDrawerButton tabBarLabel = {} hideNavBar>

<Scene key = & # 39; items & # 39; hideDrawerButton tabBarLabel = {} hideNavBar>

<Scene key = & # 39; products & # 39; hideDrawerButton tabBarLabel = {} hideNavBar>

``````

## What is "AV" in av-> system_mem and what does this line return?

What is "AV" in av-> system_mem And what value does this line return?

## Command Line – Tools to debug ACPI problems

I came across this excellent article written by Intel:

Contains a nifty bash script:

``````#! / bin / bash
cd / var / tmp /
acpidump -b
iasl -d * .dat
lp = \$ (grep "Inactiveness S0 of low power" /var/tmp/facp.dsl | awk & # 39; {print \$ (NF)} & # 39;)

Yes [ "\$lp" -eq 1 ]; so
echo "Low Power S0 Idle is" \$ lp
echo "The system supports S0ix!"
plus
echo "Low Power S0 Idle is" \$ lp
echo "The system does not support S0ix!"
fi
``````

The output was full of errors and in the lower part the script said:

``````Low power S0 Inactive is 0
The system does not support S0ix!
``````

I have a skylake i-7 6700HQ chip and distrust the results. I suspect that all ACPI errors are the culprits and correcting them could change the result.

The work file `grep`ed by the script contains this:

``````\$ cat facp.dsl
/ *
* Intel ACPI Component Architecture
* Disassembler AML / ASL + version 20160108-64
* Copyright (c) 2000 - 2016 Intel Corporation
*
* Disassembly of facp.dat, Sun July 14 16:55:52 2019
*
* ACPI data table [FACP]
*
* Format: [HexOffset DecimalOffset ByteLength]  FieldName: FieldValue
* /

[000h 0000   4]                    Signature: "FACP"    [Fixed ACPI Description Table (FADT)]
[004h 0004   4]                                                                    Length of the table: 0000010C
[008h 0008   1]                     Review: 05
[009h 0009   1]                     Check sum: 88

(... SNIP ...)

[103h 0259   1]         Encrypted Access Width: 03 [DWord Access:32]

/ **** The ACPI table ends in the middle of a data structure! (table dump) * /

Data of the raw table: length 268 (0x10C)

0000: 46 41 43 50 0C 01 00 00 05 88 41 4C 57 41 52 45 // FACP ...... ALWARE
0010: 41 4C 49 45 4E 57 52 45 09 20 07 01 41 4D 49 20 // ALIENWRE. ..TO ME
0020: 13 00 01 00 80 6F 89 37 10 42 EE 36 01 02 09 00 // ..... o.7.B.6 ....
0030: B2 00 00 00 A0 A1 00 00 00 18 00 00 00 00 00 00 // ................
0040: 04 18 00 00 00 00 00 00 50 18 00 00 08 18 00 00 // ........ P .......
0050: 80 18 00 00 00 00 00 00 04 04 01 04 20 00 10 00 // ............ ...
0060: 65 00 39 00 00 04 10 00 00 00 0D 00 32 12 00 00 // e.9 ......... 2 ...
0070: A5 86 03 00 01 08 00 01 F9 0C 00 00 00 00 00 00 // ................
0080: 06 00 00 00 00 00 00 00 00 00 00 00 10 42 EE 36 // ........... B.6
0090: 00 00 00 00 01 20 00 02 00 18 00 00 00 00 00 00 // ..... ..........
00A0: 01 00 00 02 00 00 00 00 00 00 00 00 01 10 00 02 // ................
00B0: 04 18 00 00 00 00 00 00 00 00 00 02 00 00 00 00 // ................
00C0: 00 00 00 00 01 08 00 01 50 18 00 00 00 00 00 00 // ........ P .......
00D0: 01 20 00 03 08 18 00 00 00 00 00 00 01 00 00 01 //. ..............
00E0: 80 18 00 00 00 00 00 00 00 00 00 01 00 00 00 00 // ................
00F0: 00 00 00 00 01 08 00 03 04 18 00 00 00 00 00 00 // ................
0100: 01 08 00 03 00 18 00 00 00 00 00 00 // ............
``````

The line / **** The ACPI table ends in the middle of a data structure! (table dump) * / it worries me

The complete output starts well, but I'll show you some of the errors:

``````Intel ACPI component architecture
ASL + Optimizing Compiler version 20160108-64
Copyright (c) 2000 - 2016 Intel Corporation

Input file /var/tmp/apic.dat, Length 0xBC (188) bytes
ACPI: APIC 0x00000000000000000000 (v03 ALWARE ALIENWRE 01072009 AMI 00010013)
Acpi data table [APIC] decoded
Formatted output: /var/tmp/apic.dsl - 8729 bytes
Input file /var/tmp/bgrt.dat, length 0x38 (56) bytes
ACPI: BGRT 0x0000000000000000 000038 (v01 ALWARE ALIENWRE 01072009 AMI 00010013)
Acpi data table [BGRT] decoded
Formatted output: /var/tmp/bgrt.dsl - 1495 bytes
Input file /var/tmp/dbg2.dat, length 0x54 (84) bytes

(... SNIP ...)

Pass 1 pair of [DSDT]
Analysis of deferred access codes (methods / buffers / packages / regions)

Completed analysis
ACPI error: error in the arg count of the external method _SB_.PCI0.GFX0.ATPX: Stream 7, attempt 4 (20160108 / dmextern-822)
ACPI error: error in the arg count of the external method _SB_.PCI0.GFX0.ATPX: Stream 7, try 1 (20160108 / dmextern-822)

We found 20 external control methods, comparing with new information.
Pass 1 pair of [DSDT]
Analysis of deferred access codes (methods / buffers / packages / regions)

Completed analysis
Disassembly completed
Output ASL: dsdt.dsl - 1135146 bytes

IASL warning: 20 external control methods were found during
disassembly, but additional ACPI tables to resolve these external aspects
were not specified The output file resulting from the disassembler can not be
compile because the disassembler did not know how many arguments
To assign to these methods. Specify the tables needed to solve.
references of external control methods, the -e option can be used to
Enter the file names. Note: SSDTs can be loaded dynamically in
the execution time and may or may not be available through the host operating system.
Example of iASL invocations:
iasl -e ssdt1.aml ssdt2.aml ssdt3.aml -d dsdt.aml
iasl -e dsdt.aml ssdt2.aml -d ssdt1.aml
iasl -e ssdt * .aml -d dsdt.aml

In addition, the -fe option can be used to specify a file that contains
Method of controlling external declarations with the associated method.
the argument counts. Each line of the file should be of the form:
External (, MethodObj, )
Invocation:
iasl -fe refs.txt -d dsdt.aml

(... SNIP ...)

ACPI error: error in the arg count of the external method _SB_.GGOV: Current 4, attempt 2 (20160108 / dmextern-822)
ACPI error: error in the arg count of the external method _SB_.GGOV: Current 4, attempt 2 (20160108 / dmextern-822)
ACPI error: error in the arg count of the external method _SB_.GGOV: Current 4, attempt 2 (20160108 / dmextern-822)

(... SNIP ...)

ACPI error: error in the arg count of the external method _SB_.PCI0.LPCB.H_EC.ECWT: Current 6, attempt 7 (20160108 / dmextern-822)
ACPI error: error in the arg count of the external method _SB_.PCI0.LPCB.H_EC.ECWT: Current 6, attempt 4 (20160108 / dmextern-822)

(... SNIP ...)

ACPI error: arg count error of external method P8XH: Current 2, attempt 5 (20160108 / dmextern-822)
ACPI error: arg count error of external method P8XH: Current 2, attempt 5 (20160108 / dmextern-822)
(... repeat 9 times ...)

(... SNIP ...)

ACPI error: arg count error of external method _SB_.SGOV: Current 5, attempt 2 (20160108 / dmextern-822)

(... SNIP ...)

ACPI error: arg count error of external method _SB_.SGOV: Stream 7, attempt 2 (20160108 / dmextern-822)

(... SNIP ...)

Etc., etc., etc.
``````

I have searched on github.com for tools to analyze ACPI in Linux and I am sure there are many of them. But I wonder if someone has had a similar experience and what tools did you use?

## artifacts: What can cause a detailed ghost image flipped horizontally in an image taken with a monochrome line scanning camera?

Assuming that standard optics (lens elements that are spherical or pseudo-spherical, with rotational symmetry with respect to the optical axis) and "standard" cameras (without beam splitting, or mirrors in the optical path), there is nothing optically this will cause ghost images of lateral reflection of a single axis, either from left to right, from top to bottom or even diagonally. This is because the lenses perform transformations for any set of orthogonal input axes (ie, X Y Y axes). Both dimensions are transformed: the left is changed by the right and the upper part is changed by the lower part (in addition to the scale, and probably also a certain degree of distortion). In linear algebra, swapping. X for -X Y Y for -Y is mathematically equivalent to a rotation of 180 ° on the z axis (ie, on the optical axis of the lens). Thus, in optically generated ghost images (again, with "standard" optics), all ghost elements are reflected through the center of the image, not simply through a vertical or horizontal "fold line".

Moving away from standard optics, cylindrical sector lens elements, which curve in one dimension (usually laterally) but not in the orthogonal (vertical) dimension, could cause symmetrical phantom patterns from left to right. The anamorphic lenses, or at least the current anamorphic filters and adapters, come to mind. They compress the lateral field of view of a shooting lens, which when printed or processed allows much wider lateral fields of vision than the camera can normally. This is often used to film wide-screen cinema.

In addition to optics, I suppose it is possible that some sensor technologies are susceptible to lateral "ghost images", perhaps because of the way sensor data is read or scanned. But that would be pure speculation on my part.

The last thing I can think of, at least inside the optics or the camera itself, is some kind of reflection of the sensor image, back to some plane in the optical path (like a filter plate or something behind it). the lens, quite close to the plane of the film / sensor), and then back to the sensor. But in order for the reflected image to appear even slightly focused, the aggregate reflection path must be quite short compared to the rear focusing distance of the lens. This implies that the lens focuses extremely close to the subject, and there would be a certain distance from the exit pupil of the lens to the sensor. In addition, that reflection surface would have to be concave (looking from the face of the lens) only in the lateral dimension. Frankly, this last possibility is even more speculative and unlikely than the previous paragraph.

Outside the camera, the most obvious explanation is a reflection through a window, an automotive glass or another surface that is largely transparent but semi-reflective. That would explain the same degree of magnification and the object reflected in the focus as the real object in the image.

## Command line – Printing to printer with colored text.

So, in my work, I test the functionality of laptops with a Linux live usb of Linux. I've been looking for a way to get the hardware information and print it. So far I have it about how I want it using inxi -M -C -B -m> output.txt. Then I print it with lpr.

What I would like is that some of the words are colored or bold when printed. Specifically, the words before the information such as CPU: o Memory:. Basically just like it does in the terminal.

I have researched a lot and I have not found a way to do this. It's possible?

## A purely algebraic argument for the existence of a section of a smooth projective morphism to the projective line

If I am reading this post correctly, any soft projective $$mathbb {C}$$-Morphism of schemes $$X rightarrow mathbb {P} ^ 1$$ It admits a section. I'm afraid of the topological argument presented there. Is there any algebraic proof of this fact? What happens in fields other than $$mathbb {C}$$?

## Test verification of sec. 24 "Topology" of Munkres, the long line can not be embedded in real

I'm doing this exercise in the topology of Munkres (~ paraphrasing). I have two motivations for reading this book: 1, the topology is really pretty, but the main one, 2, is that I'm not yet an undergraduate student; therefore, I have never taken any kind of "evidence-based" course and would like to learn how to write legible tests. Appreciate:

1. A verification of my test.

Remember that $$S _ { Omega}$$ Denotes the minimum set ordered, uncountable. Let L denote the ordered set $$S _ { Omega} times[01)[01)[01)[01)$$ in the order of the dictionary, with its smallest element removed. The set L is a classic example in topology called Long line.

Theorem: the long line is connected to the route and locally homeomorphic to $$mathbb {R}$$, but it can not be embedded in $$mathbb {R}$$.

The structure of the test is given by Munkres.

(a) Let X be an ordered set; leave $$a Be X points. Show that $$[ac)[ac)[ac)[ac)$$ has the order type of $$[01)[01)[01)[01)$$ Yes, both $$[ab)[ab)[ab)[ab)$$ Y $$[bc)[bc)[bc)[bc)$$ have the order type of $$[01)[01)[01)[01)$$.

Assume $$[ab)[ab)[ab)[ab)$$ Y $$[bc)[bc)[bc)[bc)$$ have the order type of $$[01)[01)[01)[01)$$. Then there are order isomorphisms. $$f:[ab)rightarrow[0frac{1}{2})[ab)rightarrow[0frac{1}{2})[ab)rightarrow[0frac{1}{2})[ab)rightarrow[0frac{1}{2})$$ Y $$g:[bc)rightarrow[0frac{1}{2})[bc)rightarrow[0frac{1}{2})[bc)rightarrow[0frac{1}{2})[bc)rightarrow[0frac{1}{2})$$, why $$[01)[01)[01)[01)$$ has the same kind of order that $$[01/2)[01/2)[01/2)[01/2)$$. Define $$h:[ac)rightarrow[01)[ac)rightarrow[01)[ac)rightarrow[01)[ac)rightarrow[01)$$ as follows:

$$h (x) = begin {cases} f (x) text {if} x in[a, b) \ g (x) text {if} x in[BC) end {cases}$$

$$h$$ it's an order-isomorphism, like $$p it implies $$h (p) .

Conversely, it assumes $$[ac)[ac)[ac)[ac)$$ has the order type of $$[01)[01)[01)[01)$$. Then there is an order-isomorphism. $$f:[ac)rightarrow[01)[ac)rightarrow[01)[ac)rightarrow[01)[ac)rightarrow[01)$$. Restricting the domain to $$[ab)[ab)[ab)[ab)$$ gives a new order-isomorphism $$g:[ab)rightarrow[0d)[ab)rightarrow[0d)[ab)rightarrow[0d)[ab)rightarrow[0d)$$, where $$d in (0.1)$$. $$[0d)[0d)[0d)[0d)$$ is of the order type of $$[01)[01)[01)[01)$$; multiplying by $$1 / d$$ It is an order of isomorphism. Similarly, restricting the domain of $$f$$ to $$[bc)[bc)[bc)[bc)$$ gives order-isomorphism $$h:[bc)rightarrow[d1)[bc)rightarrow[d1)[bc)rightarrow[d1)[bc)rightarrow[d1)$$, where $$d in (0.1)$$.

(b) Let X be an ordered set. Leave $$x_0 Be a growing sequence of points of X; suppose $$b = sup {x_i }$$. Show that $$[x_0b)[x_0b)[x_0b)[x_0b)$$ has the order type of $$[01)[01)[01)[01)$$ if each interval $$[x_ix_i+1)[x_ix_i+1)[x_ix_i+1)[x_ix_i+1)$$ has the order type of $$[01)[01)[01)[01)$$.

This is simple, having already tried. $$(a)$$. Begin with $$i = 1$$: $$[x_0x_1)[x_1b)[x_0x_1)[x_1b)[x_0x_1)[x_1b)[x_0x_1)[x_1b)$$ It is a partition of a set in the same way that we saw in $$(a)$$; therefore, each must have the same type of order that $$[01)[01)[01)[01)$$. We proceed by induction, considering now the whole. $$[x_1b)[x_1b)[x_1b)[x_1b)$$ and the sequence $$x_1 The test is the same.

(c) Leave $$a_0$$ denotes the smallest element of $$S _ { Omega}$$. For each element $$a$$ of $$S _ { Omega}$$ different from $$a_0$$, shows that the interval $$[a_0times0atimes0)[a_0times0atimes0)[a_0times0atimes0)[a_0times0atimes0)$$ of $$L$$ has the order type of $$[01)[01)[01)[01)$$.

The[[Innuendo: Proceed by transfinite induction. Either has an immediate predecessor in $$S _ { Omega}$$, or there is a growing sequence $$a_i$$ in $$S _ { Omega}$$ with $$a = sup {a_i }$$]

How can I order this ?: $$[a_0a)[a_0a)[a_0a)[a_0a)$$ is accountable by the definition of $$S _ { Omega}$$. Following the trail: yes $$a$$ it has an immediate predecessor, $$b$$, so $$[btimes0atimes0)[btimes0atimes0)[btimes0atimes0)[btimes0atimes0)$$ has the order type of $$[01)[01)[01)[01)$$ (All points in this set are of the form $$b times x$$, where $$x en[01)[01)[01)[01)$$).

By induction backwards. $$a_0$$ any finite section of $$S _ { Omega}$$of which $$a$$ is the largest element, is the isomorphic order for $$[01)[01)[01)[01)$$.

Yes $$a$$ is not the largest element of a finite section of $$S _ { Omega}$$, then there is a growing sequence $$a_i$$ in $$S _ { Omega}$$ with $$a = sup {a_i }$$, this sequence is exactly every element of $$S _ { Omega}$$ strictly less than $$a$$, in order (which must be countable). Every $$a_ {i + 1}$$ In this sequence has an immediate predecessor, namely: $$a_1$$, then each $$[a_{i}times0a_{i+1}times0)[a_{i}times0a_{i+1}times0)[a_{i}times0a_{i+1}times0)[a_{i}times0a_{i+1}times0)$$ must be isomorphic order to $$[01)[01)[01)[01)$$ for the previous argument. Then for $$(b)$$, then you must $$[a_0times0atimes0)[a_0times0atimes0)[a_0times0atimes0)[a_0times0atimes0)$$.

(d) Show that $$L$$ The road is connected.

Extensible $$(c)$$ to include sets of the form $$[ab)abenL[ab)abinL[ab)abenL[ab)abinL$$ It's trivial – just add / subtract the sets of the ends – I'll assume this. This implies that $$[a,b]$$ has the same kind of order that $$[0,1]$$. So between two points $$a, b in L$$, there is an order-isomorphism $$f:[0,1] correct arrow [a,b]$$; which is necessarily a homeomorphism and therefore a continuous map.

Is that last step valid? How can I make that clearer?

(e) Show that each point of $$L$$ It has a homeomorphic neighborhood with an open interval in. $$mathbb {R}$$.

Leave $$x$$ be our point, assume $$x neq a_0$$. Then there are some points, $$a, b in L$$, such that $$a . By $$(d)$$, $$L$$ The path is connected, so there is some homeomorphism. $$f:[c,d] correct arrow [a,b]$$ such that $$f (c) = a$$, $$f (d) = (b)$$. Then, restricting the range of $$f$$ to $$(c, d)$$ we get a homeomorphism $$f & # 39; 🙁 c, d) rightarrow (a, b)$$.

And finally…

(f) Show that L can not be embedded in $$mathbb {R}$$or indeed in $$mathbb {R} ^ n$$ For any $$n$$.

The[[Innuendo: any subspace of $$mathbb {R} ^ n$$ It has an accounting basis for its topology.

Suppose there was an imbedding $$f: L rightarrow mathbb {R} ^ n$$, therefore a homeomorphism $$f & # 39 ;: L rightarrow Y$$, $$Y subset mathbb {R} ^ n$$ obtained by restricting the range of $$f$$. $$Y$$ It must have an accounting basis because $$mathbb {R} ^ n$$ is metrizable, so $$L$$ It must also have an accounting base for its topology, being homeomorphic with $$Y$$.

Assume $$L$$ I had an accounting basis, call this base $$U_ {i}$$ where $$i in mathbb {Z} ^ {+}$$. Each open set of $$L$$ It must contain, in its entirety, at least one. $$U_i$$. Leave $$x _ { alpha}$$ Be the collection of all the points of the form. $$y times 0$$ where $$y in S {Omega}$$. $$x _ { alpha}$$ It is uncountable, being indexed by $$S _ { Omega}$$. Then for (e), there is a countless collection $$V _ { alpha}$$ of neighborhoods around $$x _ { alpha}$$. Keep in mind that we can choose, with more force, $$V _ { alpha}$$ in such a way that it is paired-disunion.

That last step feels neglected; Any suggestions?

Then each contains some $$U_ {i}$$; So, there is some injective function. $$f: S _ { Omega} rightarrow mathbb {Z} ^ {+}$$ defined by $$f ( alpha) = i$$ as long as $$U_i subset V _ { alpha}$$. This contradicts that $$S _ { Omega}$$ it is countless

$$therefore$$

## Unity3d: keep working on the project in the editor while building for Android on the command line

Is it possible to continue working on the project in the editor while it is being built for Android on the command line?

## networks: How to automatically enable Internet Connection Sharing using the command line in Windows 10?

We have payment terminal and auto-kiosk based on windows. They must be connected via USB so that the terminal can have wifi. Every time we turn on the kiosk, we have to manually connect the payment terminal. Configure the shared network each time you turn on the kiosk

As you can see in the image, we have to disable "Allow other users of the network to connect through the Internet connection of this computer", and then enable it and choose Ethernet 3 from the drop-down menu to connect the terminal. Is there any way to automate the process? How to run it every time we turn on the kiosk?