[Update] C# List Examples | set in dex – POLLICELEE

set in dex: คุณกำลังดูกระทู้

C# List ExamplesCreate a new List and add elements to it. Loop over its elements with for and foreach.

List. Programs often do simple things, like read in numbers. With a List, we can Add() these items as we encounter them, and this C# class handles the implementation details.

List details. The List is initialized with the new keyword. When we call Add, the List adjusts its size as needed. It is used in nearly all larger C# programs.

The List is initialized with the new keyword. When we call Add, the List adjusts its size as needed. It is used in nearly all larger C# programs. Initialize List

Initialize. Here we create 2 separate lists of ints. We add 4 prime numbers to each List. The values are stored in the order added—2, 3, 5 and then 7.

Version 1 We call Add() 4 times with the number as the argument. The end count of the list is 4.

List Add

Version 2 This code adds all 4 numbers in a single expression—it is easier to read, and the code generated is the same.

Here we create 2 separate lists of ints. We add 4 prime numbers to each List. The values are stored in the order added—2, 3, 5 and then 7.

C# program that uses List, Add, initializer

var numbers = new List<int>();
numbers.Add(

2

);
numbers.Add(

3

);
numbers.Add(

5

);
numbers.Add(

7

);
Console.WriteLine(“LIST 1: ” + numbers.Count);

var numbers2 = new List<int>() { 2, 3, 5, 7 };
Console.WriteLine(“LIST 2: ” + numbers2.Count);
}
}

LIST 1: 4
LIST 2: 4

using System; using System.Collections.Generic; class Program { static void Main() {var numbers = new(); numbers.); numbers.Add(); numbers.Add(); numbers.Add(); Console.WriteLine(“LIST 1: ” + numbers.Count);var numbers2 = new() { 2, 3, 5, 7 }; Console.WriteLine(“LIST 2: ” + numbers2.Count); } }LIST 1: 4 LIST 2: 4

Foreach-loop. This is the clearest loop when no index is needed. It automatically sets each element to a name we specify—here we use the identifier “prime.”

Part A We use the “foreach” keyword and declare a variable that is assigned to each element as we pass over it.

Part B In the foreach-loop, we access the “prime” variable, which is the current element. We print each int to the screen.

This is the clearest loop when no index is needed. It automatically sets each element to a name we specify—here we use the identifier “prime.”

C# program that uses foreach, List

List<int>

list = new List<int>() { 2, 3, 7 };

foreach (

int prime

in list)
{

System.Console.WriteLine(“PRIME ELEMENT: {0}”, prime);
}
}
}

PRIME ELEMENT: 2
PRIME ELEMENT: 3
PRIME ELEMENT: 7

using System.Collections.Generic; class Program { static void Main() {list = new List() { 2, 3, 7 };in list) {System.Console.WriteLine(“PRIME ELEMENT: {0}”, prime); } } }PRIME ELEMENT: 2 PRIME ELEMENT: 3 PRIME ELEMENT: 7

Indexes, for-loop. A List has elements like an array, and they are accessed by indexes starting at zero. For iteration, we can use these indexes in a for-loop.

Part 1 Here we create a list of 3 elements, and print its first element to the console (using index 0).

Part 2 We use a for-loop, beginning at 0. We end when we reach Count—the last index accessed is Count-1.

For

Part 3 We print each element index with Console.WriteLine. We use a string interpolation expression to format the string.

A List has elements like an array, and they are accessed by indexes starting at zero. For iteration, we can use these indexes in a for-loop.

C# program that uses List indexes and for-loop

List<int>

list = new List<int>(new int[]{ 2, 3, 7 });
Console.WriteLine($”FIRST ELEMENT: {list[0]}”);

for (int i = 0; i < list.

Count

; i++)
{

Console.WriteLine($”{i} = {list[i]}”);
}
}
}

FIRST ELEMENT: 2
0 = 2
1 = 3
2 = 7

using System; using System.Collections.Generic; class Program { static void Main() {list = new List(new int[]{ 2, 3, 7 }); Console.WriteLine($”FIRST ELEMENT: {list[0]}”);(int i = 0; i < list.; i++) {Console.WriteLine($”{i} = {list[i]}”); } } }FIRST ELEMENT: 2 0 = 2 1 = 3 2 = 7

For-loop, reverse. Much like an array, we can access the elements in a List in any way we like. We can loop over the List elements in reverse with a for-loop.

Start For a reverse loop, we must access the last element first, so we get the Count and subtract one from it. This is the last index.

Much like an array, we can access the elements in a List in any way we like. We can loop over the List elements in reverse with a for-loop.

C# program that uses for reverse, List

var

votes = new List<bool> { false, false, true };

for (int i =

votes.Count – 1

; i >= 0; i–)
{
Console.WriteLine(“DECREMENT LIST LOOP: {0}”, votes[i]);
}
}
}

DECREMENT LIST LOOP: True
DECREMENT LIST LOOP: False
DECREMENT LIST LOOP: False

using System; using System.Collections.Generic; class Program { static void Main() {votes = new List { false, false, true };(int i =; i >= 0; i–) { Console.WriteLine(“DECREMENT LIST LOOP: {0}”, votes[i]); } } }DECREMENT LIST LOOP: True DECREMENT LIST LOOP: False DECREMENT LIST LOOP: False

AddRange, InsertRange. For adding many elements at once, we use the InsertRange and AddRange methods. InsertRange can insert at an index, while AddRange adds at the end.

Tip The first argument to InsertRange is the index where we want to insert new elements. The second is an IEnumerable (a string array).

Result We create a List of 2 strings, then add 2 strings from an array to index 1. The result List has 4 strings.

For adding many elements at once, we use the InsertRange and AddRange methods. InsertRange can insert at an index, while AddRange adds at the end. AddRange, InsertRange

C# program that uses InsertRange

var animals = new List<string>() { “bird”, “dog” };

animals.InsertRange(1, new string[] { “frog”, “snake” });

foreach

(string value in animals)
{
Console.WriteLine(“RESULT: ” + value);
}
}
}

RESULT: bird
RESULT:

frog

RESULT:

snake

RESULT: dog

using System; using System.Collections.Generic; class Program { static void Main() {var animals = new() { “bird”, “dog” };animals.(1, new string[] { “frog”, “snake” });(string value in animals) { Console.WriteLine(“RESULT: ” + value); } } }RESULT: bird RESULT:RESULT:RESULT: dog

Count, clear. To get the number of elements, access the Count property. This is fast—just avoid the Count extension method. Count, on the List type, is equal to Length on arrays.

Part A We create a List, add 3 elements, and then Count them. The correct value (3) is printed.

Part B Here we use the Clear method to erase all the elements in a List. The List then has zero elements.

List Clear

