How do I handle pull-to-refresh in UIKit with Swift?

To handle pull-to-refresh functionality in UIKit with Swift, you can utilize the UIRefreshControl class, which offers a simple way to implement this feature in table views or collection views. Here's how you can set it up:

import UIKit class ViewController: UIViewController, UITableViewDataSource, UITableViewDelegate { let tableView = UITableView() let refreshControl = UIRefreshControl() override func viewDidLoad() { super.viewDidLoad() setupTableView() setupRefreshControl() } func setupTableView() { tableView.dataSource = self tableView.delegate = self tableView.frame = view.bounds view.addSubview(tableView) } func setupRefreshControl() { refreshControl.addTarget(self, action: #selector(refreshData), for: .valueChanged) tableView.refreshControl = refreshControl } @objc func refreshData() { // Add your data refreshing logic here // Simulating a network call with a delay DispatchQueue.main.asyncAfter(deadline: .now() + 2) { self.refreshControl.endRefreshing() // Update your data source and reload the table view self.tableView.reloadData() } } // MARK: - UITableViewDataSource func tableView(_ tableView: UITableView, numberOfRowsInSection section: Int) -> Int { return 20 // example static count } func tableView(_ tableView: UITableView, cellForRowAt indexPath: IndexPath) -> UITableViewCell { let cell = UITableViewCell() cell.textLabel?.text = "Row \(indexPath.row + 1)" return cell } }

pull-to-refresh UIRefreshControl UITableView Swift UIKit

Related Questions

How do I avoid rehashing overhead with std::set in multithreaded code?

How do I find elements with custom comparators with std::set for embedded targets?

How do I erase elements while iterating with std::set for embedded targets?

How do I provide stable iteration order with std::unordered_map for large datasets?

How do I reserve capacity ahead of time with std::unordered_map for large datasets?

How do I erase elements while iterating with std::unordered_map in multithreaded code?

How do I provide stable iteration order with std::map for embedded targets?

How do I provide stable iteration order with std::map in multithreaded code?

How do I avoid rehashing overhead with std::map in performance-sensitive code?

How do I merge two containers efficiently with std::map for embedded targets?