Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8785013
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 13, 20262026-06-13T21:14:43+00:00 2026-06-13T21:14:43+00:00

How do short int based masks work in c++ (for example ones in Bullet

  • 0

How do short int based masks work in c++ (for example ones in Bullet)?

I look at Bullets

CollisionFilterGroups { 
  DefaultFilter = 1, 
  StaticFilter = 2, 
  KinematicFilter = 4, 
  DebrisFilter = 8, 
  SensorTrigger = 16, 
  CharacterFilter = 32, 
  AllFilter = -1 
}

And see that all values are degrees of 2 and I know that:

short is signed integer that takes 2 bytes to store and is from −32,768 to +32,767.

But how to create my own groups: how to calculate mask intersections?

For example how to create in addition to CollisionFilterGroups something like:

MyCollisionFilterGroups { 
  Cubes= ?,
  Boxes= ?, 
  Spheres= ?
}

Where

  • We want “planes” not to collide (“see”) with “planes”, “boxes” and “spheres”
  • We want “boxes” to collide with other “boxes” and “spheres”
  • We want “spheres” not to collide with “spheres” yet collide with “boxes”
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-13T21:14:44+00:00Added an answer on June 13, 2026 at 9:14 pm

    Your question is unclear, but I think you’re looking to set category and mask bits for the objects in your simulation:

    MyCollisionFilterGroups { 
        Plane= 64,
        Box= 128, 
       Sphere= 256
    }
    

    Plane, category bits = Plane, Mask = 0

    Box, category bits = Box, mask = Box + Sphere (or Box | Sphere)

    Sphere, category bits = Sphere, mask = Box

    In a nutshell, create power of two for each filter group, set the category mask for each object to the group enum, and set its mask to the enum of the object types you want it to collide with (or 0 to collide with nothing).

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm initializing an unsigned short int with a = 0xff (all bits are set).
Here's the following algorithm: int encryption(int a, int b) { short int c, c2;
struct Record { char Surname[20]; char Initial; unsigned short int Gender; //0 = male
Unsigned int into a short and back. Is this possible? How to do it
(background: Why should I use int instead of a byte or short in C#
Short problem: #include <iostream> using namespace std; int main() { double **T; long int
Short story: struct A{}; struct B:private A{}; void f(void *){} void f(A*){} int main(){
I am writing a function short getBits(short data, int p, int n) I have
In short, I think boxing is an annoyance. Let's look at some alternatives... public
Long story short I need to get items based on a range (high/low value),

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.