To get the number of elements, access the Count property. This is fast—just avoid the Count extension method. Count, on the List type, is equal to Length on arrays.

C# program that counts and clears List

List<bool> list = new List<bool>();
list.Add(

true

);
list.Add(

false

);
list.Add(

true

);
Console.WriteLine(list.Count);

list.Clear();
Console.WriteLine(list.Count);
}
}

3
0

using System; using System.Collections.Generic; class Program { static void Main() { list = new List(); list.Add(); list.Add(); list.Add(); Console.WriteLine(list.);list.(); Console.WriteLine(list.Count); } }3 0

Copy array. Here we create a List with elements from an array. We use the List constructor and pass it the array. List receives this parameter and fills its values from it.

Caution The array element type must match the List element type or compilation will fail.

CopyTo The List constructor can be used to copy a collection (like an IEnumerable). But for ranges, CopyTo can be used.

List CopyTo

Here we create a List with elements from an array. We use the List constructor and pass it the array. List receives this parameter and fills its values from it.

C# program that copies array to List

int[]

array = new int[] { 2, 3, 5 };

List<int>

copied = new List<int>(array);

Console.WriteLine(“COPIED COUNT: {0}”, copied.Count);
}
}

COPIED COUNT: 3

using System; using System.Collections.Generic; class Program { static void Main() {array = new int[] { 2, 3, 5 };copied = new List(array);Console.WriteLine(“COPIED COUNT: {0}”, copied.Count); } }COPIED COUNT: 3

List parameter. Lists do not exist just to be allocated and looped over. We want to test and examine elements to solve real-world problems in our programs.

Main Here we pass a List to ContainsValue300. The List can be passed as an argument—only the reference, not all elements, are copied.

ContainsValue300 This method uses a foreach-loop, which tests to see if 300 is in a list of numbers.

If

Result The values List contains the value 300, so our custom method returns the boolean true.

Lists do not exist just to be allocated and looped over. We want to test and examine elements to solve real-world problems in our programs.

C# program that uses foreach

Main

()
{
var values = new List<int>() { 200, 300, 500 };

if (

ContainsValue300

(values))
{
Console.WriteLine(“RETURNED TRUE”);
}
}

static bool

ContainsValue300

(List<int> list)
{
foreach (int number in list)
{

if (number == 300)
{
return true;
}
}

return false;
}
}

RETURNED TRUE

using System; using System.Collections.Generic; class Program { static void() { var values = new List() { 200, 300, 500 };(values)) { Console.WriteLine(“RETURNED TRUE”); } } static bool(List list) {(int number in list) {(number == 300) { return true; } }return false; } }RETURNED TRUE

IndexOf. This determines the element index of a certain value in the List collection. It searches for the first position (from the start) of the value.

Note IndexOf has two overloads. It works in the same way as string’s IndexOf. It searches by value and returns the location.

This determines the element index of a certain value in the List collection. It searches for the first position (from the start) of the value.

C# program that uses IndexOf

List<int>

primes = new List<int>(new int[] { 19, 23, 29 });

int index = primes.IndexOf(23);
Console.WriteLine(index);

index = primes.IndexOf(10);
Console.WriteLine(index);
}
}

1
-1

using System; using System.Collections.Generic; class Program { static void Main() {primes = new List(new int[] { 19, 23, 29 }); int index = primes.(23);Console.WriteLine(index); index = primes.(10);Console.WriteLine(index); } }1 -1

Contains, Find and Exist. Similiar to IndexOf, these methods provide searching of the List. They vary in arguments accepted. With Predicates, we influence what elements match.

Similiar to IndexOf, these methods provide searching of the List. They vary in arguments accepted. With Predicates, we influence what elements match. List Contains List Find, Exists

C# program that uses built-in Contains method

1

);
values.Add(

2

);
values.Add(

3

);

if (values.Contains(3))
{
Console.WriteLine(“Contains 3”);
}
}
}

Contains 3

using System; using System.Collections.Generic; class Program { static void Main() { var values = new List(); values.Add(); values.Add(); values.Add();if (values.(3)) { Console.WriteLine(“Contains 3”); } } }Contains 3

ForEach. This is a method. Sometimes we may not want to write a traditional foreach-loop. Here ForEach is useful. It accepts an Action.

Example We have a 2-element string List. Then we call ForEach with a lambda that writes each element “a” to the console.

This is a method. Sometimes we may not want to write a traditional foreach-loop. Here ForEach is useful. It accepts an Action.

C# program that uses ForEach on List

animals.ForEach(a => Console.WriteLine(“ANIMAL: ” + a));
}
}

ANIMAL: bird
ANIMAL: dog

using System; using System.Collections.Generic; class Program { static void Main() { var animals = new List() { “bird”, “dog” };animals.(a => Console.WriteLine(“ANIMAL: ” + a)); } }ANIMAL: bird ANIMAL: dog

TrueForAll. This method accepts a Predicate. If the Predicate returns true for each element in the List, TrueForAll() will also return true.

And TrueForAll() checks the entire list—unless an element doesn’t match (it has an early exit condition).

This method accepts a Predicate. If the Predicate returns true for each element in the List, TrueForAll() will also return true.

C# program that uses TrueForAll on List

List<int>

{ 10, 11, 12 };

if (numbers.TrueForAll(element => element < 20))
{
Console.WriteLine(“All elements less than 20”);
}
}
}

All elements less than 20

using System; using System.Collections.Generic; class Program { static void Main() { var numbers = new{ 10, 11, 12 };if (numbers.(element => element < 20)) { Console.WriteLine(“All elements less than 20”); } } }All elements less than 20

Join string list. Next we use string.Join on a List of strings. This is helpful when we need to turn several strings into one comma-delimited string.

ToArray It requires the ToArray instance method on List. This ToArray is not an extension method.

Tip The biggest advantage of Join here is that no trailing comma is present on the resulting string.

Next we use string.Join on a List of strings. This is helpful when we need to turn several strings into one comma-delimited string.

C# program that joins List

List<string>

cities = new List<string>();
cities.Add(“New York”);
cities.Add(“Mumbai”);
cities.Add(“Berlin”);
cities.Add(“Istanbul”);

string line = string.Join(“,”, cities.ToArray());
Console.WriteLine(line);
}
}

New York,Mumbai,Berlin,Istanbul

using System; using System.Collections.Generic; class Program { static void Main() {cities = new List(); cities.Add(“New York”); cities.Add(“Mumbai”); cities.Add(“Berlin”); cities.Add(“Istanbul”);string line = string.(“,”, cities.ToArray()); Console.WriteLine(line); } }New York,Mumbai,Berlin,Istanbul

Keys in Dictionary. We use the List constructor to get a List of keys from a Dictionary. This is a simple way to iterate over Dictionary keys (or store them elsewhere).

