Python:DataTypes - Revision history

Hdridder: /* list */

2026-05-13T11:48:45Z

list

← Older revision		Revision as of 11:48, 13 May 2026
Line 62:		Line 62:
	:Sort lst1 and return 'None' object		:Sort lst1 and return 'None' object

	;lst2 = sorted(iterable)		;lst2 = sorted(iterable, key=int)
	:Return the iterable object sorted as list		:Return the iterable object sorted as list.
			:The optional key= part converts the elements to int before sorting. Other functions can be used too.

	;<nowiki>srtlist = sorted(alist, key = lambda x: (x[4], x[0]))</nowiki>		;<nowiki>srtlist = sorted(alist, key = lambda x: (x[4], x[0]))</nowiki>

2025-12-11T10:10:31Z

set

← Older revision		Revision as of 10:10, 11 December 2025
Line 124:		Line 124:
	:Remove the '2' object from set1 (returns None object)		:Remove the '2' object from set1 (returns None object)

			;set1.update(itterable)
			:Update the set with the elements in itterable (list, set, )
	;unionset = set1.union(set2)		;unionset = set1.union(set2)
	:Combine the sets (e.g.to remove duplicates)		:Combine the sets into a new set (e.g.to remove duplicates)

	;intersectset = set1.intersection(set2)		;intersectset = set1.intersection(set2)
	;intersectset = set1 & set2		;intersectset = set1 & set2
	:~~All~~ elements that exist in both sets		:Put all elements that exist in both sets into a new set

	;diffset = set1 - set2		;diffset = set1 - set2
	;diffset = set1.difference(set2)		;diffset = set1.difference(set2)
	:diffset will have all elements of set1 that are not in set2		:diffset will have all elements of set1 that are not in set2

			Augmented assignment (update the left hand object instead of creating a new one) are:
			;set1 \|= set2
			:Update set1 with set2
			;set1 -= set2
			:Removed set2 from set1
			;set1 &= set2
			:set1 will have the elements that exist in both sets (intersection)
			;set1 ^= set2
			:set1 will have the elements that exist in only 1 of the sets

	==Tuple==		==Tuple==

2025-12-11T08:12:04Z

Dictionary or dict

@@ Line 150: / Line 150: @@
 :Initialize dictionary with data
