




import csv

import tweepy

# Twitter API credentials
lowerCamelCase__			:       Tuple         =							''
lowerCamelCase__			:       str         =							''
lowerCamelCase__			:       int         =							''
lowerCamelCase__			:       List[str]         =							''

def  UpperCAmelCase_							(				__UpperCAmelCase						:     str							) ->			None:
      # authorize twitter, initialize tweepy
      SCREAMING_SNAKE_CASE_     						=      tweepy.OAuthHandler(__UpperCAmelCase      ,      __UpperCAmelCase							)
      auth.set_access_token(__UpperCAmelCase      ,      __UpperCAmelCase							)
      SCREAMING_SNAKE_CASE_     						=      tweepy.API(__UpperCAmelCase							)

      # initialize a list to hold all the tweepy Tweets
      SCREAMING_SNAKE_CASE_     						=      []

      # make initial request for most recent tweets (200 is the maximum allowed count)
      SCREAMING_SNAKE_CASE_     						=      api.user_timeline(screen_name=__UpperCAmelCase      ,      count=2_00							)

      # save most recent tweets
      alltweets.extend(__UpperCAmelCase							)

      # save the id of the oldest tweet less one
      SCREAMING_SNAKE_CASE_     						=      alltweets[-1].id - 1

      # keep grabbing tweets until there are no tweets left to grab
      while len(__UpperCAmelCase							) > 0:
            print(f"getting tweets before {oldest}"							)

            # all subsequent requests use the max_id param to prevent duplicates
            SCREAMING_SNAKE_CASE_     						=      api.user_timeline(
                screen_name=__UpperCAmelCase      ,      count=2_00      ,      max_id=__UpperCAmelCase							)

            # save most recent tweets
            alltweets.extend(__UpperCAmelCase							)

            # update the id of the oldest tweet less one
            SCREAMING_SNAKE_CASE_     						=      alltweets[-1].id - 1

            print(f"...{len(__UpperCAmelCase							)} tweets downloaded so far"							)

      # transform the tweepy tweets into a 2D array that will populate the csv
      SCREAMING_SNAKE_CASE_     						=      [[tweet.id_str, tweet.created_at, tweet.text] for tweet in alltweets]

      # write the csv
      with open(f"new_{screen_name}_tweets.csv"      ,      'w'							) as f:
            SCREAMING_SNAKE_CASE_     						=      csv.writer(__UpperCAmelCase							)
            writer.writerow(['id', 'created_at', 'text']							)
            writer.writerows(__UpperCAmelCase							)


if __name__ == "__main__":
      # pass in the username of the account you want to download
      get_all_tweets('FirePing32')





from __future__ import annotations

from sys import maxsize
from typing import Generic, TypeVar

lowerCamelCase__			:       Dict         =							TypeVar('T')

def  UpperCAmelCase_							(				__UpperCAmelCase						:     int							) ->			int:
      return (position - 1) // 2

def  UpperCAmelCase_							(				__UpperCAmelCase						:     int							) ->			int:
      return (2 * position) + 1

def  UpperCAmelCase_							(				__UpperCAmelCase						:     int							) ->			int:
      return (2 * position) + 2