Keys The Keys property returns an enumerable collection of keys. But a List of these elements is more usable.

We use the List constructor to get a List of keys from a Dictionary. This is a simple way to iterate over Dictionary keys (or store them elsewhere).

C# program that converts Keys

var dict = new Dictionary<int, bool>();
dict.Add(3, true);
dict.Add(5, false);

List<int>

keys = new List<int>(dict.Keys);
foreach (int key in keys)
{
Console.WriteLine(key);
}
}
}

3, 5

using System; using System.Collections.Generic; class Program { static void Main() {var dict = new Dictionary(); dict.Add(3, true); dict.Add(5, false);keys = new List(dict.); foreach (int key in keys) { Console.WriteLine(key); } } }3, 5

Insert. This method places an element at an index. We pass in the index (an integer) and the element we wish to place in the list. Insert can cause performance problems.

Part 1 We create an empty string list, and then add 2 string elements to it (these are the names of dogs).

Part 2 We call insert to place a new dog name as the second element. Later elements (“beagle”) now come after the new second element.

Queue A Queue may allow simpler usage of the collection in our code. This may be easier to understand.

Queue

This method places an element at an index. We pass in the index (an integer) and the element we wish to place in the list. Insert can cause performance problems. List Insert

C# program that inserts into List

List<string>

dogs = new List<string>();
dogs.Add(“spaniel”);
dogs.Add(“beagle”);

dogs.Insert(1, “dalmatian”);

foreach

(string dog in dogs)
{
Console.WriteLine(dog);
}
}
}

spaniel
dalmatian
beagle

using System; using System.Collections.Generic; class Program { static void Main() {dogs = new List(); dogs.Add(“spaniel”);dogs.Add(“beagle”);dogs.(1, “dalmatian”);(string dog in dogs) { Console.WriteLine(dog); } } }spaniel dalmatian beagle

Remove. With this method we eliminate the first matching element in the List. If we pass the value 20 to Remove, the first element in the list with value 20 is removed.

Info We can call Remove with an argument that does not occur in the list. This will not cause an exception.

List Remove

RemoveAll We can remove more than 1 element at once with the RemoveAll method.

RemoveAll

With this method we eliminate the first matching element in the List. If we pass the value 20 to Remove, the first element in the list with value 20 is removed.

C# program that uses Remove

numbers.Remove(20);

foreach

(int number in numbers)
{
Console.WriteLine(“NOT REMOVED: {0}”, number);
}

numbers.Remove(2000);
}
}

NOT REMOVED: 10
NOT REMOVED: 30

using System; using System.Collections.Generic; class Program { static void Main() { var numbers = new List() { 10, 20, 30 };numbers.(20);(int number in numbers) { Console.WriteLine(“NOT REMOVED: {0}”, number); }numbers.(2000); } }NOT REMOVED: 10 NOT REMOVED: 30

Reverse. With this method no sorting occurs—the original order is intact but inverted. The strings contained in the List are left unchanged.

Internally This method invokes the Array.Reverse method. Many list methods are implemented with Array methods.

With this method no sorting occurs—the original order is intact but inverted. The strings contained in the List are left unchanged. Array.Reverse

C# program that uses Reverse

List<string>

list = new List<string>();
list.Add(“anchovy”);
list.Add(“barracuda”);
list.Add(“bass”);
list.Add(“viperfish”);

list.Reverse();

foreach (string value in list)
{
Console.WriteLine(value);
}
}
}

viperfish
bass
barracuda
anchovy

using System; using System.Collections.Generic; class Program { static void Main() {list = new List(); list.Add(“anchovy”); list.Add(“barracuda”); list.Add(“bass”); list.Add(“viperfish”);list.(); foreach (string value in list) { Console.WriteLine(value); } } }viperfish bass barracuda anchovy

GetRange. This returns a range of elements in a List. This is similar to the Take and Skip methods from LINQ. It has different syntax. The result List can be used like any other List.

C# program that gets ranges from List

List<string>

rivers = new List<string>(new string[]
{
“nile”,
“amazon”,
“yangtze”,
“mississippi”,
“yellow”
});

List<string>

range = rivers.GetRange(1, 2);
foreach (string river in range)
{
Console.WriteLine(river);
}
}
}

amazon
yangtze

using System; using System.Collections.Generic; class Program { static void Main() {rivers = new List(new string[] { “nile”, “amazon”,”yangtze”,”mississippi”, “yellow” });range = rivers.(1, 2); foreach (string river in range) { Console.WriteLine(river); } } }amazon yangtze

Equal. SequenceEqual is a method from System.Linq. It tells us whether 2 collections have the same exact elements. The number of elements and order must be the same.

Also If unordered Lists should be considered equal, we can write a custom method. We can sort and then compare.

List Element Equality

SequenceEqual is a method from System.Linq. It tells us whether 2 collections have the same exact elements. The number of elements and order must be the same. SequenceEqual

C# program that uses SequenceEqual

List<int> { 10, 20, 30 };
var numbers2 = new List<int> { 10, 20, 30 };

if (numbers.SequenceEqual(numbers2))
{
Console.WriteLine(“LISTS ARE EQUAL”);
}
}
}

LISTS ARE EQUAL

using System; using System.Collections.Generic; using System.Linq; class Program { static void Main() { var numbers = new { 10, 20, 30 }; var numbers2 = new { 10, 20, 30 };if (numbers.(numbers2)) { Console.WriteLine(“LISTS ARE EQUAL”); } } }LISTS ARE EQUAL

Var keyword. This shortens lines of code, which sometimes improves readability. Var has no effect on performance, only readability for programmers.

This shortens lines of code, which sometimes improves readability. Var has no effect on performance, only readability for programmers. Var

C# program that uses var with List

var list1 = new List<int>();

List<int>

list2 = new List<int>();
}
}

using System.Collections.Generic; class Program { static void Main() {list1 = new List();list2 = new List(); } }

Benchmark, create List. Suppose we want to create a List of 3 elements with an initializer. If we can use an array instead, the program will be faster.

Version 1 We create a string array of 3 elements with an array initializer. We test its length.

Initialize Array

Version 2 This code creates a List of strings with an initializer. The List is an additional object—performance is affected.

Result It is faster to allocate an array of strings—this was tested in 2021, on .NET 5 for Linux.

Suppose we want to create a List of 3 elements with an initializer. If we can use an array instead, the program will be faster.

C# program that tests List creation time

var s1 = Stopwatch.StartNew();
for (int i = 0; i < _max; i++)
{
var items = new string[] { “bird”, “frog”, “fish” };
if (items.Length == 0)
{
return;
}
}
s1.Stop();