-Check [[Python#collections|collections defaultdict]] for automatic key creation.
 ;if key in dict:
 :Test if key exists in dict. <code>if dict[key]:</code> will throw a keyerror if it does not exist.
@@ Line 181: / Line 200: @@
 :Remove key from dict1, return dict1[key] if successful, None if key does not exist in dict1.
-Code example:
+Code example recursively search a key:
 <syntaxhighlight lang=python>
 def search_dict(data,skey=None):

2025-11-18T13:16:57Z

DateTime

← Older revision		Revision as of 13:16, 18 November 2025
Line 276:		Line 276:
	:%s - Seconds since [https://www.epochconverter.com/ epoc] (January 1, 1970 00:00:00)		:%s - Seconds since [https://www.epochconverter.com/ epoc] (January 1, 1970 00:00:00)
	:%f - Nanoseconds or Milliseconds depends on what your system supports		:%f - Nanoseconds or Milliseconds depends on what your system supports
			All formats can be found at W3schools[https://www.w3schools.com/python/gloss_python_date_format_codes.asp]
	;datetime.datetime(year, month, day, hour, minute, second).strftime('%s')		;datetime.datetime(year, month, day, hour, minute, second).strftime('%s')
	:Date to [https://www.epochconverter.com/ epoc]; hour, minute and second are optional.		:Date to [https://www.epochconverter.com/ epoc]; hour, minute and second are optional.

2025-11-13T08:14:42Z

← Older revision		Revision as of 08:14, 13 November 2025
Line 155:		Line 155:

	;dict1.keys()		;dict1.keys()
	:~~[[Python:DataTypes#list\|List]]~~ of keys in dict1		:Iterable of keys in dict1
	;dict1.values()		;dict1.values()
	:~~[[Python:DataTypes#list\|List]]~~ of values ~~in dict1~~		:Iterable of values
	;dict1.items()		;dict1.items()
	:~~[[Python:DataTypes#list\|List]]~~ of key-value pairs as [[#Tuple\|tuple]]s ~~in dict1~~		:iterable of all key-value pairs in dict1 as [[#Tuple\|tuple]]s

	;sum(adict.values())		;sum(adict.values())

2025-07-08T13:27:40Z

list

← Older revision		Revision as of 13:27, 8 July 2025
Line 56:		Line 56:
	;<nowiki>len(lst1) - 1 - lst1[::-1].index(x)</nowiki>		;<nowiki>len(lst1) - 1 - lst1[::-1].index(x)</nowiki>
	:Return the last position in lst1 where x is found		:Return the last position in lst1 where x is found
			;bisect(lst1, x)
			:Return index of first value higher than x. bisect needs to be imported as <code>from bisect import bisect</code>

	;lst1.sort()		;lst1.sort()

2025-04-22T18:23:01Z

list

← Older revision		Revision as of 18:23, 22 April 2025
Line 38:		Line 38:

	;lst1.extend(list2)		;lst1.extend(list2)
	:Add the elements of ~~list2 object~~ to the end of lst1		;lst1 + lst2
			:Add the elements of lst2 to the end of lst1

	;lst1.pop(n)		;lst1.pop(n)
	:Remove and return n<sup>th</sup> element from lst1. Last element if n is not specified.		:Remove and return n<sup>th</sup> element from lst1. Last element if n is not specified.
			;lst1.remove(x)
			:Remove object x from the list.

	;lst1 = list(object)		;lst1 = list(object)

2024-11-27T10:39:29Z

DateTime

← Older revision		Revision as of 10:39, 27 November 2024
Line 287:		Line 287:
	</syntaxhighlight>		</syntaxhighlight>

	;Convert ~~date~~ strings to a datetime object. The format indicates where the elements can be found (as in unix date formats ('%Y%m%d_%H%M'))		;Convert datetime strings to a datetime object. The format indicates where the elements can be found (as in unix date formats ('%Y%m%d_%H%M'))
	<syntaxhighlight lang=python>		<syntaxhighlight lang=python>
	from datetime import datetime		from datetime import datetime
Line 296:		Line 296:
	dt = datetime.fromtimestamp(<unixtime>)		dt = datetime.fromtimestamp(<unixtime>)
	</syntaxhighlight>		</syntaxhighlight>
			;To convert to a date object
			<syntaxhighlight lang=python>
			from datetime import datetime
			dateobj = datetime.strptime(<datetimestring>, <format>).date()
			</syntaxhighlight>


	;The parser is pretty smart, but it can be confused for day numbers under 13. It accepts e.g. <nowiki>1-jan-1991 12:30</nowiki> and YYYYMMDD-HHMM format.		;The parser is pretty smart, but it can be confused for day numbers under 13. It accepts e.g. <nowiki>1-jan-1991 12:30</nowiki> and YYYYMMDD-HHMM format.

2024-02-01T13:05:32Z

Dictionary or dict

← Older revision		Revision as of 13:05, 1 February 2024
Line 223:		Line 223:

	;<code>sorted(dict1.items(), key=lambda x: x[1], reverse=False)</code>		;<code>sorted(dict1.items(), key=lambda x: x[1], reverse=False)</code>
	:~~Sort a dict on value, return~~ a list of tuples (key,value) sorted on value		:Return a list of tuples (key,value) sorted on value
			;<code>sorted(adict.keys(), key=adict.get)</code>
			:Return a list of keys sorted on values

	;intersectionkeys = dicta.keys() & dictb.keys()		;intersectionkeys = dicta.keys() & dictb.keys()

2023-12-21T12:55:34Z

list

← Older revision		Revision as of 12:55, 21 December 2023
Line 90:		Line 90:
	;Check if some values are in a list (works for sets too)		;Check if some values are in a list (works for sets too)
	<code>if [ i for i in alist if i in [value1,value2]]:</code>		<code>if [ i for i in alist if i in [value1,value2]]:</code>

			;sum(aListWithNumbers)
			:Total of all values in the list

	==set==		==set==