class 	lowerCamelCase_							(				Generic[T] ):


 '''simple docstring'''







 def __init__(							self  :		Optional[Any]						):
       SCREAMING_SNAKE_CASE_     						=      []
       SCREAMING_SNAKE_CASE_     						=      {}
       SCREAMING_SNAKE_CASE_     						=      0



 def __len__(							self  :		Optional[Any]						):
       return self.elements



 def __repr__(							self  :		Optional[int]						):
       return str(self.heap						)



 def 				lowerCAmelCase_  (							self  :		Union[str, Any]						):
       # Check if the priority queue is empty
       return self.elements == 0



 def 				lowerCAmelCase_  (							self  :		Tuple    ,    _lowerCAmelCase  :		T    ,    _lowerCAmelCase  :		int						):
       # Add an element with given priority to the queue
       self.heap.append((elem, weight)						)
       SCREAMING_SNAKE_CASE_     						=      self.elements
       self.elements += 1
       self._bubble_up(_lowerCAmelCase						)



 def 				lowerCAmelCase_  (							self  :		Optional[int]						):
       # Remove and return the element with lowest weight (highest priority)
       if self.elements > 1:
             self._swap_nodes(0    ,    self.elements - 1						)
       SCREAMING_SNAKE_CASE_						,			SCREAMING_SNAKE_CASE_     						=      self.heap.pop()
       del self.position_map[elem]
       self.elements -= 1
       if self.elements > 0:
             SCREAMING_SNAKE_CASE_						,			SCREAMING_SNAKE_CASE_     						=      self.heap[0]
             self._bubble_down(_lowerCAmelCase						)
       return elem



 def 				lowerCAmelCase_  (							self  :		Optional[int]    ,    _lowerCAmelCase  :		T    ,    _lowerCAmelCase  :		int						):
       # Update the weight of the given key
       SCREAMING_SNAKE_CASE_     						=      self.position_map[elem]
       SCREAMING_SNAKE_CASE_     						=      (elem, weight)
       if position > 0:
             SCREAMING_SNAKE_CASE_     						=      get_parent_position(_lowerCAmelCase						)
             SCREAMING_SNAKE_CASE_						,			SCREAMING_SNAKE_CASE_     						=      self.heap[parent_position]
             if parent_weight > weight:
                   self._bubble_up(_lowerCAmelCase						)
             else:
                   self._bubble_down(_lowerCAmelCase						)
       else:
             self._bubble_down(_lowerCAmelCase						)



 def 				lowerCAmelCase_  (							self  :		Union[str, Any]    ,    _lowerCAmelCase  :		T						):
       # Place a node at the proper position (upward movement) [to be used internally
       # only]
       SCREAMING_SNAKE_CASE_     						=      self.position_map[elem]
       if curr_pos == 0:
             return None
       SCREAMING_SNAKE_CASE_     						=      get_parent_position(_lowerCAmelCase						)
       SCREAMING_SNAKE_CASE_						,			SCREAMING_SNAKE_CASE_     						=      self.heap[curr_pos]
       SCREAMING_SNAKE_CASE_						,			SCREAMING_SNAKE_CASE_     						=      self.heap[parent_position]
       if parent_weight > weight:
             self._swap_nodes(_lowerCAmelCase    ,    _lowerCAmelCase						)
             return self._bubble_up(_lowerCAmelCase						)
       return None



 def 				lowerCAmelCase_  (							self  :		List[Any]    ,    _lowerCAmelCase  :		T						):
       # Place a node at the proper position (downward movement) [to be used
       # internally only]
       SCREAMING_SNAKE_CASE_     						=      self.position_map[elem]
       SCREAMING_SNAKE_CASE_						,			SCREAMING_SNAKE_CASE_     						=      self.heap[curr_pos]
       SCREAMING_SNAKE_CASE_     						=      get_child_left_position(_lowerCAmelCase						)
       SCREAMING_SNAKE_CASE_     						=      get_child_right_position(_lowerCAmelCase						)
       if child_left_position < self.elements and child_right_position < self.elements:
             SCREAMING_SNAKE_CASE_						,			SCREAMING_SNAKE_CASE_     						=      self.heap[child_left_position]
             SCREAMING_SNAKE_CASE_						,			SCREAMING_SNAKE_CASE_     						=      self.heap[child_right_position]
             if child_right_weight < child_left_weight and child_right_weight < weight:
                   self._swap_nodes(_lowerCAmelCase    ,    _lowerCAmelCase						)
                   return self._bubble_down(_lowerCAmelCase						)
       if child_left_position < self.elements:
             SCREAMING_SNAKE_CASE_						,			SCREAMING_SNAKE_CASE_     						=      self.heap[child_left_position]
             if child_left_weight < weight:
                   self._swap_nodes(_lowerCAmelCase    ,    _lowerCAmelCase						)
                   return self._bubble_down(_lowerCAmelCase						)
       else:
             return None
       if child_right_position < self.elements:
             SCREAMING_SNAKE_CASE_						,			SCREAMING_SNAKE_CASE_     						=      self.heap[child_right_position]
             if child_right_weight < weight:
                   self._swap_nodes(_lowerCAmelCase    ,    _lowerCAmelCase						)
                   return self._bubble_down(_lowerCAmelCase						)
       return None




 def 				lowerCAmelCase_  (							self  :		Optional[Any]    ,    _lowerCAmelCase  :		int    ,    _lowerCAmelCase  :		int						):
       # Swap the nodes at the given positions
       SCREAMING_SNAKE_CASE_     						=      self.heap[nodea_pos][0]
       SCREAMING_SNAKE_CASE_     						=      self.heap[nodea_pos][0]
       SCREAMING_SNAKE_CASE_						,			SCREAMING_SNAKE_CASE_     						=      (
           self.heap[nodea_pos],
           self.heap[nodea_pos],
       )
       SCREAMING_SNAKE_CASE_     						=      nodea_pos
       SCREAMING_SNAKE_CASE_     						=      nodea_pos