var s2 = Stopwatch.StartNew();
for (int i = 0; i < _max; i++)
{
var items = new List<string>() { “bird”, “frog”, “fish” };
if (items.Count == 0)
{
return;
}
}
s2.Stop();
Console.WriteLine(((double)(s1.Elapsed.TotalMilliseconds * 1000000) / _max).ToString(“0.00 ns”));
Console.WriteLine(((double)(s2.Elapsed.TotalMilliseconds * 1000000) / _max).ToString(“0.00 ns”));
}
}

12.57 ns Create string array
59.07 ns Create string List

using System; using System.Collections.Generic; using System.Diagnostics; class Program { const int _max = 1000000; static void Main() {var s1 = Stopwatch.StartNew();(int i = 0; i < _max; i++) { var items = new string[] { “bird”, “frog”, “fish” }; if (items.Length == 0) { return; } } s1.Stop();s2 = Stopwatch.StartNew(); for (int i = 0; i < _max; i++) { var items = new List() { “bird”, “frog”, “fish” }; if (items.Count == 0) { return; } } s2.Stop(); Console.WriteLine(((double)(s1.Elapsed.TotalMilliseconds * 1000000) / _max).ToString(“0.00 ns”)); Console.WriteLine(((double)(s2.Elapsed.TotalMilliseconds * 1000000) / _max).ToString(“0.00 ns”)); } }12.57 ns Create string array 59.07 ns Create string List

Capacity. We can use the Capacity property on List, or pass an integer to the constructor (which sets an initial capacity) to improve allocation performance.

We can use the Capacity property on List, or pass an integer to the constructor (which sets an initial capacity) to improve allocation performance. Capacity

Sort. This orders the elements in the List. For strings it orders alphabetically. For integers (or other numbers) it orders from lowest to highest.

This orders the elements in the List. For strings it orders alphabetically. For integers (or other numbers) it orders from lowest to highest. Sort List

BinarySearch. This method implements the binary search algorithm. Binary search uses guesses to find the correct element faster than linear searching.

This method implements the binary search algorithm. Binary search uses guesses to find the correct element faster than linear searching. BinarySearch List

Conversion. We can convert a List to an array of the same type using the instance method ToArray. There are examples of these conversions.

We can convert a List to an array of the same type using the instance method ToArray. There are examples of these conversions. Convert List, Array Convert List, String Convert List, DataTable

Combine lists. With Concat, a method from the System.Linq namespace, we can add one list to another. Only a single method call is required.

With Concat, a method from the System.Linq namespace, we can add one list to another. Only a single method call is required. Concat

Remove duplicates. With Distinct() we can remove duplicates from a List. Other algorithms, that use Dictionary, can be used to scan for and erase duplicates.

With Distinct() we can remove duplicates from a List. Other algorithms, that use Dictionary, can be used to scan for and erase duplicates. Duplicates

Notes, List. This generic (like all others) is created with a type parameter. List is powerful: it provides flexible allocation and growth. Lists can be nested, static, or assigned to null.

This generic (like all others) is created with a type parameter. List is powerful: it provides flexible allocation and growth. Lists can be nested, static, or assigned to null. Nested List Null List Static List

A summary. List’s syntax is at first confusing. But we become used to it. In most programs lacking strict memory or performance constraints, List is ideal.

© 2007-2021 sam allen.

see site info on the changelog

[NEW] 5. Data Structures — Python 3.10.0 documentation | set in dex – POLLICELEE

5.

Data Structures

This chapter describes some things you’ve learned about already in more detail,
and adds some new things as well.

5.1.

More on Lists

The list data type has some more methods. Here are all of the methods of list
objects:

list.append

(

x

)

Add an item to the end of the list. Equivalent to a[len(a):] = [x].

list.extend

(

iterable

)

Extend the list by appending all the items from the iterable. Equivalent to
a[len(a):] = iterable.

list.insert

(

i

,

x

)

Insert an item at a given position. The first argument is the index of the
element before which to insert, so a.insert(0, x) inserts at the front of
the list, and a.insert(len(a), x) is equivalent to a.append(x).

list.remove

(

x

)

Remove the first item from the list whose value is equal to x. It raises a
ValueError if there is no such item.

list.pop

(

[

i

]

)

Remove the item at the given position in the list, and return it. If no index
is specified, a.pop() removes and returns the last item in the list. (The
square brackets around the i in the method signature denote that the parameter
is optional, not that you should type square brackets at that position. You
will see this notation frequently in the Python Library Reference.)

list.clear

(

)

Remove all items from the list. Equivalent to del a[:].

list.index

(

x

[

, start

[

, end

]

]

)

Return zero-based index in the list of the first item whose value is equal to x.
Raises a ValueError if there is no such item.

The optional arguments start and end are interpreted as in the slice
notation and are used to limit the search to a particular subsequence of
the list. The returned index is computed relative to the beginning of the full
sequence rather than the start argument.

list.count

(

x

)

Return the number of times x appears in the list.

list.sort

(

*

,

key

=

None

,

reverse

=

False

)

Sort the items of the list in place (the arguments can be used for sort
customization, see sorted() for their explanation).

list.reverse

(

)

Reverse the elements of the list in place.

list.copy

(

)

Return a shallow copy of the list. Equivalent to a[:].

An example that uses most of the list methods:

>>>

fruits

=

[

'orange'

,

'apple'

,

'pear'

,

'banana'

,

'kiwi'

,

'apple'

,

'banana'

]

>>>

fruits

.

count

(

'apple'

)

2

>>>

fruits

.

count

(

'tangerine'

)

0

>>>

fruits

.

index

(

'banana'

)

3

>>>

fruits

.

index

(

'banana'

,

4

)

# Find next banana starting a position 4

6

>>>

fruits

.

reverse

()

>>>

fruits

['banana', 'apple', 'kiwi', 'banana', 'pear', 'apple', 'orange']

>>>

fruits

.

append

(

'grape'

)

>>>

fruits

['banana', 'apple', 'kiwi', 'banana', 'pear', 'apple', 'orange', 'grape']

>>>

fruits

.

sort

()

>>>

fruits

['apple', 'apple', 'banana', 'banana', 'grape', 'kiwi', 'orange', 'pear']

>>>

fruits

.

pop

()

'pear'

You might have noticed that methods like insert, remove or sort that
only modify the list have no return value printed – they return the default
None. This is a design principle for all mutable data structures in
Python.

Another thing you might notice is that not all data can be sorted or
compared. For instance, [None, 'hello', 10] doesn’t sort because
integers can’t be compared to strings and None can’t be compared to
other types. Also, there are some types that don’t have a defined
ordering relation. For example, 3+4j < 5+7j isn’t a valid
comparison.

5.1.1.

Using Lists as Stacks

