Skip to main content

Five clear and effective ways to revert the last commit

By

Reverting a commit in Git is a common task, and understanding the different methods can save developers a lot of headaches. Here are five clear and effective ways to revert the last commit:

  1. Using git reset (Soft Reset):

    • This method allows you to move the HEAD pointer to a previous commit without losing your changes.
    • Execute: git reset --soft HEAD~1
    • Explanation:
      • --soft keeps your changes in the working directory.
      • HEAD~1 refers to the commit before the current one.

  2. Using git reset (Hard Reset):

    • Be cautious with this one, as it discards uncommitted changes.
    • Execute: git reset --hard HEAD~1
    • Explanation:
      • --hard resets both the HEAD and the working directory.
      • Again, HEAD~1 points to the previous commit.

  3. Using git revert:

    • Creates a new commit that undoes the changes introduced by a specific commit.
    • Execute: git revert <commit_to_revert>
    • Find the commit ID using git log.

  4. Rollback with git reflog:

    • If you accidentally reset too far, git reflog can save you.
    • Use git reflog to find the commit you want to revert to.
    • Then execute: git reset --hard <commit_id>.

  5. Reverting a Pushed Commit:

    • If the commit has already been pushed to a shared repository, use git revert.
    • It creates a new commit that undoes the changes without overwriting history.
    • Execute: git revert <commit_to_revert>

Comments

Post a Comment

Popular posts from this blog

Functional Programming in Scala for Working Class OOP Java Programmers - Part 1

By
Introduction Have you ever been to a scala conf and told yourself "I have no idea what this guy talks about?" did you look nervously around and see all people smiling saying "yeah that's obvious " only to get you even more nervous? . If so this post is for you, otherwise just skip it, you already know fp in scala ;) This post is optimistic, although I'm going to say functional programming in scala is not easy, our target is to understand it, so bare with me. Let's face the truth functional programmin in scala is difficult if is difficult if you are just another working class programmer coming mainly from java background. If you came from haskell background then hell it's easy. If you come from heavy math background then hell yes it's easy. But if you are a standard working class java backend engineer with previous OOP design background then hell yeah it's difficult. Scala and Design Patterns An interesting point of view on scala, is
14 comments
Read more

Alternatives to Using UUIDs

By
  Alternatives to Using UUIDs UUIDs are valuable for several reasons: Global Uniqueness : UUIDs are designed to be globally unique across systems, ensuring that no two identifiers collide unintentionally. This property is crucial for distributed systems, databases, and scenarios where data needs to be uniquely identified regardless of location or time. Standardization : UUIDs adhere to well-defined formats (such as UUIDv4) and are widely supported by various programming languages and platforms. This consistency simplifies interoperability and data exchange. High Collision Resistance : The probability of generating duplicate UUIDs is extremely low due to the combination of timestamp, random bits, and other factors. This collision resistance is essential for avoiding data corruption. However, there are situations where UUIDs may not be the optimal choice: Length and Readability : UUIDs are lengthy (typically 36 characters in their canonical form) and may not be human-readable. In URLs,
Post a Comment
Read more

Bellman Ford Graph Algorithm

By
The Shortest path algorithms so you go to google maps and you want to find the shortest path from one city to another.  Two algorithms can help you, they both calculate the shortest distance from a source node into all other nodes, one node can handle negative weights with cycles and another cannot, Dijkstra cannot and bellman ford can. One is Dijkstra if you run the Dijkstra algorithm on this map its input would be a single source node and its output would be the path to all other vertices.  However, there is a caveat if Elon mask comes and with some magic creates a black hole loop which makes one of the edges negative weight then the Dijkstra algorithm would fail to give you the answer. This is where bellman Ford algorithm comes into place, it's like the Dijkstra algorithm only it knows to handle well negative weight in edges. Dijkstra has an issue handling negative weights and cycles Bellman's ford algorithm target is to find the shortest path from a single node in a graph t
1 comment
Read more