class 	lowerCamelCase_							(				Generic[T] ):


 '''simple docstring'''







 def __init__(							self  :		Union[str, Any]						):
       SCREAMING_SNAKE_CASE_     						=      {}
       SCREAMING_SNAKE_CASE_     						=      0



 def __repr__(							self  :		Optional[int]						):
       return str(self.connections						)



 def __len__(							self  :		Tuple						):
       return self.nodes



 def 				lowerCAmelCase_  (							self  :		Dict    ,    _lowerCAmelCase  :		T						):
       # Add a node in the graph if it is not in the graph
       if node not in self.connections:
             SCREAMING_SNAKE_CASE_     						=      {}
             self.nodes += 1




 def 				lowerCAmelCase_  (							self  :		List[Any]    ,    _lowerCAmelCase  :		T    ,    _lowerCAmelCase  :		T    ,    _lowerCAmelCase  :		int						):
       # Add an edge between 2 nodes in the graph
       self.add_node(_lowerCAmelCase						)
       self.add_node(_lowerCAmelCase						)
       SCREAMING_SNAKE_CASE_     						=      weight
       SCREAMING_SNAKE_CASE_     						=      weight


def  UpperCAmelCase_							(				__UpperCAmelCase						:     GraphUndirectedWeighted[T]      ,      ) ->			tuple[dict[T, int], dict[T, T | None]]:
      SCREAMING_SNAKE_CASE_     						=      {node: maxsize for node in graph.connections}
      SCREAMING_SNAKE_CASE_     						=      {node: None for node in graph.connections}

      SCREAMING_SNAKE_CASE_     						=      MinPriorityQueue()
      for node, weight in dist.items():
            priority_queue.push(__UpperCAmelCase      ,      __UpperCAmelCase							)

      if priority_queue.is_empty():
            return dist, parent

      # initialization
      SCREAMING_SNAKE_CASE_     						=      priority_queue.extract_min()
      SCREAMING_SNAKE_CASE_     						=      0
      for neighbour in graph.connections[node]:
            if dist[neighbour] > dist[node] + graph.connections[node][neighbour]:
                  SCREAMING_SNAKE_CASE_     						=      dist[node] + graph.connections[node][neighbour]
                  priority_queue.update_key(__UpperCAmelCase      ,      dist[neighbour]							)
                  SCREAMING_SNAKE_CASE_     						=      node

    # running prim's algorithm
      while not priority_queue.is_empty():
            SCREAMING_SNAKE_CASE_     						=      priority_queue.extract_min()
            for neighbour in graph.connections[node]:
                  if dist[neighbour] > dist[node] + graph.connections[node][neighbour]:
                        SCREAMING_SNAKE_CASE_     						=      dist[node] + graph.connections[node][neighbour]
                        priority_queue.update_key(__UpperCAmelCase      ,      dist[neighbour]							)
                        SCREAMING_SNAKE_CASE_     						=      node
      return dist, parent