The list methods make it very easy to use a list as a stack, where the last
element added is the first element retrieved (“last-in, first-out”). To add an
item to the top of the stack, use append(). To retrieve an item from the
top of the stack, use pop() without an explicit index. For example:

>>>

stack

=

[

3

,

4

,

5

]

>>>

stack

.

append

(

6

)

>>>

stack

.

append

(

7

)

>>>

stack

[3, 4, 5, 6, 7]

>>>

stack

.

pop

()

7

>>>

stack

[3, 4, 5, 6]

>>>

stack

.

pop

()

6

>>>

stack

.

pop

()

5

>>>

stack

[3, 4]

5.1.2.

Using Lists as Queues

It is also possible to use a list as a queue, where the first element added is
the first element retrieved (“first-in, first-out”); however, lists are not
efficient for this purpose. While appends and pops from the end of list are
fast, doing inserts or pops from the beginning of a list is slow (because all
of the other elements have to be shifted by one).

To implement a queue, use collections.deque which was designed to
have fast appends and pops from both ends. For example:

>>>

from

collections

import

deque

>>>

queue

=

deque

([

"Eric"

,

"John"

,

"Michael"

])

>>>

queue

.

append

(

"Terry"

)

# Terry arrives

>>>

queue

.

append

(

"Graham"

)

# Graham arrives

>>>

queue

.

popleft

()

# The first to arrive now leaves

'Eric'

>>>

queue

.

popleft

()

# The second to arrive now leaves

'John'

>>>

queue

# Remaining queue in order of arrival

deque(['Michael', 'Terry', 'Graham'])

5.1.3.

List Comprehensions

List comprehensions provide a concise way to create lists.
Common applications are to make new lists where each element is the result of
some operations applied to each member of another sequence or iterable, or to
create a subsequence of those elements that satisfy a certain condition.

For example, assume we want to create a list of squares, like:

>>>

squares

=

[]

>>>

for

x

in

range

(

10

):

...

squares

.

append

(

x

**

2

)

...

>>>

squares

[0, 1, 4, 9, 16, 25, 36, 49, 64, 81]

Note that this creates (or overwrites) a variable named x that still exists
after the loop completes. We can calculate the list of squares without any
side effects using:

squares

=

list

(

map

(

lambda

x

:

x

**

2

,

range

(

10

)))

or, equivalently:

squares

=

[

x

**

2

for

x

in

range

(

10

)]

which is more concise and readable.

A list comprehension consists of brackets containing an expression followed
by a for clause, then zero or more for or if
clauses. The result will be a new list resulting from evaluating the expression
in the context of the for and if clauses which follow it.
For example, this listcomp combines the elements of two lists if they are not
equal:

>>>

[(

x

,

y

)

for

x

in

[

1

,

2

,

3

]

for

y

in

[

3

,

1

,

4

]

if

x

!=

y

]

[(1, 3), (1, 4), (2, 3), (2, 1), (2, 4), (3, 1), (3, 4)]

and it’s equivalent to:

>>>

combs

=

[]

>>>

for

x

in

[

1

,

2

,

3

]:

...

for

y

in

[

3

,

1

,

4

]:

...

if

x

!=

y

:

...

combs

.

append

((

x

,

y

))

...

>>>

combs

[(1, 3), (1, 4), (2, 3), (2, 1), (2, 4), (3, 1), (3, 4)]

Note how the order of the for and if statements is the
same in both these snippets.

If the expression is a tuple (e.g. the (x, y) in the previous example),
it must be parenthesized.

>>>

vec

=

[

-

4

,

-

2

,

0

,

2

,

4

]

>>>

# create a new list with the values doubled

>>>

[

x

*

2

for

x

in

vec

]

[-8, -4, 0, 4, 8]

>>>

# filter the list to exclude negative numbers

>>>

[

x

for

x

in

vec

if

x

>=

0

]

[0, 2, 4]

>>>

# apply a function to all the elements

>>>

[

abs

(

x

)

for

x

in

vec

]

[4, 2, 0, 2, 4]

>>>

# call a method on each element

>>>

freshfruit

=

[

' banana'

,

' loganberry '

,

'passion fruit '

]

>>>

[

weapon

.

strip

()

for

weapon

in

freshfruit

]

['banana', 'loganberry', 'passion fruit']

>>>

# create a list of 2-tuples like (number, square)

>>>

[(

x

,

x

**

2

)

for

x

in

range

(

6

)]

[(0, 0), (1, 1), (2, 4), (3, 9), (4, 16), (5, 25)]

>>>

# the tuple must be parenthesized, otherwise an error is raised

>>>

[

x

,

x

**

2

for

x

in

range

(

6

)]

File "<stdin>", line 1, in <module>

[x, x**2 for x in range(6)]

^

SyntaxError: invalid syntax

>>>

# flatten a list using a listcomp with two 'for'

>>>

vec

=

[[

1

,

2

,

3

],

[

4

,

5

,

6

],

[

7

,

8

,

9

]]

>>>

[

num

for

elem

in

vec

for

num

in

elem

]

[1, 2, 3, 4, 5, 6, 7, 8, 9]

List comprehensions can contain complex expressions and nested functions:

>>>

from

math

import

pi

>>>

[

str

(

round

(

pi

,

i

))

for

i

in

range

(

1

,

6

)]

['3.1', '3.14', '3.142', '3.1416', '3.14159']

5.1.4.

Nested List Comprehensions

The initial expression in a list comprehension can be any arbitrary expression,
including another list comprehension.

Consider the following example of a 3×4 matrix implemented as a list of
3 lists of length 4:

>>>

matrix

=

[

...

[

1

,

2

,

3

,

4

],

...

[

5

,

6

,

7

,

8

],

...

[

9

,

10

,

11

,

12

],

...

]

The following list comprehension will transpose rows and columns:

>>>

[[

row

[

i

]

for

row

in

matrix

]

for

i

in

range

(

4

)]

[[1, 5, 9], [2, 6, 10], [3, 7, 11], [4, 8, 12]]

As we saw in the previous section, the nested listcomp is evaluated in
the context of the for that follows it, so this example is
equivalent to:

>>>

transposed

=

[]

>>>

for

i

in

range

(

4

):

...

transposed

.

append

([

row

[

i

]

for

row

in

matrix

])

...

>>>

transposed

[[1, 5, 9], [2, 6, 10], [3, 7, 11], [4, 8, 12]]

which, in turn, is the same as:

>>>

transposed

=

[]

>>>

for

i

in

range

(

4

):

...

# the following 3 lines implement the nested listcomp

...

transposed_row

=

[]

...

for

row

in

matrix

:

...

transposed_row

.

append

(

row

[

i

])

...

transposed

.

append

(

transposed_row

)

...

>>>

transposed

[[1, 5, 9], [2, 6, 10], [3, 7, 11], [4, 8, 12]]

In the real world, you should prefer built-in functions to complex flow statements.
The zip() function would do a great job for this use case:

>>>

list

(

zip

(

*

matrix

))

[(1, 5, 9), (2, 6, 10), (3, 7, 11), (4, 8, 12)]

See Unpacking Argument Lists for details on the asterisk in this line.

5.2.

The

del

statement

There is a way to remove an item from a list given its index instead of its
value: the del statement. This differs from the pop() method
which returns a value. The del statement can also be used to remove
slices from a list or clear the entire list (which we did earlier by assignment
of an empty list to the slice). For example:

>>>

a

=

[

-

1

,

1

,

66.25

,

333

,

333

,

1234.5

]

>>>

del

a

[

0

]

>>>

a

[1, 66.25, 333, 333, 1234.5]

>>>

del

a

[

2

:

4

]

>>>

a

[1, 66.25, 1234.5]

>>>

del

a

[:]

>>>

a

[]

del can also be used to delete entire variables:

>>>

del

a

Referencing the name a hereafter is an error (at least until another value
is assigned to it). We’ll find other uses for del later.

5.3.

Tuples and Sequences

We saw that lists and strings have many common properties, such as indexing and
slicing operations. They are two examples of sequence data types (see
Sequence Types — list, tuple, range). Since Python is an evolving language, other sequence data
types may be added. There is also another standard sequence data type: the
tuple.

A tuple consists of a number of values separated by commas, for instance:

>>>

t

=

12345

,

54321

,

'hello!'

>>>

t

[

0

]

12345

>>>

t

(12345, 54321, 'hello!')

>>>

# Tuples may be nested:

...

u

=

t

,

(

1

,

2

,

3

,

4

,

5

)

>>>

u

((12345, 54321, 'hello!'), (1, 2, 3, 4, 5))

>>>

# Tuples are immutable:

...

t

[

0

]

=

88888

Traceback (most recent call last):

File

"<stdin>"

, line

1

, in

<module>

TypeError

:

'tuple' object does not support item assignment

>>>

# but they can contain mutable objects:

...

v

=

([

1

,

2

,

3

],

[

3

,

2

,

1

])

>>>

v

([1, 2, 3], [3, 2, 1])

As you see, on output tuples are always enclosed in parentheses, so that nested
tuples are interpreted correctly; they may be input with or without surrounding
parentheses, although often parentheses are necessary anyway (if the tuple is
part of a larger expression). It is not possible to assign to the individual
items of a tuple, however it is possible to create tuples which contain mutable
objects, such as lists.

Though tuples may seem similar to lists, they are often used in different
situations and for different purposes.
Tuples are immutable, and usually contain a heterogeneous sequence of
elements that are accessed via unpacking (see later in this section) or indexing
(or even by attribute in the case of namedtuples).
Lists are mutable, and their elements are usually homogeneous and are
accessed by iterating over the list.

A special problem is the construction of tuples containing 0 or 1 items: the
syntax has some extra quirks to accommodate these. Empty tuples are constructed
by an empty pair of parentheses; a tuple with one item is constructed by
following a value with a comma (it is not sufficient to enclose a single value
in parentheses). Ugly, but effective. For example:

>>>

empty

=

()

>>>

singleton

=

'hello'

,

# <-- note trailing comma

>>>

len

(

empty

)

0

>>>

len

(

singleton

)

1

>>>

singleton

('hello',)

The statement t = 12345, 54321, 'hello!' is an example of tuple packing:
the values 12345, 54321 and 'hello!' are packed together in a tuple.
The reverse operation is also possible:

>>>

x

,

y

,

z

=

t

This is called, appropriately enough, sequence unpacking and works for any
sequence on the right-hand side. Sequence unpacking requires that there are as
many variables on the left side of the equals sign as there are elements in the
sequence. Note that multiple assignment is really just a combination of tuple
packing and sequence unpacking.

5.4.

Sets

Python also includes a data type for sets. A set is an unordered collection
with no duplicate elements. Basic uses include membership testing and
eliminating duplicate entries. Set objects also support mathematical operations
like union, intersection, difference, and symmetric difference.

Curly braces or the set() function can be used to create sets. Note: to
create an empty set you have to use set(), not {}; the latter creates an
empty dictionary, a data structure that we discuss in the next section.

Here is a brief demonstration:

>>>

basket

=

{

'apple'

,

'orange'

,

'apple'

,

'pear'

,

'orange'

,

'banana'

}

>>>

print

(

basket

)

# show that duplicates have been removed

{'orange', 'banana', 'pear', 'apple'}

>>>

'orange'

in

basket

# fast membership testing

True

>>>

'crabgrass'

in

basket

False

>>>

# Demonstrate set operations on unique letters from two words

...

>>>

a

=

set

(

'abracadabra'

)

>>>

b

=

set

(

'alacazam'

)

>>>

a

# unique letters in a

{'a', 'r', 'b', 'c', 'd'}

>>>

a

-

b

# letters in a but not in b

{'r', 'd', 'b'}

>>>

a

|

b

# letters in a or b or both

{'a', 'c', 'r', 'd', 'b', 'm', 'z', 'l'}

>>>

a

&

b

# letters in both a and b

{'a', 'c'}

>>>

a

^

b

# letters in a or b but not both

{'r', 'd', 'b', 'm', 'z', 'l'}

Similarly to list comprehensions, set comprehensions
are also supported:

>>>

a

=

{

x

for

x

in

'abracadabra'

if

x

not

in

'abc'

}

>>>

a

{'r', 'd'}

5.5.

Dictionaries

Another useful data type built into Python is the dictionary (see
Mapping Types — dict). Dictionaries are sometimes found in other languages as
“associative memories” or “associative arrays”. Unlike sequences, which are
indexed by a range of numbers, dictionaries are indexed by keys, which can be
any immutable type; strings and numbers can always be keys. Tuples can be used
as keys if they contain only strings, numbers, or tuples; if a tuple contains
any mutable object either directly or indirectly, it cannot be used as a key.
You can’t use lists as keys, since lists can be modified in place using index
assignments, slice assignments, or methods like append() and
extend().

It is best to think of a dictionary as a set of key: value pairs,
with the requirement that the keys are unique (within one dictionary). A pair of
braces creates an empty dictionary: {}. Placing a comma-separated list of
key:value pairs within the braces adds initial key:value pairs to the
dictionary; this is also the way dictionaries are written on output.

The main operations on a dictionary are storing a value with some key and
extracting the value given the key. It is also possible to delete a key:value
pair with del. If you store using a key that is already in use, the old
value associated with that key is forgotten. It is an error to extract a value
using a non-existent key.

Performing list(d) on a dictionary returns a list of all the keys
used in the dictionary, in insertion order (if you want it sorted, just use
sorted(d) instead). To check whether a single key is in the
dictionary, use the in keyword.

Here is a small example using a dictionary:

>>>

tel

=

{

'jack'

:

4098

,

'sape'

:

4139

}

>>>

tel

[

'guido'

]

=

4127

>>>

tel

{'jack': 4098, 'sape': 4139, 'guido': 4127}

>>>

tel

[

'jack'

]

4098

>>>

del

tel

[

'sape'

]

>>>

tel

[

'irv'

]

=

4127

>>>

tel

{'jack': 4098, 'guido': 4127, 'irv': 4127}

>>>

list

(

tel

)

['jack', 'guido', 'irv']

>>>

sorted

(

tel

)

['guido', 'irv', 'jack']

>>>

'guido'

in

tel

True

>>>

'jack'

not

in

tel

False

The dict() constructor builds dictionaries directly from sequences of
key-value pairs:

>>>

dict

([(

'sape'

,

4139

),

(

'guido'

,

4127

),

(

'jack'

,

4098

)])

{'sape': 4139, 'guido': 4127, 'jack': 4098}

In addition, dict comprehensions can be used to create dictionaries from
arbitrary key and value expressions:

>>>

{

x

:

x

**

2

for

x

in

(

2

,

4

,

6

)}

{2: 4, 4: 16, 6: 36}

When the keys are simple strings, it is sometimes easier to specify pairs using
keyword arguments:

>>>

dict

(

sape

=

4139

,

guido

=

4127

,

jack

=

4098

)

{'sape': 4139, 'guido': 4127, 'jack': 4098}

5.6.

Looping Techniques

When looping through dictionaries, the key and corresponding value can be
retrieved at the same time using the items() method.

>>>

knights

=

{

'gallahad'

:

'the pure'

,

'robin'

:

'the brave'

}

>>>

for

k

,

v

in

knights

.

items

():

...

print

(

k

,

v

)

...

gallahad the pure

robin the brave

When looping through a sequence, the position index and corresponding value can
be retrieved at the same time using the enumerate() function.

>>>

for

i

,

v

in

enumerate

([

'tic'

,

'tac'

,

'toe'

]):

...

print

(

i

,

v

)

...

0 tic

1 tac

2 toe

To loop over two or more sequences at the same time, the entries can be paired
with the zip() function.

>>>

questions

=

[

'name'

,

'quest'

,

'favorite color'

]

>>>

answers

=

[

'lancelot'

,

'the holy grail'

,

'blue'

]

>>>

for

q

,

a

in

zip

(

questions

,

answers

):

...

print

(

'What is your

{0}

? It is

{1}

.'

.

format

(

q

,

a

))

...

What is your name? It is lancelot.

What is your quest? It is the holy grail.

What is your favorite color? It is blue.

To loop over a sequence in reverse, first specify the sequence in a forward
direction and then call the reversed() function.

>>>

for

i

in

reversed

(

range

(

1

,

10

,

2

)):

...

print

(

i

)

...

9

7

5

3

1

To loop over a sequence in sorted order, use the sorted() function which
returns a new sorted list while leaving the source unaltered.

>>>

basket

=

[

'apple'

,

'orange'

,

'apple'

,

'pear'

,

'orange'

,

'banana'

]

>>>

for

i

in

sorted

(

basket

):

...

print

(

i

)

...

apple

apple

banana

orange

orange

pear

Using set() on a sequence eliminates duplicate elements. The use of
sorted() in combination with set() over a sequence is an idiomatic
way to loop over unique elements of the sequence in sorted order.

>>>

basket

=

[

'apple'

,

'orange'

,

'apple'

,

'pear'

,

'orange'

,

'banana'

]

>>>

for

f

in

sorted

(

set

(

basket

)):

...

print

(

f

)

...

apple

banana

orange

pear

It is sometimes tempting to change a list while you are looping over it;
however, it is often simpler and safer to create a new list instead.

>>>

import

math

>>>

raw_data

=

[

56.2

,

float

(

'NaN'

),

51.7

,

55.3

,

52.5

,

float

(

'NaN'

),

47.8

]

>>>

filtered_data

=

[]

>>>

for

value

in

raw_data

:

...

if

not

math

.

isnan

(

value

):

...

filtered_data

.

append

(

value

)

...

>>>

filtered_data

[56.2, 51.7, 55.3, 52.5, 47.8]

5.7.

More on Conditions

The conditions used in while and if statements can contain any
operators, not just comparisons.

The comparison operators in and not in check whether a value occurs
(does not occur) in a sequence. The operators is and is not compare
whether two objects are really the same object. All comparison operators have
the same priority, which is lower than that of all numerical operators.

Comparisons can be chained. For example, a < b == c tests whether a is
less than b and moreover b equals c.

Comparisons may be combined using the Boolean operators and and or, and
the outcome of a comparison (or of any other Boolean expression) may be negated
with not. These have lower priorities than comparison operators; between
them, not has the highest priority and or the lowest, so that A and
not B or C
is equivalent to (A and (not B)) or C. As always, parentheses
can be used to express the desired composition.

The Boolean operators and and or are so-called short-circuit
operators: their arguments are evaluated from left to right, and evaluation
stops as soon as the outcome is determined. For example, if A and C are
true but B is false, A and B and C does not evaluate the expression
C. When used as a general value and not as a Boolean, the return value of a
short-circuit operator is the last evaluated argument.

It is possible to assign the result of a comparison or other Boolean expression
to a variable. For example,

>>>

string1

,

string2

,

string3

=

''

,

'Trondheim'

,

'Hammer Dance'

>>>

non_null

=

string1

or

string2

or

string3

>>>

non_null

'Trondheim'

Note that in Python, unlike C, assignment inside expressions must be done
explicitly with the
walrus operator :=.
This avoids a common class of problems encountered in C programs: typing =
in an expression when == was intended.

5.8.

Comparing Sequences and Other Types

Sequence objects typically may be compared to other objects with the same sequence
type. The comparison uses lexicographical ordering: first the first two
items are compared, and if they differ this determines the outcome of the
comparison; if they are equal, the next two items are compared, and so on, until
either sequence is exhausted. If two items to be compared are themselves
sequences of the same type, the lexicographical comparison is carried out
recursively. If all items of two sequences compare equal, the sequences are
considered equal. If one sequence is an initial sub-sequence of the other, the
shorter sequence is the smaller (lesser) one. Lexicographical ordering for
strings uses the Unicode code point number to order individual characters.
Some examples of comparisons between sequences of the same type:

(

1

,

2

,

3

)

<

(

1

,

2

,

4

)

[

1

,

2

,

3

]

<

[

1

,

2

,

4

]

'ABC'

<

'C'

<

'Pascal'

<

'Python'

(

1

,

2

,

3

,

4

)

<

(

1

,

2

,

4

)

(

1

,

2

)

<

(

1

,

2

,

-

1

)

(

1

,

2

,

3

)

==

(

1.0

,

2.0

,

3.0

)

(

1

,

2

,

(

'aa'

,

'ab'

))

<

(

1

,

2

,

(

'abc'

,

'a'

),

4

)

Note that comparing objects of different types with < or > is legal
provided that the objects have appropriate comparison methods. For example,
mixed numeric types are compared according to their numeric value, so 0 equals
0.0, etc. Otherwise, rather than providing an arbitrary ordering, the
interpreter will raise a TypeError exception.

Footnotes


set index อังคาร 9 พย. GPSC, SINGER, GUNKUL, FVC, FANCY, MACO, STI, HMPRO, ICN, XO, BROOK


setindex ช่วงเช้าดีดแรง แต่ก็โดนถล่มแรงภายในไม่กี่นาที อาการแบบนี้ระยะสั้นน่าห่วงมั้ย หรือยังสบายใจกันได้ต่อ? มาหาคำตอบกันในเทปนี้ครับ
.
HOT: GPSC
.
HighVolume: SINGER, GUNKUL, FVC, FANCY, MACO
.
FCrequest: STI, HMPRO, ICN, XO, BROOK
.
รับชมคลิก : https://youtu.be/jgz11I1QCMY
.
เล่นพื้นฐานอ่านเทคนิค
หุ้นโวลุ่มเข้า

นอกจากการดูบทความนี้แล้ว คุณยังสามารถดูข้อมูลที่เป็นประโยชน์อื่นๆ อีกมากมายที่เราให้ไว้ที่นี่: ดูเพิ่มเติม

set index อังคาร 9 พย. GPSC, SINGER, GUNKUL, FVC, FANCY, MACO, STI, HMPRO, ICN, XO, BROOK

Connect Samsung Dex To Windows Laptop PC Wirelessly


The Galaxy Note 20 Ultra is an amazing device, and has me falling in love with Samsung all over again, but there is one feature no one is talking, and we have the hack. Even Samsung themselves have omitted this. Samsung Dex can not only wirelessly display on a TV but also on A WINDOWS PC. We show you how to Wirelessly Connect Samsung Dex To Windows PC.
Note20Ultra DexWireless PC

Follow Us Or Else Dinosaurs will face Extinction!
✅https://instagram.com/reviewdork_yt
✅https://twitter.com/ReviewDork

Get a VPN 57% Off : http://bit.ly/dorkstick

Want Us To Review A Product ? Let us know in the comments!
ReviewDork, where we review tech, media, viral videos, video games, and show you the latest in how to’s , and sometimes we VLOG! 🙂
Contact: seodorks@gmail.com

Connect Samsung Dex To Windows Laptop PC Wirelessly

INCREDIBLE New DEX Set to Rock Crypto (Fantom Based DeFi Ethereum Killer?)


Fantom is quickly becoming one of the hottest blockchain ecosystems on the market, and there are a ton of new projects launching there all the time. It is positioning itself to become a gateway for the many different smart contract networks out there and push the boundaries of DeFi.
Today I show you one of the best projects on Fantom: TosDis (DIS). TosDis has its very own Fantom launchpad, TosLabs, as well as staking and farming on the platform. It is a major hub for decentralized finance on the Fantom blockchain.
Check out TosDis: https://tosdis.finance/
0:00 Intro
0:49 Fantom Overview
1:21 What is Tosdis?
1:52 Cross Staking and Farming
3:02 DIS Token
3:40 TOSLABS Projects
4:52 Partners
How to join Cardano (ADA) BitPool ➡️ https://bitboycrypto.com/howtostakeadawithbpool/
●▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬●
Connect with Me \u0026 the BitSquad!
Join the BitSquad ➡️ http://t.me/BitSquad
Join the BitBoy Lab ➡️ http://discord.BitBoy.Live
Join BitSquad Traders ➡️ http://t.me/BitSquadTraders
Join Me on Twitter ➡️ https://twitter.com/Bitboy_Crypto
Join Me on Instagram ➡️ https://www.instagram.com/bitboy_crypto
Join Me on TikTok ➡️ https://www.tiktok.com/@BitBoyCrypto
●▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬●
ByBit, Market Cipher, Ledger, TokenMetrics, Crypto.com \u0026 more!
Find deals on hardware wallets, trading indicators, exchanges \u0026 more.
Find Crypto DEALS ➡️ https://bitboycrypto.com/deals
●▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬●
All of our videos are strictly personal opinions. Please make sure to do your own research. Never take one person’s opinion for financial guidance. There are multiple strategies and not all strategies fit all people. Our videos ARE NOT financial advice.

INCREDIBLE New DEX Set to Rock Crypto (Fantom Based DeFi Ethereum Killer?)

Samsung Wireless Dex – Full Setup, Demonstration and Features


Samsung’s latest smartphone, the Galaxy Note 20 Ultra comes with the Wireless Dex function. As long as you have a smart HDTV, you can connect your Note 20 (and soon S20) to your HDTV and cast the entire DEX interface wireless to your HDTV.
It is essential to realize that you don’t have to use wireless dex, you can also opt to use standard wired dex if you have lag. You get to choose.
FOLLOW ME ON SOCIAL MEDIA \r
Follow me on twitter : http://twitter.com/sakitechonline\r
Follow me on Instagram: http://instagram.com/sakitechonline\r
Follow me on facebook: https://www.facebook.com/sakitechonline\r
My Website: http://sakitechonline.com\r
\r
Companies can send product to the following address:\r
\r
Attn: SAKITECH\r
135 S Springfield Rd. Unit 681\r
Clifton Heights, PA 19018

Samsung Wireless Dex - Full Setup, Demonstration and Features

Samsung DeX – cắm cáp trực tiếp là chạy không cần dùng dock!


Chi tiết về video trong bài viết:
Trong khu vực:
Website Tinh tế: http://www.tinhte.vn
Fanpage Facebook: https://www.facebook.com/tinhte
Instagram: https://www.instagram.com/tinhte_photo/
Twitter: https://twitter.com/tinhtefan

Samsung DeX - cắm cáp trực tiếp là chạy không cần dùng dock!

นอกจากการดูบทความนี้แล้ว คุณยังสามารถดูข้อมูลที่เป็นประโยชน์อื่นๆ อีกมากมายที่เราให้ไว้ที่นี่: ดูบทความเพิ่มเติมในหมวดหมู่General news

ขอบคุณมากสำหรับการดูหัวข้อโพสต์ set in dex

Leave a Comment